Theory of linear and integer programming
Theory of linear and integer programming
Journal of Symbolic Computation
POPL '87 Proceedings of the 14th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Constraint satisfaction in logic programming
Constraint satisfaction in logic programming
Communications of the ACM
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
The CLP( R ) language and system
ACM Transactions on Programming Languages and Systems (TOPLAS)
Abstract interpretation and application to logic programs
Journal of Logic Programming
Proving termination properties of Prolog programs: a semantic approach
Journal of Logic Programming
Strong termination of logic programs
Journal of Logic Programming
Cost analysis of logic programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
Analysis of nonlinear constraints in CLP( R )
ICLP'93 Proceedings of the tenth international conference on logic programming on Logic programming
RISC-CLP (real): logic programming with non-linear constraints over the reals
Constraint logic programming
A grammatical view of logic programming
A grammatical view of logic programming
Reasoning about termination of pure Prolog programs
Information and Computation
Norms on terms and their use in proving universal termination of a logic program
Theoretical Computer Science
Negation and constraint logic programming
Information and Computation
Modular termination proofs for logic and pure PROLOG programs
Advances in logic programming theory
From logic programming to Prolog
From logic programming to Prolog
Avoiding slack variables in the solving of linear diophantine equations and inequations
Theoretical Computer Science - Special issue: principles and practice of constraint programming
Termination analysis: some practical properties of the norm and level mapping space
JICSLP'98 Proceedings of the 1998 joint international conference and symposium on Logic programming
Constraint-based termination analysis of logic programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
Type dependencies for logic programs using ACI-unification
Theoretical Computer Science
Proving termination of input-consuming logic programs
Proceedings of the 1999 international conference on Logic programming
Bounded nondeterminism of logic programs
Proceedings of the 1999 international conference on Logic programming
Abstracting numeric constraints with Boolean functions
Information Processing Letters
∃ -Universal termination of logic programs
Theoretical Computer Science
Automatic discovery of linear restraints among variables of a program
POPL '78 Proceedings of the 5th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
POPL '77 Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Toupie: The µ-calculus over Finite Domains as a Constraint Language
Journal of Automated Reasoning
Termination of Constraint Logic Programs
ICALP '97 Proceedings of the 24th International Colloquium on Automata, Languages and Programming
Generating Efficient, Terminating Logic Programs
TAPSOFT '97 Proceedings of the 7th International Joint Conference CAAP/FASE on Theory and Practice of Software Development
Proving Termination of Logic Programs by Transforming them into Equivalent Term Rewriting Systems
Proceedings of the 13th Conference on Foundations of Software Technology and Theoretical Computer Science
Inferring Argument Size Relationships with CLP(R)
LOPSTR '96 Proceedings of the 6th International Workshop on Logic Programming Synthesis and Transformation
STAN: A Static Analyzer for CLP(R) Based on Abstract Interpretation
SAS '96 Proceedings of the Third International Symposium on Static Analysis
Termination Analysis for Mercury
SAS '97 Proceedings of the 4th International Symposium on Static Analysis
On Termination of Constraint Logic Programs
CP '95 Proceedings of the First International Conference on Principles and Practice of Constraint Programming
CP '99 Proceedings of the 5th International Conference on Principles and Practice of Constraint Programming
Logic Programs as term Rewriting Systems
ALP '94 Proceedings of the 4th International Conference on Algebraic and Logic Programming
TermiLog: A System for Checking Termination of Queries to Logic Programs
CAV '97 Proceedings of the 9th International Conference on Computer Aided Verification
On modular termination proofs of general logic programs
Theory and Practice of Logic Programming
Classes of terminating logic programs
Theory and Practice of Logic Programming
A backward analysis for constraint logic programs
Theory and Practice of Logic Programming
Practical methods for proving termination of general logic programs
Journal of Artificial Intelligence Research
Inference of termination conditions for numerical loops in Prolog
Theory and Practice of Logic Programming
On termination of meta-programs
Theory and Practice of Logic Programming
Termination of Floating-Point Computations
Journal of Automated Reasoning
Control Generation by Program Transformation
Fundamenta Informaticae - Program Transformation: Theoretical Foundations and Basic Techniques. Part 2
Inferring non-suspension conditions for logic programs with dynamic scheduling
ACM Transactions on Computational Logic (TOCL)
A non-termination criterion for binary constraint logic programs
Theory and Practice of Logic Programming
Automated termination proofs for logic programs by term rewriting
ACM Transactions on Computational Logic (TOCL)
ACM Transactions on Programming Languages and Systems (TOPLAS)
Automated termination analysis for logic programs by term rewriting
LOPSTR'06 Proceedings of the 16th international conference on Logic-based program synthesis and transformation
A 25-year perspective on logic programming
Input-termination of logic programs
LOPSTR'04 Proceedings of the 14th international conference on Logic Based Program Synthesis and Transformation
On termination of binary CLP programs
LOPSTR'04 Proceedings of the 14th international conference on Logic Based Program Synthesis and Transformation
Probabilistic termination of CHRiSM programs
LOPSTR'11 Proceedings of the 21st international conference on Logic-Based Program Synthesis and Transformation
Control Generation by Program Transformation
Fundamenta Informaticae - Program Transformation: Theoretical Foundations and Basic Techniques. Part 2
| Hi-index | 0.00 |
The Constraint Logic Programming (CLP) Scheme merges logic programming with constraint solving over predefined domains. In this article, we study proof methods for universal left termination of constraint logic programs. We provide a sound and complete characterization of left termination for ideal CLP languages which generalizes acceptability of logic programs. The characterization is then refined to the notion of partial acceptability, which is well suited for automatic modular inference. We describe a theoretical framework for automation of the approach, which is implemented. For nonideal CLP languages and without any assumption on their incomplete constraint solvers, even the most basic sound termination criterion from logic programming does not lift. We focus on a specific system, namely CLP(R), by proposing some additional conditions that make (partial) acceptability sound.