Decidable optimization problems for database logic programs
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Expressiveness of restricted recursive queries
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Proof-tree transformation theorems and their applications
PODS '89 Proceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Linearising nonlinear recursions in polynomial time
PODS '89 Proceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
On the first-order expressibility of recursive queries
PODS '89 Proceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
PODS '91 Proceedings of the tenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
PODS '91 Proceedings of the tenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Detecting redundant tuples during query evaluation
PODS '91 Proceedings of the tenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
On the complexity of equivalence between recursive and nonrecursive Datalog programs
PODS '94 Proceedings of the thirteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
In memoriam Paris C. Kanellakis
ACM Computing Surveys (CSUR)
Polynomial-time program transformations in deductive databases
PODS '90 Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Graph-theoretic methods in database theory
PODS '90 Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
GraphLog: a visual formalism for real life recursion
PODS '90 Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Decidability and undecidability results for boundedness of linear recursive queries
Proceedings of the seventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Complexity and expressive power of logic programming
ACM Computing Surveys (CSUR)
On the Complexity of Single-Rule Datalog Queries
LPAR '99 Proceedings of the 6th International Conference on Logic Programming and Automated Reasoning
In Memoriam: Paris C. Kanellakis
PCK50 Proceedings of the Paris C. Kanellakis memorial workshop on Principles of computing & knowledge: Paris C. Kanellakis memorial workshop on the occasion of his 50th birthday
DATALOG SIRUPs uniform boundedness is undecidable
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
On the complexity of single-rule datalog queries
Information and Computation - Special issue: ICC '99
Coalgebraic semantics for parallel derivation strategies in logic programming
AMAST'10 Proceedings of the 13th international conference on Algebraic methodology and software technology
Exploiting Parallelism in Coalgebraic Logic Programming
Electronic Notes in Theoretical Computer Science (ENTCS)
| Hi-index | 0.01 |