Extending the knowledge compilation map: Krom, Horn, affine and beyond

Authors:
Hélène Fargier;Pierre Marquis
Affiliations:
IRIT, CNRS, Université Paul Sabatier, Toulouse, France;Université Lille-Nord de France, Lens, France
Venue:
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 1
Year:
2008

Citing 13
Cited 5

A linear algorithm for renaming a set of clauses as a Horn set

Theoretical Computer Science
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
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
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
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
Compilation for critically constrained knowledge bases

AAAI'96 Proceedings of the thirteenth national 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
Non-conservative extension of a peer in a P2P inference system

AI Communications
Existential closures for knowledge compilation

IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Two
Towards a knowledge compilation map for heterogeneous representation languages

IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
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 extend the knowledge compilation map introduced by Darwiche and Marquis with three influential propositional fragments, the Krom CNF one (also known as the bijunctive fragment), the Hom CNF fragment and the affine fragment (also known as the biconditional fragment) as well as seven additional languages based on them, and composed respectively of Krom or Hom CNF formulas, renamable Hom CNF formulas, disjunctions of Krom CNF formulas, disjunctions of Hom CNF formulas, disjunctions of Krom or Hom CNF formulas, disjunctions of renamable Hom CNF formulas, and disjunction of fine formulas. Each fragment is evaluated w.r.t. several criteria, including the complexity of basic quaries and transformation, and its spatial efficiency is also analysed.