Sciweavers

WOLLIC
2010
Springer

The Two-Variable Fragment with Counting Revisited

14 years 4 months ago
The Two-Variable Fragment with Counting Revisited
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].
Ian Pratt-Hartmann
Added 11 Jul 2010
Updated 11 Jul 2010
Type Conference
Year 2010
Where WOLLIC
Authors Ian Pratt-Hartmann
Comments (0)