Name
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2012 | 10.1007/978-3-642-29700-7_23 | FAW-AAIM |
Keywords | Field | DocType |
satisfiability modulo theories,smt constraint,generalized optimization problem,proposed technique,logical relationship,optimization problem,generalized class,logical conjunction,logical operator,classical optimization procedure,linear arithmetic theory,efficiency w | Logical conjunction,Mathematical optimization,DPLL algorithm,Operator (computer programming),Constrained optimization problem,Optimization problem,Mathematics,Linear arithmetic,Constrained optimization,Satisfiability modulo theories | Conference |
Citations | PageRank | References |
2 | 0.38 | 9 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Feifei Ma | 1 | 58 | 13.64 |
| Jun Yan | 2 | 248 | 21.97 |
| Jian Zhang | 3 | 288 | 24.45 |