A More Compact Translation of Pseudo-Boolean Constraints into CNF Such That Generalized Arc Consistency Is Maintained

In this paper we answer the open question for the existence of a more compact encoding from Pseudo-Boolean constraints into CNF that maintains generalized arc consistency by unit propagation, formalized by Bailleux et al. in [21]. In contrast to other encodings our approach is defined in an abstract...

Full description

Saved in:
Bibliographic Details
Published inKI 2014: Advances in Artificial Intelligence pp. 123 - 134
Main Authors Manthey, Norbert, Philipp, Tobias, Steinke, Peter
Format Book Chapter
LanguageEnglish
Published Cham Springer International Publishing 2014
SeriesLecture Notes in Computer Science
Subjects
Auxiliary Variable
Conjunctive Normal Form
Constraint Programming
Propositional Variable
Unit Propagation
Online AccessGet full text
ISBN3319112058
9783319112053
ISSN0302-9743
1611-3349
DOI10.1007/978-3-319-11206-0_13

Cover

Abstract In this paper we answer the open question for the existence of a more compact encoding from Pseudo-Boolean constraints into CNF that maintains generalized arc consistency by unit propagation, formalized by Bailleux et al. in [21]. In contrast to other encodings our approach is defined in an abstract way and we present a concrete instantiation, resulting in a space complexity of $\mathcal{O}(n^2 \text{\,log}^2(n)\text{\,log}(w_{\mathsf{max}}))$ clauses in contrast to $\mathcal{O}(n^3 \text{\,log}(n)\text{\,log}(w_{\mathsf{max}}))$ clauses generated by the previously best known encoding that maintains generalized arc consistency.
AbstractList In this paper we answer the open question for the existence of a more compact encoding from Pseudo-Boolean constraints into CNF that maintains generalized arc consistency by unit propagation, formalized by Bailleux et al. in [21]. In contrast to other encodings our approach is defined in an abstract way and we present a concrete instantiation, resulting in a space complexity of $\mathcal{O}(n^2 \text{\,log}^2(n)\text{\,log}(w_{\mathsf{max}}))$ clauses in contrast to $\mathcal{O}(n^3 \text{\,log}(n)\text{\,log}(w_{\mathsf{max}}))$ clauses generated by the previously best known encoding that maintains generalized arc consistency.
Author Philipp, Tobias
Manthey, Norbert
Steinke, Peter
Author_xml – sequence: 1
  givenname: Norbert
  surname: Manthey
  fullname: Manthey, Norbert
– sequence: 2
  givenname: Tobias
  surname: Philipp
  fullname: Philipp, Tobias
– sequence: 3
  givenname: Peter
  surname: Steinke
  fullname: Steinke, Peter
BookMark eNpFkMFOwzAMhgMMiW3sDTjkBQJx3abNcVRsTNoAiXGu0iRlhZJMTXeApycMJA62pd-_f8nfhIycd5aQK-DXwHl-I_OCIUOQDCDhgvEK8IRMMCpHQZySMQgAhpjKs_9FVozImCNPmMxTvCCzEN4454BZCnkxJoc53fje0tJ_7JUe6LZXLnRqaL2jvqFPwR6MZ7fed1a56HJh6FXrhkBj87R8WNDng97R7U4NdGmd7VXXfllD570-2tswWKc_6SrQzc9hLGsuyXmjumBnf3NKXhZ32_KerR-Xq3K-ZgEAkUleQ12ItEkw5cANRyNkIqzORGFqrYzRAhIJWjQSa4Wp0XUWP8uBp0bWFqck-c0N-751r7avau_fQwURX6RaRaoVVhFVdYRY_VDFb-1nZ-o
ContentType Book Chapter
Copyright Springer International Publishing Switzerland 2014
Copyright_xml – notice: Springer International Publishing Switzerland 2014
DOI 10.1007/978-3-319-11206-0_13
DatabaseTitleList
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
Computer Science
EISBN 3319112066
9783319112060
EISSN 1611-3349
Editor Lutz, Carsten
Thielscher, Michael
Editor_xml – sequence: 1
  givenname: Carsten
  surname: Lutz
  fullname: Lutz, Carsten
  email: clu@informatik.uni-bremen.de
