A SAT-based decision procedure for the Boolean combination of difference constraints
From MaRDI portal
Recommendations
- M\textbf{ath}SAT: Tight integration of SAT and mathematical decision procedures
- A SAT based approach for solving formulas over Boolean and linear mathematical propositions
- Some progress in satisfiability checking for difference logic
- The SAT-based approach to separation logic
- Efficient SAT engines for concise logics: accelerating proof search for zero-one linear constraint systems
Cited in
(12)- Theory decision by decomposition
- Decidable \({\exists}^*{\forall}^*\) first-order fragments of linear rational arithmetic with uninterpreted predicates
- Modelling and solving temporal reasoning as propositional satisfiability
- Efficient theory combination via Boolean search
- An efficient Nelson-Oppen decision procedure for difference constraints over rationals
- Rewrite-based decision procedures
- Bounded Model Checking of Analog and Mixed-Signal Circuits Using an SMT Solver
- A SAT based approach for solving formulas over Boolean and linear mathematical propositions
- Some progress in satisfiability checking for difference logic
- Design and results of the first satisfiability modulo theories competition (SMT-COMP 2005)
- The SAT-based approach to separation logic
- M\textbf{ath}SAT: Tight integration of SAT and mathematical decision procedures
This page was built for publication: A SAT-based decision procedure for the Boolean combination of difference constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5714755)
