SAT vs. Translation Based decision procedures for modal logics: A comparative evaluation

Journal of Applied Non-Classical Logics

Volumn 10, Issue 2, 2000, Pages 145-172

  Giunchiglia, Enrico ^a   Sebastiani, Roberto ^b   Giunchiglia, Fausto ^b   Tacchella, Armando ^a  

^a DIST   (Italy)

^b UNIVERSITY OF TRENTO   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0041720096     PISSN: 11663081     EISSN: 19585780     Source Type: Journal    
DOI: 10.1080/11663081.2000.10510994     Document Type: Article

References (41)

1. M. Buro and H. Buning. Report on a SAT competition. Technical Report 110, University of Paderborn, Germany, November 1992.
2. F. Baader, E. Franconi, B. Hollunder, B. Nebel, and H.J. Profitlich. An Empirical An alysis of Optimization Techniques for Terminological Representation Systems or: Making KRIS get a move on. Applied Artificial Intelligence. Special Issue on Knowledge Base Management, 4:109-132, 1994.
3. P. Bresciani, E. Franconi, and S. Tessaris. Implementing and testing expressive Description Logics: A preliminary report. In Proc. International Workshop on Description Logics, Rome, Italy, 1995.
4. F. Baader and B. Hollunder. A Termin ological Knowledge Representation System with Complete Inference Algorithms. In Proceedings of the First International Workshop on Processing Declarative Knowledge, volume 572 of Lecture Notes in Computer Science, pages 67-85, Kaiserslaut ern (Germany), 1991. Springer-Verlag.
5. J. Crawford and L. Auton. Experimental results on the crossover point in satisfiability problems. In Proc. of the 11th National Conference on Artificial Intelligence, pages 21-27, 1993.
6. B. F. Chellas. Modal Logic- an Introduction. Cambridge University Press, 1980.
7. L. Denenberg and H. R. Lewis. Logical syntax and computational complexity. In Computation and Proof Theory: Proceedings of the Logic Colloquium, Lecture Notes in Mathematics, 1104, Aachen, 1983. Springer Verlag.
8. M. Davis, G. Longemann, and D. Loveland. A machine program for theorem proving. Journal of the ACM, 5(7), 1962.
9. M. Davis and H. Putnam. A computing procedure for quantification theory. Journal of the ACM, 7:201-215, 1960.
10. H. De Swart, editor. Automated Reason ing with Analytic Tableaux and Related Methods: International Conference Tableaux'98, number 1397 in Lecture Notes in Artificial Intelligence. Springer-Verlag, May 1998.
11. E. A. Emerson. Temporal and Modal Logic. In J. Van Leeuwen, editor, Handbook of Theoretical Computer Science, volume B, pages 995-1072. Elsevier Science Publisher B.V., 1990.
12. E. Franconi, G. De Giacomo, R. M. MacGregor, W. Nutt, C. A. Welty, and F. Sebastiani, editors. Collected Papers from the International Description Logics Workshop (DL '98}. CEUR, May 1998.
13. M. Fitting. Proof Methods for Modal and Intuitionistic Logics. D. Reidel Publishg, 1983.
14. E. Giunchiglia, F. Giunchiglia, R. Sebastiani, and A. Tacchella. More evaluation of decision procedures for modal logics. In Sixth International Conference on Principles of Knowledge Representation and Reasoning (KR '98}, 1998.
15. F. Giunchiglia and R. Sebastiani. Building decision procedures for modal logics from propositional decision procedures - the case study of modal K. In Proc. of the 13th Conference on Automated Deducti on, Lecture Notes in Artificial Intelligence, New Brunswick, NJ, USA, August 1996. Springer Verlag. Also DIST-Technical Report 96-0037 and IRST-Technical Report 9601-02.
16. F. Giunchiglia and R. Sebastiani. Buildi ng decision procedures for modal logics from propositional decision procedures - the case study of modal K(m). 1996. To appear on Information and Computation. A longer version is IRST-Technical Report 9611-06.
17. F. Giunchiglia and R. Sebastiani. A SAT-based decision procedure for ALC. In Proc. of the 5th International Conference on Principles of Knowledge Representation and Reasoning - KR '96, Cambridge, MA, USA, November 1996. Also DIST-Technical Re port 9607-08 and IRST-Technical Report 9601-02.
18. J. Y. Halpern. The effect of bounding the number of primitive propositions and the depth of nesting on the complexity of modal logic. Artificial Intelligence, 75(3):361-372, 1995.
19. A. Heuerding, G. Jager, S. Schwendimann, and M. Seyfried. The Logics Workbench LWB: A Snapshot. Euromath Bulletin, 2(1):177-186, 1996.
20. J.Y. Halpern andY. Moses. A guide t o the completeness and complexity for modal logics of knowledge and belief. Artificial Intelligence, 54(3):319-379, 1992.
21. I. Horrocks. The FaCT system. In De Swart[dS98], pages 307-312.
22. I. Horrocks. Using an expressive description logic: FaCT or fiction? In Sixth International Conference on Principles of Knowledge Representation and Reasoning (KR '98} , pages 636-647, 1998.
23. U. Hustadt and R.A. Schmidt. On evaluating decision procedures for modal logic. In Proc. of the 15th International Joint Conference on Artificial Intelligence, 1997.
24. U. Hustadt and R.A. Schmidt. On evaluating decision procedures for modal logic. Research report MPI-1-97-2-003, Max-PlanckInstitut fiir Informatik, Saarbriicken, Germany, February 1997.
25. U. Hustadt and R. A. Schmidt. An empirical analysis of modal theorem provers. To appear in Journal o f Applied Non-Classical Logics, July 1998.
26. W.H. Joyner. Resolution Startegies as Decision Procedures. Journal of the ACM, 23(3):398-417, 1976.
27. R. Ladner. The computational complexity of provability in systems of modal propositional logic. SIAM J. Camp., 6(3):467-480, 1977.
28. H. R. Lewis. Complexity Results for Classes of Quantificational Formulas. Journal of Computer and System Sciences, 21:317-353, 1980.
29. F. Massacci. Strongly analytic tableaux for normal modal logics. In Proc. of the 12th Conference on Automated Deduction, 1994.
30. D. Mitchell, B. Selman, and H. Levesque. Hard and Easy Distributions of SAT Problems. In Proc. of the 10th National Confere nce on Artificial Intelligence, pages 459-465, 1992.
31. H. J. Ohlbach. Semantics based translation methods for modal logics. Journal of Logic and Computation, 1(5):691-746, 1991.
32. P. F. Patel-Schneider. DLP system description. In Franconi et al., pages 87-89.
33. R. A. Schmidt, August 1998. Personal communication.
34. R. A. Schmidt. Decidability by resolution for propositional modal logics. To appear in Journal of Automated Reasoning, June 1998.
35. R. Sebastiani and F. Giunchiglia. From Tableau-based to SATbased procedures - preliminary report. Technical Report 9711-14, IRST, Trento, Italy, November 1997.
36. R. Sebastiani and D. McAllester. New upper bounds for satisfiability in modal logics - the case-study of modal K. Technical Report 9710-15, IRST, Trento, Italy, October 1997.
37. R. M. Smullyan. First-Order Logic. Springer-Verlag, NY, 1968.
38. A. Tacchella. Procedure di decisione per logiche modali classiche (decision procedures for classical modal logics). Master's thesis, DIST, Universita di Genova, Italy, 1997. In italian.
39. Johan Van Benthem. Correspondence theory. In D. Gabbay and F. Guenthner, editors, Handbook of Philosophical Logic, Volume II: Extensions of Classical Logic, volume 165 of Synthese Li brary, chapter 11.4, pages 167-247. D. Reidel Publ. Co., Dordrecht, 1984.
40. C. Weidenbach, B. Gaede, and G. Rock. SPASS & FLOTTER version 0.42. In M.A. McRobbie and J.K. Slaney, editors, Proceedings of the 13th Conference on Automated Deduction (CADE-13} , volume 1104 of Lecture Notes in Artificial Intelligence, pages 141-145, New Brunswick, New Jersey, USA, July/August 1996. Springer.
41. C. P. Williams and T. Hogg . Exploiting the deep structure of constraint problems. Artificial Intelligence, 70:73-117, 1994.