Detecting Cardinality Constraints in CNF
From MaRDI portal
Publication:3192077
DOI10.1007/978-3-319-09284-3_22zbMath1423.68437OpenAlexW94961302MaRDI QIDQ3192077
Armin Biere, Daniel Le Berre, Norbert Manthey, Emmanuel Lonca
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
Analysis of algorithms and problem complexity (68Q25) 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, Recognition of Nested Gates in CNF Formulas, The configurable SAT solver challenge (CSSC), Multi-agent path finding with mutex propagation