Chapter 3 Description Logics

Foundations of Artificial Intelligence

Volumn 3, Issue , 2008, Pages 135-179

  Baader, Franz ^a   Horrocks, Ian ^a   Sattler, Ulrike ^a  

^a NONE

Author keywords

[No Author keywords available]

Indexed keywords

EID: 40849102712     PISSN: 15746526     EISSN: None     Source Type: Book Series    
DOI: 10.1016/S1574-6526(07)03003-9     Document Type: Review

References (163)

1. Acciarri A., Calvanese D., De Giacomo G., Lembo D., Lenzerini M., Palmieri M., and Rosati R. Quonto: Querying ontologies. In: Veloso M.M., and Kambhampati S. (Eds). Proc. of the 20th Nat. Conf. on Artificial Intelligence (AAAI-05) (2005), AAAI Press/The MIT Press 1670-1671
2. H. Andréka, J. van Benthem, and I. Németi. Modal languages and bounded fragments of predicate logic. Technical Report ML-96-03, ILLC, University of Amsterdam, 1996
3. C. Areces. Logic engineering. The case of description and hybrid logics. PhD thesis, ILLC, University of Amsterdam, 2000. ILLC Dissertation Series 2000-5
4. Areces C., Blackburn P., and Marx M. A road-map on complexity for hybrid logics. Proc. of the Annual Conf. of the Eur. Assoc. for Computer Science Logic (CSL'99). Lecture Notes in Computer Science vol. 1683 (1999), Springer 307-321
5. Areces C., de Rijke M., and de Nivelle H. Resolution in modal, description and hybrid logic. J. of Logic and Computation 11 5 (2001) 717-736
6. F. Baader, S. Brandt, and C. Lutz. Pushing the EL envelope. In Proc. of the 19th Int. Joint Conf. on Artificial Intelligence (IJCAI 2005), pages 364-369, 2005
7. F. Baader, C. Lutz, M. Milicic, U. Sattler, and F. Wolter. Integrating description logics and action formalisms: First results. In Proc. of the 20th National Conference on Artificial Intelligence (AAAI-05). AAAI Press/The MIT Press, pages 572-577, 2005
8. F. Baader. Augmenting concept languages by transitive closure of roles: An alternative to terminological cycles. In Proc. of the 12th Int. Joint Conf. on Artificial Intelligence (IJCAI'91), pages 446-451, 1991
9. Baader F. Using automata theory for characterizing the semantics of terminological cycles. Annals of Mathematics and Artificial Intelligence 18 (1996) 175-219
10. F. Baader. Description logic terminology. In [14], pages 485-495, 2003
11. F. Baader. Terminological cycles in a description logic with existential restrictions. In G. Gottlob and T. Walsh, editors, Proc. of the 18th Int. Joint Conf. on Artificial Intelligence (IJCAI 2003), pages 325-330, Los Altos, Acapulco, Mexico, 2003. Morgan Kaufmann
12. Baader F., Buchheit M., and Hollunder B. Cardinality restrictions on concepts. Artificial Intelligence 88 1-2 (1996) 195-213
13. Baader F., Bürckert H.-J., Hollunder B., Nutt W., and Siekmann J.H. Concept logics. In: Lloyd J.W. (Ed). Computational Logics, Symposium Proceedings (1990), Springer 177-201
14. In: Baader F., Calvanese D., McGuinness D., Nardi D., and Patel-Schneider P.F. (Eds). The Description Logic Handbook: Theory, Implementation and Applications (2003), Cambridge University Press
15. Baader F., Franconi E., Hollunder B., Nebel B., and Profitlich H.-J. An empirical analysis of optimization techniques for terminological representation systems or: Making KRIS get a move on. Applied Artificial Intelligence 4 (1994) 109-132 (Special Issue on Knowledge Base Management)
16. F. Baader and P. Hanschke. A schema for integrating concrete domains into concept languages. In Proc. of the 12th Int. Joint Conf. on Artificial Intelligence (IJCAI'91), pages 452-457, 1991
17. Baader F., and Hanschke P. Extensions of concept languages for a mechanical engineering application. Proc. of the 16th German Workshop on Artificial Intelligence (GWAI'92). Lecture Notes in Computer Science vol. 671 (1992), Springer 132-143
18. Baader F., and Hollunder B. A terminological knowledge representation system with complete inference algorithms. Proc. of the Workshop on Processing Declarative Knowledge (PDK'91). Lecture Notes in Artificial Intelligence vol. 567 (1991), Springer 67-86
19. F. Baader and R. Küsters. Matching in description logics with existential restrictions. In Proc. of the 7th Int. Conf. on Principles of Knowledge Representation and Reasoning (KR 2000), pages 261-272, 2000
20. Baader F., Küsters R., Borgida A., and McGuinness D.L. Matching in description logics. J. of Logic and Computation 9 3 (1999) 411-447
21. F. Baader, R. Küsters, and R. Molitor. Structural subsumption considered from an automata theoretic point of view. In Proc. of the 1998 Description Logic Workshop (DL'98), volume 11 of CEUR Electronic Workshop Proceedings, 1998
22. F. Baader, R. Küsters, and F. Wolter. Extensions to description logics. In [14], pages 219-261, 2003
23. Baader F., Lutz C., and Suntisrivaraporn B. CEL-a polynomial-time reasoner for life science ontologies. In: Furbach U., and Shankar N. (Eds). Proc. of the Int. Joint Conf. on Automated Reasoning (IJCAR 2006). Lecture Notes in Artificial Intelligence vol. 4130 (2006), Springer-Verlag 287-291
24. Baader F., and Narendran P. Unification of concepts terms in description logics. J. of Symbolic Computation 31 3 (2001) 277-305
25. Baader F., and Sattler U. An overview of tableau algorithms for description logics. Studia Logica 69 1 (October 2001) 5-40
26. Baader F., and Tobies S. The inverse method implements the automata approach for modal satisfiability. Proc. of the Int. Joint Conf. on Automated Reasoning (IJCAR 2001). Lecture Notes in Artificial Intelligence vol. 2083 (2001), Springer 92-106
27. A.B. Baker. Intelligent backtracking on constraint satisfaction problems: experimental and theoretical results. PhD thesis, University of Oregon, 1995
28. Bechhofer S., Horrocks I., Goble C., and Stevens R. OilEd: A reasonable ontology editor for the semantic web. Proc. of the Joint German/Austrian Conf. on Artificial Intelligence (KI 2001). Lecture Notes in Artificial Intelligence vol. 2174 (2001), Springer 396-408
29. Ben-Ari M., Halpern J.Y., and Pnueli A. Deterministic propositional dynamic logic: Finite models, complexity, and completeness. J. of Computer and System Sciences 25 (1982) 402-417
30. D. Berardi, D. Calvanese, and G. De Giacomo. Reasoning on UML class diagrams using description logic based systems. In Proc. of the KI'2001 Workshop on Applications of Description Logics, volume 44 of CEUR Electronic Workshop Proceedings, 2001
31. Bernholtz O., and Grumberg O. Branching time temporal logic and amorphous tree automata. In: Best E. (Ed). Proc. of the Int. Conf. on Concurrency Theory (CONCUR'93). Lecture Notes in Computer Science vol. 715 (1993), Springer 262-277
32. Blackburn P., de Rijke M., and Venema Y. Modal Logic. Cambridge Tracts in Theoretical Computer Science vol. 53 (2001), Cambridge University Press
33. Borgida A. On the relative expressiveness of description logics and predicate logics. Artificial Intelligence 82 1-2 (1996) 353-367
34. A. Borgida, M. Lenzerini, and R. Rosati. Description logics for data bases. In [14] (Chapter 16)
35. Brachman R.J. What's in a concept: Structural foundations for semantic networks. Int. Journal of Man-Machine Studies 9 2 (1977) 127-152
36. R.J. Brachman. Structured inheritance networks. In W.A. Woods and R.J. Brachman, editors, Research in Natural Language Understanding, Quarterly Progress Report No. 1, BBN Report No. 3742, pages 36-78. Bolt, Beranek and Newman Inc., Cambridge, MA, 1978
37. Brachman R.J. "Reducing" CLASSIC to practice: Knowledge representation meets reality. Proc. of the 3rd Int. Conf. on the Principles of Knowledge Representation and Reasoning (KR'92) (1992), Morgan Kaufmann, Los Altos, CA 247-258
38. Brachman R.J., Fikes R.E., and Levesque H.J. KRYPTON: A functional approach to knowledge representation. IEEE Computer (October 1983) 67-73
39. In: Brachman R.J., and Levesque H.J. (Eds). Readings in Knowledge Representation (1985), Morgan Kaufmann, Los Altos, CA
40. Brachman R.J., McGuinness D.L., Patel-Schneider P.F., Resnick L.A., and Borgida A. Living with CLASSIC: When and how to use a KL-ONE-like language. In: Sowa J.F. (Ed). Principles of Semantic Networks (1991), Morgan Kaufmann, Los Altos, CA 401-456
41. Brachman R.J., and Schmolze J.G. An overview of the KL-ONE knowledge representation system. Cognitive Science 9 2 (1985) 171-216
42. S. Brandt. Polynomial time reasoning in a description logic with existential restrictions, GCI axioms, and-what else? In R. López de Mántaras and L. Saitta, editors, Proc. of the 16th Eur. Conf. on Artificial Intelligence (ECAI 2004), pages 298-302, 2004
43. S. Brandt, R. Küsters, and A.-Y. Turhan. Approximation and difference in description logics. In Proc. of the 8th Int. Conf. on Principles of Knowledge Representation and Reasoning (KR 2002), pages 203-214, 2002
44. P. Bresciani, E. Franconi, and S. Tessaris. Implementing and testing expressive description logics: Preliminary report. In Proc. of the 1995 Description Logic Workshop (DL'95), pages 131-139, 1995
45. Buchheit M., Donini F.M., Nutt W., and Schaerf A. A refined architecture for terminological systems: Terminology = schema + views. Artificial Intelligence 99 2 (1998) 209-260
46. Buchheit M., Donini F.M., and Schaerf A. Decidable reasoning in terminological knowledge representation systems. J. of Artificial Intelligence Research 1 (1993) 109-138
47. D. Calvanese, G. De Giacomo, and M. Lenzerini. On the decidability of query containment under constraints. In Proc. of the 17th ACM SIGACT SIGMOD SIGART Symp. on Principles of Database Systems (PODS'98), pages 149-158, 1998
48. Calvanese D., De Giacomo G., and Lenzerini M. Modeling and querying semi-structured data. Network and Information Systems 2 2 (1999)
49. D. Calvanese, G. De Giacomo, and M. Lenzerini. Reasoning in expressive description logics with fixpoints based on automata on infinite trees. In Proc. of the 16th Int. Joint Conf. on Artificial Intelligence (IJCAI'99), pages 84-89, 1999
50. Calvanese D., De Giacomo G., Lenzerini M., and Nardi D. Reasoning in expressive description logics. In: Robinson A., and Voronkov A. (Eds). Handbook of Automated Reasoning (2001), Elsevier Science Publishers (North-Holland), Amsterdam 1581-1634 (Chapter 23)
51. D. Calvanese, G. De Giacomo, M. Lenzerini, D. Nardi, and R. Rosati. Description logic framework for information integration. In Proc. of the 6th Int. Conf. on Principles of Knowledge Representation and Reasoning (KR'98), pages 2-13, 1998
52. Calvanese D., De Giacomo G., and Rosati R. Data integration and reconciliation in data warehousing: Conceptual modeling and reasoning support. Network and Information Systems 2 4 (1999) 413-432
53. Calvanese D., De Giacomo G., Lembo D., Lenzerini M., and Rosati R. DL-Lite: Tractable description logics for ontologies. In: Veloso M.M., and Kambhampati S. (Eds). Proc. of the 20th Nat. Conf. on Artificial Intelligence (AAAI-05) (2005), AAAI Press/The MIT Press 602-607
54. Calvanese D., Lenzerini M., and Nardi D. Description logics for conceptual data modeling. In: Chomicki J., and Saake G. (Eds). Logics for Databases and Information Systems (1998), Kluwer Academic Publisher 229-264
55. The Gene ontology Consortium. Gene ontology: Tool for the unification of biology. Nature Genetics 25 (2000) 25-29
56. G. De Giacomo. Decidability of class-based knowledge representation formalisms. PhD thesis, Dipartimento di Informatica e Sistemistica, Università di Roma "La Sapienza", 1995
57. G. De Giacomo and M. Lenzerini. Boosting the correspondence between description logics and propositional dynamic logics. In Proc. of the 12th Nat. Conf. on Artificial Intelligence (AAAI'94), pages 205-212, 1994
58. G. De Giacomo and M. Lenzerini. Concept language with number restrictions and fixpoints, and its relationship with μ-calculus. In Proc. of the 11th Eur. Conf. on Artificial Intelligence (ECAI'94), pages 411-415, 1994
59. G. De Giacomo and M. Lenzerini. TBox and ABox reasoning in expressive description logics. In Proc. of the 5th Int. Conf. on the Principles of Knowledge Representation and Reasoning (KR'96), pages 316-327, 1996
60. S. Derriere, A. Richard, and A. Preite-Martinez. An ontology of astronomical object types for the virtual observatory. In Proc. of Special Session 3 of the 26th meeting of the IAU: Virtual Observatory in Action: New Science, New Technology, and Next Generation Facilities, 2006
61. Devambu P., Brachman R.J., Selfridge P.J., and Ballard B.W. LASSIE: A knowledge-based software information system. Communications of the ACM 34 5 (1991) 36-49
62. Donini F.M., Hollunder B., Lenzerini M., Spaccamela A.M., Nardi D., and Nutt W. The complexity of existential quantification in concept languages. Artificial Intelligence 2-3 (1992) 309-327
63. F.M. Donini, M. Lenzerini, D. Nardi, and W. Nutt. The complexity of concept languages. In Proc. of the 2nd Int. Conf. on the Principles of Knowledge Representation and Reasoning (KR'91), pages 151-162, 1991
64. F.M. Donini, M. Lenzerini, D. Nardi, and W. Nutt. Tractable concept languages. In Proc. of the 12th Int. Joint Conf. on Artificial Intelligence (IJCAI'91), pages 458-463, 1991
65. Donini F.M., Lenzerini M., Nardi D., and Schaerf A. AL-log: Integrating Datalog and description logics. J. of Intelligent Information Systems 10 3 (1998) 227-252
66. Donini F.M., and Massacci F. EXPTIME tableaux for ALC. Artificial Intelligence 124 1 (2000) 87-138
67. Doyle J., and Patil R.S. Two theses of knowledge representation: Language restrictions, taxonomic classification, and the utility of representation services. Artificial Intelligence 48 (1991) 261-297
68. Eiter T., Lukasiewicz T., Schindlauer R., and Tompits H. Combining answer set programming with description logics for the semantic web. Proc. of the 9th Int. Conf. on Principles of Knowledge Representation and Reasoning (KR 2004) (2004), Morgan Kaufmann, Los Altos, CA 141-151
69. Fensel D., van Harmelen F., Horrocks I., McGuinness D., and Patel-Schneider P.F. OIL: An ontology infrastructure for the semantic web. IEEE Intelligent Systems 16 2 (2001) 38-45
70. Fine K. In so many possible worlds. Notre Dame J. of Formal Logic 13 4 (1972) 516-520
71. Fischer M.J., and Ladner R.E. Propositional dynamic logic of regular programs. J. of Computer and System Sciences 18 (1979) 194-211
72. E. Franconi and G. Ng. The i.com tool for intelligent conceptual modeling. In Proc. of the 7th Int. Workshop on Knowledge Representation meets Databases (KRDB 2000), volume 29 of CEUR Electronic Workshop Proceedings, 2000
73. Garey M.R., and Johnson D.S. Computers and Intractability-A Guide to NP-Completeness (1979), W.H. Freeman and Company, San Francisco, CA, USA
74. Golbreich C., Zhang S., and Bodenreider O. The foundational model of anatomy in OWL: Experience and perspectives. J. of Web Semantics 4 3 (2006)
75. E. Gonçalvès and E. Grädel. Decidability issues for action guarded logics. In Proc. of the 2000 Description Logic Workshop (DL 2000), volume 33 of CEUR Electronic Workshop Proceedings, 2000
76. J. Goodwin. Experiences of using OWL at the ordnance survey. In Proc. of the First OWL Experiences and Directions Workshop, volume 188 of CEUR Electronic Workshop Proceedings, 2005
77. E. Grädel. Guarded fragments of first-order logic: A perspective for new description logics? In Proc. of the 1998 Description Logic Workshop (DL'98), volume 11 of CEUR Electronic Workshop Proceedings, 1998
78. Grädel E. On the restraining power of guards. J. of Symbolic Logic 64 (1999) 1719-1742
79. Grädel E., Kolaitis P.G., and Vardi M.Y. On the decision problem for two-variable first-order logic. Bulletin of Symbolic Logic 3 1 (1997) 53-69
80. V. Haarslev and R. Möller. RACE system description. In Proc. of the 1999 Description Logic Workshop (DL'99), volume 22 of CEUR Electronic Workshop Proceedings, 1999
81. Haarslev V., and Möller R. RACER system description. Proc. of the Int. Joint Conf. on Automated Reasoning (IJCAR 2001). Lecture Notes in Artificial Intelligence vol. 2083 (2001), Springer 701-705
82. Hartel F.W., de Coronado S., Dionne R., Fragoso G., and Golbeck J. Modeling a description logic vocabulary for cancer research. Journal of Biomedical Informatics 38 2 (2005) 114-129
83. Hayes P. RDF model theory. W3C Recommendation, 10 February 2004. Available at. http://www.w3.org/TR/rdf-mt/
84. P.J. Hayes. In defense of logic. In Proc. of the 5th Int. Joint Conf. on Artificial Intelligence (IJCAI'77), pages 559-565, 1977. A longer version appeared in The Psychology of Computer Vision (1975). Republished in [39]
85. Hayes P.J. The logic of frames. In: Metzing D. (Ed). Frame Conceptions and Text Understanding (1979), Walter de Gruyter and Co. 46-61 Republished in [39]
86. Heinsohn J., Kudenko D., Nebel B., and Profitlich H.-J. An empirical analysis of terminological representation systems. Artificial Intelligence 68 (1994) 367-397
87. Hofmann M. Proof-theoretic approach to description-logic. In: Panangaden P. (Ed). Proc. of the 20th Annual IEEE Symp. on Logic in Computer Science, LICS 2005 (June 2005), IEEE Computer Society Press 229-237
88. Hollunder B. Consistency checking reduced to satisfiability of concepts in terminological systems. Ann. of Mathematics and Artificial Intelligence 18 2-4 (1996) 133-157
89. B. Hollunder, W. Nutt, and M. Schmidt-Schauß. Subsumption algorithms for concept description languages. In Proc. of the 9th Eur. Conf. on Artificial Intelligence (ECAI'90), pages 348-353, London (United Kingdom), 1990. Pitman
90. Horrocks I., and Patel-Schneider P.F. Optimising propositional modal satisfiability for description logic subsumption. Proc. of the 4th Int. Conf. on Artificial Intelligence and Symbolic Computation (AISC'98). LNAI vol. 1476 (1998), Springer-Verlag 234-246
91. Horrocks I., Sattler U., Tessaris S., and Tobies S. How to decide query containment under constraints using a description logic. Proc. of the 7th Int. Conf. on Logic for Programming and Automated Reasoning (LPAR 2000). Lecture Notes in Artificial Intelligence (2000), Springer-Verlag
92. Horrocks I., Sattler U., and Tobies S. Practical reasoning for expressive description logics. In: Ganzinger H., McAllester D., and Voronkov A. (Eds). Proc. of the 6th Int. Conf. on Logic for Programming and Automated Reasoning (LPAR'99). Lecture Notes in Artificial Intelligence vol. 1705 (1999), Springer 161-180
93. I. Horrocks and S. Tobies. Reasoning with axioms: Theory and practice. In Proc. of the 7th Int. Conf. on Principles of Knowledge Representation and Reasoning (KR 2000), pages 285-296, 2000
94. Horrocks I. The FaCT system. In: de Swart H. (Ed). Proc. of the 2nd Int. Conf. on Analytic Tableaux and Related Methods (TABLEAUX'98). Lecture Notes in Artificial Intelligence vol. 1397 (1998), Springer 307-312
95. I. Horrocks. Using an expressive description logic: FaCT or fiction? In Proc. of the 6th Int. Conf. on Principles of Knowledge Representation and Reasoning (KR'98), pages 636-647, 1998
96. Horrocks I., and Patel-Schneider P.F. Optimizing description logic subsumption. J. of Logic and Computation 9 3 (1999) 267-293
97. I. Horrocks and P.F. Patel-Schneider. The generation of DAML + OIL. In Proc. of the 2001 Description Logic Workshop (DL 2001), volume 49 of CEUR Electronic Workshop Proceedings, 2001
98. Horrocks I., Patel-Schneider P.F., and van Harmelen F. Reviewing the design of DAML + OIL: An ontology language for the semantic web. Proc. of the 18th Nat. Conf. on Artificial Intelligence (AAAI 2002) (2002), AAAI Press 792-797
99. Horrocks I., Patel-Schneider P.F., and van Harmelen F. From SHIQ and RDF to OWL: The making of a web ontology language. J. of Web Semantics 1 1 (2003) 7-26
100. Horrocks I., and Sattler U. A description logic with transitive and inverse roles and role hierarchies. J. of Logic and Computation 9 3 (1999) 385-410
101. Horrocks I., and Sattler U. Ontology reasoning in the SHOQ(D) description logic. Proc. of the 17th Int. Joint Conf. on Artificial Intelligence (IJCAI 2001) (2001), Morgan Kaufmann, Los Altos, CA 199-204
102. Hustadt U., and Schmidt R.A. Using resolution for testing modal satisfiability and building models. In: Gent I.P., van Maaren H., and Walsh T. (Eds). SAT 2000: Highlights of Satisfiability Research in the Year 2000. Frontiers in Artificial Intelligence and Applications vol. 63 (2000), IOS Press, Amsterdam Also to appear in a special issue of Journal of Automated Reasoning
103. Hustadt U., Schmidt R.A., and Weidenbach C. MSPASS: Subsumption testing with SPASS. Proc. of the 1999 Description Logic Workshop (DL'99) (1999), Linköping University 136-137
104. U. Hustadt, B. Motik, and U. Sattler. Reducing SHIQ-description logic to disjunctive Datalog programs. In Proc. of the 9th Int. Conf. on Principles of Knowledge Representation and Reasoning (KR 2004), pages 152-162, 2004
105. Janin D., and Walukiewicz I. Automata for the modal mu-calculus and related results. In: Wiedermann J., and Hájek P. (Eds). Int. Symp. on the Mathematical Foundation of Computer Science. Lecture Notes in Computer Science vol. 969 (1995), Springer 552-562
106. Kalyanpur A., Parsia B., and Hendler J. A tool for working with web ontologies. International Journal on Semantic Web and Information Systems 1 1 (2005) 36-49
107. Kazakov Y., and Motik B. A resolution-based decision procedure for SHOIQ. In: Furbach U., and Shankar N. (Eds). Proc. of the Int. Joint Conf. on Automated Reasoning (IJCAR 2006). Lecture Notes in Computer Science vol. 4130 (2006), Springer 662-677
108. A. Kershenbaum, A. Fokoue, C. Patel, C. Welty E. Schonberg, J. Cimino, L. Ma, K. Srinivas, R. Schloss, and J.W. Murdock. A view of OWL from the field: Use cases and experiences. In Proc. of the Second OWL Experiences and Directions Workshop, volume 216 of CEUR Electronic Workshop Proceedings, 2006
109. Knublauch H., Fergerson R., Noy N., and Musen M. The Protégé OWL Plugin: An open development environment for semantic web applications. In: McIlraith S.A., Plexousakis D., and van Harmelen F. (Eds). Proc. of the 2004 International Semantic Web Conference (ISWC 2004). Lecture Notes in Computer Science vol. 3298 (2004), Springer 229-243
110. N. Kurtonina and M. de Rijke. Classifying description logics. In Proc. of the 1997 Description Logic Workshop (DL'97), pages 49-53, 1997
111. R. Küsters and R. Molitor. Computing least common subsumers in ALEN. In Proc. of the 17th Int. Joint Conf. on Artificial Intelligence (IJCAI 2001), pages 219-224, 2001
112. L. Lacy, G. Aviles, K. Fraser, W. Gerber, A. Mulvehill, and R. Gaskill. Experiences using OWL in military applications. In Proc. of the First OWL Experiences and Directions Workshop, volume 188 of CEUR Electronic Workshop Proceedings, 2005
113. Levy A.Y., and Rousset M.C. Combining Horn rules and description logics in CARIN. Artificial Intelligence 104 1-2 (1998) 165-209
114. Lutz C. Complexity of terminological reasoning revisited. Proc. of the 6th Int. Conf. on Logic for Programming and Automated Reasoning (LPAR'99). Lecture Notes in Artificial Intelligence vol. 1705 (1999), Springer 181-200
115. C. Lutz. The complexity of reasoning with concrete domains. PhD thesis, Teaching and Research Area for Theoretical Computer Science, RWTH Aachen, 2001
116. C. Lutz. Interval-based temporal reasoning with general TBoxes. In Proc. of the 17th Int. Joint Conf. on Artificial Intelligence (IJCAI 2001), pages 89-94, 2001
117. C. Lutz and U. Sattler. Mary likes all cats. In Proc. of the 2000 Description Logic Workshop (DL 2000), volume 33 of CEUR Electronic Workshop Proceedings, 2000
118. MacGregor R. The evolving technology of classification-based knowledge representation systems. In: Sowa J.F. (Ed). Principles of Semantic Networks (1991), Morgan Kaufmann, Los Altos, CA 385-400
119. Mays E., Dionne R., and Weida R. K-Rep system overview. SIGART Bull. 2 3 (1991) 93-97
120. McGuinness D.L., and Wright J. Conceptual modeling for configuration: A description logic-based approach. Artificial Intelligence for Engineering Design, Analysis, and Manufacturing 12 4 (1998) 333-344 (Special issue on Configuration)
121. Meyer T., Lee K., Booth R., and Pan J.Z. Finding maximally satisfiable terminologies for the description logic ALC. Proc. of the 21st Nat. Conf. on Artificial Intelligence (AAAI 2006) (2006), AAAI Press/The MIT Press
122. Minsky M. A framework for representing knowledge. In: Haugeland J. (Ed). Mind Design (1981), MIT Press A longer version appeared in The Psychology of Computer Vision (1975). Republished in [39]
123. Motik B., and Sattler U. A comparison of reasoning techniques for querying large description logic aboxes. Proc. of the 13th International Conference on Logic for Programming, Artificial Intelligence (LPAR06). LNCS (2006), Springer-Verlag
124. Motik B., Sattler U., and Studer R. Query answering for OWL-DL with rules. J. of Web Semantics 3 1 (2005) 41-60
125. Muller D.E., and Schupp P.E. Alternating automata on infinite trees. Theoretical Computer Science 54 (1987) 267-276
126. Nebel B. Reasoning and Revision in Hybrid Representation Systems. Lecture Notes in Artificial Intelligence vol. 422 (1990), Springer
127. Nebel B. Terminological reasoning is inherently intractable. Artificial Intelligence 43 2 (1990) 235-249
128. Oppacher F., and Suen E. HARP: A tableau-based theorem prover. J. of Automated Reasoning 4 (1988) 69-100
129. Pacholski L., Szwast W., and Tendera L. Complexity of two-variable logic with counting. Proc. of the 12th IEEE Symp. on Logic in Computer Science (LICS'97) (1997), IEEE Computer Society Press 318-327
130. Pacholski L., Szwast W., and Tendera L. Complexity results for first-order two-variable logic with counting. SIAM J. on Computing 29 4 (2000) 1083-1117
131. Papadimitriou C.H. Computational Complexity (1994), Addison-Wesley Publ. Co., Reading, MA
132. Parsia B., Sirin E., and Kalyanpur A. Debugging OWL ontologies. In: Ellis A., and Hagino T. (Eds). Proc. of the 14th International Conference on World Wide Web (WWW'05) (2005), ACM 633-640
133. P.F. Patel-Schneider. DLP. In Proc. of the 1999 Description Logic Workshop (DL'99), volume 22 of CEUR Electronic Workshop Proceedings, 1999
134. Patel-Schneider P.F., Hayes P., and Horrocks I. OWL Web Ontology Language semantics and abstract syntax. W3C Recommendation, 10 February 2004. Available at. http://www.w3.org/TR/owl-semantics/
135. Patel-Schneider P.F., McGuinness D.L., Brachman R.J., Resnick L.A., and Borgida A. The CLASSIC knowledge representation system: Guiding principles and implementation rational. SIGART Bull. 2 3 (1991) 108-113
136. Pellet OWL reasoner. Maryland Information and Network Dynamics Lab, 2003. http://www.mindswap.org/2003/pellet/index.shtml
137. Peltason C. The BACK system-an overview. SIGART Bull. 2 3 (1991) 114-119
138. Quillian M.R. Word concepts: A theory and simulation of some basic capabilities. Behavioral Science 12 (1967) 410-430 Republished in [39]
139. Rector A., and Rogers J. Ontological and practical issues in using a description logic to represent medical concept systems: Experience from GALEN. Reasoning Web, Second International Summer School, Tutorial Lectures. Lecture Notes in Computer Science vol. 4126 (2006), Springer-Verlag 197-231
140. Rosati R. On the decidability and complexity of integrating ontologies and rules. J. of Web Semantics 3 1 (2005) 61-73
141. A. Ruttenberg, J. Rees, and J. Luciano. Experience using OWL DL for the exchange of biological pathway information. In Proc. of the First OWL Experiences and Directions Workshop, volume 188 of CEUR Electronic Workshop Proceedings, 2005
142. Sattler U. A concept language extended with different kinds of transitive roles. In: Görz G., and Hölldobler S. (Eds). 20. Deutsche Jahrestagung für Künstliche Intelligenz. Lecture Notes in Artificial Intelligence vol. 1137 (1996), Springer-Verlag
143. Sattler U., and Vardi M.Y. The hybrid mu-calculus. In: Goré R., Leitsch A., and Nipkow T. (Eds). Proc. of the International Joint Conference on Automated Reasoning (IJCAR-01). Lecture Notes in Artificial Intelligence vol. 2083 (2001), Springer-Verlag
144. K. Schild. A correspondence theory for terminological logics: Preliminary report. In Proc. of the 12th Int. Joint Conf. on Artificial Intelligence (IJCAI'91), pages 466-471, 1991
145. K. Schild. Terminological cycles and the propositional μ-calculus. In Proc. of the 4th Int. Conf. on the Principles of Knowledge Representation and Reasoning (KR'94), pages 509-520, 1994
146. K. Schild. Querying knowledge and data bases by a universal description logic with recursion. PhD thesis, Universität des Saarlandes, Germany, 1995
147. Schlobach S., and Cornet R. Non-standard reasoning services for the debugging of description logic terminologies. In: Gottlob G., and Walsh T. (Eds). Proc. of the 18th Int. Joint Conf. on Artificial Intelligence (IJCAI 2003) (2003), Morgan Kaufmann, Los Altos, CA 355-362
148. Schmidt-Schauß M. Subsumption in KL-ONE is undecidable. In: Brachman R.J., Levesque H.J., and Reiter R. (Eds). Proc. of the 1st Int. Conf. on the Principles of Knowledge Representation and Reasoning (KR'89) (1989), Morgan Kaufmann, Los Altos, CA 421-431
149. Schmidt-Schauß M., and Smolka G. Attributive concept descriptions with complements. Artificial Intelligence 48 1 (1991) 1-26
150. A. Sidhu, T. Dillon, E. Chang, and B.S. Sidhu. Protein ontology development using OWL. In Proc. of the First OWL Experiences and Directions Workshop, volume 188 of CEUR Electronic Workshop Proceedings, 2005
151. Sirin E., Parsia B., Cuenca Grau B., Kalyanpur A., and Katz Y. Pellet: A practical OWL-DL reasoner. Journal of Web Semantics 5 2 (2007) 51-53
152. Soergel D., Lauser B., Liang A., Fisseha F., Keizer J., and Katz S. Reengineering thesauri for new applications: The AGROVOC example. J. of Digital Information 4 4 (2004)
153. Spackman K.A., Campbell K.E., and Cote R.A. SNOMED RT: A reference terminology for health care. J. of the American Medical Informatics Association (1997) 640-644 (Fall Symposium Supplement)
154. P.-H. Speel, F. van Raalte, P.E. van der Vet, and N.J.I. Mars. Runtime and memory usage performance of description logics. In G. Ellis, R. A. Levinson, A. Fall, and V. Dahl, editors, Knowledge Retrieval, Use and Storage for Efficiency: Proc. of the 1st Int. KRUSE Symposium, pages 13-27, 1995
155. Stockmeyer L., and Meyer A. Word problems requiring exponential time (preliminary report). Proc. of the 5th Annual ACM Symposium on Theory of Computing (STOC'73) (1973), ACM Press 1-9
156. Semantic web for earth and environmental terminology (SWEET). Jet Propulsion Laboratory, California Institute of Technology, 2006. http://sweet.jpl.nasa.gov/
157. S. Tessaris. Questions and answers: reasoning and querying in description logic. PhD thesis, University of Manchester, Department of Computer Science, April 2001
158. Thomas W. Automata on infinite objects. In: van Leeuwen J. (Ed). Handbook of Theoretical Computer Science, vol. B (1990), Elsevier Science Publishers (North-Holland), Amsterdam 133-192 (Chapter 4)
159. S. Tobies. Complexity results and practical algorithms for logics in knowledge representation. PhD thesis, LuFG Theoretical Computer Science, RWTH-Aachen, Germany, 2001
160. Tsarkov D., and Horrocks I. FaCT++ description logic reasoner: System description. Proc. of the Int. Joint Conf. on Automated Reasoning (IJCAR 2006). Lecture Notes in Artificial Intelligence vol. 4130 (2006), Springer 292-297
161. Vardi M.Y., and Wolper P. Automata-theoretic techniques for modal logics of programs. J. of Computer and System Sciences 32 (1986) 183-221
162. Vardi M.Y., and Wolper P. Reasoning about infinite computations. Information and Computation 115 1 (1994) 1-37
163. Woods W.A. What's in a link: Foundations for semantic networks. In: Bobrow D.G., and Collins A.M. (Eds). Representation and Understanding: Studies in Cognitive Science (1975), Academic Press 35-82 Republished in [39]