A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is
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 nite algebras is presented for a constraint language including for instance equations, disequations and inequations. By extending techniques used for the combination of uni cation in disjoint equational theories, we show how to combine constraint solvers on di erent algebraic domains thatdoi:10.1006/jsco.1994.1040 fatcat:p5wmq3jefrcxzp3gydfz7x6vvq