{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,30]],"date-time":"2023-10-30T23:12:46Z","timestamp":1698707566757},"reference-count":53,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2010,2,9]],"date-time":"2010-02-09T00:00:00Z","timestamp":1265673600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["K\u00fcnstl Intell"],"published-print":{"date-parts":[[2010,4]]},"DOI":"10.1007\/s13218-010-0004-8","type":"journal-article","created":{"date-parts":[[2010,2,8]],"date-time":"2010-02-08T06:31:28Z","timestamp":1265610688000},"page":"25-33","source":"Crossref","is-referenced-by-count":9,"title":["Small is Again Beautiful in Description Logics"],"prefix":"10.1007","volume":"24","author":[{"given":"Franz","family":"Baader","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Carsten","family":"Lutz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anni-Yasmin","family":"Turhan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2010,2,9]]},"reference":[{"key":"4_CR1","unstructured":"Acciarri A, Calvanese D, De Giacomo G, Lembo D, Lenzerini M, Palmieri M, Rosati R (2005) QUONTO QUerying ONTOlogies. In: Proc of the nat conf on AI (AAAI\u201905)"},{"key":"4_CR2","unstructured":"Artale A, Calvanese D, Kontchakov R, Zakharyaschev M (2007) DL-Lite in the light of first-order logic. In: Proc of the nat conf on AI (AAAI\u201907)"},{"key":"4_CR3","unstructured":"Artale A, Calvanese D, Kontchakov R, Zakharyaschev M (2009) DL-Lite without the unique name assumption. In: Proc of the description logic WS (DL\u201909), CEUR"},{"key":"4_CR4","unstructured":"Baader F (1990) Terminological cycles in KL-ONE-based knowledge representation languages. In: Proc of the nat conf on AI (AAAI\u201990)"},{"key":"4_CR5","unstructured":"Baader F, Brandt S, Lutz C (2005) Pushing the $\\mathcal{EL}$ envelope. In: Proc of the int joint conf on AI (IJCAI\u201905)"},{"key":"4_CR6","unstructured":"Baader F, Brandt S, Lutz C (2008) Pushing the $\\mathcal{EL}$ envelope further. In: Proc of the Int WS on OWL: experiences and directions (OWLED\u201908)"},{"issue":"1\u20132","key":"4_CR7","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1016\/S0004-3702(96)00010-0","volume":"88","author":"F Baader","year":"1996","unstructured":"Baader F, Buchheit M, Hollunder B (1996) Cardinality restrictions on concepts. Artif Intell 88(1\u20132):195\u2013213","journal-title":"Artif Intell"},{"key":"4_CR8","volume-title":"The description logic handbook: theory, implementation, and applications","year":"2003","unstructured":"Baader F, Calvanese D, McGuinness D, Nardi D, Patel-Schneider PF (eds) (2003) The description logic handbook: theory, implementation, and applications. Cambridge University Press, Cambridge"},{"key":"4_CR9","doi-asserted-by":"crossref","unstructured":"Baader F, Franconi E, Hollunder B, Nebel B, Profitlich H-J (1994) An empirical analysis of optimization techniques for terminological representation systems or: making KRIS get a move on. Appl AI Spec Iss on KB Management","DOI":"10.1007\/BF00872105"},{"key":"4_CR10","unstructured":"Baader F, Hanschke P (1991) A schema for integrating concrete domains into concept languages. In: Proc of the int joint conf on AI (IJCAI\u201991)"},{"key":"4_CR11","series-title":"Int handbooks in information systems","volume-title":"Handbook on ontologies","author":"F Baader","year":"2003","unstructured":"Baader F, Horrocks I, Sattler U (2003) Description logics. In: Handbook on ontologies. Int handbooks in information systems. Springer, Berlin"},{"key":"4_CR12","doi-asserted-by":"crossref","unstructured":"Baader F, K\u00fcsters R, Molitor R (1999) Computing least common subsumers in description logics with existential restrictions. In: Proc of the int joint conf on AI (IJCAI\u201999)","DOI":"10.25368\/2022.85"},{"key":"4_CR13","unstructured":"Baader F, Lutz C, Suntisrivaraporn B (2005) Is tractable reasoning in extensions of the description logic $\\mathcal{EL}$ useful in practice? In: Proc of the int WS on methods for modalities (M4M-05)"},{"key":"4_CR14","doi-asserted-by":"crossref","unstructured":"Baader F, Lutz C, Suntisrivaraporn B (2006) CEL\u2014a polynomial-time reasoner for life science ontologies. In: Proc of the int joint conf on autom reasoning (IJCAR\u201906). LNAI, vol\u00a04130","DOI":"10.1007\/11814771_25"},{"key":"4_CR15","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1023\/A:1013882326814","volume":"69","author":"F Baader","year":"2001","unstructured":"Baader F, Sattler U (2001) An overview of tableau algorithms for description logics. Stud Log 69:5\u201340","journal-title":"Stud Log"},{"key":"4_CR16","doi-asserted-by":"crossref","unstructured":"Brachman RJ, Schmolze JG (1985) An overview of the KL-ONE knowledge representation system. Cogn Sci 9(2)","DOI":"10.1207\/s15516709cog0902_1"},{"key":"4_CR17","unstructured":"Brandt S (2004) Polynomial time reasoning in a description logic with existential restrictions, GCI axioms, and\u2014what else? In: Proc of the Eur conf on AI (ECAI\u201904)"},{"key":"4_CR18","unstructured":"Calvanese D, De Giacomo G, Lembo D, Lenzerini M, Rosati R (2005) DL-Lite: tractable description logics for ontologies. In:\u00a0Proc of the nat conf on AI (AAAI\u201905)"},{"key":"4_CR19","unstructured":"Calvanese D, de Giacomo G, Lembo D, Lenzerini M, Rosati R (2006) Data complexity of query answering in description logics. In: Proc of the int conf on principles of knowledge representation and reasoning (KR\u201906)"},{"issue":"3","key":"4_CR20","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1007\/s10817-007-9078-x","volume":"39","author":"D Calvanese","year":"2007","unstructured":"Calvanese D, De Giacomo G, Lembo D, Lenzerini M, Rosati R (2007) Tractable reasoning and efficient query answering in description logics: the DL-Lite family. J Autom Reason 39(3):385\u2013429","journal-title":"J Autom Reason"},{"key":"4_CR21","unstructured":"Calvanese D, De Giacomo G, Lembo D, Lenzerini M, Poggi A, Rosati R (2006) Linking data to ontologies: the description logic DL-Lite A . In: Proc of the int WS on OWL: experiences and directions (OWLED\u201906). CEUR"},{"issue":"2","key":"4_CR22","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1305\/ndjfl\/1093894722","volume":"13","author":"M Fitting","year":"1972","unstructured":"Fitting M (1972) Tableau methods of proof for modal logics. Notre Dame J Form Log 13(2):237\u2013247","journal-title":"Notre Dame J Form Log"},{"key":"4_CR23","unstructured":"Haarslev V, M\u00f6ller R (2001) High performance reasoning with very large knowledge bases: a practical case study. In: Proc of the int joint conf on AI (IJCAI\u201901)"},{"key":"4_CR24","doi-asserted-by":"crossref","unstructured":"Haarslev V, M\u00f6ller R (2001) RACER system description. In: Proc of the int joint conf on autom reasoning (IJCAR\u201901). LNAI, vol\u00a02083","DOI":"10.1007\/3-540-45744-5_59"},{"issue":"2","key":"4_CR25","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1007\/s10817-008-9104-7","volume":"41","author":"V Haarslev","year":"2008","unstructured":"Haarslev V, M\u00f6ller R (2008) On the scalability of description logic instance retrieval. J Autom Reason 41(2):99\u2013142","journal-title":"J Autom Reason"},{"key":"4_CR26","unstructured":"Hollunder B, Baader F (1991) Qualifying number restrictions in concept languages. In: Proc of the int conf on the principles of knowledge representation and reasoning (KR\u201991)"},{"key":"4_CR27","unstructured":"Hollunder B, Nutt W, Schmidt-Schau\u00dfM (1990) Subsumption algorithms for concept description languages. In: Proc of the Eur conf on AI (ECAI\u201990)"},{"key":"4_CR28","unstructured":"Horrocks I (1998) Using an expressive description logic: FaCT or fiction? In: Proc of the int conf on principles of knowledge representation and reasoning (KR\u201998)"},{"key":"4_CR29","volume-title":"The description logic handbook: theory, implementation, and applications","author":"I Horrocks","year":"2003","unstructured":"Horrocks I (2003) Implementation and optimization techniques. In: Baader F, Calvanese D, McGuinness D, Nardi D, Patel-Schneider PF (eds) The description logic handbook: theory, implementation, and applications. Cambridge Univ. Press, Cambridge"},{"key":"4_CR30","unstructured":"Horrocks I, Kutz O, Sattler U (2006) The even more irresistible $\\mathcal{SROIQ}$ . In: Proc of the int conf on principles of knowledge representation and reasoning (KR\u201906)"},{"issue":"3","key":"4_CR31","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1093\/logcom\/9.3.267","volume":"9","author":"I Horrocks","year":"1999","unstructured":"Horrocks I, Patel-Schneider PF (1999) Optimizing description logic subsumption. J Logic Comput 9(3):267\u2013293","journal-title":"J Logic Comput"},{"issue":"4","key":"4_CR32","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1016\/j.websem.2004.06.003","volume":"1","author":"I Horrocks","year":"2004","unstructured":"Horrocks I, Patel-Schneider PF (2004) Reducing OWL entailment to description logic satisfiability. J Web Sem 1(4):345\u2013357","journal-title":"J Web Sem"},{"issue":"1","key":"4_CR33","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1016\/j.websem.2003.07.001","volume":"1","author":"I Horrocks","year":"2003","unstructured":"Horrocks I, Patel-Schneider PF, van Harmelen F (2003) From SHIQ and RDF to OWL: the making of a web ontology language. J Web Sem 1(1):7\u201326","journal-title":"J Web Sem"},{"key":"4_CR34","unstructured":"Horrocks I, Sattler U (2005) A tableaux decision procedure for $\\mathcal{SHOIQ}$ . In: Proc of the int joint conf on AI (IJCAI\u201905)"},{"issue":"3","key":"4_CR35","first-page":"239","volume":"8","author":"I Horrocks","year":"2000","unstructured":"Horrocks I, Sattler U, Tobies S (2000) Practical reasoning for very expressive description logics. J Interest Group Pure Appl Logic 8(3):239\u2013264","journal-title":"J Interest Group Pure Appl Logic"},{"key":"4_CR36","unstructured":"Kazakov Y (2008) $\\mathcal{RIQ}$ and $\\mathcal{SROIQ}$ are harder than $\\mathcal{SHOIQ}$ . In: Proc of the int conf on principles of knowledge representation and reasoning (KR\u201908)"},{"key":"4_CR37","unstructured":"Kontchakov R, Lutz C, Toman D, Wolter F, Zakharyaschev M (2009) Combined FO rewritability for conjunctive query answering in DL-Lite. In: Proc of the description logic WS (DL\u201909)"},{"key":"4_CR38","doi-asserted-by":"crossref","first-page":"78","DOI":"10.1111\/j.1467-8640.1987.tb00176.x","volume":"3","author":"HJ Levesque","year":"1987","unstructured":"Levesque HJ, Brachman RJ (1987) Expressiveness and tractability in knowledge representation and reasoning. Comput Intell 3:78\u201393","journal-title":"Comput Intell"},{"key":"4_CR39","doi-asserted-by":"crossref","unstructured":"Lutz C (2008) The complexity of conjunctive query answering in expressive description logics. In: Proc of the int joint conf on autom reasoning (IJCAR\u201908). LNAI, vol\u00a05195","DOI":"10.1007\/978-3-540-71070-7_16"},{"key":"4_CR40","unstructured":"Lutz C, Toman D, Wolter F (2008) Conjunctive query answering in $\\mathcal{EL}$ using a database system. In: In Proc of the int WS on OWL: experiences and directions (OWLED\u201908)"},{"key":"4_CR41","unstructured":"Lutz C, Toman D, Wolter F (2009) Conjunctive query answering in the description logic $\\mathcal{EL}$ using a relational database system. In: Proc of the int joint conf on AI (IJCAI\u201909)"},{"key":"4_CR42","volume-title":"Principles of semantic networks","author":"R MacGregor","year":"1991","unstructured":"MacGregor R (1991) The evolving technology of classification-based knowledge representation systems. In: Principles of semantic networks. Kaufmann, Los Altos"},{"issue":"3","key":"4_CR43","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1145\/122296.122310","volume":"2","author":"E Mays","year":"1991","unstructured":"Mays E, Dionne R, Weida R (1991) K-REP system overview. SIGART Bull 2(3):93\u201397","journal-title":"SIGART Bull"},{"issue":"3","key":"4_CR44","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1016\/0004-3702(88)90066-5","volume":"34","author":"B Nebel","year":"1988","unstructured":"Nebel B (1988) Computational complexity of terminological reasoning in BACK. Artif Intell 34(3):371\u2013383","journal-title":"Artif Intell"},{"issue":"2","key":"4_CR45","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1016\/0004-3702(90)90087-G","volume":"43","author":"B Nebel","year":"1990","unstructured":"Nebel B (1990) Terminological reasoning is inherently intractable. Artif Intell 43(2):235\u2013249","journal-title":"Artif Intell"},{"issue":"1","key":"4_CR46","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1007\/s10817-008-9102-9","volume":"41","author":"M Ortiz","year":"2008","unstructured":"Ortiz M, Calvanese D, Eiter T (2008) Data complexity of query answering in expressive description logics via tableaux. J Autom Reason 41(1):61\u201398","journal-title":"J Autom Reason"},{"key":"4_CR47","unstructured":"Patel-Schneider PF (1984) Small can be beautiful in knowledge representation. In: Proc of the IEEE WS on knowledge-based systems"},{"issue":"3","key":"4_CR48","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1145\/122296.122314","volume":"2","author":"Ch Peltason","year":"1991","unstructured":"Peltason Ch (1991) The BACK system\u2014an overview. SIGART Bull 2(3):114\u2013119","journal-title":"SIGART Bull"},{"key":"4_CR49","unstructured":"Schmidt-Schau\u00dfM (1989) Subsumption in KL-ONE is undecidable. In: Proc of the int conf on the principles of knowledge representation and reasoning (KR\u201989)"},{"issue":"1","key":"4_CR50","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0004-3702(91)90078-X","volume":"48","author":"M Schmidt-Schau\u00df","year":"1991","unstructured":"Schmidt-Schau\u00dfM, Smolka G (1991) Attributive concept descriptions with complements. Artif Intell 48(1):1\u201326","journal-title":"Artif Intell"},{"key":"4_CR51","unstructured":"Sirin E, Parsia B (2004) Pellet: an OWL DL reasoner. In: Proc of the description logic WS (DL\u201904)"},{"key":"4_CR52","unstructured":"Suntisrivaraporn B (2009) Polynomial-time reasoning support for design and maintenance of large-scale biomedical ontologies. PhD thesis, Fakult\u00e4t Informatik, TU Dresden"},{"key":"4_CR53","doi-asserted-by":"crossref","unstructured":"Tsarkov D, Horrocks I (2006) FaCT++ description logic reasoner: system description. In: Proc of the int joint conf on autom reasoning (IJCAR\u201906). LNAI, vol\u00a04130","DOI":"10.1007\/11814771_26"}],"container-title":["KI - K\u00fcnstliche Intelligenz"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13218-010-0004-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s13218-010-0004-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13218-010-0004-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,30]],"date-time":"2023-05-30T04:13:42Z","timestamp":1685420022000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s13218-010-0004-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,2,9]]},"references-count":53,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2010,4]]}},"alternative-id":["4"],"URL":"https:\/\/doi.org\/10.1007\/s13218-010-0004-8","relation":{},"ISSN":["0933-1875","1610-1987"],"issn-type":[{"value":"0933-1875","type":"print"},{"value":"1610-1987","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,2,9]]}}}