Satisfiability modulo the theory of costs: foundations and applications
From MaRDI portal
Publication:3557072
Recommendations
Cited in
(14)- \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
- Automated reasoning in \(\mathcal{ALCQ}\) via SMT
- Learning modulo theories for constructive preference elicitation
- Optimization modulo the theory of floating-point numbers
- Iterative and core-guided maxsat solving: a survey and assessment
- Solving constraint satisfaction problems with SAT modulo theories
- Optimization modulo the theories of signed bit-vectors and floating-point numbers
- On SAT Modulo Theories and Optimization Problems
- Structured learning modulo theories
- Symbolic optimization with SMT solvers
- Exploiting subproblem optimization in SAT-based maxsat algorithms
This page was built for publication: Satisfiability modulo the theory of costs: foundations and applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3557072)