episciences.org_811_1653099273
1653099273
episciences.org
raphael.tournoy+crossrefapi@ccsd.cnrs.fr
episciences.org
Logical Methods in Computer Science
18605974
02
27
2009
Volume 5, Issue 1
The Complexity of Datalog on Linear Orders
Martin
Grohe
Goetz
Schwandtner
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 EXPTIMEcomplete. 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 EXPTIMEcomplete.
02
27
2009
811
arXiv:0902.1179
10.48550/arXiv.0902.1179
10.2168/LMCS5(1:4)2009
https://lmcs.episciences.org/811

https://lmcs.episciences.org/811/pdf