Combining equational reasoning
From MaRDI portal
Recommendations
- Combining unification algorithms
- Unification in the union of disjoint equational theories: Combining decision procedures
- Deciding the word problem in the union of equational theories.
- scientific article; zbMATH DE number 4049130
- Unification in a combination of equational theories: an efficient algorithm
Cites work
- D-bases for polynomial ideals over commutative Noetherian rings
- A generalization of Shostak's method for combining decision procedures
- A SAT based approach for solving formulas over Boolean and linear mathematical propositions
- Abstract congruence closure and specializations
- Affine relationships among variables of a program
- Algorithms in real algebraic geometry
- An algorithm for finding the basis elements of the residue class ring of a zero dimensional polynomial ideal
- Complexity, convexity and combinations of theories
- Computer Science Logic
- Congruence closure modulo associativity and commutativity
- CVC: A cooperating validity checker
- Decision Procedures for SAT, SAT Modulo Theories and Beyond. The BarcelogicTools
- DPLL(T): Fast decision procedures
- Efficient theory combination via Boolean search
- scientific article; zbMATH DE number 3870585 (Why is no real title available?)
- scientific article; zbMATH DE number 3053259 (Why is no real title available?)
- Join algorithms for the theory of uninterpreted functions
- Lazy theorem proving for bounded model checking over infinite domains
- Programming Languages and Systems
- Simplification by Cooperating Decision Procedures
- The complexity of the word problems for commutative semigroups and polynomial ideals
- Theorem proving using lazy proof explication.
- Theorem proving with the real numbers
- Uniform derivation of decision procedures by superposition
Cited in
(5)
This page was built for publication: Combining equational reasoning
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3655192)