AND/OR search spaces for graphical models

[1]  B. Mohar,et al.  Graph minors XXIII. Nash-Williams' immersion conjecture , 2010, J. Comb. Theory B.

[2]  Rina Dechter,et al.  AND/OR Multi-Valued Decision Diagrams (AOMDDs) for Weighted Graphical Models , 2007, UAI.

[3]  Rina Dechter,et al.  A Comparison of Time-Space Schemes for Graphical Models , 2007, IJCAI.

[4]  Rina Dechter,et al.  Compiling Constraint Networks into AND/OR Multi-valued Decision Diagrams (AOMDDs) , 2006, CP.

[5]  Rina Dechter,et al.  AND/OR Search Spaces and the Semantic Width of Constraint Networks , 2005, CP.

[6]  Ronald A. Howard,et al.  Influence Diagrams , 2005, Decis. Anal..

[7]  Javier Larrosa,et al.  Unifying tree decompositions for reasoning in graphical models , 2005, Artif. Intell..

[8]  Adnan Darwiche,et al.  DPLL with a Trace: From SAT to Knowledge Compilation , 2005, IJCAI.

[9]  Nic Wilson,et al.  Decision Diagrams for the Computation of Semiring Valuations , 2005, IJCAI.

[10]  Rina Dechter,et al.  AND/OR Branch-and-Bound for Graphical Models , 2005, IJCAI.

[11]  Rina Dechter,et al.  AND/OR Cutset Conditioning , 2005, IJCAI.

[12]  Rina Dechter,et al.  The Relationship Between AND/OR Search and Variable Elimination , 2005, UAI.

[13]  R. Dechter,et al.  Unifying Cluster-Tree Decompositions for Reasoning in Graphical models ∗ , 2005 .

[14]  Makoto Yokoo,et al.  Adopt: asynchronous distributed constraint optimization with quality guarantees , 2005, Artif. Intell..

[15]  Rina Dechter,et al.  The Impact of AND/OR Search Spaces on Constraint Satisfaction and Counting , 2004, CP.

[16]  Fernando Pereira,et al.  Case-factor diagrams for structured probabilistic modeling , 2004, J. Comput. Syst. Sci..

[17]  Rina Dechter,et al.  Mixtures of Deterministic-Probabilistic Networks and their AND/OR Search Space , 2004, UAI.

[18]  Hélène Fargier,et al.  Compiling CSPs into Tree-Driven Automata for Interactive Solving , 2003, Constraints.

[19]  Rina Dechter,et al.  Resolution versus Search: Two Strategies for SAT , 2000, Journal of Automated Reasoning.

[20]  Toniann Pitassi,et al.  Combining Component Caching and Clause Learning for Effective Model Counting , 2004, SAT.

[21]  Rina Dechter,et al.  On finding minimal w-cutset problem , 2004, UAI 2004.

[22]  Toniann Pitassi,et al.  Algorithms and complexity results for #SAT and Bayesian inference , 2003, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings..

[23]  Philippe Jégou,et al.  Bounded Backtracking for the Valued Constraint Satisfaction Problems , 2003, CP.

[24]  Rina Dechter,et al.  Cycle-Cutset Sampling for Bayesian Networks , 2003, Canadian Conference on AI.

[25]  Philippe Jégou,et al.  Hybrid backtracking bounded by tree-decomposition of constraint networks , 2003, Artif. Intell..

[26]  Toniann Pitassi,et al.  Value Elimination: Bayesian Interence via Backtracking Search , 2002, UAI.

[27]  Rina Dechter,et al.  A Simple Insight into Iterative Belief Propagation's Success , 2003, UAI.

[28]  David Allen,et al.  New Advances in Inference by Recursive Conditioning , 2002, UAI.

[29]  Adnan Darwiche,et al.  A differential approach to inference in Bayesian networks , 2000, JACM.

[30]  Adnan Darwiche,et al.  Uncertainty in artificial intelligence : proceedings of the nineteenth conference (2003), August 7-10, 2003, Acapulco, Mexico , 2003 .

[31]  Rina Dechter,et al.  Iterative Join-Graph Propagation , 2002, UAI.

[32]  Rina Dechter,et al.  Tree approximation for belief updating , 2002, AAAI/IAAI.

[33]  Javier Larrosa,et al.  Pseudo-tree Search with Soft Constraints , 2002, ECAI.

