research-article

Optimization Modulo Theories with Linear Rational Costs

Authors:

Roberto Sebastiani,

Silvia TomasiAuthors Info & Claims

ACM Transactions on Computational Logic (TOCL), Volume 16, Issue 2

Article No.: 12, Pages 1 - 43

https://doi.org/10.1145/2699915

Published: 17 February 2015 Publication History

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 of any previous work on SMT solvers able to produce solutions that minimize cost functions over arithmetical variables. This is unfortunate, since some problems of interest require this functionality.

In the work described in this article we start filling this gap. We present and discuss two general procedures for leveraging SMT to handle the minimization of linear rational cost functions, combining SMT with standard minimization techniques. We have implemented the procedures within the MathSAT SMT solver. Due to the absence of competitors in the AR, FV, and SMT domains, we have experimentally evaluated our implementation against state-of-the-art tools for the domain of Linear Generalized Disjunctive Programming (LGDP), which is closest in spirit to our domain, on sets of problems that have been previously proposed as benchmarks for the latter tools. The results show that our tool is very competitive with, and often outperforms, these tools on these problems, clearly demonstrating the potential of the approach.

References

[1]

Tobias Achterberg, Timo Berthold, Thorsten Koch, and Kati Wolter. 2008. Constraint integer programming: A new approach to integrate CP and MIP. In Proc. CPAIOR’08. Lecture Notes in Computer Science, Vol. 5015. Springer, 6--20.

Digital Library

[2]

Carlos Ansótegui, Miquel Bofill, Miquel Palahí, Josep Suy, and Mateu Villaret. 2011. Satisfiability modulo theories: An efficient approach for the resource-constrained project scheduling problem. In SARA.

[3]

Gilles Audemard, Marco Bozzano, Alessandro Cimatti, and Roberto Sebastiani. 2005. Verifying industrial hybrid systems with MathSAT. In Proc. BMC 2004 (ENTCS), Vol. 119. Elsevier.

Digital Library

[4]

Gilles Audemard, Alessandro Cimatti, Arthur Kornilowicz, and Roberto Sebastiani. 2002. SAT-based bounded model checking for timed systems. In Proc. FORTE’02. Lecture Notes in Computer Science, Vol. 2529. Springer.

[5]

Egon Balas. 1983. Disjunctive Programming and a Hierarchy of Relaxations for Discrete Optimization Problems. Technical Report DRC-7O-21-R3. Carnegie Mellon University. Retrieved from http://repository.cmu.edu/cgi/viewcontent.cgi&quest;article=1949&cont ext=tepper.

[6]

Egon Balas. 1998. Disjunctive programming: Properties of the convex hull of feasible points. Discr. Appl. Math. 89, 1--3 (1998), 3--44.

Digital Library

[7]

Egon Balas and Pierre Bonami. 2007. New variants of lift-and-project cut generation from the LP tableau: Open source implementation and testing. In IPCO. 89--103.

Digital Library

[8]

Clark Barrett, Roberto Sebastiani, Sanjit A. Seshia, and Cesare Tinelli. 2009. Satisfiabiity modulo theories. In Handbook of Satisfiability, Armin Biere, Marijn J. H. Heule, Hans van Maaren, and Toby Walsh (Eds.). IOS Press, 825--885.

[9]

C. W. Barrett, D. L. Dill, and A. Stump. 2002. A generalization of Shostak’s method for combining decision procedures. In Frontiers of Combining Systems (FROCOS). Lecture Notes in Artificial Intelligence. Springer-Verlag. Santa Margherita Ligure, Italy.

Digital Library

[10]

A. Biere, A. Cimatti, E. M. Clarke, and Yunshan Zhu. 1999. Symbolic model checking without BDDs. In Proc. TACAS’99. 193--207.

Digital Library

[11]

Armin Biere, Marijn J. H. Heule, Hans van Maaren, and Toby Walsh (Eds.). 2009. Handbook of Satisfiability. IOS Press. 980 pages.

