\textsc{OptiMathSAT}: a tool for optimization modulo theories
From MaRDI portal
Publication:2303246
Recommendations
- On SAT Modulo Theories and Optimization Problems
- From \textsc{MiniZinc} to optimization modulo theories, and back
- \textsf{TSAT++}: an open platform for satisfiability modulo theories
- A modular approach to MaxSAT modulo theories
- A framework for satisfiability modulo theories
- Optimal satisfiability checking for arithmetic \(\mu\)-calculi
- Pushing the Envelope of Optimization Modulo Theories with Linear-Arithmetic Cost Functions
Cites work
- A hierarchy of relaxations for linear generalized disjunctive programming
- A modular approach to MaxSAT modulo theories
- A parametric approach for smaller and better encodings of cardinality constraints
- A practical approach to satisfiability modulo linear integer arithmetic
- A system for solving constraint satisfaction problems with SMT
- An abstract interpretation of DPLL(T)
- Approximating the Pareto front of multi-criteria optimization problems
- Boolean lexicographic optimization: algorithms \& applications
- Computing small unsatisfiable cores in satisfiability modulo theories
- Constraint Integer Programming: A New Approach to Integrate CP and MIP
- Deciding floating-point logic with abstract conflict driven clause learning
- Disjunctive programming: Properties of the convex hull of feasible points
- Efficient generation of Craig interpolants in satisfiability modulo theories
- Efficient theory combination via Boolean search
- scientific article; zbMATH DE number 5493266 (Why is no real title available?)
- Invariant checking of NRA transition systems via incremental reduction to LRA with EUF
- Lazy satisfiability modulo theories
- Minimal-model-guided approaches to solving polynomial constraints and extensions
- Mixed integer programming computation
- On SAT Modulo Theories and Optimization Problems
- Optimization in SMT with \(\mathcal{LA}(\mathbb Q)\) cost functions
- Optimization modulo theories with linear rational costs
- Propagation = Lazy Clause Generation
- Propagation via lazy clause generation
- Pushing the Envelope of Optimization Modulo Theories with Linear-Arithmetic Cost Functions
- Satisfiability modulo the theory of costs: foundations and applications
- Satisfiability modulo transcendental functions via incremental linearization
- SCIP: solving constraint integer programs
- Solving constraint satisfaction problems with SAT modulo theories
- Solving SAT and MaxSAT with a quantum annealer: foundations and a preliminary report
- Solving SAT and SAT modulo theories, from an abstract Davis-Putnam-Logemann-Loveland procedure to \(\operatorname{DPLL}(T)\)
- Solving weighted CSPs with meta-constraints by reformulation into satisfiability modulo theories
- Structured learning modulo theories
- Symbolic optimization with SMT solvers
- Technical Note—Recognizing Unbounded Integer Programs
- The MathSAT5 SMT solver
- Theory and Applications of Satisfiability Testing
- Towards an Optimal CNF Encoding of Boolean Cardinality Constraints
Cited in
(18)- Optimization modulo the theories of signed bit-vectors and floating-point numbers
- OptiLog: a framework for SAT-based systems
- Solving SAT (and MaxSAT) with a quantum annealer: foundations, encodings, and preliminary results
- Optimization modulo the theory of floating-point numbers
- Solving generalized optimization problems subject to SMT constraints
- OptiMathSAT
- MILP, pseudo-Boolean, and OMT solvers for optimal fault-tolerant placements of relay nodes in mission critical wireless networks
- Symbolic optimization with SMT solvers
- On SAT Modulo Theories and Optimization Problems
- Global optimization of objective functions represented by ReLU networks
- Computing optimal hypertree decompositions with SAT
- OMTPlan: A Tool for Optimal Planning Modulo Theories
- OptiRica: towards an efficient optimizing Horn solver
- SAT solving using XOR-OR-AND normal forms.
- Exploiting partial-assignment enumeration in optimization modulo theories
- Generalized optimization modulo theories
- Multiple interdependent simple temporal networks with uncertainty: a semi-decentralized multi-agent model with shared control of activity durations
- Optimization modulo non-linear arithmetic via incremental linearization
Describes a project that uses
Uses Software
This page was built for publication: \textsc{OptiMathSAT}: a tool for optimization modulo theories
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2303246)
