Existential closures for knowledge compilation

Authors:
Pierre Marquis
Affiliations:
CRIL, CNRS, Université d'Artois, Lens, France
Venue:
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Two
Year:
2011

Citing 18
Cited 2

Knowledge compilation and theory approximation

Journal of the ACM (JACM)
Decomposable negation normal form

Journal of the ACM (JACM)
On 2-SAT and Renamable Horn

Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
The complexity of satisfiability problems

STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
A survey on knowledge compilation

AI Communications
Extending the Knowledge Compilation Map: Closure Principles

Proceedings of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence
On the use of partially ordered decision graphs for knowledge compilation and quantified Boolean formulae

AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
Knowledge compilation properties of tree-of-BDDs

AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 1
Backdoor trees

AAAI'08 Proceedings of the 23rd 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
New compilation languages based on structured decomposability

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
A knowledge compilation map

Journal of Artificial Intelligence Research
Tractable cover compilations

IJCAI'97 Proceedings of the 15th international joint conference on Artifical intelligence - Volume 1
The comparative linguistics of knowledge representation

IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
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
Compilation for critically constrained knowledge bases

AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1

Knowledge compilation for model counting: affine decision trees

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

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study the existential closures of several propositional languages L considered recently as target languages for knowledge compilation (KC), namely the incomplete fragments KROM-C, HORN-C, K/H-C, renH-C, AFF, and the corresponding disjunction closures KROM-C[V], HORN-C[V], K/H-C[V], renH-C[V], and AFF[V]. We analyze the queries, transformations, expressiveness and succinctness of the resulting languages L[∃] in order to locate them in the KC map. As a by-product, we also address several issues concerning disjunction closures that were left open so far. From our investigation, the language HORN - C[V, ∃] (where disjunctions and existential quantifications can be applied to Horn CNF formulae) appears as an interesting target language for the KC purpose, challenging the influential DNNF languages.