Algebraic decision diagrams and their applications
ICCAD '93 Proceedings of the 1993 IEEE/ACM international conference on Computer-aided design
Decomposable negation normal form
Journal of the ACM (JACM)
Axioms for probability and belief-function proagation
UAI '88 Proceedings of the Fourth Annual Conference on Uncertainty in Artificial Intelligence
Decision with uncertainties, feasibilities, and utilities: towards a unified algebraic framework
Proceedings of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy
Journal of Artificial Intelligence Research
Constraint solving over semirings
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
Valued constraint satisfaction problems: hard and easy problems
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
Decision diagrams for the computation of semiring valuations
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
AND/OR multi-valued decision diagrams (AOMDDs) for graphical models
Journal of Artificial Intelligence Research
Interactive cost configuration over decision diagrams
Journal of Artificial Intelligence Research
Compiling min-based possibilistic causal networks: a mutilated-based approach
ECSQARU'11 Proceedings of the 11th European conference on Symbolic and quantitative approaches to reasoning with uncertainty
Experimental comparative study of compilation-based inference in bayesian and possibilitic networks
WILF'11 Proceedings of the 9th international conference on Fuzzy logic and applications
Explaining propagators for s-DNNF circuits
CPAIOR'12 Proceedings of the 9th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Towards a knowledge compilation map for heterogeneous representation languages
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
A generic framework for a compilation-based inference in probabilistic and possibilistic networks
Information Sciences: an International Journal
Hi-index | 0.00 |
Subsets of the Negation Normal Form formulas (NNFs) of propositional logic have received much attention in AI and proved as valuable representation languages for Boolean functions. In this paper, we present a new framework, called VNNF, for the representation of a much more general class of functions than just Boolean ones. This framework supports a larger family of queries and transformations than in the NNF case, including optimization ones. As such, it encompasses a number of existing settings, e.g. NNFs, semiring CSPs, mixed CSPs, SLDDs, ADD, AADDs. We show how the properties imposed on NNFs to define more "tractable" fragments (decomposability, determinism, decision, read-once) can be extended to VNNFs, giving rise to subsets for which a number of queries and transformations can be achieved in polynomial time.