Encoding cardinality constraints using multiway merge selection networks

DOI10.1007/s10601-019-09302-0zbMath1432.68417OpenAlexW2935376254MaRDI QIDQ2009191

Michał Karpiński, Marek Piotrów

Publication date: 27 November 2019

Published in: Constraints (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10601-019-09302-0

zbMATH Keywords

SAT encodingcardinality constraintSAT-solverSAT translationselection network

Mathematics Subject Classification ID

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

Related Items (2)

Encoding cardinality constraints using standard encoding of generalized selection networks preserves arc-consistency ⋮ Exact and approximate determination of the Pareto front using minimal correction subsets

Uses Software

• MiniSat
• PBLib
• COMiniSatPS

Cites Work

• A linear-time transformation of linear inequalities into conjunctive normal form
• Curriculum-based course timetabling with SAT and MaxSAT
• Cardinality networks: a theoretical and empirical study
• Encoding cardinality constraints using standard encoding of generalized selection networks preserves arc-consistency
• Pairwise Cardinality Networks
• PBLib – A Library for Encoding Pseudo-Boolean Constraints into CNF
• Towards an Optimal CNF Encoding of Boolean Cardinality Constraints
• A Parametric Approach for Smaller and Better Encodings of Cardinality Constraints
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Encoding cardinality constraints using multiway merge selection networks