Combining Symbolic Constraint Solvers on Algebraic Domains (1994)
| Venue: | Journal of Symbolic Computation |
| Citations: | 27 - 7 self |
BibTeX
@ARTICLE{Kirchner94combiningsymbolic,
author = {Helene Kirchner and Christophe Ringeissen},
title = {Combining Symbolic Constraint Solvers on Algebraic Domains},
journal = {Journal of Symbolic Computation},
year = {1994},
volume = {18},
pages = {18--2}
}
OpenURL
Abstract
ion An atomic constraint p ? (t 1 ; : : : ; t m ) is decomposed into a conjunction of pure atomic constraints by introducing new equations of the form (x = ? t), where t is an alien subterm in the constraint and x is a variable that does not appear in p ? (t 1 ; : : : ; t m ). This is formalized thanks to the notion of abstraction. Definition 4.2. Let T be a set of terms such that 8t 2 T ; 8u 2 X [ SC; t 6= E1[E2 u: A variable abstraction of the set of terms T is a surjective mapping \Pi from T to a set of variables included in X such that 8s; t 2 T ; \Pi(s) = \Pi(t) if and only if s =E1[E2 t: \Pi \Gamma1 denotes any substitution (with possibly infinite domain) such that \Pi(\Pi \Gamma1 (x)) = x for any variable x in the range of \Pi. It is important to note that building a variable abstraction relies on the decidability of E 1 [ E 2 -equality in order to abstract equal alien subterms by the same variable. Let T = fu #R j u 2 T (F [ X ) and u #R2 T (F [ X )n(X [ SC)g...







