CC(X): Semantic Combination of Congruence Closure with Solvable Theories
Open Access
- 6 May 2008
- journal article
- research article
- Published by Elsevier in Electronic Notes in Theoretical Computer Science
- Vol. 198 (2) , 51-69
- https://doi.org/10.1016/j.entcs.2008.04.080
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Fast congruence closure and extensionsInformation and Computation, 2007
- Canonization for disjoint unions of theoriesInformation and Computation, 2005
- Nelson-Oppen, Shostak and the Extended Canonizer: A Family Picture with a NewbornPublished by Springer Nature ,2005
- Deciding Combinations of TheoriesJournal of the ACM, 1984
- Variations on the Common Subexpression ProblemJournal of the ACM, 1980
- Fast Decision Procedures Based on Congruence ClosureJournal of the ACM, 1980
- Simplification by Cooperating Decision ProceduresACM Transactions on Programming Languages and Systems, 1979