On SAT Modulo Theories and Optimization Problems
From MaRDI portal
Publication:5756563
DOI10.1007/11814948_18zbMath1187.68558MaRDI 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
68T20: Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.)
Related Items
Solving constraint satisfaction problems with SAT modulo theories, Solving weighted CSPs with meta-constraints by reformulation into satisfiability modulo theories, Structured learning modulo theories, Exploiting subproblem optimization in SAT-based maxsat algorithms, Optimization modulo non-linear arithmetic via incremental linearization, Optimization modulo the theories of signed bit-vectors and floating-point numbers, An abstract view on optimizations in SAT and ASP, Cable tree wiring -- benchmarking solvers on a real-world scheduling problem with a variety of precedence constraints, Supercharging plant configurations using Z3, Semiring programming: a semantic framework for generalized sum product problems, Learning modulo theories for constructive preference elicitation, \textsc{OptiMathSAT}: a tool for optimization modulo theories, Optimization modulo the theory of floating-point numbers, Iterative and core-guided maxsat solving: a survey and assessment, A logical approach to efficient Max-SAT solving, A framework for certified Boolean branch-and-bound optimization, Delegatable Functional Signatures, Speeding up the Constraint-Based Method in Difference Logic, Optimization Modulo Theories with Linear Rational Costs, Satisfiability Modulo Theories, Search-Space Partitioning for Parallelizing SMT Solvers, Branch and Bound for Boolean Optimization and the Generation of Optimality Certificates, Algorithms for Weighted Boolean Optimization
Uses Software