– sequence: 2
  givenname: Michael
  surname: Thielscher
  fullname: Thielscher, Michael
  email: mit@cse.unsw.edu.au
EndPage 134
GroupedDBID -DT
-GH
-~X
1SB
29L
2HA
2HV
5QI
875
AASHB
ABMNI
ACGFS
ADCXD
AEFIE
ALMA_UNASSIGNED_HOLDINGS
EJD
F5P
FEDTE
HVGLF
LAS
LDH
P2P
RIG
RNI
RSU
SVGTG
VI1
~02
ID FETCH-LOGICAL-s1133-90b1b864f234010d03d6926ec568dbcaddc61291c6f93ba34dcb53547104d9be3
ISBN 3319112058
9783319112053
ISSN 0302-9743
IngestDate Tue Jul 29 20:25:49 EDT 2025
IsPeerReviewed true
IsScholarly true
Language English
LinkModel OpenURL
MergedId FETCHMERGED-LOGICAL-s1133-90b1b864f234010d03d6926ec568dbcaddc61291c6f93ba34dcb53547104d9be3
Notes Original Abstract: In this paper we answer the open question for the existence of a more compact encoding from Pseudo-Boolean constraints into CNF that maintains generalized arc consistency by unit propagation, formalized by Bailleux et al. in [21]. In contrast to other encodings our approach is defined in an abstract way and we present a concrete instantiation, resulting in a space complexity of \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$\mathcal{O}(n^2 \text{\,log}^2(n)\text{\,log}(w_{\mathsf{max}}))$\end{document} clauses in contrast to \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$\mathcal{O}(n^3 \text{\,log}(n)\text{\,log}(w_{\mathsf{max}}))$\end{document} clauses generated by the previously best known encoding that maintains generalized arc consistency.
PageCount 12
ParticipantIDs springer_books_10_1007_978_3_319_11206_0_13
PublicationCentury 2000
PublicationDate 2014
PublicationDateYYYYMMDD 2014-01-01
PublicationDate_xml – year: 2014
  text: 2014
PublicationDecade 2010
PublicationPlace Cham
PublicationPlace_xml – name: Cham
PublicationSeriesSubtitle Lecture Notes in Artificial Intelligence
PublicationSeriesTitle Lecture Notes in Computer Science
PublicationSubtitle 37th Annual German Conference on AI, Stuttgart, Germany, September 22-26, 2014. Proceedings
PublicationTitle KI 2014: Advances in Artificial Intelligence
PublicationYear 2014
Publisher Springer International Publishing
Publisher_xml – name: Springer International Publishing
RelatedPersons Kleinberg, Jon M.
Mattern, Friedemann
Nierstrasz, Oscar
Steffen, Bernhard
Kittler, Josef
Weikum, Gerhard
Naor, Moni
Mitchell, John C.
Terzopoulos, Demetri
Kobsa, Alfred
Pandu Rangan, C.
Kanade, Takeo
Hutchison, David
Tygar, Doug
RelatedPersons_xml – sequence: 1
  givenname: David
  surname: Hutchison
  fullname: Hutchison, David
– sequence: 2
  givenname: Takeo
  surname: Kanade
  fullname: Kanade, Takeo
– sequence: 3
  givenname: Josef
  surname: Kittler
  fullname: Kittler, Josef
– sequence: 4
  givenname: Jon M.
  surname: Kleinberg
  fullname: Kleinberg, Jon M.
– sequence: 5
  givenname: Alfred
  surname: Kobsa
  fullname: Kobsa, Alfred
– sequence: 6
  givenname: Friedemann
  surname: Mattern
  fullname: Mattern, Friedemann
– sequence: 7
  givenname: John C.
  surname: Mitchell
  fullname: Mitchell, John C.
– sequence: 8
  givenname: Moni
  surname: Naor
  fullname: Naor, Moni
