Search Results for author:
Found 3 papers, 1 papers with code
Learning to Select SAT Encodings for Pseudo-Boolean and Linear Integer Constraints
We show that it is possible to select encodings effectively using a standard set of features for constraint problems; however we obtain better performance with a new set of features specifically designed for the pseudo-Boolean and linear constraints.
Automatic Tabulation in Constraint Models
The performance of a constraint model can often be improved by converting a subproblem into a single table constraint.
SAT Encodings for Pseudo-Boolean Constraints Together With At-Most-One Constraints
When solving a combinatorial problem using propositional satisfiability (SAT), the encoding of the problem is of vital importance.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
