Propagation complete encodings of smooth DNNF theories
type: Item
instance of: scholarly article
title: Propagation complete encodings of smooth DNNF theories
author: Petr Kučera
author: Petr Savický
published in: Constraints
publication date: 2022-09-29T00:00:00Z
full work available at URL: https://arxiv.org/abs/1909.06673
Mathematics Subject Classification ID: 68Txx
Mathematics Subject Classification ID: 68Qxx
Mathematics Subject Classification ID: 03Bxx
zbMATH DE Number: 7594546
MaRDI profile type: Publication
Wikidata QID: Q114226981
OpenAlex ID: W2972395529
cites work: On CNF Encodings of Decision Diagrams
cites work: Principles and practice of constraint programming. 18th international conference, CP 2012, Québec City, QC, Canada, October 8--12, 2012. Proceedings
cites work: Complexity issues related to propagation completeness
cites work: GAC Via Unit Propagation
cites work: Q5503674
cites work: Knowledge Compilation with Empowerment
cites work: On the Tractable Counting of Theory Models and its Application to Truth Maintenance and Belief Revision
cites work: Q4411139
cites work: Compiling CP subproblems to MDDs and d-DNNFs
cites work: Solving non-Boolean satisfiability problems with stochastic local search: A comparison of encodings
cites work: 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
cites work: MDD propagators with explanation
cites work: Generalising and Unifying SLUR and Unit-Refutation Completeness
cites work: Limitations of restricted branching in clause learning
cites work: Decomposing Global Grammar Constraints
cites work: On finding solutions for extended Horn formulas
cites work: Towards an Optimal CNF Encoding of Boolean Cardinality Constraints
DOI: 10.1007/S10601-022-09331-2
description: scientific article; zbMATH DE number 7594546