A Proof Procedure for Data Dependencies
Journal of the ACM (JACM)
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)
On the implementation of a simple class of logic queries for databases
PODS '86 Proceedings of the fifth ACM SIGACT-SIGMOD symposium on Principles of database systems
A problem-oriented inferential database system
ACM Transactions on Database Systems (TODS)
Equivalences of logic programs
Proceedings on Third international conference on 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
Parallel evaluation of recursive rule queries
PODS '86 Proceedings of the fifth ACM SIGACT-SIGMOD symposium on Principles of database systems
Filtering data flow in deductive databases
Proceedings on International conference on database theory
An amateur's introduction to recursive query processing strategies
SIGMOD '86 Proceedings of the 1986 ACM SIGMOD international conference on Management of data
A message passing framework for logical query evaluation
SIGMOD '86 Proceedings of the 1986 ACM SIGMOD international conference on Management of data
Exploiting constraints in design synthesis
Exploiting constraints in design synthesis
Towards a theory of declarative knowledge
Foundations of deductive databases and logic programming
Determining View dependencies using tableaux
ACM Transactions on Database Systems (TODS)
Testing implications of data dependencies
ACM Transactions on Database Systems (TODS)
The Semantics of Predicate Logic as a Programming Language
Journal of the ACM (JACM)
Equivalences Among Relational Expressions with the Union and Difference Operators
Journal of the ACM (JACM)
Horn clauses and database dependencies
Journal of the ACM (JACM)
Logic and Data Bases
Optimal implementation of conjunctive queries in relational data bases
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
Query optimization by semantic reasoning
Query optimization by semantic reasoning
Database theory—past and future
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
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
Handling redundancy in the processing of recursive database queries
SIGMOD '87 Proceedings of the 1987 ACM SIGMOD international conference on Management of data
Data functions, datalog and negation
SIGMOD '88 Proceedings of the 1988 ACM SIGMOD international conference on Management of data
Minimizing function-free recursive inference rules
Journal of the ACM (JACM)
On distributed processibility of datalog queries by decomposing databases
SIGMOD '89 Proceedings of the 1989 ACM SIGMOD international conference on Management of data
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
Why a single parallelization strategy is not enough in knowledge bases
PODS '89 Proceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Fully abstract compositional semantics for logic programs
POPL '89 Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
On compile-time query optimization in deductive databases by means of static filtering
ACM Transactions on Database Systems (TODS)
Argument reduction by factoring
VLDB '89 Proceedings of the 15th international conference on Very large data bases
Necessary and sufficient conditions to linearize doubly recursive programs in logic databases
ACM Transactions on Database Systems (TODS)
Hard problems for simple logic programs
SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
Towards an algebraic theory of recursion
Journal of the ACM (JACM)
Detecting redundant tuples during query evaluation
PODS '91 Proceedings of the tenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Independence of logic database queries and update
PODS '90 Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Non-deterministic languages to express deterministic transformations
PODS '90 Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Proceedings of the seventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
What You Always Wanted to Know About Datalog (And Never Dared to Ask)
IEEE Transactions on Knowledge and Data Engineering
IEEE Transactions on Knowledge and Data Engineering
Efficient Query Processing for a Subset of Linear Recursive Binary Rules
IEEE Transactions on Knowledge and Data Engineering
Generalization of ZYT-linearizability for bilinear datalog programs
Information and Computation
A type discipline for authorization policies
ACM Transactions on Programming Languages and Systems (TOPLAS) - Special Issue ESOP'05
Achieving compositionality of the stable model semantics for smodels programs1
Theory and Practice of Logic Programming
Modular Equivalence for Normal Logic Programs
Proceedings of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy
Using datalog with binary decision diagrams for program analysis
APLAS'05 Proceedings of the Third Asian conference on Programming Languages and Systems
Query patterns for existential rules
RR'12 Proceedings of the 6th international conference on Web Reasoning and Rule Systems
Hi-index | 0.01 |
Datalog programs, i.e., Prolog programs without function symbols, are considered It is assumed that a variable appearing in the head of a rule must also appear in the body of the rule. The input of a program is a set of ground atoms (which are given in addition to the program's rules) and, therefore, can be viewed as an assignment of relations to some of the program's predicates. Two programs are equivalent if they produce the same result for all possible assignments of relations to the extensional predicates (i.e., the predicates that do not appear as heads of rules). Two programs are uniformly equivalent if they produce the same result for all possible assignments of initial relations to all the predicates (i.e., both extensional and intentional). The equivalence problem for Datalog programs is known to be undecidable. It is shown that uniform equivalence is decidable, and an algorithm is given for minimizing a Datalog program under uniform equivalence. A technique for removing parts of a program that are redundant under equivalence (but not under uniform equivalence) is developed. A procedure for testing uniform equivalence is also developed for the case in which the database satisfies some constraints.