A Lower Bound on CNF Encodings of the At-most-one Constraint
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985807%3A_____%2F19%3A00494392" target="_blank" >RIV/67985807:_____/19:00494392 - isvavai.cz</a>
Alternative codes found
RIV/00216208:11320/19:10402518
Result on the web
<a href="http://dx.doi.org/10.1016/j.tcs.2018.09.003" target="_blank" >http://dx.doi.org/10.1016/j.tcs.2018.09.003</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1016/j.tcs.2018.09.003" target="_blank" >10.1016/j.tcs.2018.09.003</a>
Alternative languages
Result language
angličtina
Original language name
A Lower Bound on CNF Encodings of the At-most-one Constraint
Original language description
Constraint 'at most one' is a basic cardinality constraint which requires that at most one of its n boolean inputs is set to 1. This constraint is widely used when translating a problem into a conjunctive normal form (CNF) and we investigate its CNF encodings suitable for this purpose. An encoding differs from a CNF representation of a function in that it can use auxiliary variables. We are especially interested in propagation complete encodings which have the property that unit propagation is strong enough to enforce consistency on input variables. We show a lower bound on the number of clauses in any propagation complete encoding of the 'at most one' constraint. The lower bound almost matches the size of the best known encodings. We also study an important case of 2-CNF encodings where we show a slightly better lower bound. The lower bound holds also for a related 'exactly one' constraint.
Czech name
—
Czech description
—
Classification
Type
J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database
CEP classification
—
OECD FORD branch
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
Result continuities
Project
Result was created during the realization of more than one project. More information in the Projects tab.
Continuities
I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace
Others
Publication year
2019
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
Theoretical Computer Science
ISSN
0304-3975
e-ISSN
—
Volume of the periodical
762
Issue of the periodical within the volume
March
Country of publishing house
NL - THE KINGDOM OF THE NETHERLANDS
Number of pages
23
Pages from-to
51-73
UT code for WoS article
000459528200005
EID of the result in the Scopus database
2-s2.0-85053701165