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].

• Type: Conference
• Year: 2010
• Where: WOLLIC
• Authors: Ian Pratt-Hartmann
• Keywords: Artificial Intelligence, Two-variable Fragment, WOLLIC 2010, finite Satisfiability Problems, first-order Logic