SAT-based decision procedures for classical modal logics

Journal of Automated Reasoning

Volumn 28, Issue 2, 2002, Pages 143-171

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

^a DIST   (Italy)

^b UNIVERSITY OF TRENTO   (Italy)

Author keywords

Modal logic; SAT based decision procedure

Indexed keywords

COMPUTER SCIENCE; DECISION THEORY; MODAL ANALYSIS;

CLASSICAL MODAL LOGICS;

FORMAL LOGIC;

EID: 0036476958     PISSN: 01687433     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1015071400913     Document Type: Article

References (40)

1. An empirical analysis of optimization techniques for terminological representation systems, or Making KRIS get a move on
2. An algorithm to evaluate quantified boolean formulae
3. A computing procedure for quantification theory
4. Minimizing the number of clauses by renaming
5. Automated reasoning with analytic tableaux and related methods: International conference tableaux'98
6. From classical to normal modal logics
7. Ideal and real belief about belief
8. Building decision procedures for modal logics from propositional decision procedures - The case study of modal K
9. A SAT-based decision procedure for ALC
10. More evaluation of decision procedures for modal logics
11. Labelled tableaux for non-normal modal logics
12. Comparing subsumption optimizations
13. Optimising description logic subsumption
14. Using an expressive description logic: FaCT or fiction?
15. On evaluating decision procedures for modal logic
16. BLACKBOX: A new approach to the application of theorem proving to problem solving
17. Strongly analytic tableaux for normal modal logics
18. Pragmatics
19. Translation methods for non-classical logics - An overview
20. DLP system description
21. A structure-preserving clause form translation
22. SAT system description
23. On the complexity of proofs in propositional logics
24. Correspondence theory
25. On the complexity of epistemic reasoning
26. Spass & Flotter version 0.42
27. SATO: An efficient propositional prover