Skip to main content
Conference Proceedings

The two-variable fragment with counting revisited

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2010) 6188 LNAI 42-54
DOI: 10.1007/978-3-642-13824-9_4
16Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The satisfiability and finite satisfiability problems for the two-variable fragment of first-order logic with counting were shown in [5] to be in NExpTime. This paper presents a simplified proof via a result on integer programming due to Eisenbrand and Shmonina [2]. © 2010 Springer-Verlag.

Author supplied keywords

Cite

CITATION STYLE

APA

Pratt-Hartmann, I. (2010). The two-variable fragment with counting revisited. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6188 LNAI, pp. 42–54). https://doi.org/10.1007/978-3-642-13824-9_4

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free