Ansótegui, Carlos, Bofill, Miquel, Coll, Jordi et al. (7 more authors) (2019) Automatic Detection of At-Most-One and Exactly-One Relations for Improved SAT Encodings of Pseudo-Boolean Constraints. In: Proceedings of the 25th International Conference on Principles and Practice of Constraint Programming. Springer , pp. 20-36.
Abstract
Pseudo-Boolean (PB) constraints often have a critical role in constraint satisfaction and optimisation problems. Encoding PB constraints to SAT has proven to be an efficient approach in many applications, however care must be taken to encode them compactly and with good propagation properties. It has been shown that at-most-one (AMO) and exactly-one (EO) relations over subsets of the variables can be exploited in various encodings of PB constraints, improving their compactness and solving performance. In this paper we detect AMO and EO relations completely automatically and exploit them to improve SAT encodings that are based on Multi-Valued Decision Diagrams (MDDs). Our experiments show substantial reductions in encoding size and dramatic improvements in solving time thanks to automatic AMO and EO detection.
Metadata
Item Type: | Proceedings Paper |
---|---|
Authors/Creators: |
|
Dates: |
|
Institution: | The University of York |
Academic Units: | The University of York > Faculty of Sciences (York) > Computer Science (York) |
Depositing User: | Pure (York) |
Date Deposited: | 12 Jul 2019 14:10 |
Last Modified: | 16 Oct 2024 11:03 |
Status: | Published |
Publisher: | Springer |
Open Archives Initiative ID (OAI ID): | oai:eprints.whiterose.ac.uk:148518 |