Incremental Encoding and Solving of Cardinality Constraints

DOI10.1007/978-3-319-11936-6_22MaRDI QIDQ3457805zbMATH OpenOpenAlexFDO

Authors Sven Reimer, M. Sauer, Tobias Schubert, Bernd Becker

Publication date 17 December 2015

Published in Automated Technology for Verification and Analysis (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-11936-6_22

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• A parametric approach for smaller and better encodings of cardinality constraints
• Efficient SAT-based encodings of conditional cardinality constraints
• Principles and Practice of Constraint Programming – CP 2004
• Towards Robust CNF Encodings of Cardinality Constraints
• Logics in Artificial Intelligence
• Perfect hashing and CNF encodings of cardinality constraints
• An efficient bounds consistency algorithm for the global cardinality constraint
• An efficient bounds consistency algorithm for the global cardinality constraint
• The complexity of global cardinality constraints

Cited in

(3)

• QMaxSAT: A partial Max-SAT solver
• On using incremental encodings in unsatisfiability-based MaxSAT solving
• Resizing cardinality constraints for MaxSAT

This page was built for publication: Incremental Encoding and Solving of Cardinality Constraints

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3457805)