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...

Full description

Saved in:
Bibliographic Details
Published inFrontiers in Algorithmics and Algorithmic Aspects in Information and Management Vol. 7285; pp. 247 - 258
Main Authors Ma, Feifei, Yan, Jun, Zhang, Jian
Format Book Chapter
LanguageEnglish
Published Germany Springer Berlin / Heidelberg 2012
Springer Berlin Heidelberg
SeriesLecture Notes in Computer Science
Online AccessGet full text
ISBN9783642296994
3642296998
ISSN0302-9743
1611-3349
DOI10.1007/978-3-642-29700-7_23

Cover

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.
AbstractList 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.
Author Yan, Jun
Zhang, Jian
Ma, Feifei
Author_xml – sequence: 1
  givenname: Feifei
  surname: Ma
  fullname: Ma, Feifei
  email: maff@ios.ac.cn
  organization: Institute of Software, Chinese Academy of Sciences, China
– sequence: 2
  givenname: Jun
  surname: Yan
  fullname: Yan, Jun
  email: junyan@acm.org
  organization: Institute of Software, Chinese Academy of Sciences, China
– sequence: 3
  givenname: Jian
  surname: Zhang
  fullname: Zhang, Jian
  email: jian_zhangg@acm.org
  organization: State Key Laboratory of Computer Science, China
BookMark eNpNkMFOwzAQRA0URCn9Aw75AcOu7drxERUoSKAitZyt2HEhJY1DnHLo1-MWDuxlpZmd1ehdkEETGk_IFcI1AqgbrXLKqRSMMq0AqDKMH5FxknkSD5o6JkOUiJRzoU_-eVJrMSBD4MCoVoKfkaHS6ShZcE7GMa4hjZQSIR-Su0Wov6vmPZv5xndFXe18mc3bvtpUu6KvQpO9dsHWfhOzxdauveuzPmSLl2U2DU3su6Jq-nhJTldFHf34b4_I28P9cvpIn-ezp-ntM21xknO68lKWYL11yBjmJc8xd96BKhk6LG3SHEN0AixY55Vk3LoJc1ZIZEoIPiLs929su9TZd8aG8BkNgtljM4mB4SZRMAdEZo8thcRvqO3C19bH3vh9yvkmta_dR9H2vouGg4JcSYM6pSea_wDlwWyv
ContentType Book Chapter
Copyright Springer-Verlag Berlin Heidelberg 2012
Copyright_xml – notice: Springer-Verlag Berlin Heidelberg 2012
DBID FFUUA
DEWEY 005.1
DOI 10.1007/978-3-642-29700-7_23
DatabaseName ProQuest Ebook Central - Book Chapters - Demo use only
DatabaseTitleList
DeliveryMethod fulltext_linktorsrc
Discipline Computer Science
EISBN 9783642297007
3642297005
EISSN 1611-3349
Editor Lu, Pinyan
Su, Kaile
Snoeyink, Jack
Wang, Lusheng
Editor_xml – sequence: 1
  fullname: Lu, Pinyan
– sequence: 2
  fullname: Su, Kaile
– sequence: 3
  fullname: Wang, Lusheng
– sequence: 4
  fullname: Snoeyink, Jack
