H'el`ene Kirchner and Christophe Ringeissen. Combining symbolic constraint solvers on algebraic domains. Journal of Symbolic Computation, 18(2):113-- 155, 1994.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....be combined in the case of disjoint signatures (independently of where these decision procedures come from) that is, if E 1 and E 2 are equational theories over disjoint signatures, and both have a decidable word problem, then E 1 [ E 2 has a decidable word problem as well. This was shown in [14, 13, 9, 3]. Surprisingly, this combination result does not appear to be widely known, possibly because it was obtained and presented as a side result of the research on combining matching and unification algorithms. As a matter of fact, although the result in principle follows from a technical lemma in ....

....does not appear to be widely known, possibly because it was obtained and presented as a side result of the research on combining matching and unification algorithms. As a matter of fact, although the result in principle follows from a technical lemma in [14] it is not explicitly stated there; in [13, 3] it is stated as a corollary, but not mentioned in the abstract or the introduction; only [9] explicitly refers to the result in the abstract. The combination methods used in these articles are essentially identical, the main differences lying in the proofs of correctness. They all directly ....

[Article contains additional citation context not shown here]

H'el`ene Kirchner and Christophe Ringeissen. Combining symbolic constraint solvers on algebraic domains. Journal of Symbolic Computation, 18(2):113--155, 1994.

....and solvers have to satisfy more or less stringent conditions to be meaningfully combinable. 1. 1 Related Work Most of the current work on combination has been restricted to the Unification Problem and derivates (disunification, matching, and so on) BS92, BS93, Bou90, Bou93, DKR94, Her86, KR94a, KR94b, Rin92, SS88, SS89, Tid86, Yel87b, Yel87a] In essence, in this context the input language is restricted to quantifier free formulas over a functional signature (no predicate symbols other than equality) the constraint theories to be combined are equational theories typically with ....

H'el`ene Kirchner and Christophe Ringeissen. Combining symbolic constraint solvers on algebraic domains. Journal of Symbolic Computation, 18(2):113--155, 1994.

....to some adopted notion of satis ability. 3 1. 1 Previous Work Most of the current work on the combination of constraints reasoners regards the combination of solvers for equational constraints, in particular, algorithms for E uni cation and related problems [BS95b, Bou93, DKR94, Her86, KR94a, KR94b, Rin92, SS89] In this context, the constraint language is restricted to quanti erfree formulae over a functional signature (no predicate symbols other than equality) each component constraint domain is axiomatized by an equational theory and the combined domain is axiomatized by the ....

Helene Kirchner and Christophe Ringeissen. Combining symbolic constraint solvers on algebraic domains. Journal of Symbolic Computation, 18(2):113-155, 1994.

No context found.

H'el`ene Kirchner and Christophe Ringeissen. Combining symbolic constraint solvers on algebraic domains. Journal of Symbolic Computation, 18(2):113-- 155, 1994.

No context found.

KR94. Helene Kirchner and Christophe Ringeissen. Combining symbolic constraint solvers on algebraic domains. Journal of Symbolic Computation, 18(2):113-155, 1994.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC