Author:
Ansótegui Carlos,Bofill Miquel,Coll Jordi,Dang Nguyen,Esteban Juan Luis,Miguel Ian,Nightingale Peter,Salamon András Z.,Suy Josep,Villaret Mateu
Publisher
Springer International Publishing
Reference28 articles.
1. Lecture Notes in Computer Science;I Abío,2015
2. Abío, I., Nieuwenhuis, R., Oliveras, A., Rodríguez-Carbonell, E., Mayer-Eichberger, V.: A new look at BDDs for pseudo-Boolean constraints. J. Artif. Intell. Res. 443–480 (2012).
https://doi.org/10.1613/jair.3653
3. Ansótegui, C.: Complete SAT solvers for Many-Valued CNF Formulas. Ph.D. thesis, University of Lleida (2004)
4. Audemard, G., Simon, L.: On the glucose SAT solver. Int. J. Artif. Intell. Tools 27(1), 1–25 (2018).
https://doi.org/10.1142/S0218213018400018
5. Lecture Notes in Computer Science;O Bailleux,2009
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Learning to select SAT encodings for pseudo-Boolean and linear integer constraints;Constraints;2023-09
2. SAT encodings for Pseudo-Boolean constraints together with at-most-one constraints;Artificial Intelligence;2022-01
3. Multiple-choice Knapsack Constraint in Graphical Models;Integration of Constraint Programming, Artificial Intelligence, and Operations Research;2022
4. Coupling Different Integer Encodings for SAT;Integration of Constraint Programming, Artificial Intelligence, and Operations Research;2022
5. At-Most-One Constraints in Efficient Representations of Mutex Networks;2020 IEEE 32nd International Conference on Tools with Artificial Intelligence (ICTAI);2020-11