Exploiting partial-assignment enumeration in optimization modulo theories
From MaRDI portal
Cites work
- \textsc{OptiMathSAT}: a tool for optimization modulo theories
- A structure-preserving clause form translation
- AllSAT for combinational circuits
- Efficient theory combination via Boolean search
- Entailing generalization boosts enumeration
- Generalized optimization modulo theories
- Implementing efficient All solutions SAT solvers
- Lazy satisfiability modulo theories
- On CNF conversion for disjoint SAT enumeration
- On CNF conversion for SAT and SMT enumeration
- 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
- Solving generalized optimization problems subject to SMT constraints
- Solving SAT (and MaxSAT) with a quantum annealer: foundations, encodings, and preliminary results
- Structured learning modulo theories
- Symbolic optimization with SMT solvers
- The MathSAT5 SMT solver
- Tools and Algorithms for the Construction and Analysis of Systems
- Tools and algorithms for the construction and analysis of systems. 22nd international conference, TACAS 2016, held as part of the European joint conferences on theory and practice of software, ETAPS 2016, Eindhoven, The Netherlands, April 2--8, 2016. Proc
This page was built for publication: Exploiting partial-assignment enumeration in optimization modulo theories
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6852317)
