Počet záznamů: 1
A Lower Bound on CNF Encodings of the At-most-one Constraint
- 1.
SYSNO ASEP 0494392 Druh ASEP J - Článek v odborném periodiku Zařazení RIV J - Článek v odborném periodiku Poddruh J Článek ve WOS Název A Lower Bound on CNF Encodings of the At-most-one Constraint Tvůrce(i) Kučera, P. (CZ)
Savický, Petr (UIVT-O) SAI, RID, ORCID
Vorel, V. (CZ)Zdroj.dok. Theoretical Computer Science. - : Elsevier - ISSN 0304-3975
Roč. 762, March (2019), s. 51-73Poč.str. 23 s. Jazyk dok. eng - angličtina Země vyd. NL - Nizozemsko Klíč. slova Knowledge compilation ; Cardinality constraint ; At most one constraint ; Propagation complete encoding Vědní obor RIV IN - Informatika Obor OECD Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8) CEP GBP202/12/G061 GA ČR - Grantová agentura ČR Způsob publikování Omezený přístup Institucionální podpora UIVT-O - RVO:67985807 UT WOS 000459528200005 EID SCOPUS 85053701165 DOI https://doi.org/10.1016/j.tcs.2018.09.003 Anotace 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. Pracoviště Ústav informatiky Kontakt Tereza Šírová, sirova@cs.cas.cz, Tel.: 266 053 800 Rok sběru 2020 Elektronická adresa http://dx.doi.org/10.1016/j.tcs.2018.09.003
Počet záznamů: 1