Rule-Based Constraint Programming

Authors:
Claude Kirchner;Christophe Ringeissen
Affiliations:
LORIA - INRIA, 615 rue du Jardin Botanique, BP 101, 54602 Villers-lès-Nancy Cedex France. e-mail: Claude.Kirchner@loria.fr, Christophe.Ringeissen@loria.fr;(Correspd.) LORIA - INRIA, 615 rue du Jardin Botanique, BP 101, 54602 Villers-lès-Nancy Cedex France. e-mail: Claude.Kirchner@loria.fr, Christophe.Ringeissen@loria.fr
Venue:
Fundamenta Informaticae
Year:
1998

Citing 22
Cited 0

Unification in combinations of collapse-free regular theories

Journal of Symbolic Computation
Constraint logic programming

POPL '87 Proceedings of the 14th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Opening the AC-unification race

Journal of Automated Reasoning
Rewrite systems

Handbook of theoretical computer science (vol. B)
Conditional rewriting logic as a unified model of concurrency

Selected papers of the Second Workshop on Concurrency and compositionality
Combining matching algorithms: The regular case

Journal of Symbolic Computation
AC-unification race: the system solving approach, implementation and benchmarks

Journal of Symbolic Computation
Concurrent constraint programming

Concurrent constraint programming
Combining unification algorithms

Journal of Symbolic Computation
Combining symbolic constraint solvers on algebraic domains

Journal of Symbolic Computation
Combining decision algorithms for matching in the union of disjoint equational theories

Information and Computation
Unification in the union of disjoint equational theories: combining decision procedures

Journal of Symbolic Computation
A Unification Algorithm for Associative-Commutative Functions

Journal of the ACM (JACM)
Simplification by Cooperating Decision Procedures

ACM Transactions on Programming Languages and Systems (TOPLAS)
An Efficient Unification Algorithm

ACM Transactions on Programming Languages and Systems (TOPLAS)
A Methodological View of Constraint Solving

Constraints
A Compiler for Nondeterministic Term Rewriting Systems

RTA '96 Proceedings of the 7th International Conference on Rewriting Techniques and Applications
On the Combination of Symbolic Constraints, Solution Domains, and Constraint Solvers

CP '95 Proceedings of the First International Conference on Principles and Practice of Constraint Programming
Toward the Concurrent Implementation of Computational Systems

ALP '96 Proceedings of the 5th International Conference on Algebraic and Logic Programming
"Syntactic" AC-Unification

CCL '94 Proceedings of the First International Conference on Constraints in Computational Logics
A complete unification algorithm for associative-commutative functions

IJCAI'75 Proceedings of the 4th international joint conference on Artificial intelligence - Volume 1
Compilation techniques for associative-commutative normalisation

Algebraic'97 Proceedings of the 2nd international conference on Theory and Practice of Algebraic Specifications

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we present a view of constraint programming based on the notion of rewriting controlled by strategies. We argue that this concept allows us to describe in a unified way the constraint solving mechanism as well as the meta-language needed to manipulate the constraints. This has the advantage to provide descriptions that are very close to the proof theoretical setting used now to describe constraint manipulations like unification or numerical constraint solving. We examplify the approach by presenting examples of constraint solvers descriptions and combinations written in the ELAN language.