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
Using Recursive Decomposition to Construct Elimination Orders, Jointrees, and Dtrees
ECSQARU '01 Proceedings of the 6th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty
Why Use a Unified Knowledge Representation?
Proceedings of the 14th International conference on Industrial and engineering applications of artificial intelligence and expert systems: engineering of intelligent systems
Knowledge Base Maintenance through Knowledge Representation
DEXA '01 Proceedings of the 12th International Conference on Database and Expert Systems Applications
A rigorous approach to knowledge base maintenance
IEA/AIE'2003 Proceedings of the 16th international conference on Developments in applied artificial intelligence
The engineering of expert systems testing process
AIC'07 Proceedings of the 7th Conference on 7th WSEAS International Conference on Applied Informatics and Communications - Volume 7
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
Building maintainable knowledge bases with knowledge objects
KES'07/WIRN'07 Proceedings of the 11th international conference, KES 2007 and XVII Italian workshop on neural networks conference on Knowledge-based intelligent information and engineering systems: Part I
JaCk-SAT: a new parallel scheme to solve the satisfiability problem (SAT) based on join-and-check
PPAM'07 Proceedings of the 7th international conference on Parallel processing and applied mathematics
Introduction to inconsistency tolerance
Inconsistency Tolerance
Algorithms for generating ordered solutions for explicit and/or structures
Journal of Artificial Intelligence Research
Hi-index | 0.00 |
We propose a method for compiling propositional theories into a new tractable form that we refer to as decomposable negation normal form (DNNF). We show a number of results about our compilation approach. First, we show that every propositional theory can be compiled into DNNF and present an algorithm to this effect. Second, we show that if a clausal form has a bounded treewidth, then its DNNF compilation has a linear size and can be computed in linear time - treewidth is a graphtheoretic parameter which measures the connectivity of the clausal form. Third, we show that once a propositional theory is compiled into DNNF, a number of reasoning tasks, such as satisfiability and forgetting, can be performed in linear time. Finally, we 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 for their ability to answer queries.