Detecting cardinality constraints in CNF

DOI10.1007/978-3-319-09284-3_22MaRDI QIDQ3192077zbMATH OpenOpenAlexFDO

Authors Armin Biere, Daniel Le Berre, Emmanuel Lonca, Norbert Manthey

Publication date 26 September 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-319-09284-3_22

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• Towards an Optimal CNF Encoding of Boolean Cardinality Constraints
• Cardinality networks: a theoretical and empirical study
• Cardinality Networks and Their Applications
• Efficient CNF encoding of Boolean cardinality constraints
• A parametric approach for smaller and better encodings of cardinality constraints

Cited in

(7)

• Tight representation of logical constraints as cardinality rules
• Multi-agent path finding with mutex propagation
• Stable states of Boolean regulatory networks composed over hexagonal grids
• Recognition of Nested Gates in CNF Formulas
• scientific article; zbMATH DE number 1950752 (Why is no real title available?)
• The configurable SAT solver challenge (CSSC)
• Clausal proofs for pseudo-Boolean reasoning

This page was built for publication: Detecting cardinality constraints in CNF

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