Attribute exploration with background knowledge
Theoretical Computer Science
Formal Concept Analysis: Mathematical Foundations
Formal Concept Analysis: Mathematical Foundations
Description logic programs: combining logic programs with description logic
WWW '03 Proceedings of the 12th international conference on World Wide Web
The description logic handbook: theory, implementation, and applications
The description logic handbook: theory, implementation, and applications
A proposal for an owl rules language
Proceedings of the 13th international conference on World Wide Web
Theory of Relational Databases
Theory of Relational Databases
Complexity boundaries for horn description logics
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 1
Completing description logic knowledge bases using formal concept analysis
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Fostering Web Intelligence by Semi-automatic OWL Ontology Refinement
WI-IAT '08 Proceedings of the 2008 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology - Volume 01
Lexico-logical acquisition of OWL DL axioms: an integrated approach to ontology refinement
ICFCA'08 Proceedings of the 6th international conference on Formal concept analysis
Formal concept analysis in knowledge discovery: a survey
ICCS'10 Proceedings of the 18th international conference on Conceptual structures: from information to intelligence
ESWC'11 Proceedings of the 8th extended semantic web conference on The semantic web: research and applications - Volume Part I
Advocatus diaboli --- exploratory enrichment of ontologies with negative constraints
EKAW'12 Proceedings of the 18th international conference on Knowledge Engineering and Knowledge Management
Review: Formal concept analysis in knowledge processing: A survey on applications
Expert Systems with Applications: An International Journal
| Hi-index | 0.00 |
Proposing a certain notion of logical completeness as a novel quality criterion for ontologies, we identify and characterise a class of logical propositions which naturally extend domain and range restrictions commonly known from diverse ontology modelling approaches. We argue for the intuitivity of this kind of axioms and show that they fit equally well into formalisms based on rules as well as ones based on description logics. Extending the attribute exploration technique from formal concept analysis (FCA), we present an algorithm for the efficient interactive specification of all axioms of this form valid in a domain of interest.We compile some results that apply when role hierarchies and symmetric roles come into play and demonstrate the presented method in a small example.