| |
VOLUME 5, ISSUE 1, PAPER 4
|
The Complexity of Datalog on Linear Orders
|
©Martin Grohe, Humboldt-Universitaet zu Berlin, Berlin, Germany
©Goetz Schwandtner, Johannes Gutenberg-Universitaet, Mainz, Germany
|
Abstract
We study the program complexity of datalog on both finite and infinite linear
orders. Our main result states that on all linear orders with at least two
elements, the nonemptiness problem for datalog is EXPTIME-complete. While
containment of the nonemptiness problem in EXPTIME is known for finite linear
orders and actually for arbitrary finite structures, it is not obvious for
infinite linear orders. It sharply contrasts the situation on other infinite
structures; for example, the datalog nonemptiness problem on an infinite
successor structure is undecidable. We extend our upper bound results to
infinite linear orders with constants.
As an application, we show that the datalog nonemptiness problem on Allen's
interval algebra is EXPTIME-complete.
|
Publication date: February 27, 2009
Full Text: PDF | PostScript
DOI: 10.2168/LMCS-5(1:4)2009
Hit Counts: 1833 |
 Creative Commons | |
