EXPTIME tableaux for ALC

Artificial Intelligence

Volumn 124, Issue 1, 2000, Pages 87-138

  Donini, Francesco M ^a,c   Massacci, Fabio ^b,c  

^a Dipartimento di Elettrotecnica ed Elettronica   (Italy)

^b Via Roma 56   (Italy)

^c SAPIENZA UNIVERSITY OF ROME   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL LINGUISTICS; COMPUTER SIMULATION; DATA STRUCTURES; DECISION THEORY; FORMAL LOGIC; MATHEMATICAL TRANSFORMATIONS; MODAL ANALYSIS; PROBLEM SOLVING;

AUTOMATED REASONING; DESCRIPTION LOGICS; MODAL LOGICS;

ARTIFICIAL INTELLIGENCE;

EID: 0034322495     PISSN: 00043702     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0004-3702(00)00070-9     Document Type: Article

References (80)

1. Abadi M., Burrows M., Lampson B., Plotkin G.D. A calculus for access control in distributed systems. ACM Trans. Program. Lang. Syst. Vol. 15:(4):1993;706-734.
2. Arai N. A proper hierarchy of propositional sequent calculi. Theoret. Comput. Sci. Vol. 159:(2):1996;343-354.
3. Baader F., Hollunder B., Nebel B., Profitlich H.-J., Franconi E. An empirical analysis of optimization techniques for terminological representation systems or: "making KRIS get a move on" Appl. Intelligence. Vol. 4:(2):1994;109-132.
4. Basin D., Matthews S., Vigano L. A new method for bounding the complexity of modal logics. Gottlob G., Leitsch A., Mundici D. Proc. 5th Kurt Gödel Colloquium, KGC'97. Lecture Notes in Computer Science. Vol. 1289:1997;89-102 Springer, Berlin.
5. Baumgartner P., Furbach U., Niemelä I. Hyper tableaux. Alferes J., Pereira L., Orlowska E. Proc. 5th European Workshop on Logics in Artificial Intelligence (JELIA'96). Lecture Notes in Artificial Intelligence. Vol. 1126:1996;1-17 Springer, Berlin.
6. Blackburn P., Spaan E. A modal perspective on computational complexity of attribute value grammar. J. Logic Language and Inform. Vol. 2:1993;129-169.
7. Borgida A., Patel-Schneider P. A semantics and complete algorithm for subsumption in the CLASSIC description logic. J. Artificial Intelligence Res. Vol. 1:1994;277-308.
8. Buchheit M., Donini F.M., Schaerf A. Decidable reasoning in terminological knowledge representation systems. J. Artificial Intelligence Res. Vol. 1:1993;109-138.
9. Calvanese D., De Giacomo G., Lenzerini M. What can knowledge representation do for semi-structured data? Proc. AAAI-98, Madison, WI. 1998;205-210.
10. Calvanese D., De Giacomo G., Lenzerini M., Nardi D., Rosati R. Description logic framework for information integration. Proc. 6th International Conference on Principles of Knowledge Representation and Reasoning (KR-98), Trento, Italy. 1998;2-13.
11. Castilho M., Fariñas del Cerro L., Gasquet O., Herzig A. Modal tableaux with propagation rules and structural rules. Fundamenta Informaticae. Vol. 32:(3):1997;281-297.
12. Cerrito S., Cialdea Myer M. Hintikka multiplicities in matrix decision methods for some propositional modal logics. Galmiche D. Proc. International Conference on Analytic Tableaux and Related Methods (TABLEAUX'97). Lecture Notes in Artificial Intelligence. Vol. 1227:1997;138-152 Springer, Berlin.
13. Courcoubetis C., Vardi M., Wolper P., Yannakakis M. Memory efficient algorithms for the verification of temporal properties. Formal Methods in System Design. Vol. 1:1992;275-288.
14. De Giacomo G., Lenzerini M. Tbox and abox reasoning in expressive description logics. Proc. 5th International Conference on the Principles of Knowledge Representation and Reasoning (KR-96), Cambridge, MA. 1996;316-327 Morgan Kaufmann, Los Altos, CA.
15. De Giacomo G., Lenzerini M. A uniform framework for concept definitions in description logics. J. Artificial Intelligence Res. Vol. 6:1997;87-110.
16. G. De Giacomo, F. Massacci, Combining deduction and model checking into tableaux and algorithms for Converse-PDL, to appear in Information and Computation (accepted in 1997). An online version is at http://www.academicpress.com/i&c on IDEALfirst. A preliminary version appeared in: Proc. CADE-96, Lecture Notes in Artificial Intelligence, Vol. 1104, 1996, Springer, Berlin, pp. 613-628.
17. Dechter R. Enhancement schemes for constraint processing: Backjumping, learning, and cutset decomposition. Artificial Intelligence. Vol. 41:(3):1990;273-312.
18. Demri S. Uniform and non uniform strategies for tableaux calculi for modal logics. J. Appl. Non-Classical Logics. Vol. 5:(1):1995;77-96.
19. Devambu P., Brachman R.J., Selfridge P.J., Ballard B.W. LASSIE: A knowledge-based software information system. Comm. ACM. Vol. 34:(5):1991;36-49.
20. Donini F.M., De Giacomo G., Massacci F. EXPTIME tableaux for ALC . Padgham L., Franconi E., Gehrke M., McGuinness D., Patel-Schneider P. Proc. 1996 Description Logic Workshop (DL-96). no. WS-96-05 in AAAI Technical Reports Series. 1996;107-110 AAAI Press/MIT Press.
21. Donini F.M., Lenzerini M., Nardi D., Nutt W. Tractable concept languages. Proc. IJCAI-91, Sydney, Australia. 1991;458-463.
22. Donini F.M., Lenzerini M., Nardi D., Nutt W. The complexity of concept languages. Inform. and Comput. Vol. 134:1997;1-58.
23. Doyle J., Patil R. Two theses of knowledge representation: Language restrictions, taxonomic classification, and the utility of representation services. Artificial Intelligence. Vol. 48:1991;261-297.
24. Emerson A.E. Automated temporal reasoning about reactive systems. Moller F., Birtwistle G. Logics for Concurrency (Structure versus Automata). Lecture Notes in Computer Science. Vol. 1043:1996;41-101 Springer, Berlin.
25. Fagin R., Halpern J.Y., Moses Y., Vardi M.Y. Reasoning about Knowledge. 1995;MIT Press, Cambridge, MA.
26. Fariñas del Cerro L., Gasquet O. Tableaux based decision procedures for modal logics of confluence and density. Fundamenta Informaticae. Vol. 40:(4):1999;317-333.
27. Fischer N.J., Ladner R.E. Propositional dynamic logic of regular programs. J. Comput. System Sci. Vol. 18:1979;194-211.
28. Fitting M. Proof Methods for Modal and Intuitionistic Logics. 1983;Reidel, Dordrecht.
29. Fitting M. Basic modal logic. Gabbay D., Hogger C., Robinson J. Handbook of Logic in Artificial Intelligence and Logic Programming, Vol. 1. 1993;365-448 Oxford University Press, Oxford.
30. Franconi E., et al. Proc. 1998 Internat. Workshop on Description Logics. Technical Report ITC-IRST 9805-03. 1998;. Available as CEUR Publication at http://SunSite.Informatik.RWTH-Aachen.DE/Publications/CEUR-WS/Vol-11/.
31. Gerth R., Peled D., Vardi M., Wolper P. Simple on-the-fly automatic verification of linear temporal logic. Protocol Specification Testing and Verification (PSVT-95), Warsaw, Poland. 1995;3-18 Chapman Hall.
32. Giunchiglia E., Giunchiglia F., Sebastiani R., Tacchella A. SAT vs. translation based decision procedures for modal logics: A comparative evaluation. J. Appl. Non-Classical Logics. Vol. 10:(2):2000.
33. Giunchiglia E., Tacchella A. A subset-matching size-bounded cache for satisfiability in modal logics. Dyckhoff R. Proc. 4th International Conference on Analytic Tableaux and Related Methods (TABLEAUX 2000). Lecture Notes in Artificial Intelligence. Vol. 1847:2000;Springer, Berlin.
34. Giunchiglia F., Sebastiani R. Building decision procedures for modal logics from propositional decision procedures - The case study of modal K. McRobbie M.A., Slaney J.K. Proc. 13th International Conference on Automated Deduction (CADE'96). Lecture Notes in Artificial Intelligence. Vol. 1104:1996;583-597 Springer, Berlin.
35. Glasgow J., MacEwen G., Panangaden P. A logic for reasoning about security. ACM Trans. Comput. Syst. Vol. 10:(3):1992;226-264.
36. Goré R. Tableau methods for modal and temporal logics. D'Agostino M., Gabbay D., Hähnle R. Handbook of Tableau Methods. 1999;Kluwer Academic, Dordrecht.
37. Haarslev V., Möller R. Consistency testing: The RACE experience. Dyckhoff R. Proc. 4th International Conference on Analytic Tableaux and Related Methods (TABLEAUX 2000). Lecture Notes in Artificial Intelligence. Vol. 1847:2000;Springer, Berlin.
38. Halpern J.Y., Moses Y. A guide to completeness and complexity for modal logics of knowledge and belief. Artificial Intelligence. Vol. 54:1992;319-379.
39. Heuerding A., Seyfried M., Zimmermann H. Efficient loop-check for backward proof search in some non-classical logics. Proc. 5th Workshop on Theorem Proving with Analytic Tableaux and Related Methods (TABLEAUX'96). Lecture Notes in Artificial Intelligence. Vol. 1071:1996;210-225 Springer, Berlin.
40. Hoffman J., Koehler J. A new method to index and query sets. Proc. IJCAI-99, Stockholm, Sweden. 1999;462-467 Morgan Kaufmann, Los Altos, CA.
41. Horrocks I. Using an expressive description logic: FaCT or fiction? Proc. 6th International Conference on Principles of Knowledge Representation and Reasoning (KR-98), Trento, Italy. 1998;636-647 Morgan Kaufmann, Los Altos, CA.
42. Horrocks I. Benchmark analysis with FaCT. Dyckhoff R. Proc. 4th International Conference on Analytic Tableaux and Related Methods (TABLEAUX 2000). Lecture Notes in Artificial Intelligence. Vol. 1847:2000;62-66 Springer, Berlin.
43. Horrocks I., Patel-Schneider P.F. Optimizing description logic subsumption. J. Logic Comput. Vol. 9:(3):1999;267-293.
44. Horrocks I., Sattler U. A description logic with transitive and inverse roles and role hierarchies. J. Logic Comput. Vol. 9:(3):1999;385-410.
45. Horrocks I., Sattler U., Tobies S. Practical reasoning for expressive description logics. J. Interest Group in Pure and Applied Logic. Vol. 8:(3):2000;239-263.
46. Horrocks I., Tobies S. Reasoning with axioms: Theory and practice. Cohen A.G.F., Selman B. Proc. 7th International Conference on Principles of Knowledge Representation and Reasoning (KR'2000), Breckenridge, CO. 2000;285-296 Morgan Kaufmann, Los Altos, CA.
47. Hustadt U., Schmidt R.A. On the relation of resolution and tableaux proof systems for description logics. Dean T. Proc. IJCAI-99, Stockholm, Sweden. 1999;110-115 Morgan Kaufmann, Los Altos, CA.
48. Hustadt U., Schmidt R.A. An empirical analysis of modal theorem provers. J. Appl. Non-Classical Logics. Vol. 9:(4):1999;479-522.
49. Kozen D., Tiuryn J. Logic of programs. van Leeuwen J. Handbook of Theoretical Computer Science, Vol. II. 1990;Elsevier Science (North-Holland), Amsterdam. Chapter 14, pp. 789-840.
50. Kripke S. Semantical analysis of modal logic I: Normal propositional calculi. Zeitschrift fur Mathematische Logik und Grundlagen der Mathematik. Vol. 9:1963;67-96.
51. Ladner R.E. The computational complexity of provability in systems of modal propositional logic. SIAM J. Comput. Vol. 6:(3):1977;467-480.
52. Levesque H.J. Foundations of a functional approach to knowledge representation. Artificial Intelligence. Vol. 23:1984;155-212.
53. Levesque H.J., Brachman R.J. A fundamental tradeoff in knowledge representation and reasoning. Brachman R.J., Levesque H.J. Readings in Knowledge Representation. 1985;41-70 Morgan Kaufmann, Los Altos, CA.
54. Massacci F. Strongly analytic tableaux for normal modal logics. Bundy A. Proc. 12th International Conference on Automated Deduction (CADE'94). Lecture Notes in Artificial Intelligence. Vol. 814:1994;723-737 Springer, Berlin.
55. Massacci F. Simplification: A general constraint propagation technique for propositional and modal tableaux. de Swart H. Proc. 2nd International Conference on Analytic Tableaux and Related Methods (TABLEAUX'98). Lecture Notes in Artificial Intelligence. Vol. 1397:1998;217-231 Springer, Berlin.
56. Massacci F. Tableaux methods for formal verification in multi-agent distributed systems. J. Logic Comput. Vol. 8:(3):1998;373-400.
57. Massacci F. Single step tableaux for modal logics: Methodology, computations, algorithms. J. Automat. Reason. Vol. 24:(3):2000;319-364.
58. Massacci F., Donini F.M. Design and results of TANCS-00. Dyckhoff R. Proc. 4th International Conference on Analytic Tableaux and Related Methods (TABLEAUX 2000). Lecture Notes in Artificial Intelligence. Vol. 1847:2000;Springer, Berlin.
59. Mehlhorn K., Nueher S., Seel M., Uhrig C. The LEDA User Manual, http://www.mpi-sb.mpg.de/LEDA/. 1998;Max-Planck-Institut für Informatik and Algorithmic Solutions Software GmbH.
60. Nebel B. Computational complexity of terminological reasoning in BACK. Artificial Intelligence. Vol. 34:(3):1988;371-383.
61. Nebel B., Bürckert H.-J. Reasoning about temporal relations: A maximal tractable subclass of Allen's interval algebra. J. ACM. Vol. 42:(1):1995;43-66.
62. Ohlbach H.J. Translation methods for non-classical logics - An overview. J. Interest Group in Pure and Applied Logic. Vol. 1:(1):1993;69-89.
63. Oppacher F., Suen E. HARP: A tableau-based theorem prover. J. Automat. Reason. Vol. 4:1988;69-100.
64. Patel-Schneider P. DLP system description. Franconi E., et al. Proc. 1998 Internat. Workshop on Description Logics. 1998;Technical Report ITC-IRST 9805-03. Available as CEUR Publication at http://SunSite.Informatik.RWTH-Aachen.DE/Publications/CEUR-WS/Vol-11/.
65. Pratt V.R. A practical decision method for propositional dynamic logic. Proc. 10th ACM Symposium on Theory of Computing (STOC'78), San Diego, CA. 1978;326-337.
66. Pratt V.R. Models of program logics. Proc. 20th Annual Symposium on the Foundations of Computer Science (FOCS'79). 1979;115-122 IEEE Computer Society Press.
67. Renz J., Nebel B. On the complexity of qualitative spatial reasoning: A maximal tractable fragment of the region connection calculus. Artificial Intelligence. Vol. 108:(1-2):1999;69-123.
68. Schild K. A correspondence theory for terminological logics: Preliminary report. Proc. IJCAI-91, Sydney, Australia. 1991;466-471 Morgan Kaufmann, Los Altos, CA.
69. Schmidt R. Decidability by resolution for propositional modal logics. J. Automat. Reason. Vol. 22:(4):1999;379-396.
70. Schmidt-Schauß M., Smolka G. Attributive concept descriptions with complements. Artificial Intelligence. Vol. 48:1991;1-26.
71. Shanin N., Davydov G.Yu., Mints G.E., Orenkov V.P., Slisenko A.O. An algorithm for machine search of a natural logical deduction in a propositional calculus. Siekmann J., Wrightson G. Automation of Reasoning (Classical Papers on Computational Logic), Vol. 1 (1957-1966). 1983;Springer, Berlin.
72. Smullyan R.M. First Order Logic. 1968;Springer, Berlin. Republished by Dover, New York, 1995.
73. Smullyan R.M. Uniform Gentzen systems. J. Symbolic Logic. Vol. 33:(4):1968;549-559.
74. Sundar R., Tarjan R. Unique binary-search-tree representations and equality testing of sets and sequences. SIAM J. Comput. Vol. 23:(1):1994;24-44.
75. Tobies S. A PSPACE algorithm for graded modal logic. Ganzinger H. Proc. 16th International Conference on Automated Deduction (CADE'99). Lecture Notes in Artificial Intelligence. Vol. 1632:1999;52-66 Springer, Berlin.
76. Urquhart A. The complexity of propositional proofs. Bull. Symbolic Logic. Vol. 1:(4):1995;425-467.
77. Vardi M., Wolper P. Automata-theoretic techniques for modal logics of programs. J. Comput. System Sci. Vol. 32:1986;183-221.
78. Vardi M., Wolper P. Reasoning about infinite computations. Inform. and Comput. Vol. 115:(1):1994;1-37.
79. Wright J.R., Weixelbaum E.S., Vesonder G.T., Brown K.E., Palmer S.R., Berman J.I., Moore H.H. A knowledge-based configurator that supports sales, engineering, and manufacturing at AT&T network systems. AI Magazine. Vol. 14:(3):1993;69-80.
80. Yellin D. An algorithm for dynamic subset and intersection testing. Theoret. Comput. Sci. Vol. 129:(2):1994;397-406.