[12]

Marco Bozzano, Roberto Bruttomesso, Alessandro Cimatti, Tommi A. Junttila, Silvio Ranise, Peter van Rossum, and Roberto Sebastiani. 2006. Efficient theory combination via boolean search. Inf. Comput. 204, 10 (2006), 1493--1525.

Digital Library

[13]

A. Brooke, D. Kendrick, A. Meeraus, and R. Raman. 2011. GAMS—A User’s Guide. GAMS Development Corporation, Washington, DC.

[14]

Roberto Cavada, Alessandro Cimatti, Anders Franzén, Krishnamani Kalyanasundaram, Marco Roveri, and R. K. Shyamasundar. 2007. Computing predicate abstractions by integrating BDDs and SMT solvers. In FMCAD. IEEE Comput. Soc., 69--76.

Digital Library

[15]

Alessandro Cimatti, Anders Franzén, Alberto Griggio, Roberto Sebastiani, and Cristian Stenico. 2010. Satisfiability modulo the theory of costs: Foundations and applications. In TACAS. Lecture Notes in Computer Science, Vol. 6015. Springer, 99--113.

Digital Library

[16]

Alessandro Cimatti, Alberto Griggio, Bastiaan Joost Schaafsma, and Roberto Sebastiani. 2013a. A modular approach to MaxSAT modulo theories. In International Conference on Theory and Applications of Satisfiability Testing, SAT. Lecture Notes in Computer Science, Vol. 7962.

Digital Library

[17]

Alessandro Cimatti, Alberto Griggio, Bastiaan Joost Schaafsma, and Roberto Sebastiani. 2013b. The MathSAT 5 SMT solver. In Tools and Algorithms for the Construction and Analysis of Systems (TACAS’13). Lecture Notes in Computer Science, Vol. 7795. Springer, 95--109.

Digital Library

[18]

Alessandro Cimatti, Alberto Griggio, and Roberto Sebastiani. 2010. Efficient generation of Craig interpolants in satisfiability modulo theories. ACM Trans. Comput. Logics 12, 1 (Oct. 2010).

Digital Library

[19]

Alessandro Cimatti, Alberto Griggio, and Roberto Sebastiani. 2011. Computing small unsatisfiable cores in SAT modulo theories. J. Artif. Intell. Res. 40 (April 2011), 701--728.

Digital Library

[20]

Leonardo Mendonça de Moura and Nikolaj Bjørner. 2008. Z3: An efficient SMT solver. In TACAS. Lecture Notes in Computer Science, Vol. 4963. Springer, 337--340.

Digital Library

[21]

Isil Dillig, Thomas Dillig, Kenneth L. McMillan, and Alex Aiken. 2012. Minimum satisfying assignments for SMT. In CAV. 394--409.

Digital Library

[22]

Bruno Dutertre and Leonardo de Moura. 2006. A fast linear-arithmetic solver for DPLL(T). In CAV. Lecture Notes in Computer Science, Vol. 4144.

Digital Library

[23]

Bruno Dutertre and Leonardo De Moura. 2006. The Yices SMT Solver. Technical Report. SRI International. Retrieved from http://yices.csl.sri.com/tool-paper.pdf.

[24]

N. Eén and N. Sörensson. 2004. An extensible SAT-solver. In Theory and Applications of Satisfiability Testing (SAT’03). Lecture Notes in Computer Science, Vol. 2919. Springer, 502--518.

[25]

Alberto Griggio. 2012. A practical approach to satisfiability modulo linear integer arithmetic. J. Satis., Boolean Model. Comput. 8 (2012), 1--27.

[26]

IBM. 2010. IBM ILOG CPLEX Optimizer. Retrieved from http://www-01.ibm.com/software/integration/optimization/cplex-optimizer/.

[27]

