A practical approach to satisfiability modulo linear integer arithmetic
From MaRDI portal
Recommendations
Cited in
(31)- Minimal counterexamples for linear-time probabilistic verification
- A Datalog hammer for supervisor verification conditions modulo simple linear arithmetic
- \textsc{OptiMathSAT}: a tool for optimization modulo theories
- Tools and Algorithms for the Construction and Analysis of Systems
- Efficient Term-ITE Conversion for Satisfiability Modulo Theories
- Optimization modulo theories with linear rational costs
- SAT Modulo the Theory of Linear Arithmetic: Exact, Inexact and Commercial Solvers
- scientific article; zbMATH DE number 1979549 (Why is no real title available?)
- Efficiently Simulating Higher-Order Arithmetic by a First-Order Theory Modulo
- Automated generation of hybrid automata for multi-rigid-body mechanical systems and its application to the falsification of safety properties
- A generalised branch-and-bound approach and its application in SAT modulo nonlinear integer arithmetic
- Linear integer arithmetic revisited
- Solving nonlinear integer arithmetic with MCSAT
- Integration of linear arithmetic and goal-oriented resolution for software reasoning
- Efficient Interpolant Generation in Satisfiability Modulo Linear Integer Arithmetic
- SPASS-SATT. A CDCL(LA) solver
- Experimenting on solving nonlinear integer arithmetic with incremental linearization
- Satisfiability modulo transcendental functions via incremental linearization
- Towards conflict-driven learning for virtual substitution
- Instantiation of SMT problems modulo integers
- Local Search For Satisfiability Modulo Integer Arithmetic Theories
- Satisfiability modulo linear arithmetic over a finite ring
- Local Search for SMT on Linear Integer Arithmetic
- A Benders decomposition approach to deciding modular linear integer arithmetic
- Integration of an LP solver into interval constraint propagation
- New techniques for linear arithmetic: cubes and equalities
- Fast cube tests for LIA constraint solving
- Pushing the Envelope of Optimization Modulo Theories with Linear-Arithmetic Cost Functions
- A complete and terminating approach to linear integer solving
- From simplification to a partial theory solver for non-linear real polynomial constraints
- Improving IntSat by expressing disjunctions of bounds as linear constraints
This page was built for publication: A practical approach to satisfiability modulo linear integer arithmetic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2786906)
