Solving Generalized Optimization Problems Subject to SMT Constraints
In a classical constrained optimization problem, the logical relationship among the constraints is normally the logical conjunction. However, in many real applications, the relationship among the constraints might be more complex. This paper investigates a generalized class of optimization problems whose constraints are connected by various kinds of logical operators in addition to conjunction. Such optimization problems have been rarely studied in literature in contrast to the classical ones. A framework which integrates classical optimization procedures into the DPLL(T) architecture for solving Satisfiability Modulo Theories (SMT) problems is proposed. Two novel techniques for improving the solving efficiency w.r.t. linear arithmetic theory are also presented. Experiments show that the proposed techniques are quite effective.
Unable to display preview. Download preview PDF.
- 2.Cheng, K.C., Yap, R.H.C.: Search space reduction and Russian doll search. In: Proceedings of the 22nd AAAI Conference on Artificial Intelligence (AAAI 2007) (2007) Google Scholar
- 5.Eén, N., Sorensson, N.: The MiniSat Page (2011), http://minisat.se/
- 9.Hooker, J.N., Osorio, M.A.: Mixed logical-linear programming. Discrete Appl. Math. 96-97, 395–442 (October 1999)Google Scholar
- 10.Kroening, D., Strichman, O.: Decision Procedures. Springer (2008)Google Scholar
- 12.de Moura, L., Bjørner, N.S.: Z3: An Efficient SMT Solver. In: Ramakrishnan, C.R., Rehof, J. (eds.) TACAS 2008. LNCS, vol. 4963, pp. 337–340. Springer, Heidelberg (2008), http://research.microsoft.com/projects/z3/index.html CrossRefGoogle Scholar