Lower Bounds for Existential Pebble Games and k-Consistency Tests

    Logical Methods in Computer Science, 2012.

    Cited by: 10|Bibtex|Views26|Links
    EI
    Keywords:
    k-consistency testsconstraint satisfaction problempolynomial timeexistential-positive k-variable fragmentexistential pebble gamesMore(19+)

    Abstract:

    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

    Code:

    Data:

    Your rating :
    0

     

    Best Paper
    Best Paper of LICS, 2012
    Tags
    Comments