Efficient algorithms for combinatorial problems on graphs with bounded, decomposability—a survey
BIT - Ellis Horwood series in artificial intelligence
Graph-Based Algorithms for Boolean Function Manipulation
IEEE Transactions on Computers
A theory of diagnosis from first principles
Artificial Intelligence
Artificial Intelligence
Complexity of finding embeddings in a k-tree
SIAM Journal on Algebraic and Discrete Methods
Symbolic Boolean manipulation with ordered binary-decision diagrams
ACM Computing Surveys (CSUR)
Readings in model-based diagnosis
Readings in model-based diagnosis
Characterizing diagnoses and systems
Artificial Intelligence
A symbolic generalization of probability theory
A symbolic generalization of probability theory
Building problem solvers
Graph driven BDDs—a new data structure for Boolean functions
Theoretical Computer Science
Knowledge compilation and theory approximation
Journal of the ACM (JACM)
A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
SIAM Journal on Computing
Journal of the ACM (JACM)
A very simple function that requires exponential size read-once branching programs
Information Processing Letters
On some tractable classes in deduction and abduction
Artificial Intelligence
Artificial Intelligence - special issue on computational tradeoffs under bounded resources
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
A survey on knowledge compilation
AI Communications
A reactive planner for a model-based executive
IJCAI'97 Proceedings of the Fifteenth international joint conference on Artifical intelligence - Volume 2
Model-based diagnosis using structured system descriptions
Journal of Artificial Intelligence Research
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
An evaluation of structural parameters for probabilistic reasoning: results on benchmark circuits
UAI'96 Proceedings of the Twelfth international conference on Uncertainty in artificial intelligence
Importance Measures from Reliability Theory for Probabilistic Assumption-Based Reasoning
ECSQARU '01 Proceedings of the 6th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty
A compiler for deterministic, decomposable negation normal form
Eighteenth national conference on Artificial intelligence
Compiling propositional weighted bases
Artificial Intelligence - Special issue on nonmonotonic reasoning
A new characterization of probabilities in Bayesian networks
UAI '04 Proceedings of the 20th conference on Uncertainty in artificial intelligence
Complexity of propositional nested circumscription and nested abnormality theories
ACM Transactions on Computational Logic (TOCL)
First order LUB approximations: characterization and algorithms
Artificial Intelligence - Special volume on reformulation
Artificial Intelligence
Multi-state Directed Acyclic Graphs
CAI '07 Proceedings of the 20th conference of the Canadian Society for Computational Studies of Intelligence on Advances in Artificial Intelligence
Relaxations for Compiled Over-Constrained Problems
CP '08 Proceedings of the 14th international conference on Principles and Practice of Constraint Programming
Efficient Genome Wide Tagging by Reduction to SAT
WABI '08 Proceedings of the 8th international workshop on Algorithms in Bioinformatics
Using OBDDs for Efficient Query Evaluation on Probabilistic Databases
SUM '08 Proceedings of the 2nd international conference on Scalable Uncertainty Management
Literal Projection for First-Order Logic
JELIA '08 Proceedings of the 11th European conference on Logics in Artificial Intelligence
Logical Compilation of Bayesian Networks with Discrete Variables
ECSQARU '07 Proceedings of the 9th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty
Extending the Knowledge Compilation Map: Closure Principles
Proceedings of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence
DNNF-based belief state estimation
AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
Compilation of query-rewriting problems into tractable fragments of propositional logic
AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
Prime Implicates and Reduced Implicate Tries
ISMIS '09 Proceedings of the 18th International Symposium on Foundations of Intelligent Systems
Propositional fragments for knowledge compilation and quantified boolean formulae
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 1
On compiling system models for faster and more scalable diagnosis
AAAI'05 Proceedings of the 20th 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
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
Incremental algorithms for approximate compilation
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 3
Journal of Artificial Intelligence Research
On valued negation normal form formulas
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Diagnosability testing with satisfiability algorithms
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Hierarchical diagnosis of multiple faults
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
On the compilation of stratified belief bases under linear and possibilistic logic policies
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
DPLL with a trace: from SAT to knowledge compilation
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Compiling Bayesian networks with local structure
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
First order LUB approximations: characterization and algorithms
Artificial Intelligence - Special volume on reformulation
Knowledge compilation properties of trees-of-BDDs, revisited
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Tableaux for Projection Computation and Knowledge Compilation
TABLEAUX '09 Proceedings of the 18th International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
Applications of automated reasoning
KI'06 Proceedings of the 29th annual German conference on Artificial intelligence
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
Compiling solution configurations in semiring valuation systems
MICAI'07 Proceedings of the artificial intelligence 6th Mexican international conference on Advances in artificial intelligence
Reduced implicate/implicant tries
ISMIS'08 Proceedings of the 17th international conference on Foundations of intelligent systems
Approximating weighted Max-SAT problems by compensating for relaxations
CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming
Nenofex: expanding NNF for QBF solving
SAT'08 Proceedings of the 11th international conference on Theory and applications of satisfiability testing
On Decomposability and Interaction Functions
Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence
Knowledge Compilation Using Interval Automata and Applications to Planning
Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence
RALF: reliability analysis for logic faults: an exact algorithm and its applications
Proceedings of the Conference on Design, Automation and Test in Europe
New approaches to boolean quantifier elimination
ACM Communications in Computer Algebra
Compiling min-based possibilistic causal networks: a mutilated-based approach
ECSQARU'11 Proceedings of the 11th European conference on Symbolic and quantitative approaches to reasoning with uncertainty
Experimental comparative study of compilation-based inference in bayesian and possibilitic networks
WILF'11 Proceedings of the 9th international conference on Fuzzy logic and applications
Linkless normal form for ALC concepts and TBoxes
KI'11 Proceedings of the 34th Annual German conference on Advances in artificial intelligence
Sequential diagnosis by abstraction
Journal of Artificial Intelligence Research
Efficient query processing with compiled knowledge bases
TABLEAUX'05 Proceedings of the 14th international conference on Automated Reasoning with Analytic Tableaux and Related Methods
Review: learning bayesian networks: Approaches and issues
The Knowledge Engineering Review
Duality in knowledge compilation techniques
ISMIS'05 Proceedings of the 15th international conference on Foundations of Intelligent Systems
Normal forms for knowledge compilation
ISMIS'05 Proceedings of the 15th international conference on Foundations of Intelligent Systems
Functional treewidth: bounding complexity in the presence of functional dependencies
SAT'06 Proceedings of the 9th international conference on Theory and Applications of Satisfiability Testing
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
Computing minimum-cardinality diagnoses by model relaxation
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Two
On the impact of belief state representation in planning under uncertainty
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Three
Bucket and mini-bucket schemes for m best solutions over graphical models
GKR'11 Proceedings of the Second international conference on Graph Structures for Knowledge Representation and Reasoning
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
Algorithms for generating ordered solutions for explicit and/or structures
Journal of Artificial Intelligence Research
On the violation of circuits in decomposable negation normal form
AI'12 Proceedings of the 25th Australasian joint conference on Advances in Artificial Intelligence
Propositional Update Operators Based on Formula/Literal Dependence
ACM Transactions on Computational Logic (TOCL)
A comparative study of compilation-based inference methods for min-based possibilistic networks
ECSQARU'13 Proceedings of the 12th European conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty
Cliquewidth and knowledge compilation
SAT'13 Proceedings of the 16th international conference on Theory and Applications of Satisfiability Testing
SAT-Based analysis and quantification of information flow in programs
QEST'13 Proceedings of the 10th international conference on Quantitative Evaluation of Systems
Knowledge compilation for model counting: affine decision trees
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
A generalization of SAT and #SAT for robust policy evaluation
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
Hi-index | 0.00 |
Knowledge compilation has been emerging recently as a new direction of research for dealing with the computational intractability of general propositional reasoning. According to this approach, the reasoning process is split into two phases: an off-line compilation phase and an on-line query-answering phase. In the off-line phase, the propositional theory is compiled into some target language, which is typically a tractable one. In the on-line phase, the compiled target is used to efficiently answer a (potentially) exponential number of queries. The main motivation behind knowledge compilation is to push as much of the computational overhead as possible into the off-line phase, in order to amortize that overhead over all on-line queries. Another motivation behind compilation is to produce very simple on-line reasoning systems, which can be embedded cost-effectively into primitive computational platforms, such as those found in consumer electronics.One of the key aspects of any compilation approach is the target language into which the propositional theory is compiled. Previous target languages included Horn theories, prime implicates/implicants and ordered binary decision diagrams (OBDDs). We propose in this paper a new target compilation language, known as decomposable negation normal form (DNNF), and present a number of its properties that make it of interest to the broad community. Specifically, we show that DNNF is universal; supports a rich set of polynomial--time logical operations; is more space-efficient than OBDDs; and is very simple as far as its structure and algorithms are concerned. Moreover, we present an algorithm for converting any propositional theory in clausal form into a DNNF and show that if the clausal form has a bounded treewidth, then its DNNF compilation has a linear size and can be computed in linear time (treewidth is a graph-theoretic parameter that measures the connectivity of the clausal form). We also propose two techniques for approximating the DNNF compilation of a theory when the size of such compilation is too large to be practical. One of the techniques generates a sound but incomplete compilation, while the other generates a complete but unsound compilation. Together, these approximations bound the exact compilation from below and above in terms of their ability to answer clausal entailment queries. Finally, we show that the class of polynomial--time DNNF operations is rich enough to support relatively complex AI applications, by proposing a specific framework for compiling model-based diagnosis systems.