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 conrm previous experimental results in showing that SAT based decision procedures, i.e., the procedures built on top of decision procedures for propositional satisability, are more ecient than tableau based decision procedures. They also conrm previous evidence of an easy-hard-easy pattern in the satisability curve for modal K. Finally, on these tests, SAT based decision procedures are also more ecient 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
|
910
|
Temporal and modal logic
– Emerson
- 1990
|
|
778
|
A computing procedure for quantification theory
– Davis, Putnam
- 1960
|
|
511
|
A machine program for theorem proving
– Davis, Logemann, et al.
- 1962
|
|
498
|
Modal Logic: An Introduction
– Chellas
- 1980
|
|
289
|
A guide to completeness and complexity of modal logics of knowledge and belief
– Halpern, Moses
- 1992
|
|
249
|
Proof methods for modal and intuitionistic logics
– Fitting
- 1983
|
|
249
|
and easy distributions of SAT problems
– Hard
- 1992
|
|
210
|
First-order logic
– Smullyan
- 1968
|
|
203
|
Using an expressive description logic: FaCT or fiction
– Horrocks
- 1998
|
|
194
|
Experimental results on the crossover point in satisfiability problems
– Crawford, Auton
- 1996
|
|
148
|
Correspondence theory
– Benthem
- 1984
|
|
145
|
The computational complexity of provability in systems of modal propositional logic
– Ladner
- 1977
|
|
110
|
Building decision procedures for modal logics from propositional decision procedures - the case study of modal K
– Giunchiglia, Sebastiani
- 1996
|
|
101
|
The FaCT System
– Horrocks
|
|
99
|
A Terminological Knowledge Representation System with Complete Inference Algorithms
– Baader, Hollunder
- 1991
|
|
82
|
Report on a SAT competition
– Buro, Büning
- 1993
|
|
75
|
Exploiting the deep structure of constraint problems
– Williams, Hogg
- 1994
|
|
64
|
A computing procedure for quanti theory
– Davis, Putnam
- 1960
|
|
57
|
On evaluating decision procedures for modal logic
– Hustadt, Schmidt
- 1997
|
|
54
|
A SAT-based decision procedure for ALC
– Giunchiglia, Sebastiani
- 1996
|
|
52
|
Strongly analytic tableaux for normal modal logics
– Massacci
- 1994
|
|
51
|
SPASS & FLOTTER version 0.42
– Weidenbach, Gaede, et al.
- 1996
|
|
48
|
Implementing and testing expressive description logics: Preliminary report
– Bresciani, Franconi, et al.
- 1995
|
|
47
|
DLP system description
– Patel-Schneider
- 1998
|
|
42
|
The effect of bounding the number of primitive propositions and the depth of nesting on the complexity of modal logic
– Halpern
- 1995
|
|
37
|
Semantics based translation methods for modal logics
– Ohlbach
- 1991
|
|
34
|
Using an expressive description logic: FaCT or
– Horrocks
- 1998
|
|
34
|
Complexity Results for Classes of Quantificational Formulas
– Lewis
- 1980
|
|
24
|
More evaluation of decision procedures for modal logics
– Giunchiglia, Giunchiglia, et al.
- 1998
|
|
22
|
An empirical analysis of modal theorem provers
– Hustadt, Schmidt
- 1999
|
|
20
|
Decidability by Resolution for Propositional Modal Logics
– Schmidt
- 1999
|
|
9
|
Automated Reasoning with Analytic Tableaux and
– Swart, editor
- 1998
|
|
6
|
The Logics Workbench LWB: A snapshot
– Heuerding, Jager, et al.
- 1996
|
|
6
|
On evaluating decision procedures for modal logic. Research report MPI-I-97-2-003, Max-Planck-Institut fur Informatik
– Hustadt, Schmidt
- 1997
|
|
4
|
From Tableau-based to SAT-based procedures - preliminary report
– Sebastiani, Giunchiglia
- 1997
|
|
3
|
New upper bounds for satisfiability in modal logics - the case-study of modal K
– Sebastiani, McAllester
- 1997
|
|
2
|
Logical syntax and computational complexity
– Denenberg, Lewis
- 1983
|
|
2
|
Resolution startegies as decision procedures
– Joyner
- 1976
|
|
1
|
Complexity Results for Classes of Quanti Formulas
– Lewis
- 1980
|
|
1
|
New upper bounds for satis in modal logics - the case-study of modal K
– Sebastiani, McAllester
- 1997
|
|
1
|
Procedure di decisione per logiche modali classiche (decision procedures for classical modal logics
– Tacchella
- 1997
|
|
