Definitorially complete description logics

Proceedings of the International Conference on Knowledge Representation and Reasoning

Volumn , Issue , 2006, Pages 79-89

  Ten Cate, Balder ^a   Conradie, Willem ^b   Marx, Maarten ^a   Venema, Yde ^a  

^a UNIVERSITY OF AMSTERDAM   (Netherlands)

^b UNIVERSITY OF JOHANNESBURG   (South Africa)

Author keywords

[No Author keywords available]

Indexed keywords

DATA DESCRIPTION; FORMAL LANGUAGES; KNOWLEDGE BASED SYSTEMS; SYNTACTICS; TERMINOLOGY;

AVAILABLE OPERATION; DESCRIPTION LOGIC; INTERPOLANTS; KNOWLEDGE BASE; NUMBER RESTRICTIONS; TWO WAYS; WORST-CASE COMPLEXITY;

KNOWLEDGE REPRESENTATION;

EID: 84860572965     PISSN: 23341025     EISSN: 23341033     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (17)

1. Areces, C., and de Rijke, M. 2001. From description to hybrid logics, and back. In Wolter, F.; Wansing, H.; de Rijke, M.; and Zakharyaschev, M., eds., Advances in Modal Logic. Volume 3. CSLI Publications. 17-36.
2. Areces, C.; Blackburn, P.; Hernandez, B. M.; and Marx, M. 2003. Handling boolean aboxes. In et al, D. C., ed., Proceedings of the International Workshop on Description Logics (DL2003).
3. Baader, F., and Nutt, W. 2003. Basic description logics. In Baader, F.; McGuiness, D.; Nardi, D.; and Patel-Schneider, P., eds., The Description Logic Handbook: Theory, implementation and applications. Cambridge University Press.
4. Baader, F., and Sattler, U. 2000. Tableau algorithms for description logics. In Dyckhoff, R., ed., Proceedings of the International Conference on Automated Reasoning with Tableaux and Related Methods (Tableaux 2000), volume 1847 of Lecture Notes in Artificial Intelligence. Springer- Verlag.
5. D'Agostino, G., and Lenzi, G. 2002. On modal μ-calculus with explicit interpolants. Technical Report PP-2002-17, Institute for Logic, Language and Computaion, University of Amsterdam.
6. Doets, K. 1996. Basic Model Theory. Cambridge University Press.
7. Donini, F. M., and Massacci, F. 2000. Exptime tableaux for ALC. Artificial Intelligence 124(1):87-138.
8. Donini, F. 2003. Complexity of reasoning. In Baader, F.; McGuiness, D.; Nardi, D.; and Patel-Schneider, P., eds., The Description Logic Handbook: Theory, implementation and applications. Cambridge University Press.
9. Friedman, H. 1976. The complexity of explicit definitions. Advances in Mathematics 20(1):18-29.
10. Ghilardi, S. 1995. An algebraic theory of normal forms. Annals Pure Appl. Logic 71(3):189-245.
11. Horrocks, I.; Patel-Schneider, P.; and van Harmelen, F. 2003. From SHIQ and RDF to OWL: The making of a web ontology language. Journal of Web Semantics 1(1):7-26.
12. Janin, D., and Walukiewicz, I. 1995. Automata for the modal μ-calculus and related results. In Mathematical foundations of computer science 1995 (Prague), volume 969 of Lecture Notes in Comput. Sci. Berlin: Springer. 552-562.
13. Pitts, A. M. 1992. On an interpretation of secondorder quantification in first-order intuitionistic propositional logic. Journal of Symbolic Logic 57(1):33-52.
14. Sattler, U.; Calvanese, D.; and Molitor, R. 2003. Relationships with other formalisms. In Baader, F.; McGuiness, D.; Nardi, D.; and Patel-Schneider, P., eds., The Description Logic Handbook: Theory, implementation and applications. Cambridge University Press.
15. ten Cate, B.; Marx, M.; and Viana, P. 2005. Hybrid logics with Sahlqvist axioms. Logic Journal of the IGPL 13(3):293-300.
16. ten Cate, B. 2005. Model theory for extended modal languages. Ph.D. Dissertation, University of Amsterdam. ILLC Dissertation Series DS-2005-01.
17. Visser, A. 1996. Uniform interpolation and layered bisimulation. In G̈odel'96 (Brno, 1996), volume 6 of Lecture Notes Logic. Berlin: Springer. 139-164.