activity
20042024
most citedComplexity of the Two-Variable Fragment with (Binary-Coded) Counting Quantifiers

184 citations · 617 across the 22 of their papers we have counts for

collaborators
Showing 2006Show all

1 paper · 1 filter

cs.LO2006★ 59 cited

Complexity of the Guarded Two-Variable Fragment with Counting Quantifiers

Ian Pratt-Hartmann

We show that the finite satisfiability problem for the guarded two-variable fragment with counting quantifiers is in EXPTIME. The method employed also yields a simple proof of a re…