# Complexity of the Two-Variable Fragment with Counting Quantifiers

@article{PrattHartmann2005ComplexityOT, title={Complexity of the Two-Variable Fragment with Counting Quantifiers}, author={Ian Pratt-Hartmann}, journal={Journal of Logic, Language and Information}, year={2005}, volume={14}, pages={369-395} }

The satisfiability and finite satisfiability problems for the two-variable fragment of first-order logic with counting quantifiers are both in NEXPTIME, even when counting quantifiers are coded succinctly.

#### Topics from this paper

#### 177 Citations

Complexity of the Guarded Two-variable Fragment with Counting Quantifiers

- Mathematics, Computer Science
- J. Log. Comput.
- 2007

The finite satisfiability problem for the guarded two-variable fragment with counting quantifiers is in EXPTIME.

The Two-Variable Fragment with Counting Revisited

- Mathematics, Computer Science
- WoLLIC
- 2010

This paper presents a simplified proof via a result on integer programming due to Eisenbrand and Shmonina of the satisfiability and finite satisfiability problems for the two-variable fragment of first-order logic with counting. Expand

Data-complexity of the two-variable fragment with counting quantifiers

- Computer Science, Mathematics
- Inf. Comput.
- 2009

The data-complexity of both satisfiability and finite satisfiability for the two-variable fragment with counting quantifiers is NP-complete; the data-complexity of both query answering and finite… Expand

Adding Path-Functional Dependencies to the Guarded Two-Variable Fragment with Counting

- Computer Science, Mathematics
- Log. Methods Comput. Sci.
- 2017

The satisfiability and finite satisfiability problems for the two-variable
guarded fragment of first-order logic with counting quantifiers, a database,
and path-functional dependencies are both… Expand

Logics with counting and equivalence

- Computer Science, Mathematics
- CSL-LICS
- 2014

We consider the two-variable fragment of first-order logic with counting, subject to the stipulation that a single distinguished binary predicate be interpreted as an equivalence. We show that the… Expand

The two-variable fragment with counting and equivalence

- Mathematics, Computer Science
- Math. Log. Q.
- 2015

We consider the two-variable fragment of first-order logic with counting, subject to the stipulation that a single distinguished binary predicate be interpreted as an equivalence. We show that the… Expand

Two-variable logics with counting and semantic constraints

- Computer Science
- SIGL
- 2018

The decidability frontier is outlined, describing some of the techniques developed for deciding satisfiability and finite satisfiability, as well as characterizing their complexity. Expand

On the Complexity of the Numerically Definite Syllogistic and Related Fragments

- Computer Science, Mathematics
- ArXiv
- 2007

The complexity of the satisfiability problem for various logics obtained by adding numerical quantifiers, and other constructions, to the traditional syllogistic is determined. Expand

Extending Two-Variable Logic on Trees

- Computer Science, Mathematics
- CSL
- 2017

It is shown that adding either additional binary symbols or counting quantifiers to the logic does not affect the complexity of the finite satisfiability problem, but combining the two extensions and adding both binary symbols and counting quantifier leads to an explosion of this complexity. Expand

On the Finite Satisfiability Problem for the Guarded Fragment with Transitivity

- Computer Science, Mathematics
- LPAR
- 2005

It is proved that in case of one transitive predicate the problem is decidable and its complexity is the same as the general satisfiability problem, i.e. 2Exptime-complete. Expand

#### References

SHOWING 1-10 OF 15 REFERENCES

Complexity of the Guarded Two-variable Fragment with Counting Quantifiers

- Mathematics, Computer Science
- J. Log. Comput.
- 2007

The finite satisfiability problem for the guarded two-variable fragment with counting quantifiers is in EXPTIME.

A Polynomial Translation from the Two-Variable Guarded Fragment with Number Restrictions to the Guarded Fragment

- Mathematics, Computer Science
- JELIA
- 2004

A satisfiability preserving transformation of formulas in this fragment to the three-variable guarded fragment is given and can be computed in polynomial time and produces a formula that is linear in the size of the initial formula even for the binary coding of number restrictions. Expand

Counting in the Two Variable Guarded Logic with Transitivity

- Computer Science, Mathematics
- STACS
- 2005

It is shown that the extension of the two-variable guarded fragment with transitive guards (GF+TG) by functionality statements is undecidable and of the same complexity as GF+TG with functionality, where functional predicate letters appear in guards only. Expand

Two-variable logic with counting is decidable

- Mathematics, Computer Science
- Proceedings of Twelfth Annual IEEE Symposium on Logic in Computer Science
- 1997

We prove that the satisfiability and the finite satisfiability problems for C/sup 2/ are decidable. C/sup 2/ is first-order logic with only two variables in the presence of arbitrary counting… Expand

On Logics with Two Variables

- Computer Science, Mathematics
- Theor. Comput. Sci.
- 1999

Abstract This paper is a survey and systematic presentation of decidability and complexity issues for modal and non-modal two-variable logics. A classical result due to Mortimer says that the… Expand

On the complexity of integer programming

- Mathematics, Computer Science
- JACM
- 1981

A simple proof that integer programming ts in X means that there is a pseudopolynomial-tune algorithm for integer programmmg with any (fixed) number of constraints is given. Expand

Complexity Results for First-Order Two-Variable Logic with Counting

- Computer Science, Mathematics
- SIAM J. Comput.
- 2000

It is proved that the satisfiability problem for first-order sentences with two variables and with additional quantifiers "there exists exactly (at most, at least) $i$" for $i\leq p$ is NEXPTIME-complete. Expand

Complexity of two-variable logic with counting

- Mathematics, Computer Science
- Proceedings of Twelfth Annual IEEE Symposium on Logic in Computer Science
- 1997

It is proved that the problem of satisfiability of sentences of C/sub 1//sup 2/ is NEXPTIME-complete, which easily implies that the satisfiability problem for C/sup2/ is in non-deterministic, doubly exponential time. Expand

On the complexity of the instance checking problem in concept languages with existential quantification

- Computer Science
- Journal of Intelligent Information Systems
- 2004

This work considers a particular concept language, calledALE, and addresses the question of whether instance checking can be really solved by means of subsumption algorithms in this language, and shows that inALE instance checking is strictly harder than subsumption. Expand

Integer Programming with a Fixed Number of Variables

- Mathematics, Computer Science
- Math. Oper. Res.
- 1983

It is shown that the integer linear programming problem with a fixed number of variables is polynomially solvable. The proof depends on methods from geometry of numbers.