Relational queries computable in polynomial time
Information and Control
Parallel evaluation of recursive rule queries
PODS '86 Proceedings of the fifth ACM SIGACT-SIGMOD symposium on Principles of database systems
Elements of the Theory of Computation
Elements of the Theory of Computation
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
The complexity of relational query languages (Extended Abstract)
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Perspectives on database theory
ACM SIGACT News
Inherent complexity of recursive queries
PODS '99 Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Complexity and expressive power of logic programming
ACM Computing Surveys (CSUR)
The Branching-Time Transformation Technique for Chain Datalog Programs
Journal of Intelligent Information Systems
On the Complexity of Single-Rule Datalog Queries
LPAR '99 Proceedings of the 6th International Conference on Logic Programming and Automated Reasoning
On the complexity of single-rule datalog queries
Information and Computation - Special issue: ICC '99
Linearisability on datalog programs
Theoretical Computer Science
Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
| Hi-index | 0.01 |
We consider logic programs with a single recursive rules, whose right-hand side consists of binary relations forming a chain. We give a complete characterization of all programs of this form that are computable in NC (assuming that P ≠ ). Our proof uses ideas from automata and language theory, and the combinatorics of strings.