[34]  Dan Geiger,et al.  Exact genetic linkage computations for general pedigrees , 2002, ISMB.

[35]  Pierre Marquis,et al.  A Knowledge Compilation Map , 2002, J. Artif. Intell. Res..

[36]  M. Mézard,et al.  Analytic and Algorithmic Solution of Random Satisfiability Problems , 2002, Science.

[37]  Rina Dechter,et al.  Backjump-based backtracking for constraint satisfaction problems , 2002, Artif. Intell..

[38]  Javier Larrosa,et al.  A General Scheme for Multiple Lower Bound Computation in Constraint Optimization , 2001, CP.

[39]  Yee Whye Teh,et al.  Belief Optimization for Binary Networks: A Stable Alternative to Loopy Belief Propagation , 2001, UAI.

[40]  Adnan Darwiche,et al.  Recursive conditioning , 2001, Artif. Intell..

[41]  Joseph Sifakis,et al.  Model checking , 1996, Handbook of Automated Reasoning.

[42]  Rina Dechter,et al.  Approximation algorithms for graphical models , 2001 .

[43]  R. Dechter,et al.  Up and Down Mini-Buckets: A Scheme for Approximating Combinatorial Optimization Tasks , 2001 .

[44]  Javier Larrosa,et al.  Boosting Search with Variable Elimination , 2000, CP.

[45]  Jian Cheng,et al.  AIS-BN: An Adaptive Importance Sampling Algorithm for Evidential Reasoning in Large Bayesian Networks , 2000, J. Artif. Intell. Res..

[46]  Rina Dechter,et al.  A New Perspective on Algorithms for Optimizing Policies under Uncertainty , 2000, AIPS.

[47]  W. Freeman,et al.  Generalized Belief Propagation , 2000, NIPS.

[48]  Rina Dechter,et al.  Bucket Elimination: A Unifying Framework for Reasoning , 1999, Artif. Intell..

[49]  Georg Gottlob,et al.  A Comparison of Structural CSP Decomposition Methods , 1999, IJCAI.

[50]  Joao Marques-Silva,et al.  GRASP: A Search Algorithm for Propositional Satisfiability , 1999, IEEE Trans. Computers.

[51]  Shmuel Katz,et al.  Self-Stabilizing Distributed Constraint Satisfaction , 1999, Chic. J. Theor. Comput. Sci..

[52]  Avi Pfeffer,et al.  Probabilistic Frame-Based Systems , 1998, AAAI/IAAI.

[53]  Jung-Fu Cheng,et al.  Turbo Decoding as an Instance of Pearl's "Belief Propagation" Algorithm , 1998, IEEE J. Sel. Areas Commun..

[54]  V. Bertacco,et al.  The disjunctive decomposition of logic functions , 1997, 1997 Proceedings of IEEE International Conference on Computer Aided Design (ICCAD).

[55]  Hans L. Bodlaender,et al.  Treewidth: Algorithmic Techniques and Results , 1997, MFCS.

[56]  Rina Dechter,et al.  A Scheme for Approximating Probabilistic Inference , 1997, UAI.

[57]  Roberto J. Bayardo,et al.  Using CSP Look-Back Techniques to Solve Real-World SAT Instances , 1997, AAAI/IAAI.

[58]  Peter Haddawy,et al.  Answering Queries from Context-Sensitive Probabilistic Knowledge Bases , 1997, Theor. Comput. Sci..

[59]  R. Dechter,et al.  Algorithms and heuristics for constraint satisfaction problems , 1997 .

[60]  Daniel P. Miranker,et al.  A Complexity Analysis of Space-Bounded Learning Algorithms for the Constraint Satisfaction Problem , 1996, AAAI/IAAI, Vol. 1.

[61]  Rina Dechter,et al.  Topological parameters for time-space tradeoff , 1996, Artif. Intell..

[62]  Rina Dechter,et al.  Bucket elimination: A unifying framework for probabilistic inference , 1996, UAI.

[63]  Martin C. Cooper,et al.  Tractable Constraints on Ordered Domains , 1995, Artif. Intell..

[64]  Ingo Wegener,et al.  Graph Driven BDDs - A New Data Structure for Boolean Functions , 1995, Theor. Comput. Sci..

[65]  Rina Dechter,et al.  Constraint Processing , 1995, Lecture Notes in Computer Science.

[66]  Kenneth L. McMillan.  Hierarchical Representations of Discrete Functions, with Application to Model Checking , 1994, CAV.

