Search results
- 1.0559241 - ÚI 2023 RIV NL eng J - Journal Article
Kučera, P. - Savický, Petr
Propagation Complete Encodings of Smooth DNNF Theories.
Constraints. Roč. 27, č. 3 (2022), s. 327-359. ISSN 1383-7133. E-ISSN 1572-9354
R&D Projects: GA ČR(CZ) GA19-19463S
Institutional support: RVO:67985807
Keywords : knowledge compilation * constraint CNF encoding * DNNF * propagation complete encoding
OECD category: Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
Impact factor: 1.6, year: 2022
Method of publishing: Limited access
https://dx.doi.org/10.1007/s10601-022-09331-2
Permanent Link: https://hdl.handle.net/11104/0332581 - 2.0494392 - ÚI 2020 RIV NL eng J - Journal Article
Kučera, P. - Savický, Petr - Vorel, V.
A Lower Bound on CNF Encodings of the At-most-one Constraint.
Theoretical Computer Science. Roč. 762, March (2019), s. 51-73. ISSN 0304-3975. E-ISSN 1879-2294
R&D Projects: GA ČR GBP202/12/G061
Grant - others:GA ČR(CZ) GA15-15511S
Institutional support: RVO:67985807
Keywords : Knowledge compilation * Cardinality constraint * At most one constraint * Propagation complete encoding
OECD category: Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
Impact factor: 0.747, year: 2019
Method of publishing: Limited access
http://dx.doi.org/10.1016/j.tcs.2018.09.003
Permanent Link: http://hdl.handle.net/11104/0287600File Download Size Commentary Version Access a0494392.pdf 9 607.1 KB Publisher’s postprint require - 3.0478486 - ÚI 2018 RIV CH eng C - Conference Paper (international conference)
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]
R&D Projects: GA ČR GBP202/12/G061
Grant - others:GA ČR(CZ) GA15-15511S
Institutional support: RVO:67985807
Keywords : Knowledge compilation * Cardinality constraint * At most one constraint * Propagation complete encoding
OECD category: Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
Permanent Link: http://hdl.handle.net/11104/0274603File Download Size Commentary Version Access 0478486.pdf 2 801.7 KB Author´s preprint open-access a0478486.pdf 4 310.6 KB Publisher’s postprint require