Reduction of OBDDs in linear time
Information Processing Letters
Compiling constraint satisfaction problems
Artificial Intelligence
Decomposable negation normal form
Journal of the ACM (JACM)
Consistency restoriation and explanations in dynamic CSPs----application to configuration
Artificial Intelligence
Solving Advanced Reasoning Tasks Using Quantified Boolean Formulas
Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
Hierarchical Representations of Discrete Functions, with Application to Model Checking
CAV '94 Proceedings of the 6th International Conference on Computer Aided Verification
Propositional fragments for knowledge compilation and quantified boolean formulae
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 1
Constructing conditional plans by a theorem-prover
Journal of Artificial Intelligence Research
A perspective on knowledge compilation
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
Artificial Intelligence
A Unified Framework for Certificate and Compilation for QBF
ICLA '09 Proceedings of the 3rd Indian Conference on Logic and Its Applications
Extending the Knowledge Compilation Map: Closure Principles
Proceedings of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence
Knowledge compilation properties of tree-of-BDDs
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 1
Extending the knowledge compilation map: Krom, Horn, affine and beyond
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 1
AND/OR multi-valued decision diagrams (AOMDDs) for graphical models
Journal of Artificial Intelligence Research
Knowledge compilation properties of trees-of-BDDs, revisited
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Interactive cost configuration over decision diagrams
Journal of Artificial Intelligence Research
Existential closures for knowledge compilation
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Two
Hi-index | 0.00 |
Decomposable Negation Normal Form formulae (DNNFs) form an interesting propositional fragment, both for efficiency and succinctness reasons. A famous subclass of the DNNF fragment is the OBDD fragment which offers many polytime queries and transformations, including quantifier eliminations (under some ordering restrictions). Nevertheless, the decomposable AND nodes at work in OBDDs enable only sequential decisions: clusters of variables are never assigned "in parallel" like in full DNNFs. This is an serious drawback since succinctness for the full DNNF fragment relies on such a "parallelization property". This is why we suggest to go a step further, from (sequentially) ordered decision diagrams to (partially) ordered, decomposable decision graphs, in which any decomposable AND node is allowed, and not only assignment ones. We show that, like the OBDD fragment, such a new class offers many tractable queries and transformations, including quantifier eliminations under some ordering restrictions. Furthermore, we show that this class is strictly more succinct than OBDD.