Building decision procedures for modal logics from propositional decision procedures: The case study of modal K(m)

Information and Computation

Volumn 162, Issue 1-2, 2000, Pages 158-178

  Giunchiglia, Fausto ^a,b   Sebastiani, Roberto ^b  

^a ITC IRST   (Italy)

^b DISA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; MODAL ANALYSIS; PHASE TRANSITIONS; SEMANTICS;

DECISION PROCEDURES;

DECISION THEORY;

EID: 0034634034     PISSN: 08905401     EISSN: None     Source Type: Journal    
DOI: 10.1006/inco.1999.2850     Document Type: Article

References (19)

1. Armando, A., and Giunchiglia, E. (1993), Embedding complex decision procedures inside an interactive theorem prover, Ann. Math. Artificial Intelligence 8, 475-502.
2. Buro, M., and Buning, H. (1992), "Report on a SAT Competition," Technical Report 110, University of Paderborn, Germany.
3. Baader, F., Franconi, E., Hollunder, B., Nebel, B., and Profitlich, H. J. (1994), An empirical analysis of optimization techniques for terminological representation systems or: Making KRIS get a move on, Appl. Artificial Intelligence (Special Issue on Knowledge Base Management) 4, 109-132.
4. Bryant, R. E. (1992), Symbolic Boolean manipolation with ordered binary-decision diagrams, ACM Comput. Surveys 24, 293-318.
5. Davis, M., Longemann, G., and Loveland, D. (1962), A machine program for theorem proving, J. Assoc. Comput. Mach. 5.
6. D'Agostino, M., and Mondadori, M. (1994), The taming of the cut, J. Logic Comput. 4, 285-319.
7. Fitting, M. (1988), First-order modal tableaux, J. Automat. Reason. 4, 191-213.
8. Giunchiglia, F., Roveri, M., and Sebastiani, R. (1996), A new method for testing decision procedures in modal and terminological logics, in "Proc. DL'96, Cambridge, MA, November 1996."
9. Giunchiglia, F., and Serafini, L. (1994), Multilanguage hierarchical logics (or: how we can do without modal logics), Artificial Intelligence 65, 29-70.
10. Giunchiglia, F., Serafini, L., Giunchiglia, E., and Frixione, M. (1993), Nonomniscient belief as context-based reasoning, in "Proc. IJCAI93, Chambery, France," pp. 548-554.
11. Halpern, J. Y., and Moses, Y. (1992), A guide to the completeness and complexity for modal logics of knowledge and belief, Artificial Intelligence 54, 319-379.
12. Hollunder, B., Nutt, W., and Schmidt-Schauß, M. (1990), Subsumption algorithms for concept description languages, in "Proc. ECAI90," pp. 348-353.
13. Massacci, F. (1994), Strongly analytic tableaux for normal modal logics, in "Proc. CADE94."
14. Mitchell, D., Selman, B., and Levesque, H. (1992), Hard and easy distributions of SAT problems, in "Proc. AAAI92," pp. 459-465.
15. Schild, K. D. (1991), A correspondence theory for terminological logics: preliminary report, in "Proc. IJCAI91, Sydney, Australia," pp. 466-471.
16. Sebastiani, R. (1994), Applying GSAT to non-clausal formulas, J. Artificial Intelligence Res. 1, 309-314.
17. Selman, B., Levesque, H., and Mitchell, D. (1992), A new method for solving hard satisfiability problems, in "Proc. AAAI92," pp. 440-446.
18. Uribe, T. E., and Stickel, M. E. (1994), Ordered binary decision diagrams and the Davis-Putnam procedure, in "Proc. of the 1st International Conference on Constraints in Computational Logics."
19. Williams, C. P., and Hogg, T. (1994), Exploiting the deep structure of constraint problems, Artificial Intelligence 70, 73-117.