Pushing the Envelope of Optimization Modulo Theories with Linear-Arithmetic Cost Functions

@article{Sebastiani2015PushingTE,
  title={Pushing the Envelope of Optimization Modulo Theories with Linear-Arithmetic Cost Functions},
  author={R. Sebastiani and P. Trentin},
  journal={ArXiv},
  year={2015},
  volume={abs/1410.5568}
}
  • R. Sebastiani, P. Trentin
  • Published 2015
  • Computer Science, Mathematics
  • ArXiv
  • In the last decade we have witnessed an impressive progress in the expressiveness and efficiency of Satisfiability Modulo Theories SMT solving techniques. This has brought previously-intractable problems at the reach of state-of-the-art SMT solvers, in particular in the domain of SW and HW verification. Many SMT-encodable problems of interest, however, require also the capability of finding models that are optimal wrt. some cost functions. In previous work, namely Optimization Modulo Theory… CONTINUE READING

    Figures and Topics from this paper.

    Explore Further: Topics Discussed in This Paper

    From MiniZinc to Optimization Modulo Theories, and Back (Extended Version)
    Bit-Vector Optimization
    17
    OptiMathSAT: A Tool for Optimization Modulo Theories
    43
    On the Benefits of Enhancing Optimization Modulo Theories with Sorting Networks for MaxSMT
    2
    OptiMathSAT: A Tool for Optimization Modulo Theories
    43
    SMT-based Verification Applied to Non-convex Optimization Problems
    6

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 28 REFERENCES
    Optimization Modulo Theories with Linear Rational Costs
    53
    Optimization in SMT with LA(Q) Cost Functions
    68
    On SAT Modulo Theories and Optimization Problems
    151
    Satisfiability Modulo the Theory of Costs: Foundations and Applications
    87
    Symbolic optimization with SMT solvers
    115
    ILP Modulo Theories
    20
    A Modular Approach to MaxSAT Modulo Theories
    32
    Handbook of satisfiability
    541
    νZ - Maximal Satisfaction with Z3
    52