EndPage 258
ExternalDocumentID EBC3070876_192_259
GroupedDBID 089
0D6
0DA
2HV
38.
A4J
AABBV
AAFYB
AAPKO
ABBVZ
ABFCL
ABFCV
ABMNI
ADWNV
AEDXK
AEJLV
AEKFX
AETDV
AEZAY
AFSBW
AIJHZ
AIMOO
ALMA_UNASSIGNED_HOLDINGS
AZZ
BBABE
CZZ
FFUUA
I4C
IEZ
IX.
MA.
PH7
PI1
SBO
TGCOT
TPJZQ
TSXQS
Z81
Z83
Z88
-DT
-GH
-~X
1SB
29L
2HA
5QI
875
AASHB
ACGFS
ADCXD
AEFIE
EJD
F5P
FEDTE
HVGLF
LAS
LDH
P2P
RIG
RNI
RSU
SVGTG
VI1
~02
ID FETCH-LOGICAL-p1583-fe66d0bebc12218d3818cec07d21c1db218c211c40b0bce7623bc52cb46127443
ISBN 9783642296994
3642296998
ISSN 0302-9743
IngestDate Tue Jul 29 20:14:30 EDT 2025
Thu May 29 16:08:01 EDT 2025
IsPeerReviewed false
IsScholarly false
LCCallNum QA76.9.A43
Language English
LinkModel OpenURL
MergedId FETCHMERGED-LOGICAL-p1583-fe66d0bebc12218d3818cec07d21c1db218c211c40b0bce7623bc52cb46127443
OCLC 793342290
PQID EBC3070876_192_259
PageCount 12
ParticipantIDs springer_books_10_1007_978_3_642_29700_7_23
proquest_ebookcentralchapters_3070876_192_259
PublicationCentury 2000
PublicationDate 2012
PublicationDateYYYYMMDD 2012-01-01
PublicationDate_xml – year: 2012
  text: 2012
PublicationDecade 2010
PublicationPlace Germany
PublicationPlace_xml – name: Germany
– name: Berlin, Heidelberg
PublicationSeriesTitle Lecture Notes in Computer Science
PublicationSubtitle Joint International Conference, FAW-AAIM 2012, Beijing, China, May 14-16, 2012, Proceedings
PublicationTitle Frontiers in Algorithmics and Algorithmic Aspects in Information and Management
PublicationYear 2012
Publisher Springer Berlin / Heidelberg
Springer Berlin Heidelberg
Publisher_xml – name: Springer Berlin / Heidelberg
– name: Springer Berlin Heidelberg
RelatedPersons Kleinberg, Jon M.
Mattern, Friedemann
Nierstrasz, Oscar
Steffen, Bernhard
Kittler, Josef
Vardi, Moshe Y.
Weikum, Gerhard
Sudan, Madhu
Naor, Moni
Mitchell, John C.
Terzopoulos, Demetri
Pandu Rangan, C.
Kanade, Takeo
Hutchison, David
Tygar, Doug
RelatedPersons_xml – sequence: 1
  givenname: David
  surname: Hutchison
  fullname: Hutchison, David
  organization: Lancaster University, Lancaster, UK
– sequence: 2
  givenname: Takeo
  surname: Kanade
  fullname: Kanade, Takeo
  organization: Carnegie Mellon University, Pittsburgh, USA
– sequence: 3
  givenname: Josef
  surname: Kittler
  fullname: Kittler, Josef
  organization: University of Surrey, Guildford, UK
– sequence: 4
  givenname: Jon M.
  surname: Kleinberg
  fullname: Kleinberg, Jon M.
  organization: Cornell University, Ithaca, USA
– sequence: 5
  givenname: Friedemann
  surname: Mattern
  fullname: Mattern, Friedemann
  organization: ETH Zurich, Zurich, Switzerland
– sequence: 6
  givenname: John C.
  surname: Mitchell
  fullname: Mitchell, John C.
  organization: Stanford University, Stanford, USA
– sequence: 7
  givenname: Moni
  surname: Naor
  fullname: Naor, Moni
  organization: Weizmann Institute of Science, Rehovot, Israel
– sequence: 8
  givenname: Oscar
  surname: Nierstrasz
  fullname: Nierstrasz, Oscar
  organization: University of Bern, Bern, Switzerland
– sequence: 9
  givenname: C.
  surname: Pandu Rangan
  fullname: Pandu Rangan, C.
  organization: Indian Institute of Technology, Madras, India
– sequence: 10
  givenname: Bernhard
  surname: Steffen
  fullname: Steffen, Bernhard
  organization: University of Dortmund, Dortmund, Germany
– sequence: 11
  givenname: Madhu
  surname: Sudan
  fullname: Sudan, Madhu
  organization: Massachusetts Institute of Technology, USA
