A perspective on knowledge compilation

Authors:
Adnan Darwiche;Pierre Marquis
Affiliations:
Computer Science Department, University of California, Los Angeles, CA;CRIL, Université d'Artois, Lens Cedex, France
Venue:
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
Year:
2001

Citing 12
Cited 14

Graph-Based Algorithms for Boolean Function Manipulation

IEEE Transactions on Computers
Knowledge compilation and theory approximation

Journal of the ACM (JACM)
Learning to reason

Journal of the ACM (JACM)
Propositional belief base update and minimal change

Artificial Intelligence
Efficient Boolean Manipulation with OBDD's Can be Extended to FBDD's

IEEE Transactions on Computers
Compiling Knowledge into Decomposable Negation Normal Form

IJCAI '99 Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence
Some connections between nonuniform and uniform complexity classes

STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
A survey on knowledge compilation

AI Communications
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 = query rewriting + view synthesis

Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
A compiler for deterministic, decomposable negation normal form

Eighteenth national conference on Artificial intelligence
Man bites dog: looking for interesting inconsistencies in structured news reports

Data & Knowledge Engineering
Knowledge Compilation Using the Extension Rule

Journal of Automated Reasoning
On Stratified Belief Base Compilation

Annals of Mathematics and Artificial Intelligence
Compiling propositional weighted bases

Artificial Intelligence - Special issue on nonmonotonic reasoning
Compiling CSPs into Tree-Driven Automata for Interactive Solving

Constraints
On propositional definability

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

Journal of Artificial Intelligence Research
Using probabilistic argumentation for key validation in public-key cryptography

International Journal of Approximate Reasoning
Prime forms and minimal change in propositional belief bases

Annals of Mathematics and Artificial Intelligence
A syntactical approach to belief update

MICAI'05 Proceedings of the 4th Mexican international conference on Advances in Artificial Intelligence
Just-in-time compilation of knowledge bases

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

Quantified Score

Hi-index	0.00

Visualization

Abstract

We provide a perspective on knowledge compilation which calls for analyzing different compilation approaches according to two key dimensions: the succinctness of the target compilation language, and the class of queries and transformations that the language supports in polytime. We argue that such analysis is necessary for placing new compilation approaches within the context of existing ones. We also go beyond classical, flat target compilation languages based on CNF and DNF, and consider a richer, nested class based on directed acyclic graphs, which we show to include a relatively large number of target compilation languages.