[67]  Nevin Lianwen Zhang,et al.  A computational theory of decision networks , 1993, Int. J. Approx. Reason..

[68]  C. Meinel,et al.  Efficient Boolean Manipulation With OBDD's can be Extended to FBDD's , 1994, IEEE Trans. Computers.

[69]  David Poole,et al.  Probabilistic Horn Abduction and Bayesian Networks , 1993, Artif. Intell..

[70]  Dan Roth,et al.  On the Hardness of Approximate Reasoning , 1993, IJCAI.

[71]  Sérgio Vale Aguiar Campos,et al.  Symbolic Model Checking , 1993, CAV.

[72]  Lefteris M. Kirousis,et al.  Fast Parallel Constraint Satisfaction , 1993, Artif. Intell..

[73]  Michael Luby,et al.  Approximating Probabilistic Inference in Bayesian Belief Networks is NP-Hard , 1993, Artif. Intell..

[74]  Prakash P. Shenoy,et al.  Valuation-Based Systems for Bayesian Decision Analysis , 1992, Oper. Res..

[75]  Christophe Lecoutre.  Constraint Networks , 1992 .

[76]  Shmuel Katz,et al.  On the Feasibility of Distributed Constraint Satisfaction , 1991, IJCAI.

[77]  John R. Gilbert,et al.  Approximating Treewidth, Pathwidth, and Minimum Elimination Tree Height , 1991, WG.

[78]  Robin Thomas,et al.  Quickly excluding a forest , 1991, J. Comb. Theory, Ser. B.

[79]  Robert K. Brayton,et al.  Algorithms for discrete function manipulation , 1990, 1990 IEEE International Conference on Computer-Aided Design. Digest of Technical Papers.

[80]  Rina Dechter,et al.  Enhancement Schemes for Constraint Processing: Backjumping, Learning, and Cutset Decomposition , 1990, Artif. Intell..

[81]  Steffen L. Lauritzen,et al.  Bayesian updating in causal probabilistic networks by local computations , 1990 .

[82]  Prakash P. Shenoy,et al.  Probability propagation , 1990, Annals of Mathematics and Artificial Intelligence.

[83]  David Heckerman,et al.  A Tractable Inference Algorithm for Diagnosing Multiple Diseases , 2013, UAI.

[84]  Judea Pearl,et al.  Probabilistic reasoning in intelligent systems - networks of plausible inference , 1991, Morgan Kaufmann series in representation and reasoning.

[85]  Rina Dechter,et al.  Tree Clustering for Constraint Networks , 1989, Artif. Intell..

[86]  David J. Spiegelhalter,et al.  Local computations with probabilities on graphical structures and their application to expert systems , 1990 .

[87]  Judea Pearl,et al.  Probabilistic reasoning in intelligent systems , 1988 .

[88]  Rina Dechter,et al.  Network-Based Heuristics for Constraint-Satisfaction Problems , 1987, Artif. Intell..

[89]  Randal E. Bryant,et al.  Graph-Based Algorithms for Boolean Function Manipulation , 1986, IEEE Transactions on Computers.

[90]  Michael J. Quinn,et al.  Taking Advantage of Stable Sets of Variables in Constraint Satisfaction Problems , 1985, IJCAI.

[91]  ArnborgStefan.  Efficient algorithms for combinatorial problems on graphs with bounded, decomposabilitya survey , 1985 .

[92]  Stefan Arnborg,et al.  Efficient algorithms for combinatorial problems on graphs with bounded decomposability — A survey , 1985, BIT.

[93]  Paul D. Seymour,et al.  Graph minors. I. Excluding a forest , 1983, J. Comb. Theory, Ser. B.

[94]  David Maier,et al.  The Theory of Relational Databases , 1983 .

[95]  Nils J. Nilsson,et al.  Principles of Artificial Intelligence , 1980, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[96]  Keith Price,et al.  Review of "Principles of Artificial Intelligence by Nils J. Nilsson", Tioga Publishing Company, Palo Alto, CA, ISBN 0-935382-01-1. , 1980, SGAR.

[97]  Sheldon B. Akers,et al.  Binary Decision Diagrams , 1978, IEEE Transactions on Computers.

[98]  Alan K. Mackworth.  Consistency in Networks of Relations , 1977, Artif. Intell..

[99]  C. Y. Lee.  Representation of switching circuits by binary-decision programs , 1959 .