Natalia Kalinnik, Erika Ábrahám, Tobias Schubert, Ralf Wimmer, and Bernd Becker. 2010. Exploiting different strategies for the parallelization of an SMT solver. In Proc. MBMV. 97--106.

[28]

Chu Min Li and Felip Manyà. 2009. MaxSAT, hard and soft constraints. In Handbook of Satisfiability, Armin Biere, Marijn J. H. Heule, Hans van Maaren, and Toby Walsh (Eds.). IOS Press, 613--631.

[29]

Andrea Lodi. 2009. Mixed integer programming computation. In 50 Years of Integer Programming 1958-2008. Springer-Verlag, 619--645.

[30]

I. Lynce and J. P. Marques-Silva. 2004. On computing minimum unsatisfiable cores. In Proc. 7th International Conference on Theory and Applications of Satisfiability Testing.

[31]

Panagiotis Manolios and Vasilis Papavasileiou. 2013. ILP modulo theories. In CAV. 662--677.

Digital Library

[32]

Joao P. Marques-Silva, Ines Lynce, and Sharad Malik. 2009. Conflict-Driven Clause Learning SAT Solvers, Chapter 4, 131--153. In Biere et al. {2009}.

[33]

J. P. Marques-Silva and K. A. Sakallah. 1996. GRASP—A new search algorithm for satisfiability. In Proc. ICCAD’96. 220--227.

Digital Library

[34]

Matthew W. Moskewicz, Conor F. Madigan, Ying Zhao, Lintao Zhang, and Sharad Malik. 2001. Chaff: Engineering an efficient SAT solver. In DAC. 530--535.

Digital Library

[35]

C. G. Nelson and D. C. Oppen. 1979. Simplification by cooperating decision procedures. TOPLAS 1, 2 (1979), 245--257.

Digital Library

[36]

Robert Nieuwenhuis and Albert Oliveras. 2006. On SAT modulo theories and optimization problems. In Proc. Theory and Applications of Satisfiability Testing (SAT’06). Lecture Notes in Computer Science, Vol. 4121. Springer.

Digital Library

[37]

R. Nieuwenhuis, A. Oliveras, and C. Tinelli. 2006. Solving SAT and SAT modulo theories: From an abstract Davis-Putnam-Logemann-Loveland procedure to DPLL(T). J. ACM 53, 6 (Nov. 2006), 937--977.

Digital Library

[38]

D. A. Plaisted and S. Greenbaum. 1986. A structure-preserving clause form translation. J. Symbol. Comput. 2 (1986), 293--304.

Digital Library

[39]

R. Raman and I. E. Grossmann. 1994. Modelling and computational techniques for logic based integer programming. Comput. Chem. Eng. 18, 7 (1994), 563--578.

[40]

Olivier Roussel and Vaso Manquinho. 2009. Pseudo-Boolean and Cardinality Constraints. In Handbook of Satisfiability, Armin Biere, Marijn J. H. Heule, Hans van Maaren, and Toby Walsh (Eds.). IOS Press, 695--733.

[41]

Nicolas W. Sawaya and Ignacio E. Grossmann. 2005. A cutting plane method for solving linear generalized disjunctive programming problems. Comput. Chem. Eng. 29, 9 (2005), 1891--1913.

[42]

Nicolas W. Sawaya and Ignacio E. Grossmann. 2012. A hierarchy of relaxations for linear generalized disjunctive programming. Eur. J. Oper. Res. 216, 1 (2012), 70--82.

[43]

Roberto Sebastiani. 2007. Lazy satisfiability modulo theories. J. Sat., Boolean Model. Comput. 3, 3--4 (2007), 141--224.

[44]

Roberto Sebastiani and Silvia Tomasi. 2012. Optimization in SMT with LA(Q) cost functions. In IJCAR. Lecture Notes in Artificial Intelligence, Vol. 7364. Springer, 484--498. Retrieved from http://disi.unitn.it/&sim;rseba/publist.html.

