On SAT Modulo Theories and Optimization Problems

DOI10.1007/11814948_18zbMath1187.68558OpenAlexW1548812055MaRDI QIDQ5756563

Robert Nieuwenhuis, Albert Oliveras

Publication date: 4 September 2007

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11814948_18

Mathematics Subject Classification ID

Related Items (23)

Optimization modulo non-linear arithmetic via incremental linearization ⋮ Search-Space Partitioning for Parallelizing SMT Solvers ⋮ Satisfiability Modulo Theories ⋮ A logical approach to efficient Max-SAT solving ⋮ Optimization Modulo Theories with Linear Rational Costs ⋮ A framework for certified Boolean branch-and-bound optimization ⋮ Semiring programming: a semantic framework for generalized sum product problems ⋮ Solving constraint satisfaction problems with SAT modulo theories ⋮ Solving weighted CSPs with meta-constraints by reformulation into satisfiability modulo theories ⋮ Learning modulo theories for constructive preference elicitation ⋮ Structured learning modulo theories ⋮ Exploiting subproblem optimization in SAT-based maxsat algorithms ⋮ Delegatable Functional Signatures ⋮ Optimization modulo the theories of signed bit-vectors and floating-point numbers ⋮ \textsc{OptiMathSAT}: a tool for optimization modulo theories ⋮ Speeding up the Constraint-Based Method in Difference Logic ⋮ An abstract view on optimizations in SAT and ASP ⋮ Optimization modulo the theory of floating-point numbers ⋮ Branch and Bound for Boolean Optimization and the Generation of Optimality Certificates ⋮ Algorithms for Weighted Boolean Optimization ⋮ Cable tree wiring -- benchmarking solvers on a real-world scheduling problem with a variety of precedence constraints ⋮ Iterative and core-guided maxsat solving: a survey and assessment ⋮ Supercharging plant configurations using Z3

Uses Software

• Pueblo
• MaxSolver
• Chaff

This page was built for publication: On SAT Modulo Theories and Optimization Problems