A new general method to generate random modal formulae for testing decision procedures

Authors:
Peter F. Patel-Schneider;Roberto Sebastiani
Affiliations:
Bell Labs Research, Murray Hill, NJ;Dip. di Informatica e Telecomunicazioni, Università di Trento, Trento, Italy
Venue:
Journal of Artificial Intelligence Research
Year:
2003

Citing 15
Cited 5

A guide to completeness and complexity for modal logics of knowledge and belief

Artificial Intelligence
The effect of bounding the number of primitive propositions and the depth of nesting on the complexity of modal logic

Artificial Intelligence
An algorithm to evaluate quantified Boolean formulae

AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
Beyond NP: the QSAT phase transition

AAAI '99/IAAI '99 Proceedings of the sixteenth national conference on Artificial intelligence and the eleventh Innovative applications of artificial intelligence conference innovative applications of artificial intelligence
Building decision procedures for modal logics from propositional decision procedures: the case study of modal K(m)1

Information and Computation
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Random Constraint Satisfaction: Flaws and Structure

Constraints
Evaluating Optimized Decision Procedures for Propositional Modal K(m) Satisfiability

Journal of Automated Reasoning
SAT-Based Decision Procedures for Classical Modal Logics

Journal of Automated Reasoning
Distributed Modal Theorem Proving with KE

TABLEAUX '96 Proceedings of the 5th International Workshop on Theorem Proving with Analytic Tableaux and Related Methods
Free Variable Tableaux for Propositional Modal Logics

TABLEAUX '97 Proceedings of the International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
Propositional Logics on the Computer

TABLEAUX '95 Proceedings of the 4th International Workshop on Theorem Proving with Analytic Tableaux and Related Methods
Building Decision Procedures for Modal Logics from Propositional Decision Procedure - The Case Study of Modal K

CADE-13 Proceedings of the 13th International Conference on Automated Deduction: Automated Deduction
A New System and Methodology for Generating Random Modal Formulae

IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
RACER System Description

IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning

Automated reasoning in modal and description logics via SAT encoding: the case study of KmALC-satisfiability

Journal of Artificial Intelligence Research
Framework for an automated comparison of description logic reasoners

ISWC'06 Proceedings of the 5th international conference on The Semantic Web
The QMLTP problem library for first-order modal logics

IJCAR'12 Proceedings of the 6th international joint conference on Automated Reasoning
Performance heterogeneity and approximate reasoning in description logic ontologies

ISWC'12 Proceedings of the 11th international conference on The Semantic Web - Volume Part I
Finite satisfiability of propositional interval logic formulas with multi-objective evolutionary algorithms

Proceedings of the twelfth workshop on Foundations of genetic algorithms XII

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.