Expressiveness of restricted recursive queries

Authors:
F. Afrati;S. S. Cosmadakis
Affiliations:
National Technical University of Athens, Greece/ research performed while visiting the IBM T.J. Watson Research Center;IBM T.J. Watson Research Center
Venue:
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Year:
1989

Citing 21
Cited 20

On compiling queries in recursive first-order databases

Journal of the ACM (JACM)
Implementation of logical query languages for databases

ACM Transactions on Database Systems (TODS)
Relational queries computable in polynomial time

Information and Control
Data independent recursion in deductive databases

PODS '86 Proceedings of the fifth ACM SIGACT-SIGMOD symposium on Principles of database systems
Parallel evaluation of recursive rule queries

PODS '86 Proceedings of the fifth ACM SIGACT-SIGMOD symposium on Principles of database systems
An amateur's introduction to recursive query processing strategies

SIGMOD '86 Proceedings of the 1986 ACM SIGMOD international conference on Management of data
The parallel complexity of simple chain queries

PODS '87 Proceedings of the sixth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Bounds on the propagation of selection into logic programs

PODS '87 Proceedings of the sixth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
A decidable class of bounded recursions

PODS '87 Proceedings of the sixth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Languages that capture complexity classes

SIAM Journal on Computing
Computing with logic: logic programming with Prolog

Computing with logic: logic programming with Prolog
Logic programming and parallel complexity

Foundations of deductive databases and logic programming
Decidable optimization problems for database logic programs

STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Decidability and undecidability results for boundedness of linear recursive queries

Proceedings of the seventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Programming primitives for database languages

POPL '81 Proceedings of the 8th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Universality of data retrieval languages

POPL '79 Proceedings of the 6th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Introduction To Automata Theory, Languages, And Computation

Introduction To Automata Theory, Languages, And Computation
Logic and Data Bases

Logic and Data Bases
The complexity of relational query languages (Extended Abstract)

STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Optimal implementation of conjunctive queries in relational data bases

STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
Elementary induction on abstract structures (Studies in logic and the foundations of mathematics)

Elementary induction on abstract structures (Studies in logic and the foundations of mathematics)

Magic is relevant

SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
On Datalog vs. polynomial time (extended abstract)

PODS '91 Proceedings of the tenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
The expressiveness of a family of finite set languages

PODS '91 Proceedings of the tenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Datalog expressiveness of chain queries: grammar tools and characterizations

PODS '92 Proceedings of the eleventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Monotone monadic SNP and constraint satisfaction

STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Bonded arity Datalog (≠) queries on graphs

PODS '94 Proceedings of the thirteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
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
Rule-based languages

Annals of Mathematics and Artificial Intelligence
The expressiveness of DAC

Theoretical Computer Science
A Transformation Technique for Datalog Programs Based on Non-deterministic Constructs

LOPSTR '01 Selected papers from the 11th International Workshop on Logic Based Program Synthesis and Transformation
Linearisability on datalog programs

Theoretical Computer Science
Datalog programs and their persistency numbers

ACM Transactions on Computational Logic (TOCL)
Dualities for Constraint Satisfaction Problems

Complexity of Constraints
Universal algebra and hardness results for constraint satisfaction problems

Theoretical Computer Science
Undecidability and intractability results concerning datalog programs and their persistency numbers

ACM Transactions on Computational Logic (TOCL)
CSP duality and trees of bounded pathwidth

Theoretical Computer Science
Efficient rule-based inferencing for OWL EL

IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Three

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study the effect of various syntactic restrictions on the expressive power of database logic programs. We find natural examples of programs whichrequire recursively defined predicates of arbitrarily large width,require rules with arbitrarily many recursive calls, orrequire nonlinear rules, but can be evaluated in NC2.