A generalization of Shostak's method for combining decision procedures
From MaRDI portal
Recommendations
Cited in
(19)- Delayed theory combination vs. Nelson-Oppen for satisfiability modulo theories: a comparative analysis
- Solving quantified verification conditions using satisfiability modulo theories
- Combination of convex theories: modularity, deduction completeness, and explanation
- A general setting for flexibly combining and augmenting decision procedures
- Polite combination of algebraic datatypes
- Conflict-driven satisfiability for theory combination: transition system and completeness
- Strategies for combining decision procedures
- Efficient theory combination via Boolean search
- Canonization for disjoint unions of theories
- Interpolation systems for ground proofs in automated deduction: a survey
- Optimization modulo theories with linear rational costs
- Combining equational reasoning
- Combining decision procedures by (model-)equality propagation
- Combining decision procedures for positive theories sharing constructors
- A New approach for combining decision procedures for the word problem, and its connection to the Nelson-Oppen combination method
- Shininess, strong politeness, and unicorns
- Combining combination properties. I: Nelson-Oppen and politeness
- Combining combination properties: minimal models
- Combining nonstably infinite theories
This page was built for publication: A generalization of Shostak's method for combining decision procedures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4737130)
