Proving Termination of Constraint Solver Programs

Authors:
Thom W. Frühwirth
Affiliations:
-
Venue:
Selected papers from the Joint ERCIM/Compulog Net Workshop on New Trends in Contraints
Year:
1999

Citing 14
Cited 10

The complexity of some polynomial network consistency algorithms for constraint satisfaction problems

Artificial Intelligence
Termination of rewriting

Journal of Symbolic Computation
Constraint satisfaction using constraint logic programming

Artificial Intelligence - Special volume on constraint-based reasoning
Strong termination of logic programs

Journal of Logic Programming
Proving termination of GHC programs

New Generation Computing
Term rewriting and all that

Term rewriting and all that
Confluence and Semantics of Constraint Simplification Rules

Constraints
A Methodological View of Constraint Solving

Constraints
Placing Base Stations in Wireless Indoor Communication Networks

IEEE Intelligent Systems
Termination of Constraint Logic Programs

ICALP '97 Proceedings of the 24th International Colloquium on Automata, Languages and Programming
Linear Constraint Solving in CLP-Languages

Selected Papers from Constraint Programming: Basics and Trends
On Termination of Constraint Logic Programs

CP '95 Proceedings of the First International Conference on Principles and Practice of Constraint Programming
Operational Equivalence of CHR Programs and Constraints

CP '99 Proceedings of the 5th International Conference on Principles and Practice of Constraint Programming
A scheme for integrating concrete domains into concept languages

IJCAI'91 Proceedings of the 12th international joint conference on Artificial intelligence - Volume 1

Towards Inductive Constraint Solving

CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
Using confluence to generate rule-based constraint solvers

Proceedings of the 3rd ACM SIGPLAN international conference on Principles and practice of declarative programming
Termination of Floating-Point Computations

Journal of Automated Reasoning
Termination Analysis of CHR Revisited

ICLP '08 Proceedings of the 24th International Conference on Logic Programming
Welcome to Constraint Handling Rules

Constraint Handling Rules
Constructing Rule-Based Solvers for Intentionally-Defined Constraints

Constraint Handling Rules
Automating Termination Proofs for CHR

ICLP '09 Proceedings of the 25th International Conference on Logic Programming
Research Summary: Termination of CHR

ICLP '09 Proceedings of the 25th International Conference on Logic Programming
Analysing graph transformation systems through constraint handling rules

Theory and Practice of Logic Programming
Probabilistic termination of CHRiSM programs

LOPSTR'11 Proceedings of the 21st international conference on Logic-Based Program Synthesis and Transformation

Quantified Score

Hi-index	0.00

Visualization

Abstract

We adapt and extend existing approaches to termination in rule-based languages (logic programming and rewriting systems) to prove termination of actually implemented CHR constraint solvers. CHR (Constraint Handling Rules) are a declarative language especially designed for writing constraint solvers. CHR are a concurrent constraint logic programming language consisting of multi-headed guarded rules that rewrite constraints into simpler ones until they are solved. The approach allows to prove termination of many constraint solvers, from Boolean and arithmetic to terminological and path-consistent constraints. Because of multi-heads, our termination orders must consider conjunctions, while atomic formulas suffice in usual approaches. Our results indicate that in practice, proving termination for concurrent constraint logic programs may not be harder than for other classes of logic programming languages, contrary to what has been feared in the literature.