Search

• < Previous
• 1
• Next >

---

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 EXPTIME-complete. While containment of the nonemptiness problem in EXPTIME is known for finite&nbsp;[&hellip;]

---

Randomisation and Derandomisation in Descriptive Complexity Theory

Kord Eickmeyer ; Martin Grohe.

We study probabilistic complexity classes and questions of derandomisation from a logical point of view. For each logic L we introduce a new logic BPL, bounded error probabilistic L, which is defined from L in a similar way as the complexity class BPP, bounded error probabilistic polynomial time, is&nbsp;[&hellip;]

---

A Finite-Model-Theoretic View on Propositional Proof Complexity

Erich Grädel ; Martin Grohe ; Benedikt Pago ; Wied Pakusa.

We establish new, and surprisingly tight, connections between propositional proof complexity and finite model theory. Specifically, we show that the power of several propositional proof systems, such as Horn resolution, bounded-width resolution, and the monomial calculus of bounded degree, can be&nbsp;[&hellip;]

---

Infinite Probabilistic Databases

Martin Grohe ; Peter Lindner.

Probabilistic databases (PDBs) model uncertainty in data in a quantitative way. In the established formal framework, probabilistic (relational) databases are finite probability spaces over relational database instances. This finiteness can clash with intuitive query behavior (Ceylan et al., KR&nbsp;[&hellip;]

---