Sat vs. Translation Based Decision Procedures for Modal Logics: a Comparative Evaluation Istituto per La Ricerca Scientifica E Tecnologica Sat vs. Translation Based Decision Procedures for Modal Logics: a Comparative Evaluation

ABSTRACT This paper follows on previous papers which present and evaluate various decision procedures for modal logics. We consider new test sets and systems that have been recently proposed in the literature. This new experimental analysis confirm previous experimental results in showing that SAT based decision procedures, i.e., the procedures built on top of decision procedures for propositional satisfiability, are more efficient than tableau based decision procedures. They also confirm previous evidence of an easy-hard-easy pattern in the satisfiability curve for modal K. Finally, on these tests, SAT based decision procedures are also more efficient than the recently proposed decision procedures based on translation methods. These results contradict some of the claims presented in previous papers by other authors.

[1]  Fabio Massacci,et al.  Strongly Analytic Tableaux for Normal Modal Logics , 1994, CADE.

[2]  James M. Crawford,et al.  Experimental Results on the Crossover Point inSatis ability , 1993 .

[3]  Peter F. Patel-Schneider,et al.  DLP System Description , 1998, Description Logics.

[4]  Fausto Giunchiglia,et al.  A SAT-based Decision Procedure for ALC , 1996, KR.

[5]  Bernhard Nebel,et al.  An Empirical Analysis of Optimization Techniques for Terminological Representation Systems, or Making KRIS Get a Move On , 1992, KR.

[6]  Joseph Y. Halpern.  The Effect of Bounding the Number of Primitive Propositions and the Depth of Nesting on the Complexity of Modal Logic , 1995, Artif. Intell..

[7]  M. Fitting.  Proof Methods for Modal and Intuitionistic Logics , 1983 .

[8]  D. McAllester,et al.  New upper boundsfor satis ability in modal logics { the case-study of modal K , 1997 .

[9]  Hector J. Levesque,et al.  Hard and Easy Distributions of SAT Problems , 1992, AAAI.

[10]  Hilary Putnam,et al.  A Computing Procedure for Quantification Theory , 1960, JACM.

[11]  Ullrich Hustadt,et al.  An empirical analysis of modal theorem provers , 1999, J. Appl. Non Class. Logics.

[12]  Harry R. Lewis,et al.  Complexity Results for Classes of Quantificational Formulas , 1980, J. Comput. Syst. Sci..

[13]  Richard E. Ladner,et al.  The Computational Complexity of Provability in Systems of Modal Propositional Logic , 1977, SIAM J. Comput..

[14]  Ian Horrocks,et al.  Using an Expressive Description Logic: FaCT or Fiction? , 1998, KR.

[15]  Sergio Tessaris,et al.  Implementing and Testing Expressive Description Logics: a Preliminary Report , 1995 .

[16]  E. Allen Emerson,et al.  Temporal and Modal Logic , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

[17]  Joseph Y. Halpern,et al.  A Guide to Completeness and Complexity for Modal Logics of Knowledge and Belief , 1992, Artif. Intell..

[18]  Fausto Giunchiglia,et al.  More Evaluation of Decision Procedures for Modal Logics , 1998, KR.

[19]  Hans Jürgen Ohlbach,et al.  Semantics-Based Translation Methods for Modal Logics , 1991, J. Log. Comput..

[20]  R. Labrecque.  The Correspondence Theory , 1978 .

[21]  Ian Horrocks.  The FaCT System , 1998, TABLEAUX.

[22]  Harrie de Swart,et al.  Automated Reasoning with Analytic Tableaux and Related Methods , 2000, Lecture Notes in Computer Science.

[23]  Harry R. Lewis,et al.  Logical syntax and computational complexity , 1984 .

[24]  Ullrich Hustadt,et al.  On Evaluating Decision Procedures for Modal Logic , 1997, IJCAI.

[25]  Dov M. Gabbay,et al.  Extensions of Classical Logic , 1989 .

[26]  Projektgruppe WINOPostfa.  A Terminological Knowledge Representation System with Complete Inference Algorithms , 1991 .

[27]  Fausto Giunchiglia,et al.  Building Decision Procedures for Modal Logics from Propositional Decision Procedures: The Case Study of Modal K(m) , 2000, Inf. Comput..

[28]  Tad Hogg,et al.  Exploiting the Deep Structure of Constraint Problems , 1994, Artif. Intell..

[29]  Donald W. Loveland,et al.  A machine program for theorem-proving , 2011, CACM.

[30]  William H. Joyner.  Resolution Strategies as Decision Procedures , 1976, JACM.

[31]  Fausto Giunchiglia,et al.  Building Decision Procedures for Modal Logics from Propositional Decision Procedure - The Case Study of Modal K , 1996, CADE.

[32]  Christoph Weidenbach,et al.  SPASS & FLOTTER Version 0.42 , 1996, CADE.