Complexity of the guarded two-variable fragment with counting quantifiers

Journal of Logic and Computation

Volumn 17, Issue 1, 2007, Pages 133-155

  Pratt Hartmann, Ian ^a  

^a UNIVERSITY OF MANCHESTER   (United Kingdom)

Author keywords

Complexity; Counting quantifiers; Guarded fragment; Logic; Two variable fragment

Indexed keywords

COUNTING QUANTIFIERS; GUARDED FRAGMENT; SATISFIABILITY PROBLEMS; VARIABLE FRAGMENT;

FORMAL LOGIC;

EID: 38149022273     PISSN: 0955792X     EISSN: 1465363X     Source Type: Journal    
DOI: 10.1093/logcom/exl034     Document Type: Article

References (14)

1. E. Bö rger, E. Grä del, and Y. Gurevich. The Classical Decision Problem. Springer-Verlag, Berlin, 1997.
2. D. Calvanese. Finite model reasoning in description logics. In Principles of Knowledge Representation and Reasoning (KR '96), L. C. Aiello, J. Doyle, and S. Shapiro, eds, pp. 292-303. Morgan Kaufmann, San Francisco, CA, 1996.
3. D. Calvanese. Unrestricted and Finite Model Reasoning in Class-based Representation Formalisms. PhD Thesis, Dipartimento di Informatica e Sistemistica, Universita' di Roma, 1996.
4. E. Grä del. On the restraining power of guards. J. Symb. Logic, 64, 1719-1742, 1999.
5. E. Grä del, P. G. Kolaitis, and M. Y. Vardi. On the decision problem for two-variable first-order logic. Bull. Symb. Logic, 3, 53-69, 1997.
6. E. Grä del, M. Otto, and E. Rosen. Two-variable logic with counting is decidable. In Proceedings of the 12th IEEE Symposium on Logic in Computer Science, pp. 306-317. IEEE Online Publications, 1997.
7. Y. Kazakov. A polynomial translation from the two-variable guarded fragment with number restrictions to the guarded fragment. In Logics in Artificial Intelligence: 9th European Conference, JELIA 2004, J. J. Alferes and J. Leite, eds, vol. 3229 of Lecture Notes in Artificial Intelligence, pp. 372-384. Springer, Berlin, 2004.
8. L. G. Khachiyan. A polynomial algorithm in linear programming. Soviet Math. Dokl., 20, 191-194, 1979.
9. C. Lutz, U. Sattler, and L. Tendera. The complexity of finite model reasoning in description logics. In Automated Deduction CADE-19: 19th International Conference on Automated Deduction, Franz Baader, ed. vol. 2741 of Lecture Notes in Artificial Intelligence, pp. 60-74. Springer, Berlin, 2003.
10. C. Lutz, U. Sattler, and L. Tendera. The complexity of finite model reasoning in description logics. Informat. Comput., 199, 132-171, 2005.
11. L. Pacholski, W. Szwast, and L. Tendera. Complexity results for first-order two-variable logic with counting. SIAM J. Comput., 29, 1083-1117, 1999.
12. C. H. Papadimitriou. On the complexity of integer programming. J. Assoc. Comput. Mach., 28, 765-768, 1981.
13. I. Pratt-Hartmann. Complexity of the two-variable fragment with counting quantifiers. J. ogic Language Inform., 14, 369-395, 2005.
14. D. Scott. A decision method for validity of sentences in two variables. J. Symb. Logic, 27, 477, 1962.