Lower Bounds for Existential Pebble Games and k-Consistency Tests

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 be determined in time O(n2k) by dynamic programming on the graph...

Full description

Bibliographic Details

Published in:	Logical methods in computer science Vol. 9, Issue 4
Main Author:	Berkholz, Christoph
Format:	Journal Article
Language:	English
Published:	Logical Methods in Computer Science e.V 08.10.2013
Subjects:	computer science - computational complexity computer science - logic in computer science
ISSN:	1860-5974, 1860-5974
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!