Approximation and Difference in Description Logics

S. BrandtS. Brandt, R. KüstersR. Küsters, A.-Y. TurhanA.-Y. Turhan

Datei:BrandtKuesters+-KR-02.ps.gz

Download

S. Brandt, R. Küsters, A.-Y. Turhan
Approximation and Difference in Description Logics
In D. {Fensel} and F. {Giunchiglia} and D. {McGuiness} and M.-A. {Williams}, eds., Proceedings of the Eighth International Conference on Principles of Knowledge Representation and Reasoning (KR2002), 203--214, 2002. Morgan Kaufman

Details
Bibtex

KurzfassungAbstract
Approximation is a new inference service in Description Logics first mentioned

 by Baader, Küsters, and Molitor. Approximating a concept, defined in one
 Description Logic, means to translate this concept to another concept, defined
 in a second typically less expressive Description Logic, such that both
 concepts are as closely related as possible with respect to subsumption. The
 present paper provides the first in-depth investigation of this inference
 task. We prove that approximations from the Description Logic ALC to ALE
 always exist and propose an algorithm computing them. 
 
 As a measure for the accuracy of the approximation, we introduce a
 syntax-oriented difference operator, which yields a concept that contains all
 aspects of the approximated concept that are not present in the approximation.
 It is also argued that a purely semantical difference operator, as introduced
 by Teege, is less suited for this purpose. Finally, for the logics under

consideration, we propose an algorithm computing the difference.

Forschungsgruppe:Research Group: AutomatentheorieAutomata Theory

@inproceedings{ BrKuTu-KR-02,
  address = {San Francisco, CA},
  author = {S. {Brandt} and R. {K{\"u}sters} and A.-Y. {Turhan}},
  booktitle = {Proceedings of the Eighth International Conference on Principles of Knowledge Representation and Reasoning (KR2002)},
  editor = {D. {Fensel} and F. {Giunchiglia} and D. {McGuiness} and M.-A. {Williams}},
  pages = {203--214},
  publisher = {Morgan Kaufman},
  title = {Approximation and Difference in Description Logics},
  year = {2002},
}