Deciding the guarded fragments by resolution

Journal of Symbolic Computation

Volumn 35, Issue 1, 2003, Pages 21-58

  de Nivelle, Hans ^a   de Rijke, Maarten ^b  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

^b UNIVERSITY OF AMSTERDAM   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0037268623     PISSN: 07477171     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0747-7171(02)00092-5     Document Type: Review

References (31)

1. Andréka, H., van Benthem, J., Németi, I., 1998. Modal languages and bounded fragments of predicate logic. J. Phil. Logic 27, 217-274.
2. Areces, C., 2000. Logic Engineering, Ph.D. Thesis. ILLC, University of Amsterdam.
3. Baaz, M., Fermüller, C., Leitsch, A., 1994. A non-elementary speed up in proof length by structural clause form transformation. Proceedings LICS'94. pp. 213-219.
4. Bachmair, L., Ganzinger, H., 1994. Rewrite-based equational theorem proving with selection and simplification. J. Logic Comput. 4, 217-247.
5. Boyer, R., 1971. Locking: A Restriction of Resolution. Ph.D. Thesis. University of Texas at Austin.
6. Chang, C.-L., Lee, R.-T., 1973. Symbolic Logic and Mechanical Theorem Proving. Academic Press.
7. de Nivelle, H., 1993. Generic resolution in propositional modal systems. LPAR'93. LNAI, vol. 698. pp. 241-252.
8. de Nivelle, H., 1994. Resolution games and non-liftable resolution orderings. CSL'94. pp. 279-293.
9. de Nivelle, H., 1998. A resolution decision procedure for the guarded fragment. CADE'98. pp. 191-204.
10. de Nivelle, H., 1999a. The Bliksem Theorem Prover. Can be obtained from: http://www.mpi-sb.mpg.de/~bliksem.
11. de Nivelle, H., 1999b. Translation of S4 and K4 into the guarded fragment and the 2-variable fragment (manuscript).
12. Enjalbert, P., Fariñias del Cerro, L., 1989. Modal resolution in clausal form. Theor. Comput. Sci. 65, 1-33.
13. Fermüller, C., Leitsch, A., Tammet, T., Zamov, N., 1993. Resolution Methods for the Decision Problem, LNAI, vol. 679. Springer.
14. Gabbay, D., 1981. Expressive functional completeness in tense logic. In: Mönnich, U. (Ed.), Aspects of Philosophical Logic. Reidel, pp. 91-117.
15. Ganzinger, H., de Nivelle, H., 1999. A superposition decision procedure for the guarded fragment with equality. LICS'99. pp. 295-303.
16. Ganzinger, H., Meyer, C., Veanes, M., 1999. The two-variable guarded fragment with transitive relations. LICS'99, pp. 24-34.
17. Grädel, E., 1997. On the restraining power of guards. J. Symb. Log. (to appear).
18. Grädel, E., Kolaitis, P., Vardi, M., 1997. On the decision problem for two-variable first-order logic. Bull. Symb. Logic 3, 53-69.
19. Grädel, E., Walukiewicz, I., 1999. Guarded fixed point logic. LICS'99. Trento, pp. 45-54.
20. Immerman, N., Kozen, D., 1989. Definability with a bounded number of bound variables. Inf. Comput. 83, 121-139.
21. Kurtonina, N., de Rijke, M., 1999. Expressiveness of concept expressions in first-order description logics. Artif. Intell. 107, 303-333.
22. Ladner, R., 1977. The computational complexity of provability in systems of modal propositional logic. SIAM J. Comput. 6, 467-480.
23. Leitsch, A., 1997. The resolution calculus. In: Texts in Theoretical Computer Science. Springer.
24. McCune, W., 1995. Otter 3.0 Reference Manual and Guide. Argonne National Laboratory, Mathematics and Computer Science Division. Available from: ftp. mcs. anl. gov, directory pub/Otter.
25. Mortimer, M., 1975. On languages with two variables. Z. Math. Log. Grundl. Math. 21, 135-140.
26. Ohlbach, H.-J., Weidenbach, C., 1995. A note on assumptions about skolem functions. J. Autom. Reasoning 15, 267-275.
27. Schmidt, R., 1997. Optimized Modal Translation and Resolution, Ph.D. Thesis. Max Planck Institut für Informatik, Saarbrücken.
28. Tammet, T., 1990. The resolution program, able to decide some solvable classes. Proceedings COLOG-88, pp. 300-312.
29. van Benthem, J., 1997. Dynamic bits and pieces. Technical Report LP-97-01, ILLC. University of Amsterdam.
30. Vardi, M., 1997. Why is modal logic so robustly decidable? In: Immerman, N., Kolaitis, P. (Eds.), Descriptive Complexity and Finite Models. pp. 149-183.
31. Weidenbach, C., 1997. The Spass & Flotter Users Guide, Version 0.55. Available from: ftp. mpi-sb. mpg. de, directory pub/SPASS.