A New approach for combining decision procedures for the word problem, and its connection to the Nelson-Oppen combination method
- 1 January 1997
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Combining Symbolic Constraint Solvers on Algebraic DomainsJournal of Symbolic Computation, 1994
- Combination techniques for non-disjoint equational theoriesPublished by Springer Nature ,1994
- Unification in a combination of arbitrary disjoint equational theoriesJournal of Symbolic Computation, 1989
- Counterexamples to termination for the direct sum of term rewriting systemsInformation Processing Letters, 1987
- On the Church-Rosser property for the direct sum of term rewriting systemsJournal of the ACM, 1987
- An Efficient Unification AlgorithmACM Transactions on Programming Languages and Systems, 1982
- Complexity, convexity and combinations of theoriesTheoretical Computer Science, 1980
- Fast Decision Procedures Based on Congruence ClosureJournal of the ACM, 1980
- Simplification by Cooperating Decision ProceduresACM Transactions on Programming Languages and Systems, 1979
- A Machine-Oriented Logic Based on the Resolution PrincipleJournal of the ACM, 1965