Revisiting pseudo-Boolean encodings from an integer perspective
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 5139161 (Why is no real title available?)
- A New Look at BDDs for Pseudo-Boolean Constraints
- A linear-time transformation of linear inequalities into conjunctive normal form
- A parametric approach for smaller and better encodings of cardinality constraints
- AI 2006: Advances in artificial intelligence. 19th Australian joint conference on artificial intelligence, Hobart, Australia, December 4--8, 2006. Proceedings
- Coupling different integer encodings for SAT
- Efficient CNF encoding of Boolean cardinality constraints
- Graph-Based Algorithms for Boolean Function Manipulation
- Handbook of satisfiability. In 2 parts
- Hard multidimensional multiple choice knapsack problems, an empirical study
- Improving linear constraint propagation by changing constraint representation
- New Encodings of Pseudo-Boolean Constraints into CNF
- On CNF encodings of decision diagrams
- PBLib -- a library for encoding pseudo-Boolean constraints into CNF
- Principles and practice of constraint programming. 20th international conference, CP 2014, Lyon, France, September 8--12, 2014. Proceedings
- QMaxSATpb: a certified MaxSAT solver
- SAT encodings for pseudo-Boolean constraints together with at-most-one constraints
This page was built for publication: Revisiting pseudo-Boolean encodings from an integer perspective
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6899329)
