DPLL with a trace: From SAT to knowledge compilation (2005)

by Jinbo Huang , Adnan Darwiche
Venue: IJCAI-05
Citations:21 - 2 self

Documents Related by Co-Citation

162 A Knowledge Compilation Map – Adnan Darwiche, Pierre Marquis - 2002
2927 Graph-based algorithms for Boolean function manipulation – Randal E. Bryant - 1986
50 Algorithms and Complexity Results for #SAT and Bayesian Inference – Fahiem Bacchus , Shannon Dalmao, Toniann Pitassi - 2004
17 Hierarchical representation of discrete functions with application to model checking – K McMillan - 1994
14 Compiling CSPs into tree-driven automata for interactive solving. Constraints 9:263–287 – H Fargier, M-C Vilarem - 2004
64 Combining component caching and clause learning for effective model counting – Tian Sang, Fahiem Bacchus, Paul Beame, Henry Kautz, Toniann Pitassi - 2004
143 Recursive conditioning – A Darwiche - 2000
111 Decomposable negation normal form – Adnan Darwiche - 2001
23 Compiling constraint networks into AND/OR multi-valued decision diagrams (AOMDDs) – Robert Mateescu, Rina Dechter - 2006
112 A differential approach to inference in Bayesian networks – Adnan Darwiche - 2000
17 The Relationship Between AND/OR Search Spaces and Variable Elimination – R Mateescu, R Dechter
80 A complexity analysis of space-bounded learning algorithms for the constraint satisfaction problem – Roberto J. Bayardo, Daniel P. Miranker - 1996
45 Case-factor diagrams for structured probabilistic modeling – David Mcallester, Michael Collins, Fernando Pereira - 2004
278 Bucket Elimination: A Unifying Framework for Reasoning – Rina Dechter
261 Tree clustering for constraint networks – R Dechter, J Pearl - 1989
99 The decomposition and factorization of Boolean expressions – R Brayton, C McMullen
80 Taking advantage of stable sets of variables in constraint satisfaction problems – Eugene C. Freuder, Michael J. Quinn - 1985
56 The Disjunctive decomposition of logic functions – Valeria Bertacco - 1997
102 AND/OR Search Spaces for Graphical Models – Rina Dechter - 2004