Digital Library

[45]

Meinolf Sellmann and Serdar Kadioglu. 2008. Dichotomic search protocols for constrained optimization. In CP. Lecture Notes in Computer Science, Vol. 5202. Springer.

Digital Library

[46]

Mary Sheeran, Satnam Singh, and Gunnar Stålmarck. 2000. Checking safety properties using induction and a SAT-solver. In FMCAD. Lecture Notes in Computer Science. Springer, 108--125.

Digital Library

[47]

C. Tinelli and M. T. Harandi. 1996. A new correctness proof of the Nelson--Oppen combination procedure. In Proc. Frontiers of Combining Systems (FroCoS’06) (Applied Logic). Kluwer.

[48]

A. Vecchietti. 2011. (2011). Personal communication.

[49]

A. Vecchietti and I. E. Grossmann. 2004. Computational experience with LogMIP solving linear and nonlinear disjunctive programming problems. In Proc. of FOCAPD. 587--590.

[50]

Christoph M. Wintersteiger, Youssef Hamadi, and Leonardo Mendonça de Moura. 2009. A concurrent portfolio approach to SMT solving. In Proc. Computer Aided Verification, CAV. 715--720.

Digital Library

[51]

S. Wolfman and D. Weld. 1999. The LPSAT engine & its application to resource planning. In Proc. IJCAI.

Digital Library

Cited By

Zhao JZhang HWang YZhai YYang Y(2024)Deep Isotonic Embedding Network: A flexible Monotonic Neural NetworkNeural Networks10.1016/j.neunet.2023.12.026171(457-465)Online publication date: Mar-2024
https://doi.org/10.1016/j.neunet.2023.12.026
He XLi BZhao MCai S(2024)A Local Search Algorithm for MaxSMT(LIA)Formal Methods10.1007/978-3-031-71162-6_3(55-72)Online publication date: 11-Sep-2024
https://doi.org/10.1007/978-3-031-71162-6_3
Tsiskaridze NBarrett CTinelli C(2024)Generalized Optimization Modulo TheoriesAutomated Reasoning10.1007/978-3-031-63498-7_27(458-479)Online publication date: 1-Jul-2024
https://doi.org/10.1007/978-3-031-63498-7_27
Show More Cited By

Index Terms

Optimization Modulo Theories with Linear Rational Costs
1. Computing methodologies
  1. Symbolic and algebraic manipulation
    1. Symbolic and algebraic algorithms
      1. Theorem proving algorithms
2. Theory of computation
  1. Models of computation
    1. Computability

Recommendations

Symbolic optimization with SMT solvers
POPL '14

The rise in efficiency of Satisfiability Modulo Theories (SMT) solvers has created numerous uses for them in software verification, program synthesis, functional programming, refinement types, etc. In all of these applications, SMT solvers are used for ...
Solving SAT and SAT Modulo Theories: From an abstract Davis--Putnam--Logemann--Loveland procedure to DPLL(T)

We first introduce Abstract DPLL, a rule-based formulation of the Davis--Putnam--Logemann--Loveland (DPLL) procedure for propositional satisfiability. This abstract framework allows one to cleanly express practical DPLL algorithms and to formally reason ...
All-Solution Satisfiability Modulo Theories: Applications, Algorithms and Benchmarks
ARES '15: Proceedings of the 2015 10th International Conference on Availability, Reliability and Security

Satisfiability Modulo Theories (SMT) is a decision problem for logical formulas over one or more first-order theories. In this paper, we study the problem of finding all solutions of an SMT problem with respect to a set of Boolean variables, henceforth ...

Comments

Information & Contributors

Information

Published In

cover image ACM Transactions on Computational Logic

ACM Transactions on Computational Logic Volume 16, Issue 2

March 2015

260 pages

ISSN:1529-3785

EISSN:1557-945X

DOI:10.1145/2737801

Editor:
Dale Miller
INRIA Saclay, France

