Implementation and optimisation of a tableau algorithm for the guarded fragment

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

Volumn 2381 LNAI, Issue , 2002, Pages 145-159

  Hladik, Jan ^a  

^a DRESDEN UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

DATA DESCRIPTION; FORMAL LANGUAGES; ALGORITHMS;

DESCRIPTION LOGIC; DESCRIPTION LOGIC SYSTEMS; FINITE SIGNATURES; FIRST ORDER LOGIC; GUARDED FRAGMENT; KNOWLEDGE BASIS; SATISFIABILITY ALGORITHMS; TABLEAU ALGORITHM;

FORMAL LOGIC;

EID: 84885207247     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45616-3_11     Document Type: Conference Paper

References (31)

1. H. Andréka, J. van Benthem, and I. Németi. Modal languages and bounded fragments of predicate logic. Journal of Philosophical Logic, 27(3):217-274, 1998.
2. A. B. Baker. Intelligent Backtracking on Constraint Satisfaction Problems: Experimental and Theoretical Results. PhD thesis, University of Oregon, 1995.
3. R. Dyckhoff, editor. Automated Reasoning with Analytic Tableaux and Related Methods, International Conference (TABLEAUX 2000), Volume 1847 of Lecture Notes in Artificial Intelligence. Springer-Verlag, 2000.
4. M. J. Fischer and R. E. Ladner. Propositional dynamic logic of regular programs. Journal of Computer and System Science, 18:194-211, 1979.
5. E. Franconi, G. De Giacomo, R. M. MacGregor, W. Nutt, and C. A. Welty, editors. Proceedings of the International Workshop on Description Logics, Povo - Trento, Italy, 1998. CEUR.
6. J. W. Freeman. Improvements to propositional satisfiability search algorithms. PhD thesis, University of Pennsylvania, 1995.
7. J. W. Freeman. Hard random 3-SAT problems and the Davis-Putnam procedure. Artificial Intelligence, 81:183-198, 1996.
8. H. Ganzinger, editor. Proceedings of the 16th International Conference on Automated Deduction (CADE-99), Volume 1632 of Lecture Notes in Artificial Intelligence, Berlin, 1999. Springer-Verlag.
9. H. Ganzinger and H. de Nivelle. A superposition decision procedure for the guarded fragment with equality. In 14th IEEE Symposium on Logic in Computer Science (LICS), Trento, Italy, 1999. IEEE Computer Society Press.
10. E. Grädel. Guarded fragments of first-order logic: a perspective for new description logics? In Franconi et al. [5]. Extended abstract.
11. E. Grädel. Decision procedures for guarded logics. In Ganzinger [8].
12. E. Grädel. On the restrainingpower of guards. Journal of Symbolic Logic, 64:1719-1742, 1999.
13. V. Haarslev and R. Möller. Consistency testing: The RACE experience. In Dyckhoff [3].
14. V. Haarslev and R. Möller. Description of the RACER system and ist applications. In D.L. McGuinness, PF. Patel-Schneider, C. Goble, and R. Möller, editors, Proceedings of the 2001 International Workshop on Description Logics (DL2001), Volume 49, Stanford, CA, USA, 2001. CEUR.
15. V. Haarslev and R. Möller. High performance reasoning with very large knowledge bases: A practical case study. In Bernhard Nebel, editor, Proceedings of the Seventeenth International Joint Conference on Aritificial Intelligence. Morgan Kaufman Publishers, San Francisco, USA, 2001.
16. V. Haarslev, R. Möller, and A.-Y. Turhan. RACE user's guide and reference manual version 1.1. Technical Report FBI-HH-M-289/99, University of Hamburg, CS department, 1999.
17. C. Hirsch and S. Tobies. A tableau algorithm for the clique guarded fragment. In F. Wolter, H. Wansing, M. de Rijke, and M. Zakharyaschev, editors, Advances in Modal Logics, Volume 3, Stanford, 2001. CSLI Publications.
18. -. In F. Baader and U. Sattler, editors, Proceedings of the International Workshop on Description Logics, Aachen, Germany, 2000. CEUR.
19. I. Horrocks. Optimising Tableaux Decision Procedures for Description Logics. PhD thesis, University of Manchester, 1997.
20. I. Horrocks. Usingan expressive description logic: FaCT or fiction? In A. G. Cohn, L. Schubert, and S. C. Shapiro, editors, Principles of Knowledge Representation and Reasoning: Proceedings of the Sixth International Conference (KR'98). Morgan Kaufmann Publishers, San Francisco, California, 1998.
21. I. Horrocks and P. F. Patel-Schneider. Optimising description logic subsumption. Journal of Logic and Computation, 9(3):267-293, 1999.
22. I. Horrocks and U. Sattler. A description logic with transitive and inverse roles and role hierarchies. Journal of Logic and Computation, 9(3):385-410, 1999.
23. I. Horrocks, U. Sattler, and S. Tobies. Practical reasoning for expressive description logics. In H. Ganzinger, D. McAllester, and A. Voronkov, editors, Proceedings of the Sixth International Conference on Logic for Programming and Automated Reasoning (LPAR'99), number 1705 in Lecture Notes in Artificial Intelligence, pages 161-180. Springer-Verlag, 1999.
24. U. Hustadt, R. A. Schmidt, and C. Weidenbach. MSPASS: Subsumption testing with SPASS. In Lambrix et al. [25].
25. P. Lambrix, A. Borgida, M. Lenzerini, R. Möller, and P. Patel-Schneider, editors. Proceedings of the International Workshop on Description Logics, Linköping, Sweden, 1999. CEUR.
26. C. Lutz, U. Sattler, and S. Tobies. A suggestion for an n-ary description logic. In Lambrix et al. [25].
27. F. Massacci and F. M. Donini. Design and results of TANCS-2000. In Dyckhoff [3].
28. P. F. Patel-Schneider. DLP system description. In Franconi et al. [5].
29. V. R. Pratt. Models of program logics. In Proceedings of the 20th Annual Symposium on Foundations of Computer Science, San Juan, Puerto Rico, 1979.
30. C. Weidenbach. SPASS: Combiningsuperposition, sorts and splitting. In A. Robinson and A. Voronkov, editors, Handbook of Automated Reasoning, chapter 27. Elsevier, 1999.
31. C. Weidenbach, B. Afshordel, U. Brahm, C. Cohrs, T. Engel, E. Keen, C. Theobalt, and D. Topić. System description: SPASS version 1.0.0. In Ganzinger [8].