Implementation of logical query languages for databases
ACM Transactions on Database Systems (TODS)
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
Convergence of sideways query evaluation
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
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 and correct translation of relational calculus formulas
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
SYGRAF: Implementing Logic Programs in a Database Style
IEEE Transactions on Software Engineering
Performance evaluation of data intensive logic programs
Foundations of deductive databases and logic programming
Invited talk: automata theory for database theoreticians
PODS '89 Proceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
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
Inference of monotonicity constraints in datalog programs
PODS '89 Proceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Towards an open architecture for LDL
VLDB '89 Proceedings of the 15th international conference on Very large data bases
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
Static analysis techniques for predicting the behavior of active database rules
ACM Transactions on Database Systems (TODS)
Space optimization in deductive databases
ACM Transactions on Database Systems (TODS)
Inference of monotonicity constraints in Datalog programs
Annals of Mathematics and Artificial Intelligence
IEEE Transactions on Knowledge and Data Engineering
Constraint-Based Query Evaluation in Deductive Databases
IEEE Transactions on Knowledge and Data Engineering
Chain-Split Evaluation in Deductive Databases
IEEE Transactions on Knowledge and Data Engineering
Towards a Real Horn Clause Language
VLDB '88 Proceedings of the 14th International Conference on Very Large Data Bases
Declarative semantics for active rules
Theory and Practice of Logic Programming
The design and implementation of a declarative sensor network system
Proceedings of the 5th international conference on Embedded networked sensor systems
Datalog programs over infinite databases, revisited
DBPL'07 Proceedings of the 11th international conference on Database programming languages
| Hi-index | 0.00 |
This paper presents a methodology for testing a general logic program containing function symbols and built-in predicates for safety and effective computability. Safety is the property that the set of answers for a given query is finite. A related issues is whether the evaluation strategy can effectively compute all answers and terminate. We consider these problems under the assumption that queries are evaluated using a bottom-up fixpoint computation. We also approximate the use of function symbols by considering Datalog programs with infinite base relations over which finiteness constraints and monotonicity constraints are considered. One of the main results of this paper is a recursive algorithm, check_clique, to test the safety and effective computability of predicates in arbitrarily complex cliques. This algorithm takes certain procedures as parameters, and its applicability can be strengthened by making these procedures more sophisticated. We specify the properties required of these procedures precisely, and present a formal proof of correctness for algorithm check_clique. This work provides a framework for testing safety and effective computability of recursive programs, and is based on a clique by clique analysis. The results reported here form the basis of the safety testing for the LDL language, being implemented at MCC.