Abstraction-based satisfiability solving of Presburger arithmetic
From MaRDI portal
Recommendations
- On solving Presburger and linear arithmetic with SAT
- Deciding Presburger arithmetic by model checking and comparisons with other methods
- Interpolating quantifier-free Presburger arithmetic
- Towards Efficient Satisfiability Checking for Boolean Algebra with Presburger Arithmetic
- Interpolant based decision procedure for quantifier-free Presburger arithmetic
Cited in
(12)- An approach for extracting a small unsatisfiable core
- Efficient theory combination via Boolean search
- Incremental SAT-based method with native Boolean cardinality handling for the Hamiltonian cycle problem
- SAT-Based Model Checking
- Towards Efficient Satisfiability Checking for Boolean Algebra with Presburger Arithmetic
- TaPAS: The Talence Presburger Arithmetic Suite
- On solving Presburger and linear arithmetic with SAT
- Deciding Quantifier-Free Presburger Formulas Using Parameterized Solution Bounds
- A sound and complete abstraction for reasoning about parallel prefix sums
- Interpolant based decision procedure for quantifier-free Presburger arithmetic
- Solving \(\mathrm{LIA}^\star\) using approximations
- M\textbf{ath}SAT: Tight integration of SAT and mathematical decision procedures
This page was built for publication: Abstraction-based satisfiability solving of Presburger arithmetic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5312909)