Publisher
Springer Berlin Heidelberg
Reference17 articles.
1. Lecture Notes in Computer Science;O. Bailleux,2003
2. Sinz, C.: Towards an optimal CNF encoding of Boolean cardinality constraints. In: [16], pp. 827–831
3. Eén, N., Sörensson, N.: Translating pseudo-Boolean constraints into SAT. Journal on Satisfiability, Boolean Modeling and Computation 2, 1–26 (2006)
4. Bailleux, O., Boufkhad, Y., Roussel, O.: A translation of pseudo Boolean constraints to SAT. Journal on Satisfiability, Boolean Modeling and Computation 2, 191–200 (2006)
5. Silva, J.P.M., Lynce, I.: Towards robust CNF encodings of cardinality constraints. In: [17], pp. 483–497
Cited by
33 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Generalizing Level Ranking Constraints for Monotone and Convex Aggregates;Electronic Proceedings in Theoretical Computer Science;2023-09-12
2. Coupling Different Integer Encodings for SAT;Integration of Constraint Programming, Artificial Intelligence, and Operations Research;2022
3. Shared SAT Solvers and SAT Memory in Distributed Business Applications;Communications in Computer and Information Science;2022
4. Modeling and Solving Graph Synthesis Problems Using SAT-Encoded Reachability Constraints in Picat;Electronic Proceedings in Theoretical Computer Science;2021-09-17
5. Data Driven Relational Constraint Programming;2020 IEEE 21st International Conference on Information Reuse and Integration for Data Science (IRI);2020-08