@inproceedings{24641007b1214dcf9c6992c75a19b2f2,
title = "The two-variable fragment with counting revisited",
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]. {\textcopyright} 2010 Springer-Verlag.",
keywords = "complexity, counting quantifiers, Logic",
author = "Ian Pratt-Hartmann",
year = "2010",
doi = "10.1007/978-3-642-13824-9_4",
language = "English",
isbn = "3642138233",
volume = "6188",
series = "Lecture Notes in Artificial Intelligence",
publisher = "Springer Nature",
pages = "42--54",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)|Lect. Notes Comput. Sci.",
address = "United States",
note = "17th International Workshop on Logic, Language, Information and Computation, WoLLIC 2010 ; Conference date: 01-07-2010",
}