Author:
Babka Martin,Balyo Tomáš,Čepek Ondřej,Gurský Štefan,Kučera Petr,Vlček Václav
Funder
Charles University Grant Agency
Czech Science Foundation
Subject
Artificial Intelligence,Linguistics and Language,Language and Linguistics
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Propagation complete encodings of smooth DNNF theories;Constraints;2022-06-03
2. Learning a Propagation Complete Formula;Integration of Constraint Programming, Artificial Intelligence, and Operations Research;2022
3. A lower bound on CNF encodings of the at-most-one constraint;Theoretical Computer Science;2019-03
4. Approximately Propagation Complete and Conflict Propagating Constraint Encodings;Theory and Applications of Satisfiability Testing – SAT 2018;2018
5. A Lower Bound on CNF Encodings of the At-Most-One Constraint;Theory and Applications of Satisfiability Testing – SAT 2017;2017