Combining Symbolic Constraint Solvers on Algebraic Domains

  title={Combining Symbolic Constraint Solvers on Algebraic Domains},
  author={H{\'e}l{\`e}ne Kirchner and Christophe Ringeissen},
  journal={J. Symb. Comput.},
Abstract In the context of constraint logic programming and theorem proving, the development of constraint solvers on algebraic domains and their combination is of prime interest. As an example, a constraint solver in finite algebras is presented for a constraint language including for instance equations, disequations and inequations. By extending techniques used for the combination of unification in disjoint equational theories, we show how to combine constraint solvers on different algebraic… 
SoleX: A Domain-Independent Scheme for Constraint Solver Extension
A domain-independent scheme for extending constraint solvers with new function symbols, called SoleX, consists of a collaboration of elementary solvers that add and deduce information related to constraints involving new functions, complete the computation domain and purify constraints.
An Open Automated Framework for Constraint Solver Extension: the SoleX Approach
A domain-independent scheme to extend constraint solvers so that they can handle alien constraints, i.e., constraint involving new function symbols, which consists of a set of symbolic rule-based transformations.
On the Combination of Symbolic Constraints, Solution Domains, and Constraint Solvers
The paper introduces the notion of a “free amalgamated product” as a possible solution to the first problem of how to treat “mixed” constraints, and defines so-called simply-combinable structures (SC-structures), which contain many solution structures used in constraint logic programming.
Domain-Independent Constraint Solver Extension
SoleX is a mechanism for extending constraint solvers in order to handle new function symbols on the computation domain by building two kinds of rule-based transformations: domain independent rules for symbolically processing constraints with additional function symbols and rules for completing the information on the domain with the usual interpretation of these additional functions.
Combination of Constraint Solving Techniques: An Algebraic POint of View
This paper isolates an abstract algebraic property of free algebras—called combinability—that clarifies why the combination method applies to such algebraes, and introduces a new proof method that depends on abstract notions and results from universal algebra, as opposed to technical manipulations of terms.
Combination of Constraint Solvers for Free and Quasi-Free Structures
Rule-Based Constraint Programming
A view of constraint programming based on the notion of rewriting controlled by strategies allows us to describe in a unified way the constraint solving mechanism as well as the meta-language needed to manipulate the constraints.
Cooperation and coordination of constraint solvers
This work proposes a general scheme for the cooperation of constraint solvers and develops an open and flexible combination mechanism for constraint solver cooperation.
An Environment for Designing/Executing Constraint Solver Collaborations
  • É. Monfroy
  • Computer Science
    Electron. Notes Theor. Comput. Sci.
  • 1998
On the cooperation of the constraint domains ℋ, ℛ, and ℱ in CFLP
The computational model has been proved sound and complete w.r.t. the declarative semantics provided by the CFLP scheme, while the implemented system has been tested with a set of benchmarks and shown to behave quite efficiently in comparison to the closest related approach.


A Constraint Solver in Nite Algebras and Its Combination with Uniication Algorithms
A constraint solver in nite algebras is presented for a constraint language including equations, disequations and inequations on nite domains by taking advantage of the embedding of a nite algebra in a primal algebra that can be presented, up to an isomorphism, by an equational presentation.
Constraint Solving by Narrowing in Combined Algebraic Domains
The narrowing method reduces the goal solving problem in the whole theory to rewriting and constraint solving in an adequate combined theory and results in a combined solver for goals with constraints in theories deened by unconstrained equalities.
Unification in a Combination of Equational Theories with Shared Constants and its Application to Primal Algebras
A unification algorithm provides a symbolic constraint solver in the combination of algebraic structures whose finite domains of values are non disjoint and correspond to constants.
Deduction with symbolic constraints
A framework for first-order constrained deduction is proposed in this paper. The syntax and semantics of symbolic constraints and constrained formulae are defined. Constrained deduction rules are
Unification in Combinations of Collapse-Free Regular Theories
  • K. Yelick
  • Mathematics, Computer Science
    J. Symb. Comput.
  • 1987
Unification in Order-Sorted Algebras with Overloading
An algorithm for unification in the combination of a theory Th1 and one of its overloaded extensions Th2 in the order-sorted framework is presented, which needs a separated normal form as well as a complete set of normalizing substitutions.
Combination Techniques and Decision Problems for Disunification
The results can be used to show that the existential fragment of the theory of the (ground) term algebra modulo associativity of a finite number of function symbols is decidable; the same result follows for function symbols which are associative and commutative, or associative, commUTative and idempotent.
Rewrite Systems
  • N. Dershowitz, J. Jouannaud
  • Computer Science
    Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics
  • 1990
Unification in primal algebras, their powers and their varieties
The fact that the variety generated by a primal algebra coincides with the class of its subdirect powers is used, which yields unitary unification algorithms for the equational theories of Post algebras and p-rings.
Logic Programming over Polymorphically Order-Sorted Types
This thesis presents the foundations for relational logic programming over polymorphically order-sorted data types, which are obtained as canonical models of a class of speci cations in a suitable logic accommodating sort functions.