Inherent complexity of recursive queries

Magic sets and other strange ways to implement logic programs (extended abstract)

PODS '86 Proceedings of the fifth ACM SIGACT-SIGMOD symposium on Principles of database systems

Principles of database and knowledge-base systems, Vol. I

Principles of database and knowledge-base systems, Vol. I

The generalized counting method for recursive logic queries

Theoretical Computer Science - First International Conference on Database Theory, Rome, September 1986

Expressiveness of restricted recursive queries

STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing

Inductive pebble games and the expressive power of datalog

PODS '89 Proceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems

On the power of magic

Journal of Logic Programming

Bounds on the propagation of selection into logic programs

Journal of Computer and System Sciences

The parallel complexity of simple logic programs

Journal of the ACM (JACM)

Datalog vs first-order logic

Proceedings of the 30th IEEE symposium on Foundations of computer science

On the expressive power of Datalog: tools and a case study

Selected papers of the 9th annual ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems

On Datalog vs. polynomial time

Journal of Computer and System Sciences

Bounded arity Datalog ( ≠ ) queries on graphs

Journal of Computer and System Sciences - Special issue on principles of database systems

Universality of data retrieval languages

POPL '79 Proceedings of the 6th ACM SIGACT-SIGPLAN symposium on Principles of programming languages

Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness

Tree Canonization and Transtive Closure

LICS '95 Proceedings of the 10th Annual IEEE Symposium on Logic in Computer Science