A resolution decision procedure for the guarded fragment with transitive guards

Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)

Volumn 3097, Issue , 2004, Pages 122-136

  Kazakov, Yevgeny ^a   De Nivelle, Hans ^a  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SIMULATION; DATA STRUCTURES; FORMAL LOGIC; INTERPOLATION; LOGIC PROGRAMMING; ORDER DISORDER TRANSITIONS; COMPUTATION THEORY; THEOREM PROVING;

DECIDABLE FRAGMENT; GUARDED FRAGMENT; ORDERED RESOLUTIONS; TRANSITIVE GUARDS; DECISION PROCEDURE; ORDERED RESOLUTION; ORDERING CONSTRAINTS; REDUNDANCY ELIMINATION; SELECTION FUNCTION;

DECISION MAKING; AUTOMATION;

EID: 9444245361     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-25984-8_7     Document Type: Conference Paper

References (13)

1. Andréka, H., van Benthem, J. & Németi, I. (1998), 'Modal languages and bounded fragments of predicate logic', Journal of Philosophical Logic 27, 217-274.
2. Bachmair, L. & Ganzinger, H. (2001), Resolution theorem proving, in A. Robinson & A. Voronkov, eds, 'Handbook of Automated Reasoning', Vol. I, Elsevier Science, chapter 2, pp. 19-99.
3. de Nivelle, H. & de Rijke, M. (2003), 'Deciding the guarded fragments by resolution', Journal of Symbolic Computation 35, 21-58.
4. de Nivelle, H. & Kazakov, Y. (2004), Resolution decision procedures for the guarded fragment with transitive guards, Research Report MPI-I-2004-2-001, Max-Planck-Institut für Informatik, Stuhlsatzenhausweg 85, 66123 Saarbrücken, Germany.
5. Formüller, C., Leitsch, A., Hustadt, U. & Tammet, T. (2001), Resolution decision procedures, in A. Robinson & A. Voronkov, eds, 'Handbook of Automated Reasoning', Vol. II, Elsevier Science, chapter 25, pp. 1791-1849.
6. Fermüller, C., Leitsch, A., Tammet, T. & Zamov, N. (1993), Resolution Methods for the Decision Problem, Vol. 679 of LNAI, Springer, Berlin, Heidelberg.
7. Ganzinger, H., Meyer, C. & Veanes, M. (1999), The two-variable guarded fragment with transitive relations, in 'Proc. 14th IEEE Symposium on Logic in Computer Science', IEEE Computer Society Press, pp. 24-34.
8. Grädel, E. (1999), 'On the restraining power of guards', Journal of Symbolic Logic 64(4), 1719-1742.
9. Grädel, E. & Walukiewicz, I. (1999), Guarded fixed point logic, in 'Proceedings of 14th IEEE Symposium on Logic in Computer Science LICS '99, Trento', pp. 45-54.
10. Halpern, J. Y. & Shoham, Y. (1986), A propositional modal logic of time intervals, in 'Proceedings 1st Annual IEEE Symp. on Logic in Computer Science, LICS'86, Cambridge, MA, USA, 16-18 June 1986', IEEE Computer Society Press, Washington, DC, pp. 279-292.
11. Kieroński, E. (2003), The two-variable guarded fragment with transitive guards is 2EXPTIME-hard, in A. D. Gordon, ed., 'FoSSaCS', Vol. 2620 of Lecture Notes in Computer Science, Springer, pp. 299-312.
12. Szwast, W. & Tendera, L. (2001), On the decision problem for the guarded fragment with transitivity, in 'Proc. 16th IEEE Symposium on Logic in Computer Science', pp. 147-156.
13. van Benthem, J. (1997), Dynamic bits and pieces, Technical Report LP-97-01, ILLC, University of Amsterdam.