On the tractable counting of theory models and its application to truth maintenance and belief revision

Journal of Applied Non-Classical Logics

Volumn 11, Issue 1-2, 2001, Pages 11-34

  Darwiche, Adnan ^a  

^a Engineering IV   (United States)

Author keywords

Belief revision; Counting models; Diagnosis; Knowledge compilation; Truth maintenance

Indexed keywords

EID: 84887221855     PISSN: 11663081     EISSN: 19585780     Source Type: Journal    
DOI: 10.3166/jancl.11.11-34     Document Type: Conference Paper

References (17)

1. Jon Barwise, editor. Handbook of Mathematical Logic. North-Holland, Amsterdam, 1977.
2. Hans L. Bodlaender. A linear time algorithm for finding tree-decompositions of small treewidth. SIAM Journal of Computing, 25(6):1305-1317, 1996. (Pubitemid 126584672)
3. B. Bollig and I. Wegner. Complexity theoretical results on partitioned binary decision diagrams. Theory of Computing Systems, 32:487-503, 1999.
4. R. E. Bryant. Symbolic Boolean manipulation with ordered binary decision diagrams. ACM Computing Surveys, 24(3):293-3l8, 1992.
5. Adnan Darwiche. Model-based diagnosis using structured system descriptions. Journal of Artificial Intelligence Research, 8:165-222, 1998. (Pubitemid 128636197)
6. Adnan Darwiche. Compiling knowledge into decomposable negation normal form. In Proceedings of International Joint Conference on Artificial Intelligence (IJCAI), pages 284-289, 1999.
7. Adnan Darwiche. Decomposable negation normal form. Technical Report D-109, Cognitive Systems Laboratory, Computer Science Department, UCLA, Los Angeles, Ca 90095, 1999. To appear in Journal of ACM.
8. Adnan Darwiche. A differential approach to inference in Bayesian networks. In Proceedings of the 16th Conference on Uncertainty in Artificial Intelligence (UAI), pages 123-132, 2000.
9. Johan de Kleer, Alan K. Mackworth, and Raymond Reiter. Characterizing diagnoses and systems. Artificial Intelligence, 56(2-3):l97-222, 1992.
10. Rina Dechter and Irina Rish. Directional resolution: The Davis-Putnam procedure, revisited. In Proceedings of the International Conference on Principles of Knowledge Representation and Reasoning, pages 134-145, 1994.
11. T. Eiter and G. Gottlob. On the complexity of propositional knowledge base revision, updates and counterfactuals. Artificial Intelligence, 57:227-270, 1992. (Pubitemid 23586698)
12. Kenneth D. Forbus and Johan de Kleer. Building Problem Solvers. MIT Press, 1993.
13. J. Gergov and C. Meinel. Efficient analysis and manipulation of OB-DDs can be extended to FBDDs. IEEE Transactions on Computers, 43(10):II97-I2O9, 1994.
14. Masao. Simultaneous computation of functions, partial derivatives and estimates of rounding error. Japan J. Appl. Math., 1:223-252, 1984.
15. B. Nebel. How hard is it to revise a belief base In D. Dubois and H. Prade, editors, Handbook of Defeasible Reasoning and Uncertainty Managment, pages 77-145. Kluwer Academic, 1998.
16. Graz Rote. Path problems in graphs. Computing SuppL, 7:155-189, 1990.
17. D. Sieling and I. Wegener. Graph driven BDDs - a new data structure for Boolean functions. Theoretical Computer Science, 141:283-310, 1995.