2 results
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 EXPTIME-complete. While containment of the nonemptiness problem in EXPTIME is known for finite […]
Published on February 27, 2009
Mikołaj Bojańczyk ; Martin Grohe ; Michał Pilipczuk.
We prove that for every positive integer k, there exists an MSO_1-transduction that given a graph of linear cliquewidth at most k outputs, nondeterministically, some cliquewidth decomposition of the graph of width bounded by a function of k. A direct corollary of this result is the equivalence of […]
Published on January 25, 2021