New compilation languages based on structured decomposability

Authors:
Knot Pipatsrisawat;Adnan Darwiche
Affiliations:
Computer Science Department, University of California, Los Angeles, Los Angeles, CA;Computer Science Department, University of California, Los Angeles, Los Angeles, CA
Venue:
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 1
Year:
2008

Citing 19
Cited 8

Graph-Based Algorithms for Boolean Function Manipulation

IEEE Transactions on Computers
On the size of binary decision diagrams representing Boolean functions

Theoretical Computer Science
Knowledge compilation and theory approximation

Journal of the ACM (JACM)
Decomposable negation normal form

Journal of the ACM (JACM)
The Complexity of Equivalence and Containment for Free Single Variable Program Schemes

Proceedings of the Fifth Colloquium on Automata, Languages and Programming
The LCA Problem Revisited

LATIN '00 Proceedings of the 4th Latin American Symposium on Theoretical Informatics
A compiler for deterministic, decomposable negation normal form

Eighteenth national conference on Artificial intelligence
A survey on knowledge compilation

AI Communications
DNNF-based belief state estimation

AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
A knowledge compilation map

Journal of Artificial Intelligence Research
Hierarchical diagnosis of multiple faults

IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Knowledge compilation using theory prime implicates

IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
The comparative linguistics of knowledge representation

IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
Model compilation for real-time planning and diagnosis with feedback

IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Compiling relational Bayesian networks for exact inference

International Journal of Approximate Reasoning
Structural relaxations by variable renaming and their compilation for solving MinCostSAT

CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
Clone: solving weighted Max-SAT in a reduced search space

AI'07 Proceedings of the 20th Australian joint conference on Advances in artificial intelligence
Compilation for critically constrained knowledge bases

AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
Compiling constraint networks into AND/OR multi-valued decision diagrams (AOMDDs)

CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming

Knowledge compilation properties of trees-of-BDDs, revisited

IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Top-Down Algorithms for Constructing Structured DNNF: Theoretical and Practical Implications

Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence
On Decomposability and Interaction Functions

Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence
Relax, compensate and then recover

JSAI-isAI'10 Proceedings of the 2010 international conference on New Frontiers in Artificial Intelligence
SDD: a new canonical representation of propositional knowledge bases

IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Two
Existential closures for knowledge compilation

IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Two
Representing CSPs with set-labeled diagrams: a compilation map

GKR'11 Proceedings of the Second international conference on Graph Structures for Knowledge Representation and Reasoning
Knowledge compilation for model counting: affine decision trees

IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

We introduce in this paper two new, complete propositional languages and study their properties in terms of (1) their support for polytime operations and (2) their ability to represent boolean functions compactly. The new languages are based on a structured version of decomposability--a property that underlies a number of tractable languages. The key characteristic of structured decomposability is its support for a polytime conjoin operation, which is known to be intractable for unstructured decomposability. We show that any CNF can be compiled into formulas in the new languages, whose size is only exponential in the treewidth of the CNF. Our study also reveals that one of the languages we identify is as powerful as OBDDs in terms of answering key inference queries, yet is more succinct than OBDDs.