Relational queries computable in polynomial time
Information and Control
The expressive power of finitely many generalized quantifiers
Information and Computation
Foundations of Databases: The Logical Level
Foundations of Databases: The Logical Level
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Fixed-Point Logics on Planar Graphs
LICS '98 Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science
The complexity of relational query languages (Extended Abstract)
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
From polynomial time queries to graph structure theory
Proceedings of the 13th International Conference on Database Theory
Fixed-point definability and polynomial time
CSL'09/EACSL'09 Proceedings of the 23rd CSL international conference and 18th EACSL Annual conference on Computer science logic
On p-optimal proof systems and logics for PTIME
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II
Database theory: query languages
Algorithms and theory of computation handbook
On slicewise monotone parameterized problems and optimal proof systems for TAUT
CSL'10/EACSL'10 Proceedings of the 24th international conference/19th annual conference on Computer science logic
On complete problems, relativizations and logics for complexity classes
Fields of logic and computation
A logic for PTIME and a parameterized halting problem
Fields of logic and computation
From Almost Optimal Algorithms to Logics for Complexity Classes via Listings and a Halting Problem
Journal of the ACM (JACM)
A parameterized halting problem
The Multivariate Algorithmic Revolution and Beyond
Hi-index | 0.00 |
The existence of a language expressing precisely the PTIME queries on arbitrary structures remains the central open problem in the theory of database query languages. As it turns out, two variants of this question have been formulated. Surprisingly, despite the importance of the problem, the relationship between these variants has not been systematically explored. A first contribution of the present paper is to revisit the basic definitions and clarify the connection between these two variants. We then investigate two relaxations to the original problem that appear as tempting alternatives in the absence of a language for the PTIME queries. The first consists in trying to express the PTIME queries using a richer language that can also express queries beyond PTIME, but for which there exists a query processor evaluating all PTIME queries in PTIME. The second approach, studied by many researchers, is to focus on PTIME properties on restricted sets of graphs. Our results are mostly negative, and point out limitations to both approaches. Finally, we turn to a natural class of languages that we call finitely generated, whose syntax is obtained by applying a fixed set of constructors to a given set of building blocks. We identify a broad class of such languages that cannot express all the PTIME queries.