Small is Again Beautiful in Description Logics

KI - Kunstliche Intelligenz

Volumn 24, Issue 1, 2010, Pages 25-33

  Baader, Franz ^a   Lutz, Carsten ^b   Turhan, Anni Yasmin ^a  

^a DRESDEN UNIVERSITY OF TECHNOLOGY   (Germany)

^b UNIVERSITY OF BREMEN   (Germany)

Author keywords

Automated reasoning; Description logics; Knowledge representation

Indexed keywords

BIRDS; FORMAL LANGUAGES; KNOWLEDGE REPRESENTATION; ONTOLOGY;

AUTOMATED REASONING; DESCRIPTION LANGUAGES; DESCRIPTION LOGIC; EXPRESSIVE POWER; INFERENCE PROBLEM; KNOWLEDGE-REPRESENTATION; REASONING SYSTEM; SEMANTIC-WEB; STANDARD ONTOLOGY LANGUAGE; WORST-CASE COMPLEXITY;

DATA DESCRIPTION;

EID: 83455219032     PISSN: 09331875     EISSN: 16101987     Source Type: Journal    
DOI: 10.1007/s13218-010-0004-8     Document Type: Article

References (53)

1. 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’05)
2. 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’07)
3. Artale A, Calvanese D, Kontchakov R, Zakharyaschev M (2009) DL-Lite without the unique name assumption. In: Proc of the description logic WS (DL’09), CEUR
4. Baader F (1990) Terminological cycles in KL-ONE-based knowledge representation languages. In: Proc of the nat conf on AI (AAAI’90)
5. Baader F, Brandt S, Lutz C (2005) Pushing the $\mathcal{EL}$ envelope. In: Proc of the int joint conf on AI (IJCAI’05)
6. 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’08)
7. Baader F, Buchheit M, Hollunder B (1996) Cardinality restrictions on concepts. Artif Intell 88(1–2):195–213 DOI: 10.1016/S0004-3702(96)00010-0
8. 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
9. 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
10. Baader F, Hanschke P (1991) A schema for integrating concrete domains into concept languages. In: Proc of the int joint conf on AI (IJCAI’91)
11. Baader F, Horrocks I, Sattler U (2003) Description logics. In: Handbook on ontologies. Int handbooks in information systems. Springer, Berlin
12. Baader F, Küsters R, Molitor R (1999) Computing least common subsumers in description logics with existential restrictions. In: Proc of the int joint conf on AI (IJCAI’99)
13. 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)
14. Baader F, Lutz C, Suntisrivaraporn B (2006) CEL—a polynomial-time reasoner for life science ontologies. In: Proc of the int joint conf on autom reasoning (IJCAR’06). LNAI, vol 4130
15. Baader F, Sattler U (2001) An overview of tableau algorithms for description logics. Stud Log 69:5–40 DOI: 10.1023/A:1013882326814
16. Brachman RJ, Schmolze JG (1985) An overview of the KL-ONE knowledge representation system. Cogn Sci 9(2)
17. Brandt S (2004) Polynomial time reasoning in a description logic with existential restrictions, GCI axioms, and—what else? In: Proc of the Eur conf on AI (ECAI’04)
18. Calvanese D, De Giacomo G, Lembo D, Lenzerini M, Rosati R (2005) DL-Lite: tractable description logics for ontologies. In: Proc of the nat conf on AI (AAAI’05)
19. 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’06)
20. 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–429 DOI: 10.1007/s10817-007-9078-x
21. A. In: Proc of the int WS on OWL: experiences and directions (OWLED’06). CEUR
22. Fitting M (1972) Tableau methods of proof for modal logics. Notre Dame J Form Log 13(2):237–247 DOI: 10.1305/ndjfl/1093894722
23. Haarslev V, Möller R (2001) High performance reasoning with very large knowledge bases: a practical case study. In: Proc of the int joint conf on AI (IJCAI’01)
24. Haarslev V, Möller R (2001) RACER system description. In: Proc of the int joint conf on autom reasoning (IJCAR’01). LNAI, vol 2083
25. Haarslev V, Möller R (2008) On the scalability of description logic instance retrieval. J Autom Reason 41(2):99–142 DOI: 10.1007/s10817-008-9104-7
26. 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’91)
27. Hollunder B, Nutt W, Schmidt-SchaußM (1990) Subsumption algorithms for concept description languages. In: Proc of the Eur conf on AI (ECAI’90)
28. 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’98)
29. 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
30. 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’06)
31. Horrocks I, Patel-Schneider PF (1999) Optimizing description logic subsumption. J Logic Comput 9(3):267–293 DOI: 10.1093/logcom/9.3.267
32. Horrocks I, Patel-Schneider PF (2004) Reducing OWL entailment to description logic satisfiability. J Web Sem 1(4):345–357
33. 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–26
34. Horrocks I, Sattler U (2005) A tableaux decision procedure for $\mathcal{SHOIQ}$. In: Proc of the int joint conf on AI (IJCAI’05)
35. Horrocks I, Sattler U, Tobies S (2000) Practical reasoning for very expressive description logics. J Interest Group Pure Appl Logic 8(3):239–264
36. 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’08)
37. 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’09)
38. Levesque HJ, Brachman RJ (1987) Expressiveness and tractability in knowledge representation and reasoning. Comput Intell 3:78–93 DOI: 10.1111/j.1467-8640.1987.tb00176.x
39. Lutz C (2008) The complexity of conjunctive query answering in expressive description logics. In: Proc of the int joint conf on autom reasoning (IJCAR’08). LNAI, vol 5195
40. 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’08)
41. 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’09)
42. MacGregor R (1991) The evolving technology of classification-based knowledge representation systems. In: Principles of semantic networks. Kaufmann, Los Altos
43. Mays E, Dionne R, Weida R (1991) K-REP system overview. SIGART Bull 2(3):93–97 DOI: 10.1145/122296.122310
44. Nebel B (1988) Computational complexity of terminological reasoning in BACK. Artif Intell 34(3):371–383 DOI: 10.1016/0004-3702(88)90066-5
45. Nebel B (1990) Terminological reasoning is inherently intractable. Artif Intell 43(2):235–249 DOI: 10.1016/0004-3702(90)90087-G
46. Ortiz M, Calvanese D, Eiter T (2008) Data complexity of query answering in expressive description logics via tableaux. J Autom Reason 41(1):61–98 DOI: 10.1007/s10817-008-9102-9
47. Patel-Schneider PF (1984) Small can be beautiful in knowledge representation. In: Proc of the IEEE WS on knowledge-based systems
48. Peltason Ch (1991) The BACK system—an overview. SIGART Bull 2(3):114–119 DOI: 10.1145/122296.122314
49. Schmidt-SchaußM (1989) Subsumption in KL-ONE is undecidable. In: Proc of the int conf on the principles of knowledge representation and reasoning (KR’89)
50. Schmidt-SchaußM, Smolka G (1991) Attributive concept descriptions with complements. Artif Intell 48(1):1–26 DOI: 10.1016/0004-3702(91)90078-X
51. Sirin E, Parsia B (2004) Pellet: an OWL DL reasoner. In: Proc of the description logic WS (DL’04)
52. Suntisrivaraporn B (2009) Polynomial-time reasoning support for design and maintenance of large-scale biomedical ontologies. PhD thesis, Fakultät Informatik, TU Dresden
53. Tsarkov D, Horrocks I (2006) FaCT++ description logic reasoner: system description. In: Proc of the int joint conf on autom reasoning (IJCAR’06). LNAI, vol 4130