PBLib – A Library for Encoding Pseudo-Boolean Constraints into CNF
Authors:
- 27 October 2015
- book chapter
- Published by Springer Nature
- p. 9-16
Abstract
No abstract availableKeywords
This publication has 19 references indexed in Scilit:
- A Parametric Approach for Smaller and Better Encodings of Cardinality ConstraintsLecture Notes in Computer Science, 2013
- Solving Periodic Event Scheduling Problems with SAT2012
- On Computing Minimal Equivalent SubformulasLecture Notes in Computer Science, 2012
- A Compact Encoding of Pseudo-Boolean Constraints into SAT2012
- Answer set programming at a glanceCommunications of the ACM, 2011
- Translating Pseudo-Boolean Constraints into SATJournal on Satisfiability, Boolean Modeling and Computation, 2006
- Solving Non-Boolean Satisfiability Problems with Stochastic Local Search: A Comparison of EncodingsJournal of Automated Reasoning, 2006
- Effective Preprocessing in SAT Through Variable and Clause Elimination2005
- An Extensible SAT-solver2004
- Pseudo-Boolean optimizationDiscrete Applied Mathematics, 2002