Optimization Modulo Theories with Linear Rational Costs

Volume: 16, Issue: 2, Pages: 12
Published: Feb 17, 2015
Abstract
In the contexts of automated reasoning (AR) and formal verification (FV), important decision problems are effectively encoded into Satisfiability Modulo Theories (SMT). In the last decade, efficient SMT solvers have been developed for several theories of practical interest (e.g., linear arithmetic, arrays, and bit vectors). Surprisingly, little work has been done to extend SMT to deal with optimization problems; in particular, we are not aware...
Paper Details
Title
Optimization Modulo Theories with Linear Rational Costs
Published Date
Feb 17, 2015
Volume
16
Issue
2
Pages
12
Citation AnalysisPro
  • Scinapse’s Top 10 Citation Journals & Affiliations graph reveals the quality and authenticity of citations received by a paper.
  • Discover whether citations have been inflated due to self-citations, or if citations include institutional bias.