Foundations of logic programming
Foundations of logic programming
Programming in Prolog (2nd ed.)
Programming in Prolog (2nd ed.)
Implementation of logical query languages for databases
ACM Transactions on Database Systems (TODS)
A problem-oriented inferential database system
ACM Transactions on Database Systems (TODS)
A basis for deductive database systems. II
Journal of Logic Programming
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
Decidability and expressiveness aspects of logic queries
PODS '87 Proceedings of the sixth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
PODS '87 Proceedings of the sixth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Safety of recursive Horn clauses with infinite relations
PODS '87 Proceedings of the sixth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Principles of artificial intelligence
Principles of artificial intelligence
Performance evaluation of data intensive logic programs
Foundations of deductive databases and logic programming
An Efficient Unification Algorithm
ACM Transactions on Programming Languages and Systems (TOPLAS)
Implementation of PROLOG
Principles of Database Systems
Principles of Database Systems
Symbolic Logic and Mechanical Theorem Proving
Symbolic Logic and Mechanical Theorem Proving
Universality of data retrieval languages
POPL '79 Proceedings of the 6th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
An enhanced inference mechanism for generating relational algebra queries
PODS '84 Proceedings of the 3rd ACM SIGACT-SIGMOD symposium on Principles of database systems
Proceedings of the Third International Conference on Data Engineering
Implementing Logic Programs as a Database System
Proceedings of the Third International Conference on Data Engineering
Moving Selections into Linear Least Fixpoint Queries
Proceedings of the Fourth International Conference on Data Engineering
Filtering Data Flow in Deductive Databases
ICDT '86 Proceedings of the International Conference on Database Theory
Retrieval-By-Unification Operation on a Relational Knowledge Base
VLDB '86 Proceedings of the 12th International Conference on Very Large Data Bases
Magic Functions: A Technique to Optimize Extended Datalog Recursive Programs
VLDB '87 Proceedings of the 13th International Conference on Very Large Data Bases
Theory of Relational Databases
Theory of Relational Databases
A framework for testing safety and effective computability of extended datalog
SIGMOD '88 Proceedings of the 1988 ACM SIGMOD international conference on Management of data
On the power of Alexander templates
PODS '89 Proceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Safety of datalog queries over infinite databases
PODS '89 Proceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
On compile-time query optimization in deductive databases by means of static filtering
ACM Transactions on Database Systems (TODS)
POPL '90 Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Inference of inequality constraints in logic programs (extended abstracts)
PODS '91 Proceedings of the tenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
On the decidability and axiomatization of query finiteness in deductive databases
Journal of the ACM (JACM)
An axiomatic approach to deciding query safety in deductive databases
Proceedings of the seventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
SAC '94 Proceedings of the 1994 ACM symposium on Applied computing
Programming in autoepistemic logic
IJCAI'91 Proceedings of the 12th international joint conference on Artificial intelligence - Volume 2
Hi-index | 0.00 |
It is shown how Horn logic programs can be implemented using database techniques, namely, mostly bottom-up in combination with certain top-down elements (as opposed to the top-down implementations of logic programs prevailing so far). The proposed method is sound and complete. It easily lends itself to a parallel implementation and is free of nonlogical features like backtracking. As an extension to the common approach to deductive databases, function symbols are allowed to appear in programs, and it is shown that much of database query optimization can be applied to optimize logic programs. An important advantage of present approach is its ability to evaluate successfully many programs that terminate under neither pure top-down nor bottom-up evaluation strategies.