{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,5]],"date-time":"2026-01-05T22:05:29Z","timestamp":1767650729635,"version":"build-2065373602"},"reference-count":156,"publisher":"Elsevier","isbn-type":[{"type":"print","value":"9780444516909"}],"license":[{"start":{"date-parts":[[2007,1,1]],"date-time":"2007-01-01T00:00:00Z","timestamp":1167609600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2007,1,1]],"date-time":"2007-01-01T00:00:00Z","timestamp":1167609600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1016\/s1570-2464(07)80016-4","type":"book-chapter","created":{"date-parts":[[2007,10,4]],"date-time":"2007-10-04T09:38:50Z","timestamp":1191490730000},"page":"757-819","source":"Crossref","is-referenced-by-count":17,"title":["13 Description logic"],"prefix":"10.1016","member":"78","reference":[{"key":"10.1016\/S1570-2464(07)80016-4_bib1","series-title":"Proc. of the Annual Conf. of the Eur. Assoc. for Computer Science Logic (CSL'99)","first-page":"307","article-title":"A road-map on complexity for hybrid logics","volume":"volume 1683","author":"Areces","year":"1999"},{"key":"10.1016\/S1570-2464(07)80016-4_bib2","doi-asserted-by":"crossref","first-page":"479","DOI":"10.1016\/S0747-7171(89)80055-0","article-title":"Unification in commutative theories","volume":"8","author":"Baader","year":"1989","journal-title":"J. of Symbolic Computation"},{"key":"10.1016\/S1570-2464(07)80016-4_bib3","series-title":"Proc. of the 12th Int. Joint Conf. on Artificial Intelligence (IJCAI'91)","article-title":"Augmenting concept languages by transitive closure of roles: An alternative to termi- nological cycles","author":"Baader","year":"1991"},{"key":"10.1016\/S1570-2464(07)80016-4_bib4","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1093\/logcom\/6.1.33","article-title":"A formal definition for the expressive power of terminological knowledge representation languages","volume":"6","author":"Baader","year":"1996","journal-title":"J. of Logic and Computation"},{"key":"10.1016\/S1570-2464(07)80016-4_bib5","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1007\/BF02127747","article-title":"Using automata theory for characterizing the semantics of terminological cycles","volume":"18","author":"Baader","year":"1996","journal-title":"Ann. of Mathematics and Artificial Intelligence"},{"key":"10.1016\/S1570-2464(07)80016-4_bib6","series-title":"Proceedings of the 11th International Conference on Conceptual Structures, ICCS 2003","first-page":"117","article-title":"Computing the least common subsumer in the description logic EC w.r.t. termino- logical cycles with descriptive semantics","volume":"volume 2746","author":"Baader","year":"2003"},{"key":"10.1016\/S1570-2464(07)80016-4_bib7","series-title":"Proceedings of the 18th International Joint Conference on Artificial Intelligence","first-page":"319","article-title":"Least common subsumers and most specific concepts in a description logic with existen- tial restrictions and terminological cycles","author":"Baader","year":"2003"},{"key":"10.1016\/S1570-2464(07)80016-4_bib8","series-title":"Proceedings of the 2003 International Workshop on Description Logics (DL2003)","article-title":"Restricted role-value-maps in a description logic with existential restrictions and terminological cycles","author":"Baader","year":"2003"},{"key":"10.1016\/S1570-2464(07)80016-4_bib9","series-title":"Proceedings of the 18th International Joint Conference on Artificial Intelligence","first-page":"325","article-title":"Terminological cycles in a description logic with existential restrictionsa","author":"Baader","year":"2003"},{"key":"10.1016\/S1570-2464(07)80016-4_bib10","series-title":"Proc. of the 19th Int. Joint Conf. on Artificial Intelligence (IJCAI 2005)","article-title":"Pushing the EC envelope","author":"Baader","year":"2005"},{"key":"10.1016\/S1570-2464(07)80016-4_bib11","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01051766","article-title":"On the expressivity of feature logics with negation, functional uncertainty, and sort equations","volume":"2","author":"Baader","year":"1993","journal-title":"J. of Logic, Language and Information"},{"year":"2003","series-title":"The Description Logic Handbook: Theory, Implementation, and Applications","key":"10.1016\/S1570-2464(07)80016-4_bib12"},{"key":"10.1016\/S1570-2464(07)80016-4_bib13","first-page":"109","article-title":"An empirical analysis of optimization techniques for terminological representation systems or: Making KRIS get a move on","volume":"4","author":"Baader","year":"1994","journal-title":"Applied Artificial Intelligence. Special Issue on Knowledge Base Management"},{"key":"10.1016\/S1570-2464(07)80016-4_bib14","series-title":"Proc. of the 12th Int. Joint Conf. on Artificial Intelligence (IJCAI'91)","first-page":"452","article-title":"A schema for integrating concrete domains into concept lan- guages","author":"Baader","year":"1991"},{"article-title":"A schema for integrating concrete domains into concept lan- guages","year":"1991","author":"Baader","key":"10.1016\/S1570-2464(07)80016-4_bib15"},{"key":"10.1016\/S1570-2464(07)80016-4_bib16","series-title":"Proc. of the 16th German Workshop on Artificial Intelligence (GWAI'92)","first-page":"132","article-title":"Extensions of concept languages for a mechanical engineering application","volume":"671","author":"Baader","year":"1992"},{"issue":"3","key":"10.1016\/S1570-2464(07)80016-4_bib17","doi-asserted-by":"crossref","first-page":"8","DOI":"10.1145\/122296.122298","article-title":"KRTS: Knowledge Representation and Inference System","volume":"2","author":"Baader","year":"1991","journal-title":"SIGART Bull"},{"key":"10.1016\/S1570-2464(07)80016-4_bib18","series-title":"Proc. of the Workshop on Processing Declarative Knowledge (PDK'91)","first-page":"67","article-title":"A terminological knowledge representation system with com- plete inference algorithm","volume":"volume 567","author":"Baader","year":"1991"},{"key":"10.1016\/S1570-2464(07)80016-4_bib19","series-title":"Festschrift in honor of J\u00f6rg Siekmann","first-page":"67","article-title":"Description logics as ontology languages for the semantic web","author":"Baader","year":"1991"},{"key":"10.1016\/S1570-2464(07)80016-4_bib20","series-title":"Proc. of the 22nd German Annual Conf. on Artificial Intelligence (KI'98)","first-page":"129","article-title":"Computing the least common subsumer and the most specific concept in the presence of cyclic ACN-concept descriptions","volume":"volume 1504","author":"Baader","year":"1998"},{"key":"10.1016\/S1570-2464(07)80016-4_bib21","series-title":"Proc. of the 1th Int. Conf. on Principles of Knowledge Representation and Reasoning (KR 2000)","first-page":"261","article-title":"Matching in description logics with existential restrictions","author":"Baader","year":"2000"},{"key":"10.1016\/S1570-2464(07)80016-4_bib22","series-title":"Proceedings of the 8th International Conference on Logic for Programming, Artificial Intelligence and Reasoning, (LPAR 2001)","article-title":"Unification in a description logic with transitive closure of roles","author":"Baader","year":"2001"},{"issue":"3","key":"10.1016\/S1570-2464(07)80016-4_bib23","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1093\/logcom\/9.3.411","article-title":"Matching in description logics","volume":"9","author":"Baader","year":"1999","journal-title":"J. of Logic and Computation"},{"key":"10.1016\/S1570-2464(07)80016-4_bib24","series-title":"Proc. of the 1998 Description Logic Workshop (DL'98). CEUR Electronic Workshop Proceedings","article-title":"Structural subsumption considered from an automata theoretic point of view","author":"Baader","year":"1998"},{"key":"10.1016\/S1570-2464(07)80016-4_bib25","series-title":"Proc. of the 16th Int. Joint Conf. on Artificial Intelligence (IJCAI'99)","first-page":"96","article-title":"Computing least common subsumers in description logics with existential restrictions","author":"Baader","year":"1999"},{"key":"10.1016\/S1570-2464(07)80016-4_bib26","series-title":"Proc. of the 7th Int. Conf. on Principles of Knowledge Representation and Reasoning (KR 2000)","first-page":"297","article-title":"Rewriting concepts using terminologies","author":"Baader","year":"2000"},{"key":"10.1016\/S1570-2464(07)80016-4_bib27","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1613\/jair.919","article-title":"Fusions of description logics and abstract description systems","volume":"16","author":"Baader","year":"2002","journal-title":"Journal of Artificial Intelligence Research (JAIR)"},{"issue":"3","key":"10.1016\/S1570-2464(07)80016-4_bib28","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1006\/jsco.2000.0426","article-title":"Unification of concepts terms in description logics","volume":"31","author":"Baader","year":"2001","journal-title":"J. of Symbolic Computation"},{"year":"2003","series-title":"Basic description logics","author":"Baader","key":"10.1016\/S1570-2464(07)80016-4_bib29"},{"key":"10.1016\/S1570-2464(07)80016-4_bib30","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1023\/A:1013882326814","article-title":"An overview of tableau algorithms for description logics","volume":"69","author":"Baader","year":"2001","journal-title":"Studia Logica"},{"issue":"8","key":"10.1016\/S1570-2464(07)80016-4_bib31","doi-asserted-by":"crossref","first-page":"979","DOI":"10.1016\/S0306-4379(03)00003-6","article-title":"Description logics with aggregates and concrete domains","volume":"28","author":"Baader","year":"2003","journal-title":"Informa- tion Systems"},{"key":"10.1016\/S1570-2464(07)80016-4_bib32","first-page":"447","article-title":"Unification theory","volume":"Volume I","author":"Baader","year":"2001"},{"key":"10.1016\/S1570-2464(07)80016-4_bib33","series-title":"Proc. of the 4th Int. Workshop on Frontiers of Combining Systems (FroCoS 2002)","first-page":"162","article-title":"Computational complexity of propositional linear temporal logics based on qualitative spatial or temporal reasoning","author":"Balbiani","year":"2002"},{"key":"10.1016\/S1570-2464(07)80016-4_bib34","series-title":"Proc. of the Int. Conf. on Analytic Tableaux and Related Methods (TABLEAUX'98)","article-title":"A tableau calculus for multimodal logics and some (un)decidability results","volume":"volume 1397","author":"Baldoni","year":"1998"},{"key":"10.1016\/S1570-2464(07)80016-4_bib35","series-title":"Proc. of the 18th Int. Joint Conf. on Artificial Intelligence (IJCAI 2003)","first-page":"331","article-title":"On the undecidability of description and dynamic logics with recursion and counting","author":"A. Bonatti","year":"2003"},{"issue":"70","key":"10.1016\/S1570-2464(07)80016-4_bib36","doi-asserted-by":"crossref","first-page":"207","DOI":"10.2307\/1970103","article-title":"The word problem","volume":"2","author":"W. Boone","year":"1959","journal-title":"Ann. of Mathematics"},{"article-title":"On the relationship between description logics and predicate logic queries","year":"1992","author":"Borgida","key":"10.1016\/S1570-2464(07)80016-4_bib37"},{"issue":"1\u20132","key":"10.1016\/S1570-2464(07)80016-4_bib38","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1016\/0004-3702(96)00004-5","article-title":"On the relative expressiveness of description logics and predicate logics","volume":"82","author":"Borgida","year":"1996","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S1570-2464(07)80016-4_bib39","series-title":"Proc. of the 5th Int. Conf. on the Principles of Knowledge Representation and Reasoning (KR'96)","first-page":"340","article-title":"Asking queries about frames","author":"Borgida","year":"1996"},{"key":"10.1016\/S1570-2464(07)80016-4_bib40","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1613\/jair.56","article-title":"A semantics and complete algorithm for subsump- tion in the CLASSIC description logic","volume":"1","author":"Borgida","year":"1994","journal-title":"J. of Artificial Intelligence Research"},{"key":"10.1016\/S1570-2464(07)80016-4_bib41","series-title":"Proc. of the 5th Int. Conf. on Deductive and Object-Oriented Databases (DOOD'97)","first-page":"85","article-title":"Adding uniqueness constraints to description logics (prelim- inary report)","author":"Borgida","year":"1997"},{"key":"10.1016\/S1570-2464(07)80016-4_bib42","series-title":"Research in Natural Language Understanding","first-page":"36","article-title":"Structured inheritance networks","author":"J. Brachman","year":"1978"},{"year":"1985","series-title":"Readings in Knowledge Representation","key":"10.1016\/S1570-2464(07)80016-4_bib43"},{"key":"10.1016\/S1570-2464(07)80016-4_bib44","series-title":"Principles of Semantic Networks","first-page":"401","article-title":"Living with CLASSIC: When and how to use a KL-ONE-like language","author":"J. Brachman","year":"1991"},{"issue":"2","key":"10.1016\/S1570-2464(07)80016-4_bib45","first-page":"171","article-title":"An overview of the KL-ONE knowledge representation system","volume":"9","author":"J. Brachman","year":"1985","journal-title":"Cognitive Science"},{"key":"10.1016\/S1570-2464(07)80016-4_bib46","series-title":"Proc. of the 16th Eur. Conf. on Artificial Intelligence (ECAI 2004)","article-title":"Polynomial time reasoning in a description logic with existential restrictions, gci axioms, and\u2014what else?","author":"Brandt","year":"2004"},{"key":"10.1016\/S1570-2464(07)80016-4_bib47","series-title":"Proc. of the 2002 Description Logic Workshop (DL 2002)","article-title":"Approximating ACCN-concept descrip- tions","author":"Brandt","year":"2002"},{"key":"10.1016\/S1570-2464(07)80016-4_bib48","series-title":"Proceedings of the Eighth International Conference on Principles of Knowledge Representation and Reasoning (KR2002)","first-page":"203","article-title":"Approximation and difference in descrip- tion logics","author":"Brandt","year":"2002"},{"key":"10.1016\/S1570-2464(07)80016-4_bib49","first-page":"155","article-title":"Identification constraints and functional dependencies in description logics","author":"Calvanese","year":"2001","journal-title":"Proc. of the 17th Int. Joint Conf. on Artificial Intelligence (IJCAI 2001)"},{"key":"10.1016\/S1570-2464(07)80016-4_bib50","series-title":"Proc. of the 2002 Description Logic Workshop (DL 2002)","article-title":"2-ATAs make DLs easy","author":"Calvanese","year":"2002"},{"key":"10.1016\/S1570-2464(07)80016-4_bib51","series-title":"Proceedings of the International Workshop in Description Logics 2004 (DL2004)","article-title":"DL-Lite: Practical reasoning in rich DLs","volume":"volume 104","author":"Calvanese","year":"2004"},{"key":"10.1016\/S1570-2464(07)80016-4_bib52","series-title":"Logics for Databases and Information Systems","first-page":"229","article-title":"Description logics for conceptual data modeling","author":"Calvanese","year":"1998"},{"key":"10.1016\/S1570-2464(07)80016-4_bib53","series-title":"Proc. of the 4th Int. Conf. on the Principles of Knowledge Representation and Reasoning (KR'94)","first-page":"121","article-title":"Learning the CLASSIC description logics: Theoretical and experimental results","author":"W. Cohen","year":"1994"},{"key":"10.1016\/S1570-2464(07)80016-4_bib54","series-title":"Proc. of the 12th Nat. Conf. on Artificial Intelligence (AAAI'94)","first-page":"205","article-title":"Boosting the correspondence between description logics and propositional dynamic logics","author":"De Giacomo","year":"1994"},{"key":"10.1016\/S1570-2464(07)80016-4_bib55","series-title":"Proc. of the 11th Eur. Conf. on Artificial Intelligence (AAAI'94)","first-page":"411","article-title":"Concept language with number restrictions and fixpoints, and its relationship with \u03bc-calculus","author":"De Giacomo","year":"1994"},{"key":"10.1016\/S1570-2464(07)80016-4_bib56","series-title":"Proc. of the 14th Int. Joint Conf. on Artificial Intelligence (IJCAI'95)","first-page":"411","article-title":"What's in an aggregate: Foundations for description logics with tuples and sets","author":"De Giacomo","year":"1994"},{"key":"10.1016\/S1570-2464(07)80016-4_bib57","series-title":"Proc. of the 5th Int. Conf. on the Principles of Knowledge Representation and Reasoning (KR'96)","first-page":"316","article-title":"TBox and ABox reasoning in expressive description logics","author":"De Giacomo","year":"1996"},{"key":"10.1016\/S1570-2464(07)80016-4_bib58","first-page":"123","article-title":"Grammar logics","volume":"121\u2013122","author":"Farinas del Cerro","year":"1988","journal-title":"Logique et Analyse"},{"issue":"6","key":"10.1016\/S1570-2464(07)80016-4_bib59","doi-asserted-by":"crossref","DOI":"10.1093\/logcom\/11.6.933","article-title":"The complexity of regularity in grammar logics and related modal logics","volume":"11","author":"Demri","year":"2001","journal-title":"J. of Logic and Computation"},{"key":"10.1016\/S1570-2464(07)80016-4_bib60","series-title":"Proceedings of the 1th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS'04)","first-page":"121","article-title":"LTL over integer periodicity constraints","author":"Demri","year":"2004"},{"year":"2003","series-title":"Complexity of reasoning","author":"Donini","key":"10.1016\/S1570-2464(07)80016-4_bib61"},{"key":"10.1016\/S1570-2464(07)80016-4_bib62","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1016\/0004-3702(92)90076-A","article-title":"The complexity of existential quantification in concept languages","volume":"2\u20133","author":"M. Donini","year":"1992","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S1570-2464(07)80016-4_bib63","series-title":"Proc. of the 2nd Int. Conf. on the Principles of Knowledge Representation and Reasoning (KR'91)","first-page":"151","article-title":"The complexity of concept languages","author":"M. Donini","year":"1991"},{"key":"10.1016\/S1570-2464(07)80016-4_bib64","first-page":"458","article-title":"Tractable concept languages","author":"M. Donini","year":"1991","journal-title":"Proc. of the 12th Int. Joint Conf. on Artificial Intelligence (IJCAI'91)"},{"key":"10.1016\/S1570-2464(07)80016-4_bib65","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1006\/inco.1997.2625","article-title":"Tra ctable of concept languages","volume":"134","author":"M. Donini","year":"1997","journal-title":"Information and Computation"},{"year":"1999","series-title":"Tractability and in- tractability in description logics","author":"M. Donini","key":"10.1016\/S1570-2464(07)80016-4_bib66"},{"issue":"4","key":"10.1016\/S1570-2464(07)80016-4_bib67","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1093\/logcom\/4.4.423","article-title":"Deduction in concept languages: From subsumption to instance checking","volume":"4","author":"M. Donini","year":"1994","journal-title":"J. of Logic and Computation"},{"key":"10.1016\/S1570-2464(07)80016-4_bib68","series-title":"GWAI-86 and 2. \u00d6sterreichische Artificial- Intelligence-Tagung","first-page":"69","article-title":"Data models in knowledge representation systems: A case study","volume":"volume 124","author":"Edelmann","year":"1986"},{"issue":"1","key":"10.1016\/S1570-2464(07)80016-4_bib69","doi-asserted-by":"crossref","DOI":"10.1137\/0217007","article-title":"Sorting and recognition problems for ordered sets","volume":"17","author":"Faigle","year":"1988","journal-title":"SIAM J. on Computing"},{"issue":"2","key":"10.1016\/S1570-2464(07)80016-4_bib70","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1007\/BF00379767","article-title":"Graded modalities I","volume":"44","author":"Fattorosi-Barnaba","year":"1985","journal-title":"Studia Logica"},{"issue":"4","key":"10.1016\/S1570-2464(07)80016-4_bib71","doi-asserted-by":"crossref","first-page":"516","DOI":"10.1305\/ndjfl\/1093890715","article-title":"In so many possible worlds","volume":"13","author":"Fine","year":"1972","journal-title":"Notre Dame J. of Formal Logic"},{"year":"2005","series-title":"Interpolation and Definability: Modal and Intuitionistic Logic","author":"Gabbay","key":"10.1016\/S1570-2464(07)80016-4_bib72"},{"year":"1979","series-title":"Computers and Intractability \u2014 A guide to NP- completeness","author":"R. Garey","key":"10.1016\/S1570-2464(07)80016-4_bib73"},{"key":"10.1016\/S1570-2464(07)80016-4_bib74","doi-asserted-by":"crossref","first-page":"607","DOI":"10.1007\/BF01054038","article-title":"Modal logic with names","volume":"22","author":"Gargov","year":"1993","journal-title":"J. of Philosophical Logic"},{"key":"10.1016\/S1570-2464(07)80016-4_bib75","doi-asserted-by":"crossref","first-page":"859","DOI":"10.2307\/2586506","article-title":"Unification in intuitionistic logic","volume":"64","author":"Ghilardi","year":"1999","journal-title":"J. of Symbolic Logic"},{"issue":"3","key":"10.1016\/S1570-2464(07)80016-4_bib76","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1016\/S0168-0072(99)00032-9","article-title":"Best solving modal equations","volume":"102","author":"Ghilardi","year":"2000","journal-title":"Ann. Pure Appl. Logic"},{"key":"10.1016\/S1570-2464(07)80016-4_bib77","series-title":"Proc. of the 1th Int. Conf. on Principles of Knowledge Representation and Reasoning (KR 2000)","article-title":"Expressive ABox reasoning with number restrictions, role hier- archies, and transitively closed roles","author":"Haarslev","year":"2000"},{"key":"10.1016\/S1570-2464(07)80016-4_bib78","series-title":"Proc. of the 11th Int. Joint Conf. on Artificial Intelligence (IJCAI 2001)","article-title":"High performance reasoning with very large knowledge bases: A practical case study","author":"Haarslev","year":"2001"},{"key":"10.1016\/S1570-2464(07)80016-4_bib79","series-title":"Proc. of the Int. Joint Conf. on Automated Reasoning (IJCAR 2001)","article-title":"RACER system description","volume":"volume 2083","author":"Haarslev","year":"2001"},{"key":"10.1016\/S1570-2464(07)80016-4_bib80","series-title":"Proc. of the Int. Joint Conf. on Automated Reasoning (IJCAR 2001)","first-page":"29","article-title":"The description logic A.CCM'HR+extended with concrete domains: A practically motivated approach","volume":"volume 2083","author":"Haarslev","year":"2001"},{"key":"10.1016\/S1570-2464(07)80016-4_bib81","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1016\/0004-3702(92)90049-4","article-title":"A guide to completeness and complexity for modal logics of knowledge and belief","volume":"54","author":"Y. Halpern","year":"1992","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S1570-2464(07)80016-4_bib82","series-title":"Proc. of the 3rd Int. Conf. on the Principles of Knowledge Representation and Reasoning (KR'92)","first-page":"318","article-title":"Specifying role interaction in concept languages","author":"Hanschke","year":"1992"},{"key":"10.1016\/S1570-2464(07)80016-4_bib83","series-title":"Frame Conceptions and Text Under- standing","first-page":"46","article-title":"The logic of frames","author":"J. Hayes","year":"1979"},{"issue":"4","key":"10.1016\/S1570-2464(07)80016-4_bib84","doi-asserted-by":"crossref","first-page":"609","DOI":"10.1093\/logcom\/11.4.609","article-title":"The complexity of poor man's logic","volume":"11","author":"Hemaspaandra","year":"2001","journal-title":"J. of Logic and Computation"},{"key":"10.1016\/S1570-2464(07)80016-4_bib85","series-title":"36th Annual Symposium on Foundations of Computer Science","first-page":"453","article-title":"Computing simulations on finite and infinite graphs","author":"R. Henzinger","year":"1995"},{"key":"10.1016\/S1570-2464(07)80016-4_bib86","series-title":"Proc. of the German Workshop on Artificial Intelligence","first-page":"38","article-title":"Hybrid inferences in KL-ONE-based knowledge representation systems","author":"Hollunder","year":"1990"},{"issue":"2\u20134","key":"10.1016\/S1570-2464(07)80016-4_bib87","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1007\/BF02127745","article-title":"Consistency checking reduced to satisfiability of concepts in terminological systems","volume":"18","author":"Hollunder","year":"1996","journal-title":"Ann. of Mathematics and Artificial Intelligence"},{"key":"10.1016\/S1570-2464(07)80016-4_bib88","series-title":"Proc. of the 2nd Int. Conf. on the Principles of Knowledge Representation and Reasoning (KR'91)","first-page":"335","article-title":"Qualifying number restrictions in concept languages","author":"Hollunder","year":"1991"},{"article-title":"Subsumption algorithms for concept languages","year":"1990","author":"Hollunder","key":"10.1016\/S1570-2464(07)80016-4_bib89"},{"article-title":"Optimising Tableaux Decision Procedures for Description Logics","year":"1997","author":"Horrocks","key":"10.1016\/S1570-2464(07)80016-4_bib90"},{"key":"10.1016\/S1570-2464(07)80016-4_bib91","series-title":"Proc. of the 6th Int. Conf. on Principles of Knowledge Representation and Reasoning (KR'98)","first-page":"636","article-title":"Using an expressive description logic: FaCT or fiction?","author":"Horrocks","year":"1998"},{"year":"2003","series-title":"Implementation and optimization techniques","author":"Horrocks","key":"10.1016\/S1570-2464(07)80016-4_bib92"},{"issue":"1","key":"10.1016\/S1570-2464(07)80016-4_bib93","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1016\/j.websem.2003.07.001","article-title":"From SHIQ and RDF to OWL: The making of a web ontology language","volume":"1","author":"Horrocks","year":"2003","journal-title":"J. of Web Semantics"},{"issue":"3","key":"10.1016\/S1570-2464(07)80016-4_bib94","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1093\/logcom\/9.3.385","article-title":"A description logic with transitive and inverse roles and role hierar- chies","volume":"9","author":"Horrocks","year":"1999","journal-title":"J. of Logic and Computation"},{"key":"10.1016\/S1570-2464(07)80016-4_bib95","series-title":"Proc. of the 17th Int. Joint Conf. on Artificial Intelligence (IJCAI 2001)","article-title":"Ontology reasoning in the SHOQ(D) description logic","author":"Horrocks","year":"2001"},{"key":"10.1016\/S1570-2464(07)80016-4_bib96","series-title":"Proc. of the 17th Int. Joint Conf. on Artificial Intelligence (IJCAI 2001)","article-title":"Decidability of SHIQ with complex role inclusion axioms","author":"Horrocks","year":"2003"},{"key":"10.1016\/S1570-2464(07)80016-4_bib97","unstructured":"Ian Horrocks and Ulrike Sattler. A tableaux decision procedure for SHOIQ. In Proc. of the 19th Int. Joint Conf. on Artificial Intelligence (IJCAI 2003), page Ian Horrocks and Ulrike Sattler. A tableaux decision procedure for SHOIQ. In Proc. of the 19th Int. Joint Conf. on Artificial Intelligence (IJCAI 2003), page Ian Horrocks and Ulrike Sattler. A tableaux decision procedure for SHOIQ. In Proc. of the 19th Int. Joint Conf. on Artificial Intelligence (IJCAI 2003), page s343- 348. Morgan Kaufmann, Los Altos.43- 348. Morgan Kaufmann, Los Altos.43- 348. Morgan Kaufmann, Los Altos."},{"key":"10.1016\/S1570-2464(07)80016-4_bib98","series-title":"Proc. of the 6th Int. Conf. on Logic for Programming and Automated Reasoning (LPAR'99)","first-page":"161","article-title":"Practical reasoning for expressive description logics","volume":"volume 1705","author":"Horrocks","year":"1999"},{"key":"10.1016\/S1570-2464(07)80016-4_bib99","series-title":"Proc. of the 7th Int. Conf. on Principles of Knowledge Representation and Reasoning (KR 2000)","article-title":"Reasoning with axioms: Theory and practice","author":"Horrocks","year":"2000"},{"key":"10.1016\/S1570-2464(07)80016-4_bib100","series-title":"Proc. of the 9th Int. Conf. on Principles of Knowledge Representation and Reasoning (KR 2000)","article-title":"Reducing SHIQ-description logic to disjunctive datalog programs","author":"Hustadt","year":"2000"},{"key":"10.1016\/S1570-2464(07)80016-4_bib101","series-title":"Automated Deduction in Classical and Non-Classical Logic, volume 1761 of Lecture Notes in Artificial Intelligence","first-page":"191","article-title":"Issues of decidability for description logics in the framework of resolution","author":"Hustadt","year":"2000"},{"key":"10.1016\/S1570-2464(07)80016-4_bib102","series-title":"Proc. of the 2003 Description Logic Workshop (DL 2003).CEUR Electronic Workshop Proceedings","article-title":"Subsumption of concepts in TCo for (cyclic) terminolo- gies with respect to descriptive semantics is PSPACE-complete","author":"Kazakov","year":"2003"},{"key":"10.1016\/S1570-2464(07)80016-4_bib103","series-title":"Proc. of the 8th Int. Conf. on Database Theory (ICDT 2001)","article-title":"On decidability and complexity of de- scription logics with uniqueness constraints","author":"L. Khizder","year":"2001"},{"key":"10.1016\/S1570-2464(07)80016-4_bib104","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1016\/0304-3975(82)90125-6","article-title":"Results on the propositional \u03bc-calculus","volume":"27","author":"Kozen","year":"1983","journal-title":"Theoretical Computer Science"},{"issue":"2","key":"10.1016\/S1570-2464(07)80016-4_bib105","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1016\/S0004-3702(98)00109-X","article-title":"Expressiveness of concept expressions in first-order de- scription logics","volume":"107","author":"Kurtonina","year":"1999","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S1570-2464(07)80016-4_bib106","series-title":"Proc. of the 6th Int. Conf. on Principles of Knowledge Representation and Reasoning (KR'98)","first-page":"499","article-title":"Characterizing the semantics of terminological cycles in ACN using finite automata","author":"K\u00fcsters","year":"1998"},{"key":"10.1016\/S1570-2464(07)80016-4_bib107","series-title":"Proceedings of the Joint German\/Austrian Conference on Artificial Intelligence (KI 2001)","first-page":"33","article-title":"Approximating most specific concepts in description logics with existential restrictions","volume":"volume 2174","author":"K\u00fcsters","year":"2001"},{"key":"10.1016\/S1570-2464(07)80016-4_bib108","series-title":"Proc. of the 17th Int. Joint Conf. on Artificial Intelligence (IJCAI 2001)","first-page":"219","article-title":"Computing least common subsumers in ACEN","author":"K\u00fcsters","year":"2001"},{"key":"10.1016\/S1570-2464(07)80016-4_bib109","doi-asserted-by":"crossref","first-page":"78","DOI":"10.1111\/j.1467-8640.1987.tb00176.x","article-title":"Expressiveness and tractability in knowledge representation and reasoning","volume":"3","author":"J. Levesque","year":"1987","journal-title":"Computational Intelligence"},{"key":"10.1016\/S1570-2464(07)80016-4_bib110","series-title":"Proc. of the 6th Int. Conf. on Logic for Programming and Automated Reasoning (LPAR'99)","first-page":"181","article-title":"Complexity of terminological reasoning revisited","volume":"volume 1705","author":"Lutz","year":"1999"},{"key":"10.1016\/S1570-2464(07)80016-4_bib111","series-title":"Proc. of the 8th Int. Conf. on Principles of Knowledge Representation and Reasoning (KR 2002)","first-page":"191","article-title":"Adding numbers to the SHTQ description logic\u2014First results","author":"Lutz","year":"2002"},{"article-title":"The Complexity of Reasoning with Concrete Domains","year":"2002","author":"Lutz","key":"10.1016\/S1570-2464(07)80016-4_bib112"},{"issue":"5","key":"10.1016\/S1570-2464(07)80016-4_bib113","doi-asserted-by":"crossref","first-page":"535","DOI":"10.1093\/jigpal\/10.5.535","article-title":"PSpace reasoning with the description logic ALCF(D)","volume":"10","author":"Lutz","year":"2002","journal-title":"Logic Journal of the IGPL"},{"key":"10.1016\/S1570-2464(07)80016-4_bib114","series-title":"Proc. of the 2002 Description Logic Workshop (DL 2002)","article-title":"Reasoning about entity relationship diagrams with complex attribute dependencies","author":"Lutz","year":"2002"},{"key":"10.1016\/S1570-2464(07)80016-4_bib115","first-page":"265","article-title":"Description logics with concrete domains\u2014a survey","volume":"Volume 4","author":"Lutz","year":"2003"},{"issue":"2","key":"10.1016\/S1570-2464(07)80016-4_bib116","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1016\/j.artint.2003.08.001","article-title":"Combining interval-based temporal reasoning with general TBoxes","volume":"152","author":"Lutz","year":"2004","journal-title":"Artificial Intelli- gence"},{"issue":"4","key":"10.1016\/S1570-2464(07)80016-4_bib117","doi-asserted-by":"crossref","first-page":"669","DOI":"10.1145\/1024922.1024925","article-title":"NExpTime-complete description logics with concrete domains","volume":"5","author":"Lutz","year":"2004","journal-title":"ACM Transactions on Computational Logic"},{"key":"10.1016\/S1570-2464(07)80016-4_bib118","series-title":"Proc. of the 18th Int. Joint Conf. on Artificial Intelligence (IJCAI 2003)","first-page":"349","article-title":"Keys, nommais, and concrete domains","author":"Lutz","year":"2003"},{"key":"10.1016\/S1570-2464(07)80016-4_bib119","doi-asserted-by":"crossref","unstructured":"Carsten Lutz, Maja Milicic, Description logics with concrete domains and functional dependencies Proc. of the 18th Eur. Conf. on Artificial Intelligence (IJCAI 2003), 349-354","DOI":"10.25368\/2022.143"},{"key":"10.1016\/S1570-2464(07)80016-4_bib120","series-title":"Proc. of the Int. Conf. on Analytic Tableaux and Related Methods (TABLEA UX 2005)","article-title":"A tableau algorithm for description logics with concrete domains and GCIs","author":"Lutz","year":"2005"},{"key":"10.1016\/S1570-2464(07)80016-4_bib121","series-title":"Proc. of Advances in Modal Logic 2000 (AiML 2000)","article-title":"The complexity of reasoning with Boolean modal logic","author":"Lutz","year":"2000"},{"key":"10.1016\/S1570-2464(07)80016-4_bib122","series-title":"Proc. of the 2000 Description Logic Workshop (DL 2000)","first-page":"213","article-title":"Mary likes all cats","volume":"Vol-33","author":"Lutz","year":"2000"},{"key":"10.1016\/S1570-2464(07)80016-4_bib123","series-title":"Principles of Semantic Networks","first-page":"385","article-title":"The evolving technology of classification-based knowledge representation systems","author":"MacGregor","year":"1991"},{"issue":"3","key":"10.1016\/S1570-2464(07)80016-4_bib124","doi-asserted-by":"crossref","DOI":"10.1145\/122296.122310","article-title":"K-REP system overview","volume":"2","author":"Mays","year":"1991","journal-title":"SIGART Bull"},{"key":"10.1016\/S1570-2464(07)80016-4_bib125_1","series-title":"Mind Design","article-title":"A framework for representing knowledge","author":"Minsky","year":"1981"},{"year":"1975","series-title":"The Psychology of Computer Vision","key":"10.1016\/S1570-2464(07)80016-4_bib125_2"},{"article-title":"Konsistenz von Wissensbasen in Beschreibungslogiken mit Rollenoperatoren","year":"1997","author":"Molitor","key":"10.1016\/S1570-2464(07)80016-4_bib126"},{"issue":"3","key":"10.1016\/S1570-2464(07)80016-4_bib127","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1016\/0004-3702(88)90066-5","article-title":"Computational complexity of terminological reasoning in BACK","volume":"34","author":"Nebel","year":"1988","journal-title":"Artificial Intelli- gence"},{"key":"10.1016\/S1570-2464(07)80016-4_bib128","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1016\/0004-3702(90)90087-G","article-title":"Terminological reasoning is inherently intractable","volume":"43","author":"Nebel","year":"1990","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S1570-2464(07)80016-4_bib129","series-title":"Principles of Semantic Networks","first-page":"331","article-title":"Terminological cycles: Semantics and computational properties","author":"Nebel","year":"1991"},{"key":"10.1016\/S1570-2464(07)80016-4_bib130","series-title":"Proceedings of the International Workshop in Description Logics 2002 (DL2002)","first-page":"53","article-title":"Reasoning in the SHOQ,(Dn) description logic","volume":"volume 53","author":"Z. Pan","year":"2002"},{"key":"10.1016\/S1570-2464(07)80016-4_bib131","series-title":"Proc. of the Int. Conf. on Analytic Tableaux and Related Methods (TABLEAUX'99)","first-page":"19","article-title":"DLP and FaCT","volume":"volume 1617","author":"F. Patel-Schneider","year":"1999"},{"issue":"3","key":"10.1016\/S1570-2464(07)80016-4_bib132","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1145\/122296.122314","article-title":"The BACK system \u2014 an overview","volume":"2","author":"Peltason","year":"1991","journal-title":"SIGART Bull"},{"key":"10.1016\/S1570-2464(07)80016-4_bib133","doi-asserted-by":"crossref","first-page":"410","DOI":"10.1002\/bs.3830120511","article-title":"Word concepts: A theory and simulation of some basic capabilities","volume":"12","author":"Ross Quillian","year":"1967","journal-title":"Behavioral Science"},{"key":"10.1016\/S1570-2464(07)80016-4_bib134","series-title":"Proceedings of the Workshop on Ontological Engineering, AAAI Spring Symposium (AAAI'97)","article-title":"Experience building a large, re-usable medical ontology using a de- scription logic with transitivity and concept inclusions","author":"Rector","year":"1997"},{"key":"10.1016\/S1570-2464(07)80016-4_bib135","series-title":"Proc. of the 20th German Annual Conf. on Artificial Intelligence (KI'96)","first-page":"333","article-title":"A concept language extended with different kinds of transitive roles","volume":"volume 1137","author":"Sattler","year":"1996"},{"key":"10.1016\/S1570-2464(07)80016-4_bib136","series-title":"Proc. of the 14th Eur. Conf. on Artificial Intelligence (ECAI 2000)","article-title":"Description logics for the representation of aggregated objects","author":"Sattler","year":"2000"},{"key":"10.1016\/S1570-2464(07)80016-4_bib137","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1007\/BF00962071","article-title":"On the complexity of the instance checking problem in concept languages with existential quantification","volume":"2","author":"Schaerf","year":"1993","journal-title":"J. of Intelligent Information Systems"},{"key":"10.1016\/S1570-2464(07)80016-4_bib138","series-title":"Proc. of the 12th Int. Joint Conf. on Artificial Intelligence (IJCAV91)","first-page":"466","article-title":"A correspondence theory for terminological logics: Preliminary report","author":"Schild","year":"1991"},{"key":"10.1016\/S1570-2464(07)80016-4_bib139","series-title":"Proc. of the 6th Portuguese Conf. on Artificial Intelligence (EPIA '93)","first-page":"105","article-title":"Combining terminological logics with tense logic","volume":"volume 727","author":"Schild","year":"1993"},{"key":"10.1016\/S1570-2464(07)80016-4_bib140","series-title":"Proc. of the 4th Int. Conf. on the Principles of Knowledge Representation and Reasoning (KR'94), pages 509-520","article-title":"Terminological cycles and the propositional \u03bc-calculus","author":"Schild","year":"1994"},{"key":"10.1016\/S1570-2464(07)80016-4_bib141","series-title":"Proc. of the 1st Int. Conf. on the Principles of Knowledge Rep- resentation and Reasoning (KR'89)","first-page":"421","article-title":"Subsumption in KL-ONE is undecidable","author":"Schmidt-Schau\u00df","year":"1989"},{"article-title":"Attributive concept descriptions with unions and com- plements","year":"1988","author":"Schmidt-Schau\u00df","key":"10.1016\/S1570-2464(07)80016-4_bib142"},{"issue":"1","key":"10.1016\/S1570-2464(07)80016-4_bib143","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0004-3702(91)90078-X","article-title":"Attributive concept descriptions with complements","volume":"48","author":"Schmidt-Schau\u00df","year":"1991","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S1570-2464(07)80016-4_bib144","series-title":"Associative Networks: Representation and Use of Knowledge by Computers","first-page":"121","article-title":"The structure and organization of a semantic net for comprehension and inference","author":"K. Schubert","year":"1979"},{"key":"10.1016\/S1570-2464(07)80016-4_bib145","series-title":"Proc. of the 3rd Scandinavian Conf. on Artificial Intelligence SCAI-91","first-page":"307","article-title":"A computationally tractable terminological logic","author":"Sebastiani","year":"1991"},{"key":"10.1016\/S1570-2464(07)80016-4_bib146","first-page":"74","article-title":"Undecidable propositional calculi","volume":"75","author":"Shehtman","year":"1982","journal-title":"USSR Academy of Sciences"},{"year":"1984","series-title":"Conceptuals Structures: Information Processing in Mind and Machine","author":"F. Sowa","key":"10.1016\/S1570-2464(07)80016-4_bib147"},{"key":"10.1016\/S1570-2464(07)80016-4_bib148","series-title":"J. of the American Medical Informatics Association","first-page":"640","article-title":"SNOMED RT: A reference terminology for health care","author":"A. Spackman","year":"1997"},{"year":"1951","series-title":"A Decision Method for Elementary Algebra and Geometry","author":"Tarski","key":"10.1016\/S1570-2464(07)80016-4_bib149"},{"article-title":"Complexity Results and Practical Algorithms for Logics in Knowledge Representa- tion","year":"2001","author":"Tobies","key":"10.1016\/S1570-2464(07)80016-4_bib150"},{"key":"10.1016\/S1570-2464(07)80016-4_bib151","series-title":"Proceedings of the 9th International Conference on Database Theory","first-page":"96","article-title":"On reasoning about structural equality in XML: A description logic approach","author":"Toman","year":"2002"},{"key":"10.1016\/S1570-2464(07)80016-4_bib152","doi-asserted-by":"crossref","first-page":"301","DOI":"10.2307\/2272228","article-title":"Modal reduction principles","volume":"41","author":"van Benthem","year":"1976","journal-title":"J. of Symbolic Logic"},{"issue":"3","key":"10.1016\/S1570-2464(07)80016-4_bib153","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1093\/logcom\/5.3.325","article-title":"Counting objects","volume":"5","author":"Van der Hoek","year":"1995","journal-title":"J. of Logic and Computation"},{"key":"10.1016\/S1570-2464(07)80016-4_bib154","series-title":"Proc. of the 4th Workshop on Logics of Programs","first-page":"413","article-title":"The taming of converse: Reasoning about two-way computations","volume":"volume 193","author":"Y. Vardi","year":"1985"},{"key":"10.1016\/S1570-2464(07)80016-4_bib155","series-title":"Proc. of the 16th ACM SIGACT Symp. on Theory of Computing (STOC'84)","first-page":"446","article-title":"Automata-theoretic techniques for modal logics of programs","author":"Y. Vardi","year":"1984"}],"container-title":["Studies in Logic and Practical Reasoning","Handbook of Modal Logic"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1570246407800164?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1570246407800164?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T23:16:04Z","timestamp":1761606964000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1570246407800164"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9780444516909"],"references-count":156,"URL":"https:\/\/doi.org\/10.1016\/s1570-2464(07)80016-4","relation":{},"ISSN":["1570-2464"],"issn-type":[{"type":"print","value":"1570-2464"}],"subject":[],"published":{"date-parts":[[2007]]}}}