Acquiring Generalized Domain-Range Restrictions

摘要: Proposing a certain notion of logical completeness as novel quality criterion for ontologies, we identify and characterise class propositions which naturally extend domain range restrictions commonly known from diverse ontology modelling approaches. We argue the intuitivity this kind axioms show that they fit equally well into formalisms based on rules ones description logics. Extending attribute exploration technique formal concept analysis (FCA), present an algorithm efficient interactive specification all form valid in interest.We compile some results apply when role hierarchies symmetric roles come play demonstrate presented method small example.