A Parametric Approach for Smaller and Better Encodings of Cardinality Constraints

DOI10.1007/978-3-642-40627-0_9zbMath1432.68412OpenAlexW1492234230MaRDI QIDQ5415453

Ignasi Abío, Enric Rodríguez-Carbonell, Albert Oliveras, Robert Nieuwenhuis

Publication date: 12 May 2014

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-40627-0_9

Mathematics Subject Classification ID

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

Related Items

Stable states of Boolean regulatory networks composed over hexagonal grids, PBLib – A Library for Encoding Pseudo-Boolean Constraints into CNF, The sample analysis machine scheduling problem: definition and comparison of exact solving approaches, Coupling different integer encodings for SAT, Improving the Normalization of Weight Rules in Answer Set Programs, Encoding cardinality constraints using standard encoding of generalized selection networks preserves arc-consistency, A comparison of ASP-based and SAT-based algorithms for the contension inconsistency measure, Efficient SMT-based network fault tolerance verification, Rewriting optimization statements in answer-set programs, Resizing cardinality constraints for MaxSAT, Cost-optimal constrained correlation clustering via weighted partial maximum satisfiability, Encoding cardinality constraints using multiway merge selection networks, Delegatable Functional Signatures, \textsc{OptiMathSAT}: a tool for optimization modulo theories, Synthesis of Domain Specific CNF Encoders for Bit-Vector Solvers, Comments on: ``An overview of curriculum-based course timetabling