– sequence: 9
  givenname: Oscar
  surname: Nierstrasz
  fullname: Nierstrasz, Oscar
– sequence: 10
  givenname: C.
  surname: Pandu Rangan
  fullname: Pandu Rangan, C.
– sequence: 11
  givenname: Bernhard
  surname: Steffen
  fullname: Steffen, Bernhard
– sequence: 12
  givenname: Demetri
  surname: Terzopoulos
  fullname: Terzopoulos, Demetri
– sequence: 13
  givenname: Doug
  surname: Tygar
  fullname: Tygar, Doug
– sequence: 14
  givenname: Gerhard
  surname: Weikum
  fullname: Weikum, Gerhard
SSID ssj0001354178
ssj0002792
Score 2.0189292
Snippet In this paper we answer the open question for the existence of a more compact encoding from Pseudo-Boolean constraints into CNF that maintains generalized arc...
SourceID springer
SourceType Publisher
StartPage 123
SubjectTerms Auxiliary Variable
Conjunctive Normal Form
Constraint Programming
Propositional Variable
Unit Propagation
Title A More Compact Translation of Pseudo-Boolean Constraints into CNF Such That Generalized Arc Consistency Is Maintained
URI http://link.springer.com/10.1007/978-3-319-11206-0_13
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV3Nb9MwFLe6cgEOwACNT_nArQqKY8dNDhzKtGkdo0KiQ7tFseNolaYENemB_Wn8dbxnJ43b7TIuUWVVTfLer8_P7-P3CPmUhugU8DIQU2PggCJYkKQRYFmK3ExNLlWM_c7fF_LsUpxfxVej0V-vamnTqs_69t6-kv_RKqyBXrFL9gGa3f4oLMBn0C9cQcNw3XN-d8OsVsHf5hPYVoWN7LlEvi1tna1t9Y_j0BjoNofIcwUu358uZYNV1X5eYPXbjqtb1mqVb53tnzgQ09XweNW8XY0zGIW1cVZFt44q_Wbrhf5ozKaog691fYMBfxwOakdStPik4PQeL07BcunryfI6b3sG7NUt-MCztXazRJvW9obOG6wGqTCO0XVjoYBN8-Wiy4Es6ta9fz-mordafliDib2wRh_W3AuMDrG5nXMwB0MCjmPoeIf7fjCw9XBackvGmXeJpI3ckaR2JptF3Nv9mQut3tlY_FoS7PvCu8kAs4EH5GCaiDF5NDs5v_g1xPd4LNh0YK5HokaX0XJPhX1G_VMnjglqeAuvx_O-W97J2ltnaPmcPMUGGYqdKyC0F2RkqkPyrJc77eR-SJ54XJcvyWZGESq0gwr1oELrku5ChXpQoQgVClChCBWKUKEeVChAhXpQofOGDlB5RS5PT5bHZ0E38yNoGOM8SEPFVCJFGXE4-YdFyAuZRtLoWCaF0rAba_DJU6ZlmXKVc1FoFYOowVEWRaoMf03GVV2ZI0KLOAkLEeYlNn8bicyHrExVkpSqNHEYvSGTXooZ_oubrKfwBplnPAOZZ1bmGcr87YO-_Y48HkD9nozb9cZ8AO-1VR87oPwDTr6RnA
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=KI+2014%3A+Advances+in+Artificial+Intelligence&rft.au=Manthey%2C+Norbert&rft.au=Philipp%2C+Tobias&rft.au=Steinke%2C+Peter&rft.atitle=A+More+Compact+Translation+of+Pseudo-Boolean+Constraints+into+CNF+Such+That+Generalized+Arc+Consistency+Is+Maintained&rft.series=Lecture+Notes+in+Computer+Science&rft.date=2014-01-01&rft.pub=Springer+International+Publishing&rft.isbn=9783319112053&rft.issn=0302-9743&rft.eissn=1611-3349&rft.spage=123&rft.epage=134&rft_id=info:doi/10.1007%2F978-3-319-11206-0_13
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0302-9743&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0302-9743&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0302-9743&client=summon