Graph-Based Algorithms for Boolean Function Manipulation
IEEE Transactions on Computers
The complexity of Boolean functions
The complexity of Boolean functions
Symbolic Boolean manipulation with ordered binary-decision diagrams
ACM Computing Surveys (CSUR)
On the complexity of analysis and manipulation of Boolean functions in terms of decision graphs
Information Processing Letters
Knowledge compilation and theory approximation
Journal of the ACM (JACM)
On the hardness of approximate reasoning
Artificial Intelligence
Journal of the ACM (JACM)
Propositional belief base update and minimal change
Artificial Intelligence
Decomposable negation normal form
Journal of the ACM (JACM)
Algorithms and Data Structures in VLSI Design
Algorithms and Data Structures in VLSI Design
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
Planning via Model Checking: A Decision Procedure for AR
ECP '97 Proceedings of the 4th European Conference on Planning: Recent Advances in AI Planning
Some connections between nonuniform and uniform complexity classes
STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
An Investigation of the Laws of Thought
An Investigation of the Laws of Thought
A survey on knowledge compilation
AI Communications
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
IJCAI'01 Proceedings of the 17th 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
A differential approach to inference in Bayesian networks
Journal of the ACM (JACM)
Compiling propositional weighted bases
Artificial Intelligence - Special issue on nonmonotonic reasoning
Complexity of propositional nested circumscription and nested abnormality theories
ACM Transactions on Computational Logic (TOCL)
Compilability of propositional abduction
ACM Transactions on Computational Logic (TOCL)
AND/OR search spaces for graphical models
Artificial Intelligence
Reasoning under minimal upper bounds in propositional logic
Theoretical Computer Science
On probabilistic inference by weighted model counting
Artificial Intelligence
Artificial Intelligence
Optimizing requirements decisions with keys
Proceedings of the 4th international workshop on Predictor models in software engineering
Translating owl and semantic web rules into prolog: Moving toward description logic programs
Theory and Practice of Logic Programming
Implementing semantic merging operators using binary decision diagrams
International Journal of Approximate Reasoning
Learning to assign degrees of belief in relational domains
Machine Learning
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
Updating Reduced Implicate Tries
TABLEAUX '07 Proceedings of the 16th international conference on Automated Reasoning with Analytic Tableaux and Related Methods
AND/OR Multi-valued Decision Diagrams for Constraint Networks
Concurrency, Graphs and Models
Relaxations for Compiled Over-Constrained Problems
CP '08 Proceedings of the 14th international conference on Principles and Practice of Constraint Programming
Approximate Compilation of Constraints into Multivalued Decision Diagrams
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
Conditioning probabilistic databases
Proceedings of the VLDB Endowment
Shared Ordered Binary Decision Diagrams for Dempster-Shafer Theory
ECSQARU '07 Proceedings of the 9th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty
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
Distributed Consistency-Based Diagnosis
LPAR '08 Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
A Unified Framework for Certificate and Compilation for QBF
ICLA '09 Proceedings of the 3rd Indian Conference on Logic and Its Applications
Secondary-storage confidence computation for conjunctive queries with inequalities
Proceedings of the 2009 ACM SIGMOD International Conference on Management of data
Compiling the Lexicographic Inference Using Boolean Cardinality Constraints
Canadian AI '09 Proceedings of the 22nd Canadian Conference on Artificial Intelligence: Advances in Artificial Intelligence
Using Model Counting to Find Optimal Distinguishing Tests
CPAIOR '09 Proceedings of the 6th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Extending the Knowledge Compilation Map: Closure Principles
Proceedings of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence
Compilation of query-rewriting problems into tractable fragments of propositional logic
AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
Approximate compilation for embedded model-based reasoning
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
A spectrum of symbolic on-line diagnosis approaches
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 1
Prime implicates and prime implicants in modal logic
AAAI'07 Proceedings of the 22nd 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
Prime implicate normal form for ALC concepts
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
Journal of Artificial Intelligence Research
On the expressiveness of Levesque's normal form
Journal of Artificial Intelligence Research
Learning partially observable deterministic action models
Journal of Artificial Intelligence Research
AND/OR multi-valued decision diagrams (AOMDDs) for graphical models
Journal of Artificial Intelligence Research
On valued negation normal form formulas
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
Computing Optimal Tests for Non-deterministic Systems Using DNNF Graphs
Electronic Notes in Theoretical Computer Science (ENTCS)
DPLL with a trace: from SAT to knowledge compilation
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Model compilation for real-time planning and diagnosis with feedback
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
FDNC: Decidable nonmonotonic disjunctive logic programs with function symbols
ACM Transactions on Computational Logic (TOCL)
Compiling the votes of a subelectorate
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Circuit complexity and decompositions of global constraints
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
A new d-DNNF-based bound computation algorithm for functional E-MAJSAT
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
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
Compiling relational Bayesian networks for exact inference
International Journal of Approximate Reasoning
Prime implicates and prime implicants: from propositional to modal logic
Journal of Artificial Intelligence Research
Horn upper bounds and renaming
SAT'07 Proceedings of the 10th international conference on Theory and applications of satisfiability testing
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
Prime implicates for approximate reasoning
KSEM'07 Proceedings of the 2nd international conference on Knowledge science, engineering and management
Optimizing inference in Bayesian networks and semiring valuation algebras
MICAI'07 Proceedings of the artificial intelligence 6th Mexican international conference on Advances in artificial intelligence
Compiling solution configurations in semiring valuation systems
MICAI'07 Proceedings of the artificial intelligence 6th Mexican international conference on Advances in artificial intelligence
Clone: solving weighted Max-SAT in a reduced search space
AI'07 Proceedings of the 20th Australian joint conference on Advances in artificial intelligence
Approximating weighted Max-SAT problems by compensating for relaxations
CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming
Reasoning about optimal collections of solutions
CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming
Compiling all possible conflicts of a CSP
CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming
Constraint-based optimal testing using DNNF graphs
CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming
A subclass of Horn CNFs optimally compressible in polynomial time
Annals of Mathematics and Artificial 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
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
Interactive cost configuration over decision diagrams
Journal of Artificial Intelligence Research
Generating special-purpose stateless propagators for arbitrary constraints
CP'10 Proceedings of the 16th international conference on Principles and practice of constraint programming
Relax, compensate and then recover: a theory of anytime, approximate inference
JELIA'10 Proceedings of the 12th European conference on Logics in artificial intelligence
Prime forms and minimal change in propositional belief bases
Annals of Mathematics and Artificial Intelligence
SampleSearch: Importance sampling in presence of determinism
Artificial Intelligence
State agnostic planning graphs: deterministic, non-deterministic, and probabilistic planning
Artificial Intelligence
Knowledge compilation meets database theory: compiling queries to decision diagrams
Proceedings of the 14th International Conference on Database Theory
On the optimal approximation of queries using tractable propositional languages
Proceedings of the 14th International Conference on Database Theory
Plato: a compiler for interactive web forms
PADL'11 Proceedings of the 13th international conference on Practical aspects of declarative languages
Phase transitions in knowledge compilation: an experimental study
SAT'11 Proceedings of the 14th international conference on Theory and application of satisfiability testing
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
Mapping conformant planning into SAT through compilation and projection
CAEPIA'05 Proceedings of the 11th Spanish association conference on Current Topics in Artificial Intelligence
Compiling constraint networks into AND/OR multi-valued decision diagrams (AOMDDs)
CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
Efficient query processing with compiled knowledge bases
TABLEAUX'05 Proceedings of the 14th international conference on Automated Reasoning with Analytic Tableaux and Related Methods
Using DPLL for efficient OBDD construction
SAT'04 Proceedings of the 7th international conference on Theory and Applications of Satisfiability Testing
Applied quantitative information flow and statistical databases
FAST'09 Proceedings of the 6th international conference on Formal Aspects in Security and Trust
Aggregation in probabilistic databases via knowledge compilation
Proceedings of the VLDB Endowment
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
Knowledge compilation for belief change
AI'06 Proceedings of the 19th Australian joint conference on Artificial Intelligence: advances in Artificial Intelligence
Relax, compensate and then recover
JSAI-isAI'10 Proceedings of the 2010 international conference on New Frontiers in Artificial Intelligence
Computational aspects of attack---defense trees
SIIS'11 Proceedings of the 2011 international conference on Security and Intelligent Information Systems
Knowledge compilation with empowerment
SOFSEM'12 Proceedings of the 38th international conference on Current Trends in Theory and Practice of Computer Science
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
Lifted probabilistic inference by first-order knowledge compilation
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Three
Explaining propagators for s-DNNF circuits
CPAIOR'12 Proceedings of the 9th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
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
Dsharp: fast d-DNNF compilation with sharpSAT
Canadian AI'12 Proceedings of the 25th Canadian conference on Advances in Artificial Intelligence
The dichotomy of probabilistic inference for unions of conjunctive queries
Journal of the ACM (JACM)
Relevant minimal change in belief update
JELIA'12 Proceedings of the 13th European conference on Logics in Artificial Intelligence
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
Compiling probabilistic graphical models using sentential decision diagrams
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'13 Proceedings of the 16th international conference on Theory and Applications of Satisfiability Testing
Minimal sets over monotone predicates in boolean formulae
CAV'13 Proceedings of the 25th international conference on Computer Aided Verification
Complexity issues related to propagation completeness
Artificial Intelligence
BUNDLE: a reasoner for probabilistic ontologies
RR'13 Proceedings of the 7th international conference on Web Reasoning and Rule Systems
Oblivious bounds on the probability of boolean functions
ACM Transactions on Database Systems (TODS)
Just-in-time compilation of knowledge bases
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Towards a knowledge compilation map for heterogeneous representation languages
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Semiring labelled decision diagrams, revisited: canonicity and spatial efficiency issues
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
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
The inclusion-exclusion rule and its application to the junction tree algorithm
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Generalising Unit-Refutation Completeness and SLUR via Nested Input Resolution
Journal of Automated Reasoning
A generic framework for a compilation-based inference in probabilistic and possibilistic networks
Information Sciences: an International Journal
Anytime approximation in probabilistic databases
The VLDB Journal — The International Journal on Very Large Data Bases
On rule systems whose consistency can be locally maintained
AI Communications - Intelligent Engineering Techniques for Knowledge Bases
Hi-index | 0.00 |
We propose 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 then provide a knowledge compilation map, which analyzes a large number of existing target compilation languages according to their succinctness and their polytime transformations and queries. 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 (such as OBDDs), which we show to include a relatively large number of target compilation languages.