Lower Bounds for Existential Pebble Games and k-Consistency Tests
Logical Methods in Computer Science, 2012.
k-consistency testsconstraint satisfaction problempolynomial timeexistential-positive k-variable fragmentexistential pebble gamesMore(19+)
The existential k-pebble game characterizes the expressive power of the existential-positive k-variable fragment of first-order logic on finite structures. The winner of the existential k-pebble game on two given finite structures can easily be determined in polynomial time, where the degree of the polynomial is linear in k. We show that ...More
PPT (Upload PPT)
Best Paper of LICS, 2012