On CNF Encodings of Decision Diagrams

DOI10.1007/978-3-319-33954-2_1zbMath1475.68331OpenAlexW2461501408MaRDI QIDQ2815090

Peter J. Stuckey, Ignasi Abío, Valentin Mayer-Eichberger, Graeme Gange

Publication date: 27 June 2016

Published in: Integration of AI and OR Techniques in Constraint Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-33954-2_1

Mathematics Subject Classification ID

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

Related Items (4)

Coupling different integer encodings for SAT ⋮ Learning a propagation complete formula ⋮ Bounds on the size of PC and URC formulas ⋮ Propagation complete encodings of smooth DNNF theories

This page was built for publication: On CNF Encodings of Decision Diagrams