Propagation complete encodings of smooth DNNF theories

DOI10.1007/s10601-022-09331-2OpenAlexW2972395529WikidataQ114226981 ScholiaQ114226981MaRDI QIDQ2079276

Petr Kučera, Petr Savický

Publication date: 29 September 2022

Published in: Constraints (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1909.06673

Mathematics Subject Classification ID

Artificial intelligence (68Txx) Theory of computing (68Qxx) General logic (03Bxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Integration of AI and OR techniques in contraint programming for combinatorial optimzation problems. 9th international conference, CPAIOR 2012, Nantes, France, May 28--June 1, 2012. Proceedings
• MDD propagators with explanation
• On finding solutions for extended Horn formulas
• Principles and practice of constraint programming. 18th international conference, CP 2012, Québec City, QC, Canada, October 8--12, 2012. Proceedings
• Solving non-Boolean satisfiability problems with stochastic local search: A comparison of encodings
• Limitations of restricted branching in clause learning
• Compiling CP subproblems to MDDs and d-DNNFs
• Complexity issues related to propagation completeness
• On CNF Encodings of Decision Diagrams
• Knowledge Compilation with Empowerment
• Generalising and Unifying SLUR and Unit-Refutation Completeness
• GAC Via Unit Propagation
• Decomposing Global Grammar Constraints
• Towards an Optimal CNF Encoding of Boolean Cardinality Constraints
• On the Tractable Counting of Theory Models and its Application to Truth Maintenance and Belief Revision

This page was built for publication: Propagation complete encodings of smooth DNNF theories