A New General Method to Generate Random Modal Formulae for Testing Decision Procedures

The recent emergence of heavily-optimized modal decision procedures has highlighted the key role of empirical testing in this domain. Unfortunately, the introduction of extensive empirical tests for modal logics is recent, and so far none of the proposed test generators is very satisfactory. To cope with this fact, we present a new random generation method that provides benefits over previous methods for generating empirical tests. It fixes and much generalizes one of the best-known methods, the random CNF???m test, allowing for generating a much wider variety of problems, covering in principle the whole input space. Our new method produces much more suitable test sets for the current generation of modal decision procedures. We analyze the features of the new method by means of an extensive collection of empirical tests.

[1]  Marco Schaerf,et al.  An Algorithm to Evaluate Quantified Boolean Formulae , 1998, AAAI/IAAI.

[2]  M. de Rijke,et al.  The random modal qbf test set , 2001 .

[3]  Christoph Weidenbach,et al.  MSPASS: Subsumption Testing with SPASS , 1999, Description Logics.

[4]  E. Friedgut,et al.  Sharp thresholds of graph properties, and the -sat problem , 1999 .

[5]  Yannis C. Stamatiou,et al.  Random Constraint Satisfaction: A More Accurate Picture , 1997, CP.

[6]  Gerhard Jäger,et al.  Propositional Logics on the Computer , 1995, TABLEAUX.

[7]  Toby Walsh,et al.  Beyond NP: the QSAT phase transition , 1999, AAAI/IAAI.

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

[9]  Fausto Giunchiglia,et al.  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 , 1998 .

[10]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[11]  Ian Horrocks,et al.  Evaluating Optimized Decision Procedures for Propositional Modal K(m) Satisfiability , 2004, Journal of Automated Reasoning.

[12]  Yannis C. Stamatiou,et al.  Random Constraint Satisfaction a More Accurate Picture , 2022 .

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

[14]  Peter F. Patel-Schneider,et al.  Evaluating Optimised Decision Procedures for Propositional Modal K(m) Satis ability , 1999 .

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

[16]  Peter Balsiger,et al.  A Benchmark Method for the Propositional Modal Logics K, KT, S4 , 2004, Journal of Automated Reasoning.

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

[18]  Volker Haarslev,et al.  RACER System Description , 2001, IJCAR.

[19]  Ian Horrocks,et al.  An Analysis of Empirical Testing for Modal Decision Procedures , 2000, Log. J. IGPL.

[20]  Armando Tacchella,et al.  *SAT System Description , 1999, Description Logics.

[21]  Fabio Massacci.  Design and Results of the Tableaux-99 Non-classical (Modal) Systems Comparison , 1999, TABLEAUX.

[22]  Jeremy V. Pitt,et al.  Distributed Modal Theorem Proving with KE , 1996, TABLEAUX.

[23]  Bernhard Beckert,et al.  Free Variable Tableaux for Propositional Modal Logics , 1997, TABLEAUX.

[24]  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..

[25]  Peter F. Patel-Schneider,et al.  A New System and Methodology for Generating Random Modal Formulae , 2001, IJCAR.

[26]  Toby Walsh,et al.  Random Constraint Satisfaction: Flaws and Structure , 2004, Constraints.

[27]  Fausto Giunchiglia,et al.  SAT-Based Decision Procedures for Classical Modal Logics , 2004, Journal of Automated Reasoning.

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

[29]  Roy Dyckhoff.  Automated Reasoning with Analytic Tableaux and Related Methods , 2000, Lecture Notes in Computer Science.

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

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