On the Tractable Counting of Theory Models and its Application to Truth Maintenance and Belief Revision
暂无分享,去创建一个
[1] Ingo Wegener,et al. Graph Driven BDDs - A New Data Structure for Boolean Functions , 1995, Theor. Comput. Sci..
[2] Bernhard Nebel,et al. How Hard is it to Revise a Belief Base , 1996 .
[3] Kenneth D. Forbus,et al. Building Problem Solvers , 1993 .
[4] Christoph Meinel,et al. Efficient Boolean Manipulation With OBDD's can be Extended to FBDD's , 1994, IEEE Trans. Computers.
[5] Adnan Darwiche,et al. Model-Based Diagnosis using Structured System Descriptions , 1998, J. Artif. Intell. Res..
[6] Raymond Reiter,et al. Characterizing Diagnoses and Systems , 1992, Artif. Intell..
[7] Randal E. Bryant,et al. Symbolic Boolean manipulation with ordered binary-decision diagrams , 1992, CSUR.
[8] Adnan Darwiche,et al. Decomposable negation normal form , 2001, JACM.
[9] Hans L. Bodlaender,et al. A linear time algorithm for finding tree-decompositions of small treewidth , 1993, STOC.
[10] H. Keisler,et al. Handbook of mathematical logic , 1977 .
[11] Adnan Darwiche. Compiling Knowledge into Decomposable Negation Normal Form , 1999, IJCAI.
[12] Georg Gottlob,et al. On the complexity of propositional knowledge base revision, updates, and counterfactuals , 1992, Artif. Intell..
[13] Beate Bollig,et al. Complexity Theoretical Results on Partitioned (Nondeterministic) Binary Decision Diagrams , 1997, Theory of Computing Systems.
[14] M. Iri. Simultaneous computation of functions, partial derivatives and estimates of rounding errors —Complexity and practicality— , 1984 .
[15] Peter Aczel etc. HANDBOOK OF MATHEMATICAL LOGIC , 1999 .
[16] DarwicheAdnan. A differential approach to inference in Bayesian networks , 2003 .
[17] G. Unter Rote. Path Problems in Graphs , 1989 .
[18] Rina Dechter,et al. Directional Resolution: The Davis-Putnam Procedure, Revisited , 1994, KR.