Implementation of logical query languages for databases
ACM Transactions on Database Systems (TODS)
Design overview of the NAIL] system
Proceedings on Third international conference on logic programming
An amateur's introduction to recursive query processing strategies
SIGMOD '86 Proceedings of the 1986 ACM SIGMOD international conference on Management of data
Combinatorial optimization: algorithms and complexity
Combinatorial optimization: algorithms and complexity
The Semantics of Predicate Logic as a Programming Language
Journal of the ACM (JACM)
Proving termination with multiset orderings
Communications of the ACM
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
LDL: A Logic-Based Data Language
VLDB '86 Proceedings of the 12th International Conference on Very Large Data Bases
A polynomial time algorithm for solving systems of linear inequalities with two variables per inequality
Complexity of a top-down capture rule
Complexity of a top-down capture rule
On the power of Alexander templates
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
On compile-time query optimization in deductive databases by means of static filtering
ACM Transactions on Database Systems (TODS)
Termination detection in logic programs using argument sizes (extended abstract)
PODS '91 Proceedings of the tenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
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
Cost analysis of logic programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
Constraints among argument sizes in logic programs (extended abstract)
PODS '94 Proceedings of the thirteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Deriving constraints among argument sizes in logic programs (extended abstract)
PODS '90 Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
PEPM '00 Proceedings of the 2000 ACM SIGPLAN workshop on Partial evaluation and semantics-based program manipulation
Constraint-based termination analysis of logic programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
Higher-Order and Symbolic Computation
Inference of monotonicity constraints in Datalog programs
Annals of Mathematics and Artificial Intelligence
Termination of Nested and Mutually Recursive Algorithms
Journal of Automated Reasoning
Induction Proofs with Partial Functions
Journal of Automated Reasoning
Dependent Types for Program Termination Verification
Higher-Order and Symbolic Computation
IEEE Transactions on Knowledge and Data Engineering
Deriving Pre-conditions for Array Bound Check Elimination
PADO '01 Proceedings of the Second Symposium on Programs as Data Objects
Acceptability with General Orderings
Computational Logic: Logic Programming and Beyond, Essays in Honour of Robert A. Kowalski, Part I
LOPSTR '01 Selected papers from the 11th International Workshop on Logic Based Program Synthesis and Transformation
Applying Static Analysis Techniques for Inferring Termination Conditions of Logic Programs
SAS '01 Proceedings of the 8th International Symposium on Static Analysis
A dynamic approach to characterizing termination of general logic programs
ACM Transactions on Computational Logic (TOCL)
A Graph-Based Approach for Timing Analysis and Refinement of OPS5 Knowledge-Based Systems
IEEE Transactions on Knowledge and Data Engineering
Inference of termination conditions for numerical loops in Prolog
Theory and Practice of Logic Programming
Termination of Floating-Point Computations
Journal of Automated Reasoning
Size-change termination with difference constraints
ACM Transactions on Programming Languages and Systems (TOPLAS)
A termination analyzer for Java bytecode based on path-length
ACM Transactions on Programming Languages and Systems (TOPLAS)
| Hi-index | 0.00 |
Considered is the question of whether top-down (Prolog-like) evaluation of a set of logical rules can be guaranteed to terminate. The NAIL! system is designed to process programs consisting of logical rules and to select, for each fragment of the program, the best from among many possible strategies for its evaluation. In the context of such a system, it is essential that termination tests be fast. Thus, the “uniqueness” property of logical rules is introduced. This property is satisfied by many of the common examples of rules and is easily recognized. For rules with this property, a set of inequalities, whose satisfaction is sufficient for termination of the rules, can be generated in polynomial time. Then a polynomial test for satisfaction of constraints generated by this process is given.