Generalized optimization modulo theories
From MaRDI portal
Cites work
- A modular approach to MaxSAT modulo theories
- Architecting Solvers for SAT Modulo Theories: Nelson-Oppen with DPLL
- Block-wise abstract interpretation by combining abstract domains with SMT
- Computing exact loop bounds for bounded program verification
- Generalized optimization modulo theories
- Minimal-model-guided approaches to solving polynomial constraints and extensions
- Model-based theory combination
- On SAT Modulo Theories and Optimization Problems
- Optimization in SMT with \(\mathcal{LA}(\mathbb Q)\) cost functions
- Optimization modulo non-linear arithmetic via incremental linearization
- Optimization modulo the theories of signed bit-vectors and floating-point numbers
- Optimization modulo theories with linear rational costs
- Pushing the Envelope of Optimization Modulo Theories with Linear-Arithmetic Cost Functions
- Satisfiability modulo the theory of costs: foundations and applications
- Simulation based computation of certificates for safety of dynamical systems
- Solving SAT and MaxSAT with a quantum annealer: foundations and a preliminary report
- Solving SAT and SAT modulo theories, from an abstract Davis-Putnam-Logemann-Loveland procedure to \(\operatorname{DPLL}(T)\)
- Solving non-linear arithmetic
- Speeding up the constraint-based method in difference logic
- Structured learning modulo theories
- Symbolic optimization with SMT solvers
- \textsc{OptiMathSAT}: a tool for optimization modulo theories
Cited in
(2)
This page was built for publication: Generalized optimization modulo theories
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7034848)
