Automated deduction by theory resolution
Journal of Automated Reasoning
An incremental method for generating prime implicants/implicates
Journal of Symbolic Computation
CADE-10 Proceedings of the tenth international conference on Automated deduction
Building problem solvers
An empirical evaluation of knowledge compilation by theory approximation
AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
A kind of logical compilation for knowledge bases
Theoretical Computer Science
AI*IA Proceedings of the 2nd Congress of the Italian Association for Artificial Intelligence on Trends in Artificial Intelligence
The complexity of theorem-proving procedures
STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
A New Algorithm for Generating Prime Implicants
IEEE Transactions on Computers
Algorithms for propositional KB approximation
AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
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
Resource-bounded Relational Reasoning: Induction and Deduction Through Stochastic Matching
Machine Learning - Special issue on multistrategy learning
Decomposable negation normal form
Journal of the ACM (JACM)
Consistency restoriation and explanations in dynamic CSPs----application to configuration
Artificial Intelligence
Annals of Mathematics and Artificial Intelligence
Improving the Efficiency of Reasoning Through Structure-Based Reformulation
SARA '02 Proceedings of the 4th International Symposium on Abstraction, Reformulation, and Approximation
Attacking the Complexity of Prioritized Inference Preliminary Report
SBIA '02 Proceedings of the 16th Brazilian Symposium on Artificial Intelligence: Advances in Artificial Intelligence
A Logic for Anytime Deduction and Anytime Compilation
JELIA '98 Proceedings of the European Workshop on Logics in Artificial Intelligence
Artificial Intelligence - Special issue: Fuzzy set and possibility theory-based methods in 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
Partition-based logical reasoning for first-order and propositional theories
Artificial Intelligence - Special volume on reformulation
Querying Distributed Data through Distributed Ontologies: A Simple but Scalable Approach
IEEE Intelligent Systems
A survey on knowledge compilation
AI Communications
Metatheory of actions: Beyond consistency
Artificial Intelligence
An algorithm for computing theory prime implicates in first order logic
International Journal of Information and Communication Technology
Eliminating Redundant Clauses in SAT Instances
CPAIOR '07 Proceedings of the 4th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
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
Journal of Artificial Intelligence Research
IJCAI'97 Proceedings of the 15th international joint conference on Artifical intelligence - Volume 1
A perspective on knowledge compilation
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
Partition-based logical reasoning for first-order and propositional theories
Artificial Intelligence - Special volume on reformulation
Reduced implicate/implicant tries
ISMIS'08 Proceedings of the 17th international conference on Foundations of intelligent systems
Compiling all possible conflicts of a CSP
CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming
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
Efficient query processing with compiled knowledge bases
TABLEAUX'05 Proceedings of the 14th international conference on Automated Reasoning with Analytic Tableaux and Related Methods
Introduction to inconsistency tolerance
Inconsistency Tolerance
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
Knowledge compilation with empowerment
SOFSEM'12 Proceedings of the 38th international conference on Current Trends in Theory and Practice of Computer Science
Complexity issues related to propagation completeness
Artificial Intelligence
Hi-index | 0.00 |
In this paper, we are mainly concerned with logical compilations of propositional knowledge bases. We propose a new approach to equivalence-preserving knowledge compilation based on a generalization of the standard notion of prime implicate, the theory prime implicates. Our approach consists in taking advantage of tractable theories Φ implied by the knowledge base Σ to make Σ local by computing the theory prime implicates of Σ w.r.t. Φ. As a main result, query answering from theory prime implicates compilations can be done in time polynomial in their sizes. While there is no guarantee that the size of a compilation is not exponentially greater than the size of the original knowledge base, we show that it is smaller than the size of the prime implicates compilation in the general case and it can even be exponentially smaller. Additionally, we present some experimental results providing evidence for the substantial space savings achievable with our compilation technique.