论文信息 - Classifying Description Logics

Classifying Description Logics

We describe a method for characterizing the expressive power of description logics. The method is essentially model-theoretic in nature, and it is applied to obtain expressiveness results for a wide range of logics in the well-known FL− and AL hierarchies. As a corollary we obtain a complete classification of the relative expressive power of these logics.

Maarten de Rijke | Natasha Kurtonina

[1] Lawrence C. Paulson,et al. Logic And Computation , 1987 .

[2] Alexander Borgida,et al. On the Relative Expressiveness of Description Logics and Predicate Logics , 1996, Artif. Intell..

[3] Serge Abiteboul,et al. Foundations of Databases , 1994 .

[4] Dov M. Gabbay,et al. EXPRESSIVE FUNCTIONAL COMPLETENESS IN TENSE LOGIC , 1981 .

[5] Klaus Schild,et al. A Correspondence Theory for Terminological Logics: Preliminary Report , 1991, IJCAI.

[6] Maarten de Rijke,et al. Simulating Without Negation , 1997, J. Log. Comput..

[7] David Toman,et al. First-Order Queries over Temporal Databases Inexpressible in Temporal Logic , 1996, EDBT.

[8] Werner Nutt,et al. The Complexity of Concept Languages , 1997, KR.

[9] Kees Doets,et al. Basic model theory , 1996, Studies in logic, language and information.

[10] Franz Baader,et al. A Formal Definition for the Expressive Power of Terminological Knowledge Representation Languages , 1996, J. Log. Comput..

[11] Hector J. Levesque,et al. The Tractability of Subsumption in Frame-Based Description Languages , 1984, AAAI.

[12] Alex Borgiday. On the Relative Expressiveness of Description Logics and Predicate Logics , 1996 .

[13] Francesco M. Donini,et al. Reasoning in description logics , 1997 .