A theory of diagnosis from first principles
Artificial Intelligence
The complexity of Boolean functions
The complexity of Boolean functions
Tree clustering for constraint networks (research note)
Artificial Intelligence
A symbolic generalization of probability theory
A symbolic generalization of probability theory
Qualitative probabilities: a normative framework for commonsense reasoning
Qualitative probabilities: a normative framework for commonsense reasoning
Knowledge compilation and theory approximation
Journal of the ACM (JACM)
Is intractability of nonmonotonic reasoning a real drawback?
Artificial Intelligence
Reducing belief revision to circumscription (and vice versa)
Artificial Intelligence
On compact representations of propositional circumscription
Theoretical Computer Science
The size of a revised knowledge base
Artificial Intelligence
Note about cardinality-based circumscription
Artificial Intelligence
Default reasoning from conditional knowledge bases: complexity and tractable cases
Artificial Intelligence
Decomposable negation normal form
Journal of the ACM (JACM)
Monotonic reductions, representative equivalence, and compilation of intractable problems
Journal of the ACM (JACM)
Nonmonotonic reasoning: from complexity to algorithms
Annals of Mathematics and Artificial Intelligence
Compiling Knowledge into Decomposable Negation Normal Form
IJCAI '99 Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence
Preprocessing of intractable problems
Information and Computation
A compiler for deterministic, decomposable negation normal form
Eighteenth national conference on Artificial intelligence
A survey on knowledge compilation
AI Communications
Space efficiency of propositional knowledge representation formalisms
Journal of Artificial Intelligence Research
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
Weakening conflicting information for iterated revision and knowledge integration
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
A perspective on knowledge compilation
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
How to infer from inconsistent beliefs without revising
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 2
Compilation for critically constrained knowledge bases
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
On Stratified Belief Base Compilation
Annals of Mathematics and Artificial Intelligence
International Journal of Approximate Reasoning
On the Use of Possibilistic Bases for Local Computations in Product-Based Possibilistic Networks
CAI '07 Proceedings of the 20th conference of the Canadian Society for Computational Studies of Intelligence on Advances in Artificial Intelligence
Efficient Genome Wide Tagging by Reduction to SAT
WABI '08 Proceedings of the 8th international workshop on Algorithms in Bioinformatics
Compiling the Lexicographic Inference Using Boolean Cardinality Constraints
Canadian AI '09 Proceedings of the 22nd Canadian Conference on Artificial Intelligence: Advances in Artificial Intelligence
Compiling possibilistic knowledge bases
Proceedings of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy
Propositional fragments for knowledge compilation and quantified boolean formulae
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 1
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 2
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
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Compiling relational Bayesian networks for exact inference
International Journal of Approximate Reasoning
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
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
An expressive and efficient solution to the service selection problem
ISWC'10 Proceedings of the 9th international semantic web conference on The semantic web - Volume Part I
Relational preference rules for control
Artificial Intelligence
On the complexity of paraconsistent inference relations
Inconsistency Tolerance
Hi-index | 0.00 |
In this paper, we investigate the extent to which knowledge compilation can be used to improve model checking and inference from propositional weighted bases. We first focus on the compilability issue for both problems, deriving mainly non-compilability results in the case preferences are subject to change. Then, we present a general notion of C-normal weighted base that is parametrized by a tractable class C for the clausal entailment problem. We show how every weighted base can be turned ("compiled") into a query-equivalent C-normal base whenever C is a complete class for propositional logic. Both negative and positive results are presented. On the one hand, complexity results are identified, showing that the inference problem from a C-normal weighted base is as difficult as in the general case, when the prime implicates, Horn cover or renamable Horn cover classes are targeted. On the other hand, we show that both the model checking and the (clausal) inference problem become tractable whenever DNNF-normal bases are considered. Moreover, we show that the set of all preferred models of a DNNF-normal weighted base can be computed in time polynomial in the output size, and as a consequence, model checking is also tractable for such bases. Finally, we sketch how our results can be used in model-based diagnosis in order to compute the most likely diagnoses of a system.