0478486 - ÚI 2018 RIV CH eng C - Konferenční příspěvek (zahraniční konf.)
Kučera, P. - Savický, Petr - Vorel, V.A Lower Bound on CNF Encodings of the At-Most-One Constraint.
Theory and Applications of Satisfiability Testing - SAT 2017. Cham: Springer, 2017 - (Gaspers, S.; Walsh, T.), s. 412-428. Lecture Notes in Computer Science, 10491. ISBN 978-3-319-66262-6. ISSN 0302-9743.
[SAT 2017. International Conference on Theory and Applications of Satisfiability Testing /20./. Melbourne (AU), 28.08.2017-01.09.2017]
Grant CEP: GA ČR GBP202/12/G061
Grant ostatní: GA ČR(CZ) GA15-15511S
Institucionální podpora: RVO:67985807
Klíčová slova: Knowledge compilation * Cardinality constraint * At most one constraint * Propagation complete encoding
Obor OECD: Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
Trvalý link: http://hdl.handle.net/11104/0274603
