Acquiring Generalized Domain-Range Restrictions

Sebastian RudolphSebastian Rudolph

ISBN: 978-3-540-78136-3
Download

Sebastian Rudolph
Acquiring Generalized Domain-Range Restrictions
In Raoul Medina and Sergei Obiedkov, eds., Proceedings of the 6th International Conference on Formal Concept Analysis (ICFCA'08), volume 4933 of Lecture Notes in Artificial Intelligence, 32-45, February 2008. Springer

Details
Bibtex

KurzfassungAbstract
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.
Forschungsgruppe:Research Group: Computational LogicComputational Logic

The final publication is available at Springer.

@inproceedings{R2008,
  author    = {Sebastian Rudolph},
  title     = {Acquiring Generalized Domain-Range Restrictions},
  editor    = {Raoul Medina and  Sergei Obiedkov},
  booktitle = {Proceedings of the 6th International Conference on Formal Concept
               Analysis (ICFCA'08)},
  series    = {Lecture Notes in Artificial Intelligence},
  volume    = {4933},
  publisher = {Springer},
  year      = {2008},
  month     = {February},
  pages     = {32-45}
}