Extending the Knowledge Compilation Map: Closure Principles

Authors:
Hélène Fargier;Pierre Marquis
Affiliations:
IRIT-CNRS, Université Paul Sabatier, France, email: fargier@irit.fr;Université Lille-Nord de France, Artois, CRIL UMR CNRS 8188, France, email: marquis@cril.univ-artois.fr
Venue:
Proceedings of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence
Year:
2008

Citing 8
Cited 2

Knowledge compilation and theory approximation

Journal of the ACM (JACM)
Decomposable negation normal form

Journal of the ACM (JACM)
A survey on knowledge compilation

AI Communications
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
Propositional independence: formula-variable independence and forgetting

Journal of Artificial Intelligence Research
A knowledge compilation map

Journal of Artificial Intelligence Research
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
Existential closures for knowledge compilation

IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Two

Quantified Score

Hi-index	0.00

Visualization

Abstract

We extend the knowledge compilation map introduced by Darwiche and Marquis with new propositional fragments obtained by applying closure principles to several fragments studied so far. We investigate two closure principles: disjunction and implicit forgetting (i.e., existential quantification). Each introduced fragment is evaluated w.r.t. several criteria, including the complexity of basic queries and transformations, and its spatial efficiency is also analyzed.