Tableau algorithms for description logics

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1847 LNAI, Issue , 2000, Pages 1-18

  Baader, Franz ^a   Sattler, Ulrike ^a  

^a RWTH AACHEN UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

DESCRIPTION LOGIC; KNOWLEDGE REPRESENTATION FORMALISM; NUMBER RESTRICTIONS; PROPOSITIONAL DYNAMIC LOGIC; REASONING PROBLEMS; SEMANTIC NETWORK; TABLEAU ALGORITHM; TECHNIQUES AND RESULTS;

ALGORITHMS; APPLICATION PROGRAMS; FORMAL LANGUAGES; FORMAL LOGIC; KNOWLEDGE REPRESENTATION; SEMANTICS;

DATA DESCRIPTION;

EID: 69849089097     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/10722086_1     Document Type: Conference Paper

References (53)

1. Franz Baader. Augmenting concept languages by transitive closure of roles: An alternative to terminological cycles. In Proc. of IJCAI-91, Sydney, Australia, 1991.
2. Franz Baader, Martin Buchheit, and Bernhard Hollunder. Cardinality restrictions on concepts. Artificial Intelligence, 88(1-2):195-213, 1996.
3. Franz Baader, Hans-Jürgen Bürckert, Bernhard Nebel, Werner Nutt, and Gert Smolka. On the expressivity of feature logics with negation, functional uncertainty, and sort equations. J. of Logic, Language and Information, 2:1-18, 1993.
4. Franz Baader and Philipp Hanschke. A schema for integrating concrete domains into concept languages. Technical Report RR-91-10, DFKI, Kaiserslautern, Germany, 1991. An abridged version appeared in Proc. of IJCAI-91.
5. Franz Baader and Bernhard Hollunder. A terminological knowledge representation system with complete inference algorithm. In Proc. of PDK'91, volume 567 ofLNAI, pages 67-86. Springer-Verlag, 1991.
6. Franz Baader, Bernhard Hollunder, Bernhard Nebel, Hans-Jürgen Profitlich, and Enrico Franconi. An empirical analysis of optimization techniques for terminological representation systems. In Proc. of KR-92, pages 270-281. Morgan Kaufmann, 1992.
7. Franz Baader and Ulrike Sattler. Expressive number restrictions in description logics. J. of Logic and Computation, 9(3):319-350, 1999.
8. Alexander Borgida and Peter F. Patel-Schneider. A semantics and complete algorithm for subsumption in the CLASSIC description logic. J. of Artificial IntelligenceResearch, 1:277-308, 1994.
9. Ronald J. Brachman. "Reducing" CLASSIC to practice: Knowledge representation meets reality. In Proc. of KR-92, pages 247-258. Morgan Kaufmann, 1992.
10. Ronald J. Brachman and Hector J. Levesque. The tractability of subsumption in frame-based description languages. In Proc. of AAAI-84, pages 34-37, 1984.
11. Ronald J. Brachman and Hector J. Levesque, editors. Readings in Knowledge Representation. Morgan Kaufmann, 1985.
12. Ronald J. Brachman and James G. Schmolze. An overview of the KL-ONE knowledge representation system. Cognitive Science, 9(2):171-216, 1985.
13. Paolo Bresciani, Enrico Franconi, and Sergio Tessaris. Implementing and testingexpressive description logics: Preliminary report. Working Notes of the 1995 DescriptionLogics Workshop, Technical Report, RAP 07.95, Dip. di Inf. e Sist., Univ. di Roma "La Sapienza", pages 131-139, Rome (Italy), 1995.
14. Martin Buchheit, Francesco M. Donini, and Andrea Schaerf. Decidable reasoning in terminological knowledge representation systems. J. of Artificial Intelligence Research, 1:109-138, 1993.
15. Giuseppe De Giacomo. Decidability of Class-Based Knowledge Representation Formalisms.PhD thesis, Dip. di Inf. e Sist., Univ. di Roma "La Sapienza", 1995.
16. Giuseppe De Giacomo and Maurizio Lenzerini. Boosting the correspondence between description logics and propositional dynamic logics. In Proc. of AAAI-94, pages 205-212. AAAI Press/The MIT Press, 1994.
17. Giuseppe De Giacomo and Maurizio Lenzerini. Concept language with number restrictions and fixpoints, and its relationship with μ-calculus. In A. G. Cohn,editor, Proc. of ECAI-94, pages 411-415. John Wiley & Sons, 1994.
18. Giuseppe De Giacomo and Maurizio Lenzerini. TBox and ABox reasoning in expressive description logics. In L. C. Aiello, J. Doyle, and S. C. Shapiro, editors, Proc. of KR-96, pages 316-327. Morgan Kaufmann, 1996.
19. Francesco M. Donini, Bernhard Hollunder, Maurizio Lenzerini, Alberto Marchetti Spaccamela, Daniele Nardi, and Werner Nutt. The complexity of existential quantification in concept languages. Artificial Intelligence, 2-3:309-327, 1992.
20. Francesco M. Donini, Maurizio Lenzerini, Daniele Nardi, and Werner Nutt. The complexity of concept languages. In J. Allen, R. Fikes, and E. Sandewall, editors, Proc. of KR-91, pages 151-162. Morgan Kaufmann, 1991.
21. Francesco M. Donini, Maurizio Lenzerini, Daniele Nardi, and Werner Nutt. Tractableconcept languages. In Proc. of IJCAI-91, pages 458-463, Sydney, 1991.
22. Giuseppe De Giacomo and Fabio Massacci. Tableaux and algorithms for propositional dynamic logic with converse. In Proc. of CADE-96, pages 613-628, 1996.
23. Philipp Hanschke. Specifying role interaction in concept languages. In Proc. ofKR-92, pages 318-329. Morgan Kaufmann, 1992.
24. Bernhard Hollunder. Hybrid inferences in KL-ONE-based knowledge representation systems. In Proc. of GWAI'90, volume 251 of Informatik- Fachberichte, pages 38-47. Springer-Verlag, 1990.
25. Bernhard Hollunder. Consistency checking reduced to satisfiability of concepts interminological systems. Annals of Mathematics and Artificial Intelligence, 18(2-4):133-157, 1996.
26. Bernhard Hollunder and Franz Baader. Qualifying number restrictions in concept languages. In Proc. of KR-91, pages 335-346, 1991.
27. Bernhard Hollunder and Werner Nutt. Subsumption algorithms for concept languages. Technical Report RR-90-04, DFKI, Kaiserslautern, Germany, 1990.
28. Bernhard Hollunder, Werner Nutt, and Manfred Schmidt-Schauß. Subsumption algorithms for concept description languages. In Proc. of ECAI-90, pages 348-353, London, 1990. Pitman.
29. Ian Horrocks. The FaCT system. In Harrie de Swart, editor, Proc. of TABLEAUX- 98, volume 1397 of LNAI, pages 307-312. Springer-Verlag, 1998.
30. Ian Horrocks. Using an expressive description logic: FaCT or fiction? In Proc. of KR-98, pages 636-647, 1998.
31. Ian Horrocks and Peter F. Patel-Schneider. Optimizing description logic subsumption.J. of Logic and Computation, 9(3):267-293, 1999.
32. Ian Horrocks and Ulrike Sattler. A description logic with transitive and inverse roles and role hierarchies. J. of Logic and Computation, 9(3):385-410, 1999.
33. Ian Horrocks, Ulrike Sattler, and Stephan Tobies. Practical reasoning for expressive description logics. In Proc. of LPAR'99, LNAI. Springer-Verlag, 1999.
34. Carsten Lutz. Complexity of terminological reasoning revisited. In Proc. of LPAR'99, volume 1705 of LNAI. Springer-Verlag, 1999.
35. Robert MacGregor. The evolving technology of classification-based knowledge representation systems. In John F. Sowa, editor, Principles of Semantic Networks, pages 385-400. Morgan Kaufmann, 1991.
36. Eric Mays, Robert Dionne, and Robert Weida. K-REP system overview. SIGART Bulletin, 2(3), 1991.
37. Marvin Minsky. A framework for representing knowledge. In J. Haugeland, editor,Mind Design. The MIT Press, 1981. Republished in [11].
38. Bernhard Nebel. Reasoning and Revision in Hybrid Representation Systems, volume422 of LNAI. Springer-Verlag, 1990.
39. Bernhard Nebel. Terminological reasoning is inherently intractable. Artificial Intelligence, 43:235-249, 1990.
40. Bernhard Nebel. Terminological cycles: Semantics and computational properties. In John F. Sowa, editor, Principles of Semantic Networks, pages 331-361. Morgan Kaufmann, 1991.
41. Peter F. Patel-Schneider. DLP. In Proc. of DL'99, pages 9-13. CEUR Electronic Workshop Proceedings, 1999. http://sunsite.informatik.rwth-aachen.de/ Publications/CEUR-WS/Vol-22/.
42. Peter F. Patel-Schneider, Deborah L. McGuiness, Ronald J. Brachman, Lori AlperinResnick, and Alexander Borgida. The CLASSIC knowledge representation system: Guiding principles and implementation rational. SIGART Bulletin, 2(3):108-113, 1991.
43. Christof Peltason. The BACK system - an overview. SIGART Bulletin, 2(3):114-119, 1991.
44. M. Ross Quillian. Word concepts: A theory and simulation of some basic capabilities. Behavioral Science, 12:410-430, 1967. Republished in [11].
45. Ulrike Sattler. A concept language extended with different kinds of transitive roles. In G. Görz and S. Hölldobler, editors, Proc. of KI'96, volume 1137 of LNAI.Springer-Verlag, 1996.
46. Walter J. Savitch. Relationship between nondeterministic and deterministic tape complexities. J. of Computer and System Science, 4:177-192, 1970.
47. Klaus Schild. A correspondence theory for terminological logics: Preliminary report. In Proc. of IJCAI-91, pages 466-471, Sydney, Australia, 1991.
48. Klaus Schild. Terminological cycles and the propositional μ-calculus. In J. Doyle, E. Sandewall, and P. Torasso, editors, Proc. of KR-94, pages 509-520, Bonn, 1994. Morgan Kaufmann.
49. Manfred Schmidt-Schauß. Subsumption in KL-ONE is undecidable. In R. J. Brachman,H. J. Levesque, and R. Reiter, editors, Proc. of KR-89, pages 421-431. Morgan Kaufmann, 1989.
50. Manfred Schmidt-Schauß and Gert Smolka. Attributive concept descriptions with complements. Artificial Intelligence, 48(1):1-26, 1991.
51. Edith Spaan. The complexity of propositional tense logics. In Maarten de Rijke, editor, Diamonds and Defaults, pages 287-307. Kluwer Academic Publishers, 1993.
52. Stephan Tobies. A PSPACE algorithm for graded modal logic. In Proc. of CADE- 99, volume 1632 of LNCS. Springer-Verlag, 1999.
53. Wiebe Van der Hoek and Maarten De Rijke. Counting objects. J. of Logic and Computation, 5(3):325-345, 1995.