Abstract

We address the problem of counting the models of a propositional theory, under incremental changes to the theory. Specifically, we show that if a propositional theory is in a special form that we call smooth, deterministic, decomposable negation normal form (sd-DNNF), then for any consistent set of literals S, we can simultaneously count, in time linear in the size of , the models of: [ S; [ S [ flg: for every literal l 62 S; [ S n flg: for every literal l 2 S; [ S n flg [ f:lg: for every literal l 2 S.

Citations

792	Symbolic boolean manipulation with ordered binary decision diagrams - Bryant - 1992
171	Characterizing diagnoses and systems - Kleer, Mackworth, et al. - 1992
157	On the complexity of propositional knowledge base revision, updates, and counterfactuals - Eiter, Gottlob - 1992
90	Directional resolution: the Davis–Putnam procedure, revisited, in - Dechter, Rish - 1994
88	Decomposable negation normal form - Darwiche
86	A differential approach to inference in Bayesian networks - Darwiche - 2003
55	and Johan de Kleer. Building Problem Solvers - Forbus - 1993
51	Model-based diagnosis using structured system descriptions - Darwiche
43	Graph driven BDDs -- a new data structure for Boolean functions - Sieling, Wegener - 1995
34	How hard is it to revise a belief base - Nebel - 1998
30	Compiling Knowledge into Decomposable Negation Normal Form - Darwiche - 1999
25	A linear time algorithm for tree-decompositions of small treewidth - Bodlaender - 1996
23	Path Problems in Graphs - Rote - 1990
2	Ecient analysis and manipulation of OBDDs can be extended to FBDDs - Gergov, Meinel - 1994
2	Simultaneous computation of functions, partial derivatives and estimates of rounding error - Masao - 1984
1	Complexity theoretical results on partitioned binary decision diagrams. Theory of Computing Systems - Bollig, Wegner - 1999