On SAT Modulo Theories and Optimization Problems
From MaRDI portal
Recommendations
Cited in
(40)- A framework for certified Boolean branch-and-bound optimization
- Optimization modulo non-linear arithmetic via incremental linearization
- \textsc{OptiMathSAT}: a tool for optimization modulo theories
- Delegatable functional signatures
- Optimization in SMT with \(\mathcal{LA}(\mathbb Q)\) cost functions
- Optimization modulo theories with linear rational costs
- Supercharging plant configurations using Z3
- Semiring programming: a semantic framework for generalized sum product problems
- Branch and Bound for Boolean Optimization and the Generation of Optimality Certificates
- optsat: A Tool for Solving SAT Related Optimization Problems
- SAT Modulo ODE: A Direct SAT Approach to Hybrid Systems
- Learning modulo theories for constructive preference elicitation
- Search-space partitioning for parallelizing SMT solvers
- Speeding up the constraint-based method in difference logic
- Unifying framework for optimizations in non-Boolean formalisms
- Optimization modulo the theory of floating-point numbers
- A logical approach to efficient Max-SAT solving
- Generalized optimization modulo theories
- A modular approach to MaxSAT modulo theories
- Maximum satisfiability in software analysis: applications and techniques
- Exploiting partial-assignment enumeration in optimization modulo theories
- Iterative and core-guided maxsat solving: a survey and assessment
- Solving constraint satisfaction problems with SAT modulo theories
- Satisfiability modulo theories
- Optimization modulo the theories of signed bit-vectors and floating-point numbers
- An abstract view on optimizations in SAT and ASP
- Solving weighted CSPs with meta-constraints by reformulation into satisfiability modulo theories
- Engineering and evaluating multi-objective pseudo-Boolean optimizers
- An abstract view on optimizations in propositional frameworks
- OptiRica: towards an efficient optimizing Horn solver
- Cable tree wiring -- benchmarking solvers on a real-world scheduling problem with a variety of precedence constraints
- SAT-Problems and Reductions with Respect to the Number of Variables
- Structured learning modulo theories
- Algorithms for Weighted Boolean Optimization
- Symbolic optimization with SMT solvers
- SAT Modulo Differential Equation Simulations
- Solving generalized optimization problems subject to SMT constraints
- Satisfiability modulo the theory of costs: foundations and applications
- A system for solving constraint satisfaction problems with SMT
- Exploiting subproblem optimization in SAT-based maxsat algorithms
This page was built for publication: On SAT Modulo Theories and Optimization Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5756563)
