Automatic Detection of At-Most-One and Exactly-One Relations for Improved SAT Encodings of Pseudo-Boolean Constraints
- 23 September 2019
- book chapter
- Published by Springer Nature
- p. 20-36
Abstract
No abstract availableKeywords
This publication has 22 references indexed in Scilit:
- On the Glucose SAT SolverInternational Journal on Artificial Intelligence Tools, 2018
- Compact MDDs for Pseudo-Boolean Constraints with At-Most-One Relations in Resource-Constrained Scheduling Problems2017
- Encoding Linear Constraints with Implication Chains to CNF2015
- Solving Intensional Weighted CSPs by Incremental Optimization with BDDs2014
- Detecting Cardinality Constraints in CNFLecture Notes in Computer Science, 2014
- A New Look at BDDs for Pseudo-Boolean ConstraintsJournal of Artificial Intelligence Research, 2012
- A categorisation of nurse rostering problemsJournal of Scheduling, 2010
- New Encodings of Pseudo-Boolean Constraints into CNF2009
- Using Boolean Constraint Propagation for Sub-clauses DeductionLecture Notes in Computer Science, 2005
- Resource-constrained project scheduling: Notation, classification, models, and methodsEuropean Journal of Operational Research, 1999