Using resolution for testing modal satisfiability and building models

Journal of Automated Reasoning

Volumn 28, Issue 2, 2002, Pages 205-232

  Hustadt, Ullrich ^a   Schmidt, Renate A ^a  

^a MANCHESTER METROPOLITAN UNIVERSITY   (United Kingdom)

Author keywords

Automated theorem proving; Modal logic; Model generation; Relative proof complexity; Relative search space complexity; Resolution decision procedures; Satisfiability testing; Simulation; Tableaux proof systems

Indexed keywords

COMPUTER SIMULATION; DECISION THEORY; FORMAL LOGIC; MATHEMATICAL MODELS; POLYNOMIALS; THEOREM PROVING;

AUTOMATED THEOREM PROVING;

MODAL ANALYSIS;

EID: 0036476960     PISSN: 01687433     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1015067300005     Document Type: Article

References (43)

1. Back and forth between modal logic and classical logic
2. Modal theorem proving: An equational viewpoint
3. An empirical analysis of optimization techniques for terminological representation systems, or: Making KRIS get a move on
4. A non-elementary speed-up in proof length by structural clause form transformation
5. Rewrite-based equational theorem proving with selection and simplification
6. Equational reasoning in saturation-based theorem proving
7. Resolution theorem proving
8. Cooperation between direct method and translation method in non classical logics: Some results in propositional S5
9. The relative efficiency of propositional proof systems
10. A resolution decision procedure for the guarded fragment
11. A hierarchy of backward translations: Applications to modal logics
12. Reasoning in description logics
13. Resolution method for the decision problem
14. A resolution-based decision procedure for extensions of K4
15. A note on Boolean medal logic
16. Building decision procedures for modal logics from propositional decision procedures: The case study of modal K
17. Tableau methods for modal and temporal logics
18. Testing heuristics: We have it all wrong
19. Using an expressive description logic: FaCT or fiction?
20. FaCT and DLP
21. On evaluating decision procedures for modal logics
22. An empirical analysis of modal theorem provers
23. Issues of decidability for description logics in the framework of resolution
24. Maslov's class K revisited
25. Optimised functional translation and resolution
26. Solving propositional satisfiability problems
27. Resolution strategies as decision procedures
28. A suggestion of an n-ary description logic
29. Strongly analytic tableaux for normal modal logics
30. Simplification: A general constraint propagation technique for propositional and modal tableaux
31. A resolution method for non-classical logics
32. Resolution calculi for modal logics
33. On languages with two variables
34. Functional translation and second-order frame properties of modal logics
35. Automated deduction techniques for classification in description logic systems
36. A structure-preserving clause form translation
37. Decidability by resolution for propositional modal logics
38. On the complexity of derivations in propositional calculus
39. The complexity of propositional proofs
40. SPASS V0.77