Combining symbolic constraint solvers on algebraic domains

DOI10.1006/jsco.1994.1040zbMath0819.68111OpenAlexW1966865798MaRDI QIDQ1338341

Hélène Kirchner, Christophe Ringeissen

Publication date: 18 December 1994

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/dc6ba4cad8a34a900937bb21f2814d7e715e2766

zbMATH Keywords

constraint logic programmingunification algorithmsconstraint solver

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Logic programming (68N17)

Related Items (12)

Rewriting logic: Roadmap and bibliography ⋮ Combination of constraint solving techniques: An algebraic point of view ⋮ On the cooperation of the constraint domains ℋ, ℛ, and ℱ in CFLP ⋮ Rewriting modulo SMT and open system analysis ⋮ Combination of constraint solvers for free and quasi-free structures ⋮ Twenty years of rewriting logic ⋮ Deciding the word problem in the union of equational theories. ⋮ Unification algorithms cannot be combined in polynomial time ⋮ Generalized rewrite theories, coherence completion, and symbolic methods ⋮ A New approach for combining decision procedures for the word problem, and its connection to the Nelson-Oppen combination method ⋮ Unions of non-disjoint theories and combinations of satisfiability procedures ⋮ Unification algorithms cannot be combined in polynomial time.

This page was built for publication: Combining symbolic constraint solvers on algebraic domains