Making believers out of computers
Artificial Intelligence
On the relationship between circumscription and negation as failure
Artificial Intelligence
CADE-10 Proceedings of the tenth international conference on Automated deduction
Updating logical databases
Information Processing Letters
On the complexity of propositional knowledge base revision, updates, and counterfactuals
Artificial Intelligence
Propositional circumscription and extended closed-world reasoning are &Pgr;p2-complete
Theoretical Computer Science
Optimal compression of propositional Horn knowledge bases: complexity and approximation
Artificial Intelligence
A kind of logical compilation for knowledge bases
Theoretical Computer Science
Incremental recompilation of knowledge (extended abstract)
AAAI'94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 2)
Computing circumscriptive databases, I: theory and algorithms
Information and Computation
Fixed-Parameter Tractability and Completeness I: Basic Results
SIAM Journal on Computing
The size of a revised knowledge base
PODS '95 Proceedings of the fourteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Knowledge compilation and theory approximation
Journal of the ACM (JACM)
First-order logic and automated theorem proving (2nd ed.)
First-order logic and automated theorem proving (2nd ed.)
Off-line reasoning for on-line efficiency: knowledge bases
Artificial Intelligence
Phase transitions and the search problem
Artificial Intelligence - Special volume on frontiers in problem solving: phase transitions and complexity
Generating hard satisfiability problems
Artificial Intelligence - Special volume on frontiers in problem solving: phase transitions and complexity
Default reasoning using classical logic
Artificial Intelligence
Artificial Intelligence
Is intractability of nonmonotonic reasoning a real drawback?
Artificial Intelligence
On compact representations of propositional circumscription
Theoretical Computer Science
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Caching and Lemmaizing in Model Elimination Theorem Provers
CADE-11 Proceedings of the 11th International Conference on Automated Deduction: Automated Deduction
Computation of Prime Implicates and Prime Implicants by a variant of the Davis and Putnam Procedure
ICTAI '96 Proceedings of the 8th International Conference on Tools with Artificial Intelligence
IJCAI'97 Proceedings of the 15th international joint conference on Artifical intelligence - Volume 1
An analysis of approximate knowledge compilation
IJCAI'95 Proceedings of the 14th international joint conference on Artificial 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
Computing circumscription revisited: preliminary report
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 2
Approximate knowledge compilation: the first order case
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
A new algorithm for computing theory prime implicates compilations
AAAI'96 Proceedings of the thirteenth national 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
Parameterized Complexity
A new method for consequence finding and compilation in restricted languages
AAAI '99/IAAI '99 Proceedings of the sixteenth national conference on Artificial intelligence and the eleventh Innovative applications of artificial intelligence conference innovative applications of artificial intelligence
Proof-complexity results for nonmonotonic reasoning
ACM Transactions on Computational Logic (TOCL)
Decomposable negation normal form
Journal of the ACM (JACM)
Monotonic reductions, representative equivalence, and compilation of intractable problems
Journal of the ACM (JACM)
Consistency restoriation and explanations in dynamic CSPs----application to configuration
Artificial Intelligence
Knowledge compilation = query rewriting + view synthesis
Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
On the expressive power of planning formalisms
Logic-based artificial intelligence
Propositional lower bounds: Algorithms and complexity
Annals of Mathematics and Artificial Intelligence
Compute-intensive methods in artificial intelligence
Annals of Mathematics and Artificial Intelligence
Local Reasoning and Knowledge Compilation for Efficient Temporal Abduction
IEEE Transactions on Knowledge and Data Engineering
Succinct Representations of Model Based Belief Revision
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
Compilation Schemes: A Theoretical Tool for Assessing the Expressive Power of Planning Formalisms
KI '99 Proceedings of the 23rd Annual German Conference on Artificial Intelligence: Advances in Artificial Intelligence
Preprocessing of intractable problems
Information and Computation
Artificial Intelligence - Special issue: Fuzzy set and possibility theory-based methods in artificial intelligence
Learning in a compiler for MINSAT algorithms
Theory and Practice of Logic Programming
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
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
The expressive rate of constraints
Annals of Mathematics and Artificial Intelligence
Artificial Intelligence
Compilability of propositional abduction
ACM Transactions on Computational Logic (TOCL)
Redundancy in logic I: CNF propositional formulae
Artificial Intelligence
Complexity of the Unique Extension Problem in Default Logic
Fundamenta Informaticae
A Knowledge Base for the maintenance of knowledge extracted from web data
Knowledge-Based Systems
Translating owl and semantic web rules into prolog: Moving toward description logic programs
Theory and Practice of Logic Programming
AND/OR Multi-valued Decision Diagrams for Constraint Networks
Concurrency, Graphs and Models
A Formal Approach to Aggregated Belief Formation
CIA '08 Proceedings of the 12th international workshop on Cooperative Information Agents XII
On the Definition of Essential and Contingent Properties of Subjective Belief Bases
MICAI '08 Proceedings of the 7th Mexican International Conference on Artificial Intelligence: Advances in Artificial Intelligence
Computing Only Minimal Answers in Disjunctive Deductive Databases
Journal of Automated Reasoning
Compiling the Lexicographic Inference Using Boolean Cardinality Constraints
Canadian AI '09 Proceedings of the 22nd Canadian Conference on Artificial Intelligence: Advances in Artificial Intelligence
Adaptive Web SitesA Knowledge Extraction from Web Data Approach
Proceedings of the 2008 conference on Adaptive Web Sites: A Knowledge Extraction from Web Data Approach
Extending the Knowledge Compilation Map: Closure Principles
Proceedings of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence
Knowledge Base Stratification and Merging Based on Degree of Support
ECSQARU '09 Proceedings of the 10th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty
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
Weighted Description Logics Preference Formulas for Multiattribute Negotiation
SUM '09 Proceedings of the 3rd International Conference on Scalable Uncertainty Management
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
On the compilability and expressive power of propositional planning formalisms
Journal of Artificial Intelligence Research
Journal of Artificial Intelligence Research
AND/OR multi-valued decision diagrams (AOMDDs) for graphical models
Journal of Artificial Intelligence Research
Journal of Artificial Intelligence Research
IJCAI'99 Proceedings of the 16th international joint conference on Artifical intelligence - Volume 1
On reversing actions: algorithms and complexity
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
Integrity and change in modular ontologies
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
A perspective on knowledge compilation
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
DPLL with a trace: from SAT to knowledge compilation
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Measuring conflict and agreement between two prioritized belief bases
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
Redundancy in logic I: CNF propositional formulae
Artificial Intelligence
Artificial Intelligence
FDNC: Decidable nonmonotonic disjunctive logic programs with function symbols
ACM Transactions on Computational Logic (TOCL)
Knowledge compilation properties of trees-of-BDDs, revisited
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Knowledge and Information Systems
Prime implicates and prime implicants: from propositional to modal logic
Journal of Artificial Intelligence Research
The hyper system: knowledge reformation for efficient first-order hypothetical reasoning
PRICAI'00 Proceedings of the 6th Pacific Rim international conference on Artificial intelligence
Horn upper bounds and renaming
SAT'07 Proceedings of the 10th international conference on Theory and applications of satisfiability testing
Reduced implicate/implicant tries
ISMIS'08 Proceedings of the 17th international conference on Foundations of intelligent systems
Reasoning under inconsistency: A forgetting-based approach
Artificial Intelligence
A subclass of Horn CNFs optimally compressible in polynomial time
Annals of Mathematics and Artificial Intelligence
On Computing Backbones of Propositional Theories
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
Prime forms and minimal change in propositional belief bases
Annals of Mathematics and Artificial Intelligence
Knowledge compilation meets database theory: compiling queries to decision diagrams
Proceedings of the 14th International Conference on Database Theory
An ambient intelligent agent model based on behavioural monitoring and cognitive analysis
IEA/AIE'10 Proceedings of the 23rd international conference on Industrial engineering and other applications of applied intelligent systems - Volume Part II
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
Efficient query processing with compiled knowledge bases
TABLEAUX'05 Proceedings of the 14th international conference on Automated Reasoning with Analytic Tableaux and Related Methods
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
Semantic Processing of Legal Texts
Knowledge compilation for automated Team Composition exploiting standard SQL
Proceedings of the 27th Annual ACM Symposium on Applied Computing
Existential closures for knowledge compilation
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Two
Complexity of the Unique Extension Problem in Default Logic
Fundamenta Informaticae
On minimal constraint networks
Artificial Intelligence
Large scale skill matching through knowledge compilation
ISMIS'12 Proceedings of the 20th international conference on Foundations of Intelligent Systems
Proof Systems for Planning Under Cautious Semantics
Minds and Machines
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
Minimal sets over monotone predicates in boolean formulae
CAV'13 Proceedings of the 25th international conference on Computer Aided Verification
A generic framework for a compilation-based inference in probabilistic and possibilistic networks
Information Sciences: an International Journal
| Hi-index | 0.00 |
Knowledge compilation is an AI technique for addressing computationally demanding reasoning problems. In this paper we survey recent results in knowledge compilation of propositional knowledge bases. We first define and limit the scope of such a technique, then we survey exact and approximate knowledge compilation methods. We include a discussion of compilation for non‐monotonic knowledge bases.