Issue’s Table of Contents

Copyright © 2015 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 17 February 2015

Accepted: 01 December 2014

Revised: 01 September 2014

Received: 01 January 2014

Published in TOCL Volume 16, Issue 2

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article
Research
Refereed

Funding Sources

Semiconductor Research Corporation (SRC) under GRC Research Project 2012-TJ-2266 WOLF

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

51
Total Citations
View Citations
239
Total Downloads

Downloads (Last 12 months)30
Downloads (Last 6 weeks)0

Reflects downloads up to 12 Sep 2024

Other Metrics

View Author Metrics

Citations

Cited By

Zhao JZhang HWang YZhai YYang Y(2024)Deep Isotonic Embedding Network: A flexible Monotonic Neural NetworkNeural Networks10.1016/j.neunet.2023.12.026171(457-465)Online publication date: Mar-2024
https://doi.org/10.1016/j.neunet.2023.12.026
He XLi BZhao MCai S(2024)A Local Search Algorithm for MaxSMT(LIA)Formal Methods10.1007/978-3-031-71162-6_3(55-72)Online publication date: 11-Sep-2024
https://doi.org/10.1007/978-3-031-71162-6_3
Tsiskaridze NBarrett CTinelli C(2024)Generalized Optimization Modulo TheoriesAutomated Reasoning10.1007/978-3-031-63498-7_27(458-479)Online publication date: 1-Jul-2024
https://doi.org/10.1007/978-3-031-63498-7_27
Sumic ACimatti AMicheli AVidal T(2024)SMT-Based Repair of Disjunctive Temporal Networks with Uncertainty: Strong and Weak ControllabilityIntegration of Constraint Programming, Artificial Intelligence, and Operations Research10.1007/978-3-031-60599-4_11(176-192)Online publication date: 25-May-2024
https://doi.org/10.1007/978-3-031-60599-4_11
Saeed ZHaider SAli ZArshad MAlam I(2023)On the Current State of Privacy Risks in Software Requirement Elicitation TechniquesProtecting User Privacy in Web Search Utilization10.4018/978-1-6684-6914-9.ch008(160-185)Online publication date: 3-Mar-2023
https://doi.org/10.4018/978-1-6684-6914-9.ch008
Leofante F(2023)OMTPlan: A Tool for Optimal Planning Modulo TheoriesJournal on Satisfiability, Boolean Modeling and Computation10.3233/SAT-22000114:1(17-23)Online publication date: 8-Jun-2023
https://doi.org/10.3233/SAT-220001
Panjkovic SMicheli AWilliams BChen YNeville J(2023)Expressive optimal temporal planning via optimization modulo theoryProceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence and Thirty-Fifth Conference on Innovative Applications of Artificial Intelligence and Thirteenth Symposium on Educational Advances in Artificial Intelligence10.1609/aaai.v37i10.26426(12095-12102)Online publication date: 7-Feb-2023
https://dl.acm.org/doi/10.1609/aaai.v37i10.26426
Felli PGianola AMontali MRivkin AWinkler S(2023)Data-aware conformance checking with SMTInformation Systems10.1016/j.is.2023.102230117:COnline publication date: 1-Jul-2023
https://dl.acm.org/doi/10.1016/j.is.2023.102230
Shi BWang HLi YDeng S(2023)RelaGraphInformation Processing and Management: an International Journal10.1016/j.ipm.2023.10344760:5Online publication date: 1-Sep-2023
https://dl.acm.org/doi/10.1016/j.ipm.2023.103447
De la Peña Sarracén GRosso P(2023)Systematic keyword and bias analyses in hate speech detectionInformation Processing and Management: an International Journal10.1016/j.ipm.2023.10343360:5Online publication date: 1-Sep-2023
https://dl.acm.org/doi/10.1016/j.ipm.2023.103433
Show More Cited By

View Options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Article

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Issue’s Table of Contents