Combination of constraint solvers for free and quasi-free structures
- 10 February 1998
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 192 (1) , 107-161
- https://doi.org/10.1016/s0304-3975(97)00147-3
Abstract
No abstract availableKeywords
This publication has 27 references indexed in Scilit:
- How to win a game with featuresPublished by Springer Nature ,2005
- Unification in a combination of equational theories with shared constants and its application to primal algebrasPublished by Springer Nature ,2005
- Records for logic programmingThe Journal of Logic Programming, 1994
- Universal domains and the amalgamation propertyMathematical Structures in Computer Science, 1993
- Generalized varietiesAlgebra universalis, 1993
- An introduction to Prolog IIICommunications of the ACM, 1990
- DECIDABILITY OF THE POSITIVE THEORY OF A FREE COUNTABLY GENERATED SEMIGROUPMathematics of the USSR-Sbornik, 1983
- A Unification Algorithm for Associative-Commutative FunctionsJournal of the ACM, 1981
- Simplification by Cooperating Decision ProceduresACM Transactions on Programming Languages and Systems, 1979
- A Practical Decision Procedure for Arithmetic with Function SymbolsJournal of the ACM, 1979