Optimization modulo the theory of floating-point numbers
From MaRDI portal
Publication:2305439
DOI10.1007/978-3-030-29436-6_33OpenAlexW2969929769MaRDI QIDQ2305439
Patrick Trentin, Roberto Sebastiani
Publication date: 10 March 2020
Full work available at URL: https://arxiv.org/abs/1905.02838
Mechanization of proofs and logical operations (03B35) Theorem proving (automated and interactive theorem provers, deduction, resolution, etc.) (68V15)
Related Items (2)
Optimization modulo non-linear arithmetic via incremental linearization ⋮ Optimization modulo the theories of signed bit-vectors and floating-point numbers
Uses Software
Cites Work
- Unnamed Item
- Deciding floating-point logic with abstract conflict driven clause learning
- Exploring approximations for floating-point arithmetic using UppSAT
- Optimization modulo the theories of signed bit-vectors and floating-point numbers
- \textsc{OptiMathSAT}: a tool for optimization modulo theories
- Optimization Modulo Theories with Linear Rational Costs
- Minimal-Model-Guided Approaches to Solving Polynomial Constraints and Extensions
- Approximations for Model Construction
- Satisfiability Modulo the Theory of Costs: Foundations and Applications
- Pushing the Envelope of Optimization Modulo Theories with Linear-Arithmetic Cost Functions
- Symbolic optimization with SMT solvers
- A Decision Procedure for Bit-Vectors and Arrays
- On SAT Modulo Theories and Optimization Problems
This page was built for publication: Optimization modulo the theory of floating-point numbers