– sequence: 12
  givenname: Demetri
  surname: Terzopoulos
  fullname: Terzopoulos, Demetri
  organization: University of California, Los Angeles, USA
– sequence: 13
  givenname: Doug
  surname: Tygar
  fullname: Tygar, Doug
  organization: University of California, Berkeley, USA
– sequence: 14
  givenname: Moshe Y.
  surname: Vardi
  fullname: Vardi, Moshe Y.
  organization: Rice University, Houston, USA
– sequence: 15
  givenname: Gerhard
  surname: Weikum
  fullname: Weikum, Gerhard
  organization: Max-Planck Institute of Computer Science, Saarbrücken, Germany
SSID ssj0000666108
ssj0002792
Score 1.3996637
Snippet In a classical constrained optimization problem, the logical relationship among the constraints is normally the logical conjunction. However, in many real...
SourceID springer
proquest
SourceType Publisher
StartPage 247
Title Solving Generalized Optimization Problems Subject to SMT Constraints
URI http://ebookcentral.proquest.com/lib/SITE_ID/reader.action?docID=3070876&ppg=259
http://link.springer.com/10.1007/978-3-642-29700-7_23
Volume 7285
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV07b9swECYcdyk69I2mL3DoZrAQH5KsoUPRJgiMOB3qFNkIkaJaA4kdxMqSv9E_3Ds-ZMUNCqSLYBCCLN1HHI_H-74j5IMtasmNzZirWsuUqg0zuXHM1UXd5E2VW4EE5_lJcXSqZmf52Wj0e1C1dN2Zj_bmTl7J_6AKY4ArsmTvgWz_UBiA34AvXAFhuO4Ev7fTrKHvEEoPYCNrn7I4_7mGbf6viyS6PBgACC59zcYSE4A9WzGWWOxWv8x9NHnolq1b9i6hjgyOfib1eeZZP70S3ffcpyiinPXyBgLab-CWLiLfE5kJ2MFmgy4Lc0AY_H6fL3znUN-vIkhLeQO6zafjeMZxsu586dgktaFIXmmYtvD1H8O0RUpbTv6h6uUZJkqIqqhCI-RE9AInDtug4Bdd8NsFqjHKoH6afHGQ8ozLuggK8X-tGMMikQKpSlWZZazUQu6RvXKqxuTB54PZ8Y8-cYcbPp5tJelRgTEcVYW3QgJReutpkHjafsWAvHnXX97a5uyczPuAZ_GEPEISDEV2Ctj6KRm51TPyONmeRts_J18j3nSANx3iTRPeNOJNuzUFvOkA7xfk9PBg8eWIxcYc7JLnU8laVxRNZpyxXECI2GDUZ53NykZwyxsDY1ZwblVmMmMdrLfS2FxYoyCeLpWSL8l4tV65V4Ry3jrZSCuclcrk08rYWllheFuKVuVin7BkEe3LB2LNsg3fv9G4ZsGKrmGnomErv08myWwab9_opMsN9tZSg721t7dGe7--191vyMPtTH5Lxt3VtXsHIWln3sdJ8gewooYy
linkProvider Library Specific Holdings
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=bookitem&rft.title=Frontiers+in+Algorithmics+and+Algorithmic+Aspects+in+Information+and+Management&rft.au=Ma%2C+Feifei&rft.au=Yan%2C+Jun&rft.au=Zhang%2C+Jian&rft.atitle=Solving+Generalized+Optimization+Problems+Subject+to+SMT+Constraints&rft.series=Lecture+Notes+in+Computer+Science&rft.date=2012-01-01&rft.pub=Springer+Berlin+Heidelberg&rft.isbn=9783642296994&rft.issn=0302-9743&rft.eissn=1611-3349&rft.spage=247&rft.epage=258&rft_id=info:doi/10.1007%2F978-3-642-29700-7_23
thumbnail_s http://utb.summon.serialssolutions.com/2.0.0/image/custom?url=https%3A%2F%2Febookcentral.proquest.com%2Fcovers%2F3070876-l.jpg