text:
D. Loveland},
	Journal = {Communications of the ACM},
	Pages = {394-397},
	Title = {A machine program for theorem proving},
	Volume = 5,
	Year = 1962}

@inproceedings{rachel92,
	Address = {Washington D.C.},
	Author = {R. Ben-Eliyahu, and R. Dechter},
	Booktitle = {Proceedings of the Joint International Conference and Symposium on Logic Programming},
	Pages = {813--827},
	Title = {Propositional semantics for disjunctive logic programs},
	Year = {May 1992}}

@inproceedings{mohr88,
	Author = {R. Mohe and G. Masini},
	Booktitle = {8th European Congference on Artificial Intelligence (ECAI)},
	Pages = {651--656},
	Title = {Good old discrete relaxation},
	Year = {1988}}

@inproceedings{rachel-inheritance,
	Address = {Vancouver, Canada},
	Author = {R. Ben-Eliyahu, and R. Dechter},
	Booktitle = {Canadian Artificial Intelligence Conference (CAI-92)},
	Pages = {183--189},
	Title = {Inferences in inheritance networks, using propositional logic and constraint networks techniques},
	Year = {May 1992}}

@inproceedings{crawford93,
	Author = {J. Crawford and L. Auton},
	Booktitle = {AAAI'93: Proceedings of the Eleventh National Conference on Artificial Intelligence},
	Pages = {21-27},
	Title = {Experimental results on the crossover point in satisfiability problems},
	Year = 1993}

@inproceedings{rachel91,
	Address = {Anaheim, CA},
	Author = {R. Ben-Eliyahu and R. Dechter},
	Booktitle = {Proceedings of the Ninth National Conference on Artificial Intelligence (AAAI'91)},
	Pages = {379--385},
	Title = {Default logic propositional logic and constraints},
	Year = {July 1991}}

@inproceedings{cycle_cutset,
	Address = {Orlando, Florida},
	Author = {R. Dechter and J. Pearl},
	Booktitle = {Proceedings of the 3rd IEEE Conference on AI Applications},
	Pages = {224--230},
	Title = {The Cycle-Cutset Method for Improving Search Performance in {AI} Applications},
	Year = 1987}

@article{korf87,
	Author = {J. Pearl and R. Korf},
	Journal = {Annual Reviews of Computer Science},
	Pages = {451--467},
	Title = {Search Techniques},
	Volume = 2,
	Year = 1987}

@article{dechter88,
	Author = {R. Dechter and J. Pearl},
	Journal = {Artificial Intelligence},
	Pages = {1--38},
	Title = {Network-Based Heuristics for Constraint Satisfaction Problems},
	Volume = 34,
	Year = 1987}

@inproceedings{cox84,
	Author = {P. T. Cox},
	Book = {J. A. Campbell, ed. Implementation of Prolog (Ellis Horwood, Chichester)},
	Pages = {216-233},
	Title = {Finding backtrack points for intelligent backtracking},
	Year = 1984}

@inproceedings{bruynooghe84,
	Author = {M. Bruynooghe and L. M. Pereira},
	Book = {J. A. Campbell, ed. Implementation of Prolog (Ellis Horwood, Chichester)},
	Pages = {194-215},
	Title = {Deduction revision by intelligent backtracking},
	Year = 1984}

@inproceedings{bruynooghe87,
	Author = {W. Rosiers and M. Bruynooghe},
	Book = {Artificial Intelligence II, Methodology systems Applications (AIMSA86)},
	Pages = {173-180},
	Title = {Empirical study of some constraint satisfaction algorithms},
	Year = 1986}

@article{bruynooghe81,
	Author = {M. Bruynooghe},
	Journal = {Information Processing Letters},
	Pages = {36--39},
	Title = {Solving combinatorial search problems by intelligent backtracking},
	Volume = {12},
	Year = 1981}

@article{bitner75,
	Author = {J. R. Bitner and E. M. Reingold},
	Journal = {Communications of the ACM},
	Pages = {651-656},
	Title = {Backtracking programming techniques},
	Volume = {18(11)},
	Year = {1975}}

@inproceedings{vilain89,
	Author = {Marc Vilain, Henry Kautz, and Peter van Beek},
	Book = {Readings in Qualitative Reasoning about Physical Systems, Daniel S. Weld and Johan de Kleer (eds.),Morgan-Kaufman},
	Pages = {373-381},
	Title = {Constraint propagation algorithms for temporal reasoning: A revised report},
	Year = 1989}

@inproceedings{kumar92,
	Author = {V. Kumar},
	Journal = {Encyclopedia of Artificial Intelligence, Editors S.C. Shapiro},
	Pages = {1468-1472},
	Publisher = {Wiley-Interscience, New-York},
	Title = {Search with branch-and-bound},
	Year = {1992}}

@article{kumar83,
	Author = {V. Kumar and L. N. Kanal},
	Journal = {Artificial Intelligence},
	Pages = {179-198},
	Title = {A general Branch-and-Bound formulation for understanding and synthesizing And/Or tree search procedures},
	Volume = {21},
	Year = {1983}}

@article{kumar92a,
	Author = {V. Kumar},
	Journal = {AI magazine},
	Number = {1},
	Pages = {32-44},
	Title = {Algorithms for constraint satisfaction problems: a survey},
	Volume = {13},
	Year = {1992}}

@article{dechter90,
	Author = {R. Dechter},
	Journal = {Artificial Intelligence},
	Pages = {273-312},
	Title = {Enhancement schemes for constraint processing: Backjumping, learning and cutset decomposition},
	Volume = {41},
	Year = {1990}}

@techreport{dechter88a,
	Address = {Los Angeles, California},
	Author = {R. Dechter},
	Institution = {UCLA, Cognitive Systems Laboratory},
	Number = {R-72-I},
	Title = {Constraint-Directed Approach to Diagnosis},
	Year = {1988}}

@article{cooper90,
	Author = {G.F. Cooper},
	Journal = {Artificial Intelligence},
	Pages = {393-405},
	Title = {The computational complexity of probabistic inferences},
	Volume = {42},
	Year = {1990}}

@techreport{cooper84,
	Address = {Palo-Alto, California},
	Author = {G.F. Cooper},
	Institution = {Computer Science department, Stanford University},
	Title = {Nestor: A computer-based medical diagnosis aid that integrates causal and probabilistic knowledge},
	Year = {1984}}

@techreport{vila97,
	Author = {E. Schwalb, L. Vila, and R. Dechter},
	Institution = {UC-Irvine, ICS, Tech report},
	Title = {Temporal constraint logic programming},
	Year = {1997}}

@inproceedings{freuder85,
	Author = {E. C. Freuder and M. J. Quinn},
	Booktitle = {International Joint Conference on Artificial Intelligence (IJCAI)},
	Pages = {1076-1078},
	Title = {Taking Advantage of Stable Sets of Variables in Constraint Satisfaction Problems},
	Year = {1985}}

@techreport{gaschnig79,
	Author = {J. Gaschnig},
	Institution = {Carnegie Mellon University},
	Number = {CMU-CS-79-124},
	Title = {Performance measurement and analysis of search algorithms},
	Year = {1979}}

@article{peot92,
	Author = {M. A. Peot and R. D. Shachter},
	Journal = {Artificial Intelligence},
	Pages = {299--318},
	Title = {Fusion and proagation with multiple observations in belief networks},
	Volume = 48,
	Year = {1992}}

@inproceedings{peot89,
	Author = {R. D. Shachter and M. A. Peot},
	Book = {Uncertainty in Artificial Intelligene (UAI89)},
	Title = {Simulation approaches to general probabilistic inference on belief networks},
	Year = {1989}}

@article{dechter89,
	Author = {R. Dechter and J. Pearl},
	Journal = {Artificial Intelligence},
	Pages = {353--366},
	Title = {Tree Clustering for Constraint Networks},
	Volume = {38},
	Year = {1989}}

@article{dechter-survey,
	Author = {R. Dechter},
	Journal = {Encyclopedia of Artificial Intelligence},
	Pages = {276--285},
	Title = {Constraint networks},
	Year = {1992}}

@article{mackworth-survey,
	Author = {A. K. Mackworth},
	Journal = {In Encyclopedia of Artificial Intelligence, 2nd ed.},
	Pages = {285--293},
	Title = {Constraint Satisfaction},
	Year = {1992}}

@article{stallman77,
	Author = {M. Stallman and G. J. Sussman},
	Journal = {Artificial Intelligence},
	Pages = {135-196},
	Title = {Forward reasoning and dependency-directed backtracking in a system for computer-aided circuit analysis},
	Volume = {9},
	Year = {1977}}

@article{dekleer86b,
	Author = {J. de Kleer},
	Journal = {Artificial Intelligence},
	Number = {2},
	Title = {An Assumption-Based {TMS}},
	Volume = {28},
	Year = {1986}}

@inproceedings{peng1,
	Author = {Y. Peng and J.A. Reggia},
	Booktitle = {National Conference on Artificial Intelligence (AAAI'86)},
	Pages = {140-145},
	Title = {Plausability of diagnostic hypothesis},
	Year = {1986}}

@article{peng2,
	Author = {Y. Peng and J.A. Reggia},
	Journal = {IEEE Transactions on Systems, Man and Cybernetics},
	Title = {A connectionist model for diagnostic problem solving},
	Year = {1989}}

@inproceedings{peot92a,
	Author = {R. Shachter and M. Peot},
	Booktitle = {Uncertainty in Artificial Intelligence (UAI)},
	Pages = {276-283},
	Title = {Decision making using probabilistic inference methods},
	Year = {1992}}

@inproceedings{dekleer86a,
	Address = {Philadelphia, Pennsylvania},
	Author = {J. de Kleer and B. Williams},
	Booktitle = {Proceedings of AAAI'86},
	Pages = {132--139},
	Title = {Reasoning about Multiple Faults},
	Year = {1986}}

@inproceedings{hogg,
	Address = {Seattle, Washington},
	Author = {T. Hogg, and C.P. Williams},
	Booktitle = {National Conference on Artificial Intelligence (AAAI)},
	Pages = {331-336},
	Title = {Expected gains from parallelizing constraint solving for hard problems},
	Year = {1994}}

@article{luby,
	Author = {M. Luby, A. Sinclair, and D. Zuckerman},
	Journal = {Information Processing Letters},
	Pages = {173--180},
	Title = {Optimal speedup of Las Vegas algorithms},
	Volume = 47,
	Year = {1993}}

@inproceedings{minton90,
	Address = {Anaheim, CA},
	Author = {S. Minton, M.D. Johnston, A.B. Philips and P. Laired},
	Booktitle = {National Conference on Artificial Intelligence (AAAI)},
	Pages = {17-24},
	Title = {Solving large scale constraint satisfaction and scheduling problems using heuristic repair methods},
	Year = {1990}}

@article{minton92,
	Author = {S. Minton, M.D. Johnston, A.B. Philips and P. Laired},
	Pages = {161-205},
	Title = {Artificial Intelligence},
	Volume = 52,
	Year = {1992}}

@inproceedings{meiri89,
	Address = {Detroit},
	Author = {R. Dechter, and I. Meiri},
	Booktitle = {International Joint Conference in Artificial Intelligence (IJCAI-89)},
	Pages = {271-277},
	Title = {Experimental evaluation of preprocessing techniques in constraint satisfaction problems},
	Year = {1989}}

@inproceedings{dechter91,
	Author = {R. Dechter and J. Pearl},
	Booktitle = {International Joint Conference on Artificial Intelligence (IJCAI)},
	Pages = {1164--1170},
	Title = {Directed constraint networks: A relational framework for causal reasoning},
	Year = {1991}}

@inproceedings{meiri91,
	Address = {Anaheim, CA},
	Author = {I. Meiri},
	Booktitle = {Proceedings of the Ninth National Conference on Artificial Intelligence (AAAI'91)},
	Title = {Combining Qualitative and quantitative constraint satisfaction problems},
	Year = {July 1991}}

@article{meiri96,
	Author = {I. Meiri},
	Journal = {Artificial Intelligence},
	Pages = {343-385},
	Title = {Combining Qualitative and quantitative constraints in temporal reasoning},
	Volume = {87},
	Year = {1996}}

@inproceedings{dechter-bucket,
	Author = {R. Dechter},
	Booktitle = {Uncertainty in Artificial Intelligence (UAI'96)},
	Pages = {211-219},
	Title = {Bucket elimination: A unifying framework for probabilistic inference algorithms},
	Year = {1996}}

@inproceedings{rish98,
	Author = {I. Rish and K. Kask and R. Dechter},
	Booktitle = {Uncertainty in Artificial Intelligence (UAI'98)},
	Title = {Approximation algorithms for probabilistic decoding},
	Year = {1998}}

@article{hoos2000,
	Author = {H. H. Hoos and T. Stutzle},
	Journal = {Journal of Automated Reasoning},
	Pages = {1-62},
	Title = {Local search algorithms for SAT: an empirical evaluation},
	Volume = {24(1/2)},
	Year = {2000}}

@inproceedings{hirsch01,
	Author = {E. H. Hirsch and A. Kojevnikov},
	Booktitle = {7th International Conference on Principles and Practice of Constraint Programming (CP01)},
	Title = {Solving Boolean satisfiability using local search guided by unit clause elimination},
	Year = {2001}}

@article{hirsch2000,
	Author = {E. H. Hirsch},
	Journal = {Journal of Automated Reasoning},
	Pages = {127-143},
	Title = {SAT local search algorithms: Worst-case study},
	Volume = {24(1/2)},
	Year = {2000}}

@article{rish2000,
	Author = {I. Rish and R. Dechter},
	Journal = {Journal of Automated Reasoning},
	Pages = {225--275},
	Title = {Resolution vs. search; Two strategies for SAT},
	Volume = {24(1/2)},
	Year = {2000}}

@inproceedings{kalev99a,
	Author = {K. Kask and R. Dechter},
	Booktitle = {Workshop on AI and Statistics (AISTAT'99)},
	Pages = {113-122},
	Title = {Stochastic local search for Bayesian networks},
	Year = {1999}}

@inproceedings{riah98b,
	Author = {I. Rish and R. Dechter},
	Booktitle = {1998, Stanford Spring Symposium on {\em Interactive and mixed-initiative Decision-theoretic systems}},
	Title = {Variable Independence in Markov Decision Problems},
	Year = {March, 1998}}

@inproceedings{kalev99c,
	Author = {K. Kask and R. Dechter},
	Booktitle = {Uncertainty in AI (UAI99)},
	Title = {On the power of mini-bucket heuristics for improved search},
	Year = {1999}}

@article{dechter99a,
	Author = {R. Dechter},
	Journal = {Artificial Intelligence},
	Pages = {41-85},
	Title = {Bucket elimination: A unifying framework for reasoning},
	Volume = {113/1-2},
	Year = {1999}}

@inproceedings{dechter-erice,
	Author = {R. Dechter},
	Booktitle = {M. I. Jordan (Ed.), Learning in Graphical Models, Kluwer Academic Press},
	Title = {Bucket elimination: A unifying framework for probabilistic inference algorithms},
	Year = {1998}}

@inproceedings{becker99,
	Author = {A. Becker, Bar-Yehuda R and D. Geiger},
	Booktitle = {Uncertainty in AI (UAI'99)},
	Pages = {81-89},
	Title = {Random algorithms for the loop-cutset problem},
	Year = {1999}}

@inproceedings{becker96,
	Author = {A. Becker and D. Geiger},
	Booktitle = {Uncertainty in AI (UAI'96)},
	Pages = {81-89},
	Title = {A sufficiently fast algorithm for finding close to optimal junction trees},
	Year = {1996}}

@article{rish98a,
	Author = {I. Rish and R. Dechter},
	Journal = {UCI Technical report},
	Title = {On the impact of causal independence},
	Year = {1998}}

@article{dganit,
	Author = {D. Timor and R. Dechter},
	Journal = {UCI Technical report},
	Title = {GSAT vs complete search; an experimental report},
	Year = {1996}}

@article{adnan94,
	Author = {A. Darwiche and J. Pearl},
	Title = {Symbolic causal theories},
	Year = {1994}}

@article{dmp90,
	Author = {R. Dechter, I. Meiri, and J. Pearl},
	Journal = {Artificial Intelligence},
	Pages = {61--95},
	Title = {Temporal constraint networks},
	Volume = 49,
	Year = {1990}}

@article{dmp95,
	Author = {R. Dechter, I. Meiri, and J. Pearl},
	Journal = {Artificial Intelligence},
	Title = {Uncovering trees in constraint networks},
	Year = {1995}}

@article{geiger90,
	Author = {D. Geiger and T. Verma and J. Pearl},
	Journal = {Networks},
	Pages = {507-534},
	Title = {Identifying independence in Bayesian networks},
	Volume = {20},
	Year = {1990}}

@article{shachter90,
	Author = {R. D. Shachter},
	Journal = {Networks},
	Pages = {535-563},
	Title = {An ordered examination of influence diagrams},
	Volume = {20},
	Year = {1990}}

@article{dechter92,
	Author = {R. Dechter},
	Journal = {Artificial Intelligence},
	Pages = {87--107},
	Title = {From local to global consistency},
	Volume = {55},
	Year = {1992}}

@article{dechter92b,
	Author = {R. Dechter, and J. Pearl},
	Journal = {Artificial Intelligence},
	Pages = {237--270},
	Title = {Structure identification in relational data},
	Volume = {58},
	Year = {1992}}

@article{frost99,
	Author = {D. Frost and R. Dechter},
	Journal = {Annals of Mathematics and Artificial Intelligence},
	Title = {Maintenance scheduling problems as benchmarks for constraint algorithms},
	Year = {1999}}

@article{rachel95c,
	Author = {R. Ben-Eliyahu, and R. Dechter},
	Journal = {Annals of Mathematics and Artificial Intelligence},
	Pages = {53--87},
	Title = {Propositional semantics for disjunctive logic programs},
	Volume = {12},
	Year = {1994}}

@article{rachel:minimal,
	Author = {R. Ben-Eliyahu and R. Dechter},
	Journal = {Annals of Math and AI (amai)},
	Note = {A short version in AAAI'93: Proceedings of the 11th national conference on artificial intelligence},
	Pages = {3-27},
	Title = {On Computing Minimal Models},
	Volume = {18},
	Year = {1996}}

@article{meiri94,
	Author = {R. Dechter, and I. Meiri},
	Journal = {Artificial Intelligence},
	Pages = {211--241},
	Title = {Experimental evaluation of preprocessing algorithms for constraint satisfaction problems},
	Volume = {68},
	Year = {1994}}

@article{vanbeek95,
	Author = {P. van Beek and R. Dechter},
	Journal = {Journal of the ACM},
	Pages = {543--561},
	Title = {On the minimality and Decomposability of row-convex constraint networks},
	Volume = {42},
	Year = {1995}}

@article{vanbeek97,
	Author = {P. van Beek and R. Dechter},
	Journal = {Journal of the ACM (in press)},
	Title = {Constraint tightness and looseness versus local and global consistency},
	Year = {1997}}

@inproceedings{bacchus02,
	Author = {F. Bacchus},
	Booktitle = {National Conference on Artificial Intelligence (AAAI)},
	Title = {Enhancing Davis Putnam with extended binary clause reasoning},
	Year = {2002}}

@inproceedings{bacchus95,
	Address = {Cassis, France},
	Author = {F. Bacchus and P. van Run},
	Booktitle = {Principles and Practice of Constraints Programming (CP'95)},
	Note = {Available as Lecture Notes on CS, vol 976, pp 258 -- 277, 1995},
	Title = {Dynamic variable ordering in CSPs},
	Year = {1995}}

@article{prosser93,
	Author = {P. Prosser},
	Journal = {Computational Intelligence},
	Pages = {268-299},
	Title = {Hybrid algorithms for constraint satisfaction problems},
	Volume = {9(3)},
	Year = {1993}}

@inproceedings{mackworth77b,
	Author = {A. K. Mackworth},
	Booktitle = {Fifth International Joint Conference on Artificial Intelligence},
	Pages = {598-606},
	Title = {On reading sketch maps},
	Year = {1977}}

@inproceedings{yousri91,
	Address = {Rosario, Washington},
	Author = {Y. El Fattah and R. Dechter},
	Booktitle = {Workshop on Principles of Diagnosis (DX-92)},
	Pages = {149--158},
	Title = {Empirical evaluation of diagnosis as optimization in constraint networks},
	Year = {1992}}

@article{dnekleer-7,
	Author = {J. {de~Kleer} and A.K. Mackworth and R. Reiter},
	Journal = {Artificial Intelligence},
	Pages = {197--222},
	Title = {Characterizing Diagnoses and Systems},
	Volume = {56},
	Year = {1992}}

@inproceedings{dekleer89,
	Address = {Detroit, Michigan},
	Author = {J. de Kleer},
	Booktitle = {Proceedings of IJCAI-89},
	Pages = {290--296},
	Title = {A Comparison of {ATMS} and {CSP} Techniques},
	Year = {1989}}

@article{freuder92,
	Author = {E. C. Freuder and R.J. Wallace},
	Journal = {Artificial Intelligence},
	Number = {1-3},
	Pages = {21-70},
	Title = {Partial constraint satisfaction},
	Volume = {58},
	Year = {1992}}

@article{freuder78,
	Author = {E. C. Freuder},
	Journal = {Communications of the ACM},
	Number = 11,
	Pages = {958-965},
	Title = {Synthesizing constraint expressions},
	Volume = 21,
	Year = {1978}}

@inproceedings{geffner87,
	Address = {Milan, Italy},
	Author = {H. Geffner and J. Pearl},
	Booktitle = {Proceedings of IJCAI-87},
	Pages = {1105--1111},
	Title = {An Improved Constraint Propagation Algorithm for Diagnosis},
	Year = {1987}}

@article{genesereth84,
	Author = {M. R. Genesereth},
	Journal = {Artificial Intelligence},
	Pages = {411--436},
	Title = {The Use of Design Descriptions in Automated Diagnosis},
	Volume = 24,
	Year = {1984}}

@article{mackworth77,
	Author = {A. K. Mackworth},
	Journal = {Artificial Intelligence},
	Number = {1},
	Pages = {99--118},
	Title = {Consistency in Networks of Relations},
	Volume = {8},
	Year = {1977}}

@article{mack85,
	Author = {A. K. Mackworth, and E. C. Freuder},
	Journal = {Artificial Intelligence},
	Title = {The Complexity of Some Polynomial Network Consistency Algorithms for Constraint Satisfaction Problems},
	Volume = {25},
	Year = {1985}}

@article{eddie-survey,
	Author = {E. Schwalb and L. Villa},
	Journal = {Constraints},
	Pages = {1-20},
	Title = {Temporal constaints: A survey},
	Year = {1998}}

@techreport{eddie-thesis98,
	Author = {E. Schwalb},
	Institution = {Ph.d. thesis, Information and Computer Science, Universiy of California, Irvine},
	Title = {Temporal reasoning with constraints},
	Year = {1998}}

@techreport{irina-thesis99,
	Author = {I. Rish},
	Institution = {Ph.d. thesis, Information and Computer Science, Universiy of California, Irvine},
	Title = {Efficient Reasoning in Graphical Models},
	Year = {1999}}

@techreport{mcallester80,
	Address = {Boston, Massachusetts},
	Author = {D. A. McAllester},
	Institution = {MIT},
	Number = {AI Memo 551},
	Title = {An Outlook on Truth-Maintenance},
	Year = {1980}}

@techreport{baker95,
	Address = {Oregon},
	Author = {A. B. Baker},
	Institution = {Ph.D. thesis, Graduate school of the University of Oregon},
	Title = {Intelligent Backtracking on constraint satisfaction problems: experimental and theoretical results},
	Year = {1995}}

@techreport{frost-thesis,
	Author = {D. H. Frost},
	Institution = {Ph.D. thesis, Information and Computer Science, University of California, Irvine},
	Title = {Algorithms and Heuristics for constraint satisfaction problems},
	Year = {1997}}

@techreport{kalev-thesis,
	Address = {California},
	Author = {K. Kask},
	Institution = {Ph.D. thesis, Information and Computer Science, University of California, Irvine},
	Title = {Approximation algorithms for graphical models},
	Year = {2001}}

@inproceedings{vanbeek89,
	Author = {P. VanBeek},
	Booktitle = {International Joint Conference on on Artificial Intelligence (IJCAI89)},
	Pages = {1291-1296},
	Title = {Approximation algorithms for tempral reasoning},
	Year = {1989}}

@article{vanbeek92,
	Author = {P. VanBeek},
	Journal = {Artificial Intelligence},
	Pages = {297-326},
	Title = {Reasoning about qualitative temporal information},
	Volume = {58},
	Year = {1992}}

@inproceedings{debruyne,
	Author = {R. Debruyne},
	Booktitle = {Phd thesis, Technical Report TR98041, LIRMM, Universit\E9 de Montpellier II, 1998},
	Title = {Removing more values than max-restricted path consistency for the same cost}}

@inproceedings{vanbeekthesis,
	Author = {P. VanBeek},
	Booktitle = {PhD thesis, University of Waterloo, Waterloo, Onario, Canada},
	Title = {Exact and approximate reasoning about qualitative temporal relations},
	Year = {1990}}

@inproceedings{mcallester90,
	Author = {D. A. McAllester},
	Booktitle = {AAAI'90: Proceedings of the Eighth National Conference on Artificial Intelligence},
	Pages = {1109-1116},
	Title = {Truth maintenance},
	Year = {1990}}

@inproceedings{stone86,
	Author = {S. Stone and J.M. Stone},
	Booktitle = {Technical report RC (\#54343) IBM T.J. Watson},
	Title = {Efficient search techniques-an empirical study of the N-queen problem},
	Year = {1986}}

@article{montanari74,
	Author = {U. Montanari},
	Journal = {Information Science},
	Number = {66},
	Pages = {95-132},
	Title = {Networks of Constraints: Fundamental Properties and Applications to Picture Processing},
	Volume = {7},
	Year = {1974}}

@article{pearl_fusion,
	Author = {J. Pearl},
	Journal = {Artificial Intelligence},
	Number = {3},
	Pages = {241--248},
	Title = {Fusion Propagation and Structuring in Belief Networks},
	Volume = {29},
	Year = {1986}}

@article{purdom83,
	Author = {P. W. Purdom},
	Journal = {Artificial Intelligence},
	Pages = {117-133},
	Title = {Search rearangement backtracking and polynomial average time},
	Volume = {21},
	Year = {1983}}

@inproceedings{provan87,
	Address = {Seattle, Washington},
	Author = {G. Provan},
	Booktitle = {Proceedings of AAAI'87},
	Pages = {173--177},
	Title = {Complexity Analysis of Multiple-Context {TMS}s in Scene Representation},
	Year = {1987}}

@inproceedings{avi88,
	Address = {St Paul, MN},
	Author = {R. Dechter and A. Dechter},
	Booktitle = {Proceedings of AAAI'88},
	Pages = {37-42},
	Title = {Belief maintenance in dynamic constraint networks},
	Year = {1988}}

@incollection{avi90,
	Author = {R. Dechter, A. Dechter, and J. Pearl},
	Booktitle = {Influence Diagrams, Belief Nets and Decision Analysis},
	Pages = {411-425},
	Publisher = {John Wiley \& Sons},
	Title = {Optimization in constraint networks},
	Year = {1990}}

@inproceedings{ecs02,
	Author = {R. Dechter and F. Rossi},
	Booktitle = {Nadel, L. (Ed), Encyclopedia of Cognitive Science, Nature Publishing Group, London, to be published 2002},
	Title = {Constraint satisfaction},
	Year = 2002}

@inproceedings{dechter-survey99,
	Author = {R. Dechter},
	Booktitle = {The MIT Encyclopedia of Cognitive Sciences (MITECS)},
	Editors = {R. A. Wilson and F. C. Keil},
	Pages = {195--197},
	Title = {Constraint satisfaction},
	Year = {1999}}

@inproceedings{dechter92c,
	Author = {R. Dechter},
	Booktitle = {Encyclopedia of Artificial Intelligence, 2nd Ed.},
	Pages = {276--285},
	Title = {Constraints networks},
	Year = {1992}}

@inproceedings{dechter98,
	Author = {R. Dechter and D. Frost},
	Booktitle = {UCI technical report. Also on web page www.ics.uci.edu/{\~} dechter},
	Title = {Backtracking algorithms for constraint satisfaction problems -- a tutorial survey},
	Year = 1998}

@inproceedings{reiter87,
	Address = {Seattle, Washington},
	Author = {R. Reiter and J. de Kleer},
	Booktitle = {Proceedings of AAAI'87},
	Pages = {183--188},
	Title = {Foundations of Assumption-Based Truth Maintenance System: Preliminary Report},
	Year = 1987}

@article{valiant,
	Author = {L. G. Valiant},
	Journal = {Siam Journal of Computation},
	Number = 3,
	Pages = {105-117},
	Title = {The complexity of enumeration and reliability problems},
	Volume = 8,
	Year = 1987}

@article{mitchell92,
	Author = {Mitchell, D. and Selman, B. and Levesque, H.},
	Journal = {AAAI},
	Title = {Hard and Easy Distributions of SAT Problems},
	Year = 1992}

@article{WilliamsHogg92,
	Author = {Williams, C. and Hogg, T.},
	Journal = {AAAI},
	Pages = {472--477},
	Title = {Using Deep Structure to Locate Hard Problems},
	Year = 1992}

@inproceedings{frost98,
	Address = {Carnegie Mellon university},
	Author = {D. Frost and R. Dechter},
	Booktitle = {Workshop on combinatorial search and planning of the 4th international conference on artificial Intelligence and planning systems (AIPS98)},
	Title = {Evaluating Constraint processing algorithms},
	Year = {1994}}

@inproceedings{dfrost94a,
	Address = {Seattle},
	Author = {D. Frost and R. Dechter},
	Booktitle = {AAAI'94: Proceedings of the Twelfth National Conference on Artificial Intelligence},
	Pages = {301-306},
	Title = {In search of best search: An empirical evaluation},
	Year = {1994}}

@inproceedings{dfrost94b,
	Author = {D. Frost and R. Dechter},
	Booktitle = {AAAI'94: Proceedings of the Twelfth National Conference on Artificial Intelligence},
	Pages = {294-300},
	Title = {Dead-end driven learning},
	Year = {1994}}

@inproceedings{dfrost96,
	Author = {D. Frost and R. Dechter},
	Booktitle = {Proceedings of the Second International Conference on Constraint Programming (CP-96)},
	Title = {Looking at full look-ahead},
	Year = 1996}

@inproceedings{eddie94,
	Address = {Seattle, WA},
	Author = {E. Schwalb, K. Kask, and R. Dechter},
	Booktitle = {Proceedings of the Twelfth National Conference on Artificial Intelligence (AAAI'94)},
	Pages = {1067-1072},
	Title = {Temporal Reasoning with constraints on fluents and events},
	Year = {August 1994}}

@inproceedings{kalev95,
	Address = {Montreal, Canada},
	Author = {K. Kask and R. Dechter},
	Booktitle = {International Joint Conference on Artificial Intelligence (IJCAI'95)},
	Pages = {616-622},
	Title = {GSAT and local consistency},
	Year = {August 1995}}

@inproceedings{kalev96,
	Address = {Portland Oregon},
	Author = {K. Kask and R. Dechter},
	Booktitle = {National Conference on Artificial Intelligence (AAAI'96)},
	Pages = {350-355},
	Title = {A graph-based method for improving GSAT},
	Year = {August 1996}}

@inproceedings{dfrost95,
	Author = {D. Frost and R. Dechter},
	Booktitle = {Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI-95)},
	Pages = {572-578},
	Title = {Look-ahead value ordering for constraint satisfaction problems},
	Year = {1995}}

@inproceedings{yousri95,
	Address = {Montreal, Canada},
	Author = {Y. El Fattah, and R. Dechter},
	Booktitle = {International Joint Conference of Artificial Intelligence (IJCAI-95)},
	Pages = {1742--1748},
	Title = {Diagnosing tree-decomposable circuits},
	Year = {August 1995}}

@inproceedings{dechter95,
	Author = {R. Dechter and P. van Beek},
	Booktitle = {Principles and Practice of Constraint programming (CP-95)},
	Pages = {240--257},
	Title = {Local and global relational consistency},
	Year = {1995}}

@article{dechter97b,
	Author = {R. Dechter and P. van Beek},
	Journal = {Theoretical Computer Science},
	Pages = {283-308},
	Title = {Local and global relational consistency},
	Volume = {173(1)},
	Year = {1997}}

@inproceedings{eddie94b,
	Address = {Banff, Canada},
	Author = {E. Schwalb, and R. Dechter},
	Booktitle = {Proceedings of the Canadian Conference on Artificial Intelligence (AI/GI/VI-94)},
	Title = {Compiling relational data into disjunctive structure: Empirical evaluation},
	Year = {1994}}

@inproceedings{eddie93,
	Address = {Washington, DC},
	Author = {E. Schwalb, and R. Dechter},
	Booktitle = {Proceedings of the Eleventh National Conference on Artificial Intelligence (AAAI'93)},
	Comment = {A full version will appear in Artificial Intelligence},
	Pages = {127--132},
	Title = {Coping with disjunctions in temporal constraint satisfaction problems},
	Year = {1993}}

@article{eddie97,
	Author = {E. Schwalb, and R. Dechter},
	Journal = {Artificial Intelligence},
	Pages = {29--61},
	Title = {Processing disjunctions in temporal constraint networks},
	Volume = {93(1-2)},
	Year = {1997}}

@inproceedings{collin91,
	Author = {Z. Collin and R. Dechter and S. Katz},
	Booktitle = {Proceedings of the Twelfth International Conference of Artificial Intelligence (IJCAI'91)},
	Pages = {318-324},
	Title = {On the feasibility of distributed constraint satisfaction},
	Year = {1991}}

@article{collin99,
	Author = {Z. Collin and R. Dechter and S. Katz},
	Journal = {The Chicago Journal of Theoretical Computer Science},
	Title = {Self-stabilizing distributed constraint satisfaction},
	Volume = {3(4), special issue on self-stabilization, 1999},
	Year = {1999}}

@book{chvatal83,
	Author = {V. Chvatal},
	Publisher = {Freeman},
	Title = {Linear Programming},
	Year = 1983}

@book{feller,
	Author = {W. Feller},
	Publisher = {Willey International edition},
	Title = {An Introduction to Probability Theory and its Applications},
	Year = 1967}

@book{pearl2000,
	Author = {J. Pearl},
	Publisher = {Cambridge Press},
	Title = {Causality: Models, Reasoning and Inference},
	Year = 2000}

@book{lawler85,
	Author = {E. L. Lawler, J.K. Lenstra, A.H.G. Rinnoy Kan and D. B. Shmoys},
	Publisher = {John Wiley and Sons, Essex, England},
	Title = {The traveling salesman problem},
	Year = 1985}

@article{lawler64,
	Author = {E. L. Lawler and D.E. Wood},
	Journal = {Operations Research},
	Pages = {699-719},
	Title = {Branch and Bound methods: A survey},
	Volume = {14},
	Year = 1956}

@article{dantzig54,
	Author = {G. B. Dantzig, D. R. Fulkerson and S. M. Johnson},
	Journal = {Operations Research},
	Pages = {393-410},
	Title = {Solution of a large scale traveling salesman problem},
	Volume = {2},
	Year = 1954}

@article{dantzig59,
	Author = {G. B. Dantzig, D. R. Fulkerson and S. M. Johnson},
	Journal = {Operations Research},
	Pages = {58-66},
	Title = {On a linear programming, combinatorial approach to the traveling salesman problem},
	Volume = {7},
	Year = 1959}

@book{dantzig62,
	Author = {G. B. Dantzig},
	Publisher = {Princeton university Press, Princeton,NJ},
	Title = {Linear programming and extensions},
	Year = 1962}

@book{dantzig63,
	Author = {G. Dantzig},
	Publisher = {Princeton University Press, N.J.},
	Title = {Linear Programming and Extentions},
	Year = 1963}

@book{bellman57,
	Author = {R.E. Bellman},
	Publisher = {Princeton UNiversity Press},
	Title = {Dynamic Programming},
	Year = 1957}

@book{pearl88,
	Author = {J. Pearl},
	Publisher = {Morgan Kaufmann},
	Title = {Probabilistic Reasoning in Intelligent Systems},
	Year = 1988}

@book{tsang93,
	Author = {E. Tsang},
	Publisher = {Academic press},
	Title = {Foundation of Constraint Satisfaction},
	Year = 1993}

@book{nilsson80,
	Author = {N. J. Nilsson},
	Publisher = {Tioga, Palo Alto, CA},
	Title = {Principles of Artificial Intelligence},
	Year = 1980}

@inproceedings{pearl84,
	Author = {J. Pearl},
	Booktitle = {Addison-Wesley},
	Title = {Heuristics: Intelligent Search Strategies},
	Year = 1984}

@inproceedings{tsang99,
	Author = {E. P.K Tsang, C.J. Wang, A. Davenport, C Vouldouris and T.L. Lau},
	Booktitle = {The first International Conference on the Practical application of Constraint Technologies and Logic Programming (PACLP)},
	Pages = {359-383},
	Title = {A family of stochastic methods for constraint satisfaction and optimization},
	Year = 1999}

@inproceedings{marriot98,
	Author = {K. Marriot and P. Stuckey},
	Booktitle = {MIT Press},
	Title = {Programming with Constraints, an Introduction},
	Year = 1998}

@inproceedings{lange97,
	Author = {K. Lange},
	Booktitle = {Springer},
	Title = {Mathematical and statistical methods for genetic analysis},
	Year = 1997}

@inproceedings{gu92,
	Author = {J. Gu},
	Booktitle = {Sigart Bulletin},
	Pages = {8-12},
	Title = {Efficient local search for very large-scale satisfiability problems},
	Volume = 3,
	Year = 1992}

@inproceedings{garey79,
	Author = {M. R Garey and D. S. Johnson},
	Booktitle = {W. H. Freeman and Company, San Francisco},
	Title = {Computers and Intractability: A Guide to the Theory of NP-completeness},
	Year = 1979}

@inproceedings{even,
	Author = {S. Even},
	Booktitle = {Computer Science Press},
	Title = {Graph Algorithms},
	Year = 1979}

@article{khachiyan79,
	Author = {L. G. Khachiyan},
	Journal = {Soviet Mathematics Doklady},
	Pages = {191-194},
	Title = {A polynomial algorithm in linear programming},
	Volume = {20},
	Year = {1979}}

@article{crowder83,
	Author = {H. P. Crowder, E. L. Johnson and M. W. Padberg},
	Journal = {Operation Research},
	Pages = {803-834},
	Title = {Solving large-scale zero-one linear programming problems},
	Volume = {31},
	Year = {1996}}

@article{padberg87,
	Author = {M. Padberg and G. Rinaldi},
	Journal = {Operations Research Letters},
	Pages = {1--7},
	Title = {Optimization of a 532-city symmetric traveling salesman problem by branch-and-cut},
	Volume = {6},
	Year = {1987}}

@article{padberg91,
	Author = {M. Padberg and G. Rinaldi},
	Journal = {SIAM Review},
	Pages = {60--100},
	Title = {A branch-and-cut algorithm for the resolution of large scale symmetric traveling salesman problems},
	Volume = {33},
	Year = {1991}}

@book{nillson80,
	Author = {Nils J. Nilsson},
	Publisher = {Tioga},
	Title = {Principles of Artificial Intelligence.},
	Year = {1980}}

@article{gu99,
	Author = {Z, Gu, G. L. Nemhauser and M. W. P. Savelsbergh},
	Journal = {Mathematical Programming},
	Pages = {439-467},
	Title = {Lifted flow covers for mized 0-1 integer programs},
	Volume = {85},
	Year = {1999}}

@article{zhang96,
	Author = {N.L. Zhang and D. Poole},
	Journal = {Journal of Artificial Intelligence Research (JAIR)},
	Title = {Exploiting causal independence in Bayesian network inference},
	Year = {1996}}

@inproceedings{zhang94a,
	Author = {N.L. Zhang and D. Poole},
	Booktitle = {Proc of the tenth Canadian Conference on Artificial Intelligence},
	Pages = {171-178},
	Title = {A simple algorithm for Bayesian network computations},
	Year = {1994}}

@article{pinkas95,
	Author = {G. Pinkas, and R. Dechter},
	Journal = {Journal of Artificial Intelligence Research (JAIR)},
	Pages = {223--248},
	Title = {Improving connectionist energy minimization},
	Year = 1995}

@article{allen84,
	Author = {James Allen},
	Journal = {Artificial Intelligece},
	Pages = {123-154},
	Title = {Towards a general theory of action and time},
	Volume = {23},
	Year = 1984}

@article{allen83,
	Author = {James Allen},
	Journal = {Communications of the ACM},
	Pages = {832--843},
	Title = {Maintaining Knowledge about Temporal Intervals},
	Volume = {26},
	Year = 1983}

@inproceedings{vilain82,
	Author = {M. Vilain},
	Booktitle = {National confrence of Artificial Intelligence (AAAI'82)},
	Pages = {197-201},
	Title = {A system of resoningabout time},
	Year = 1982}

@article{kohler74,
	Author = {W.H. Kohler and K. Stieglitz},
	Journal = {Journal of the ACM},
	Pages = {140-156},
	Title = {Characterization and theoretical comparison of Branch-and-Bound algorithms for permutation problems},
	Volume = {21},
	Year = 1974}

@article{shostak81,
	Author = {R. Shostak},
	Journal = {Journal of the ACM},
	Pages = {769-779},
	Title = {Deciding linear inequalities by computing loop residues},
	Volume = {28},
	Year = 1981}

@article{nebel95,
	Author = {B. Nebel and H. B{\"u}rckert},
	Journal = {Journal of the ACM},
	Pages = {43-66},
	Title = {Reasoning about Temporal Relations: A Maximal Tractable Subclass of Allen's Interval Algebra},
	Volume = {42(1)},
	Year = 1995}

@inproceedings{leiserson83,
	Author = {C.E. Leiserson and J. B. Saxe},
	Booktitle = {21st annual Allerton Conference on Communication, Control and Computing},
	Pages = {204-213},
	Title = {A mixed-integer linear programming problem which is efficiently solvable},
	Year = 1983}

@inproceedings{nebel,
	Author = {B. Nebel and H. B{\"u}rckert},
	Booktitle = {Proc. AAAI'94},
	Title = {Reasoning about Temporal Relations: A Maximal Tractable Subclass of Allen's Interval Algebra},
	Year = 1994}

@inproceedings{kondrak94,
	Author = {G. Kondrak and P. van Beek},
	Booktitle = {Proceedings of International Joint Conference of Artificial Intelligence (IJCAI-94)},
	Title = {A theoretical evaluation of selected backtracking algorithms},
	Year = 1994}

@inproceedings{baker94,
	Author = {A. B. Baker},
	Booktitle = {Proceedings of National Conference of Artificial Intelligence (AAAI'94)},
	Title = {The hazards of fancy backtracking},
	Year = 1994}

@article{kondrak97,
	Author = {G. Kondrak and P. van Beek},
	Journal = {Artificial Intelligence},
	Pages = {365-387},
	Title = {A theoretical valuation of selected algorithms},
	Volume = 89,
	Year = 1997}

@article{McGregor79,
	Author = {McGregor, J. J.},
	Journal = {Information Science},
	Pages = {229-250},
	Title = {Relational Consistency Algorithms and Their Application in Finding Subgraph and Graph Isomorphisms},
	Volume = {19},
	Year = {1979}}

@inproceedings{SaFr94,
	Address = {Amsterdam},
	Author = {Sabin, D. and Freuder, E. C.},
	Booktitle = {ECAI-94},
	Pages = {125-129},
	Title = {Contradicting Conventional Wisdom in Constraint Satisfaction},
	Year = {1994}}

@inproceedings{BavR95,
	Address = {Cassis, France},
	Author = {Bacchus, F. and van Run, P.},
	Booktitle = CP-95,
	Note = {Available as: Springer Lecture Notes in Computer Science 976},
	Pages = {258-275},
	Title = {Dynamic Variable Ordering in {CSP}s},
	Year = {1995}}

@inproceedings{dagum93,
	Author = {P. Dagum and M. Luby},
	Booktitle = {National Conference on Artificial Intelligence (AAAI-93)},
	Title = {Approximating Probabilistic Inference in Bayesian Belief Networks is NP-Hard},
	Year = 1993}

@incollection{cook97,
	Author = {S. A. Cook and D. G. Mitchell},
	Publisher = {American Mathematical Society},
	Series = {DIMACS Series in Discrete Mathematics and Theoretical Computer Science},
	Title = {{Finding hard instances of the satisfiability problem: a survey}},
	Year = {1997}}

@incollection{Dubois96,
	Author = {O. Dubois and P. Andre and Y. Boufkhad and J. Carlier},
	Booktitle = {{Cliques, Coloring, and Satifiability}},
	Editor = {David S. Johnson and Michael A. Trick},
	Publisher = {American Mathematical Society},
	Series = {DIMACS Series in Discrete Mathematics and Theoretical Computer Science},
	Title = {{SAT versus UNSAT}},
	Volume = {26},
	Year = {1996}}

@incollection{Pretolani96,
	Author = {Daniele Pretolani},
	Booktitle = {{Cliques, Coloring, and Satifiability}},
	Editor = {David S. Johnson and Michael A. Trick},
	Publisher = {American Mathematical Society},
	Series = {DIMACS Series in Discrete Mathematics and Theoretical Computer Science},
	Title = {{Efficiency and Stability of Hypergraph SAT Algorithms}},
	Volume = {26},
	Year = {1996}}

@incollection{Resende96,
	Author = {Mauricio G. C. Resende and Thomas A. Feo},
	Booktitle = {{Cliques, Coloring, and Satifiability}},
	Editor = {David S. Johnson and Michael A. Trick},
	Publisher = {American Mathematical Society},
	Series = {DIMACS Series in Discrete Mathematics and Theoretical Computer Science},
	Title = {{A GRASP for Satisfiability}},
	Volume = {26},
	Year = {1996}}

@incollection{Hampson96,
	Author = {Steven Hampson and Denis Kibler},
	Booktitle = {{Cliques, Coloring, and Satifiability}},
	Editor = {David S. Johnson and Michael A. Trick},
	Publisher = {American Mathematical Society},
	Series = {DIMACS Series in Discrete Mathematics and Theoretical Computer Science},
	Title = {{Large Plateaus and Plateau Search in Boolean Satisfiability Problems: When to Give Up Searching and Start Again}},
	Volume = {26},
	Year = {1996}}

@inproceedings{Gomes97b,
	Author = {Carla Gomes and Bart Selman and Nuno Crato},
	Booktitle = {{Principles and Practice of Constraint Programming -- CP97}},
	Editor = {Gert Smolka},
	Pages = {121-135},
	Title = {{Heavy-Tailed Distributions in Combinatorial Search}},
	Year = {1997}}

@incollection{Jaumard96,
	Author = {Brigette Jaumard and Mihnea Stan and Jacques Desrosiers},
	Booktitle = {{Cliques, Coloring, and Satifiability}},
	Editor = {David S. Johnson and Michael A. Trick},
	Publisher = {American Mathematical Society},
	Series = {DIMACS Series in Discrete Mathematics and Theoretical Computer Science},
	Title = {{Tabu Search and a Quadratic Relaxation for the Satisfiability Problems}},
	Volume = {26},
	Year = {1996}}

@inproceedings{Rish97,
	Author = {Irina Rish and Daniel Frost},
	Booktitle = {{Principles and Practice of Constraint Programming -- CP97}},
	Editor = {Gert Smolka},
	Pages = {150--162r},
	Title = {Statistical Analysis of Backtracking on Inconsistent CSPs},
	Year = {1997}}

@techreport{Bozhena,
	Author = {B. Bidyuk and R. Dechter},
	Institution = {UCI},
	Title = {The Epsilon-cuset Effect in Bayesian Networks, http://www.ics.uci.edu/\textasciitilde csp/r97a.pdf},
	Year = 2001}

@article{zecchina02,
	Author = {M. M\a'ezard and G. Parisi and R. Zecchina},
	Journal = {Science},
	Pages = {812-815},
	Title = {Analytic and Algorithmic Solution of Random Satisfiability Problems},
	Volume = {297},
	Year = {2002}}

@article{druzdzel00,
	Author = {Cheng, J. and Druzdzel, M.},
	Journal = {Journal of Artificial Intelligence Research},
	Pages = {155-188},
	Title = {{\uppercase AIS-BN}: An Adaptive Importance Sampling Algorithm for Evidential Reasoning in Large Bayesian Networks},
	Volume = {13},
	Year = {2000}}

@inproceedings{koller99b,
	Author = {N. Friedman and L. Getoor and D. Koller and A. Pfeffer.},
	Booktitle = {International Joint Conference on Artificial Intelligence},
	Pages = {1300-1307},
	Title = {Learning Probabilistic Relational Models},
	Year = {1999}}

@book{dechter-book,
	Author = {R. Dechter},
	Publisher = {Morgan Kaufmann Publishers},
	Title = {Constraint Processing},
	Year = 2003}

@techreport{pfeffer-thesis00,
	Author = {A. Pfeffer},
	Institution = {Ph.D. thesis, Stanford Universiy},
	Title = {Probabilistic Reasoning for Complex Systems},
	Year = 2000}

@article{poole93,
	Author = {D. Poole},
	Journal = {Artificial Intelligence},
	Pages = {81-129},
	Title = {Probabilistic Horn abduction and Bayesian networks},
	Volume = {64},
	Year = {1993}}

@article{ngo-haddawy97,
	Author = {L. Ngo and P. Haddawy},
	Journal = {Theoretical Computer Science},
	Pages = {147-177},
	Title = {Answering Queries from Context-Sensitive Probabilistic Knowledge Bases},
	Volume = {171},
	Year = {1977}}

@inproceedings{koller98probabilistic,
	Author = {D. Koller and A. Pfeffer},
	Booktitle = {Proceedings of the National Conference of Artificial Intelligence {AAAI}},
	Pages = {580-587},
	Title = {Probabilistic Frame-Based Systems},
	Year = {1998}}

@article{dechter04,
	Author = {R. Dechter},
	Journal = {Submitted},
	Title = {AND/OR Search Spaces for Graphical Models},
	Year = {2004}}

@inproceedings{companion,
	Author = {R. Dechter},
	Booktitle = {Submitted, UAI},
	Title = {{\uppercase {AND/OR}} Search Spaces for Graphical Models},
	Year = {2004}}

@techreport{and-or04,
	Author = {R. Dechter},
	Institution = {UCI},
	Title = {{\uppercase {AND/OR}} Search Spaces for Graphical Models},
	Year = {2004}}

@inproceedings{larkin01,
	Author = {R. Dechter and D. Larkin},
	Booktitle = {Uncertainty in Artificial Intelligence (UAI)},
	Pages = {112-119},
	Title = {Hybrid processing of belief and constraints},
	Year = {2001}}

@inproceedings{bacchus03a,
	Author = {F. Bacchus and S. Dalmao and T. Pitassi},
	Booktitle = {Uncertainty in Artificial Intelligence (UAI)},
	Pages = {20-28},
	Title = {Value Elimination: Bayesian Inference via Backtracking Search},
	Year = {2003}}

@inproceedings{bacchus03b,
	Author = {F. Bacchus and S. Dalmao and T. Pitassi},
	Booktitle = {IEEE Symposium on Foundations of Computer Science (FOCS)},
	Pages = {340-351},
	Title = {Algorithms and Complexity Results for \#Sat and Bayesian Inference},
	Year = {2003}}

@inproceedings{mdd90,
	Author = {Arvind Srinivasan and Timothy Kam and Sharad Malik and Robert K. Brayton},
	Booktitle = {International conference on CAD},
	Pages = {92-95},
	Title = {Algorithms for discrete function manipulation},
	Year = {1990}}

@techreport{quinn87,
	Address = {Durham},
	Author = {E. C. Freuder and M. J. Quinn},
	Institution = {University of New Hampshire},
	Number = {87-41},
	Title = {The use of lineal spanning trees to represent constraint satisfaction problems},
	Year = 1987}

@inproceedings{darwiche02b,
	Author = {J. Park and A. Darwiche},
	Booktitle = {Advances in Neural Information Processing Systems 15},
	Pages = {299--307},
	Title = {A Differential Semantics for Jointree Algorithms},
	Volume = {1},
	Year = {2003}}

@article{darwiche03,
	Author = {Adnan Darwiche},
	Journal = {Journal of the ACM},
	Number = {3},
	Pages = {280-305},
	Title = {A Differential Approach to Inference in {Bayesian} Networks},
	Volume = {50},
	Year = {2003}}

@inproceedings{mcallester04,
	Author = {D. McAllester and M. Collins and F. Pereira},
	Booktitle = {Proceedings of the Twentieth Conference on Uncertainty in Artificial Intelligence (UAI'04)},
	Pages = {382-391},
	Title = {Case-Factor Diagrams for Structured Probabilistic Modeling},
	Year = {2004}}

@inproceedings{bidyuk03a,
	Author = {B. Bidyuk and R. Dechter},
	Booktitle = {The Canadian AI Conference, (CAAI'03)},
	Title = {Cycle-cutset sampling for Bayesian networks},
	Year = {2003}}

@inproceedings{bidyuk03,
	Author = {B. Bidyuk and R. Dechter},
	Booktitle = {UAI'03},
	Title = {An empirical study of w-cutset sampling for Bayesian networks},
	Year = {2003}}

@inproceedings{bidyuk04,
	Author = {B. Bidyuk and R. Dechter},
	Booktitle = {UAI'04},
	Title = {On finding minimal w-cutset problem},
	Year = {2004}}

@article{fishelson02,
	Author = {M. Fishelson and D. Geiger},
	Journal = {Bioinformatics},
	Pages = {189-198},
	Title = {Exact genetic linkage computations for general pedigrees},
	Volume = {18(1)},
	Year = {2002}}

@inproceedings{larrosa02,
	Author = {J. Larrosa and P. Meseguer and M Sanchez},
	Booktitle = {Proceedings of the European Conference on Artificial Intelligence (ECAI'02)},
	Pages = {131-135},
	Title = {Pseudo-tree search with soft constraints},
	Year = 2002}

@inproceedings{kautz04,
	Author = {Tian Sang and F. Bacchus and P. Beam and H. Kautz and T. Pitassi},
	Booktitle = {Proceedings of the Seventh International Conference on Theory and Applications of Satisfiability Testing (SAT'04)},
	Title = {Combining component caching and clause learning for effective model counting},
	Year = {2004}}

@article{frost01,
	Author = {R. Dechter and D. Frost},
	Journal = {Artificial Intelligence},
	Pages = {147-188},
	Title = {Backjump-based backtracking for constraint satisfaction problems},
	Volume = {136(2)},
	Year = 2002}

@inproceedings{radu04,
	Author = {R. Marinescu and R. Dechter},
	Booktitle = {6th International Workshop on Preferences and Soft Constraints, CP'04},
	Title = {AND/OR Tree Search for Constraint Optimization},
	Year = {2004}}

@inproceedings{radu05,
	Author = {R. Marinescu and R. Dechter},
	Booktitle = {Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence (IJCAI'05)},
	Pages = {224-229},
	Title = {\uppercase{AND/OR} Branch-and-Bound for Graphical Models},
	Year = {2005}}

@article{kask05,
	Author = {K. Kask and R. Dechter and J. Larrosa and A. Dechter},
	Journal = {Artificial Intelligence},
	Pages = {165-193},
	Title = {Unifying Cluster-Tree Decompositions for Reasoning in Graphical Models},
	Volume = {166 (1-2)},
	Year = 2005}

@article{modi05,
	Author = {P. J. Modi and W. Shena and M. Tambea and M. Yokoo},
	Journal = {Artificial Intelligence},
	Pages = {149-180},
	Title = {Adopt: asynchronous distributed constraint optimization with quality guarantees},
	Volume = {161},
	Year = {2005}}

@inproceedings{bienstock95,
	Author = {D. Bienstock and M. A. Langston},
	Booktitle = {Handbook of Operations Research and Management Science: Network Models},
	Editors = {M. O. Ball and T. L. Magnanti and C. L. Monma and G. L. Nemhauser},
	Pages = {481-502},
	Title = {Algorithmic Implications of the Graph Minor Theorem},
	Year = {1995}}

@article{bienstock91,
	Author = {D. Bienstock and N. Robertson and P. Seymour and R. Thomas},
	Journal = {J. Combin. Theory Ser. B},
	Pages = {274-283},
	Title = {Quickly excluding a forest},
	Volume = {52},
	Year = {1991}}

@article{robertson83,
	Author = {N. Robertson and P. Seymour},
	Journal = {J. Combin. Theory, Ser. B},
	Pages = {39-61},
	Title = {Graph minors I. Excluding a forest},
	Volume = {35},
	Year = 1983}

@article{fishelson04a,
	Author = {M. Fishelson and D. Geiger},
	Journal = {Computational Biology},
	Pages = {263-75},
	Title = {Optimizing Exact Genetic Linkage Computations},
	Volume = {11(2-3)},
	Year = {2004}}

@techreport{fishelson04b,
	Author = {M. Fishelson},
	Institution = {Ph.d. thesis, Computer Science, Technion - Israel Institute of Technology},
	Title = {Efficient Genetic Linkage Computations for General Pedigrees},
	Year = {2004}}

@inproceedings{huang-sat04,
	Author = {Jinbo Huang and Adnan Darwiche},
	Booktitle = {Seventh International Conference on Theory and Applications of Satisfiability Testing, SAT 2004, Revised Selected Papers},
	Location = {Vancouver, Cananda},
	Pages = {157-172},
	Series = {Lecture Notes in Computer Science},
	Title = {Using DPLL for Efficient OBDD Construction},
	Volume = {3542},
	Year = {2005}}

@inproceedings{bertacco05a,
	Author = {S. Plaza and V. Bertacco},
	Booktitle = {ASPDAC-05, Asia-South Pacific Design Automation Conference},
	Title = {STACCATO: Disjoint Support Decompositions from BDDs through Symbolic Kernels},
	Year = {2005}}

@inproceedings{cobb06,
	Author = {J. Cobb},
	Booktitle = {Report, Radcliffe fellowship, Cambridge, MA},
	Title = {Joining And/Or Networks},
	Year = {2006}}

@inproceedings{mateescu01,
	Author = {R. Mateescu and R. Dechter and K. Kask},
	Booktitle = {Proceedings of The Eighteenth National Conference on Artificial Intelligence (AAAI'02)},
	Pages = {553-559},
	Title = {Tree approximation for belief updating},
	Year = 2002}

@inproceedings{mateescu02,
	Author = {R. Dechter and R. Mateescu and K. Kask},
	Booktitle = {Proceedings of the Eighteenth Conference on Uncertainty in Artificial Intelligence (UAI'02)},
	Pages = {128-136},
	Title = {Iterative join-graph propagation},
	Year = 2002}

@inproceedings{mateescu03,
	Author = {R. Dechter and R. Mateescu},
	Booktitle = {Proceedings of the Nineteenth Conference on Uncertainty in Artificial Intelligence (UAI'03)},
	Title = {A simple insight into iterative belief propagation's success},
	Year = 2003}

@techreport{tech-report-andor-counting04,
	Author = {R. Dechter and R. Mateescu},
	Institution = {UCI},
	Title = {The Impact of \uppercase{AND/OR} Search Spaces on Constraint Satisfaction and Counting},
	Year = {2004}}

@inproceedings{dechter04-mixed,
	Author = {R. Dechter and R. Mateescu},
	Booktitle = {Proceedings of the Twentieth Conference on Uncertainty in Artificial Intelligence (UAI'04)},
	Pages = {120-129},
	Title = {Mixtures of Deterministic-Probabilistic Networks and their \uppercase{AND/OR} Search Space},
	Year = {2004}}

@inproceedings{mateescu04,
	Author = {Rina Dechter and Robert Mateescu},
	Booktitle = {Proceedings of the Twentieth Conference on Uncertainty in Artificial Intelligence (UAI'04)},
	Pages = {120-129},
	Title = {Mixtures of Deterministic-Probabilistic Networks and their \uppercase{AND/OR} Search Space},
	Year = {2004}}

@inproceedings{dechter04-counting,
	Author = {Rina Dechter and Robert Mateescu},
	Booktitle = {Proceedings of the Tenth International Conference on Principles and Practice of Constraint Programming (CP'04)},
	Pages = {731-736},
	Title = {The Impact of \uppercase{AND/OR} Search Spaces on Constraint Satisfaction and Counting},
	Year = {2004}}

@inproceedings{mateescu05,
	Author = {R. Mateescu and R. Dechter},
	Booktitle = {Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence (IJCAI'05)},
	Pages = {230-235},
	Title = {\uppercase{AND/OR} Cutset Conditioning},
	Year = {2005}}

@inproceedings{mateescu05b,
	Author = {R. Mateescu and R. Dechter},
	Booktitle = {Proceedings of the Twenty First Conference on Uncertainty in Artificial Intelligence (UAI'05)},
	Pages = {380-387},
	Title = {The Relationship Between \uppercase{AND/OR} Search and Variable Elimination},
	Year = {2005}}

@inproceedings{mateescu05c,
	Author = {R.Mateescu and R. Dechter},
	Booktitle = {Proceedings of the Eleventh International Conference on Principles and Practice of Constraint Programming (CP'05), Doctoral Program},
	Pages = {860},
	Title = {\uppercase{AND/OR} Search Spaces and the Semantic Width of Constraint Networks},
	Year = {2005}}

@article{mateescu05d,
	Author = {R. Dechter and R.Mateescu},
	Journal = {Artificial Intelligence},
	Note = {submitted},
	Title = {\uppercase{AND/OR} Search Spaces for Graphical Models}}

@article{dechter06,
	Author = {R. Dechter and R. Mateescu},
	Journal = {Artificial Intelligence},
	Number = {2-3},
	Pages = {73-106},
	Title = {\uppercase{AND/OR} Search Spaces for Graphical Models},
	Volume = {171},
	Year = {2007}}

@article{dechter-mateescu07,
	Author = {R. Dechter and R. Mateescu},
	Journal = {Artificial Intelligence},
	Number = {2-3},
	Pages = {73-106},
	Title = {\uppercase{AND/OR} Search Spaces for Graphical Models},
	Volume = {171},
	Year = {2007}}

@inproceedings{mateescu06,
	Author = {R. Mateescu and R. Dechter},
	Booktitle = {Principles and Practice of Constraint Programming (CP)},
	Pages = {329-343},
	Title = {Compiling Constraint Networks into \uppercase{AND/OR} Multi-Valued Decision Diagrams (\uppercase{AOMDD}s)},
	Year = {2006}}

@inproceedings{mateescu07,
	Author = {R. Mateescu and R. Dechter},
	Booktitle = {Proceedings of the Twentieth International Joint Conference on Artificial Intelligence},
	Pages = {2346-2352},
	Title = {A Comparison of Time-Space Scheme for Graphical Models},
	Year = {2007}}

@article{bistarelli97,
	Author = {S. Bistarelli and U. Montanari and F. Rossi},
	Journal = {Journal of ACM},
	Number = {2},
	Pages = {309--315},
	Title = {Semiring based constraint solving and optimization.},
	Volume = {44},
	Year = {1997}}

@article{dantzig51,
	Author = {G.B. Dantzig},
	Journal = {Activity Analysis of Production and Allocation},
	Title = {Maximization of a linear function of variables subject to linear inequalities.},
	Year = {1951}}

@inproceedings{huang03,
	Author = {J. Huang and A. Darwiche},
	Booktitle = {International Joint Conference on Artificial Intelligence (IJCAI 2003)},
	Pages = {1167--1172},
	Title = {A structure-based variable ordering heuristic.},
	Year = {2003}}

@inproceedings{weili04,
	Author = {W. Li and P. van Beek},
	Booktitle = {International Conference on Tools with Artificial Intelligence (ICTAI'04)},
	Pages = {542--548},
	Title = {Guiding real-world SAT solving with dynamic hypergraph separator decomposition.},
	Year = {2004}}

@inproceedings{cats20,
	Author = {K. Leyton-Brown and M. Pearson and Y. Shoham},
	Booktitle = {ACM Electronic Commerce},
	Pages = {66-76},
	Title = {Towards a universal test suite for combinatorial auction algorithms.},
	Year = {2000}}

@inproceedings{schiex95,
	Author = {T. Schiex and H. Fargier and G. Verfaille},
	Booktitle = {International Joint Conference on Artificial Intelligence (IJCAI-1995)},
	Pages = {631--637},
	Title = {Valued constraint satisfaction problems: hard and easy problems.},
	Year = {1995}}

@article{meseguer99,
	Author = {P. Meseguer and J. Larrosa and T. Schiex},
	Journal = {Artificial Intelligence},
	Number = {1},
	Pages = {149--163},
	Title = {Maintaining reversible DAC for Max-CSP.},
	Volume = {107},
	Year = {1999}}

@article{larrosa01,
	Author = {J. Larrosa and P. Meseguer},
	Journal = {Constraints},
	Number = {1},
	Pages = {407--419},
	Title = {Partition-based lower bound for Max-CSP.},
	Volume = {7},
	Year = {2002}}

@inproceedings{meseguer01,
	Author = {P. Meseguer and J. Larrosa and M. Sanchez},
	Booktitle = {Principles and Practice of Constraint Programming (CP-2001)},
	Title = {Lower bounds for non-binary constraint optimization problems.},
	Year = {2001}}

@article{kask01,
	Author = {K. Kask and R. Dechter},
	Journal = {Artificial Intelligence},
	Number = {1-2},
	Pages = {91-131},
	Title = {A general scheme for automatic generation of search heuristics from specification dependencies.},
	Volume = {129},
	Year = {2001}}

@inproceedings{jegou04,
	Author = {P. Jegou and C. Terrioux},
	Booktitle = {European Conference on Artificial Intelligence (ECAI 2004)},
	Pages = {196--200},
	Title = {Decomposition and good recording for solving Max-CSPs.},
	Year = {2004}}

@inproceedings{larrosa02a,
	Author = {J. Larrosa and P. Meseguer and M. Sanchez},
	Booktitle = {In European Conference on Artificial Intelligence (ECAI-2002)},
	Pages = {131--135},
	Title = {Pseudo-tree search with soft constraints.},
	Year = {2002}}

@inproceedings{larrosa03,
	Author = {J. Larrosa and T. Schiex},
	Booktitle = {International Joint Conference in Artificial Intelligence (IJCAI-2003)},
	Pages = {631--637},
	Title = {In the quest of the best form of local consistency for Weighted CSP.},
	Year = {2003}}

@inproceedings{degivry05,
	Author = {S. de Givry and F. Heras and J. Larrosa and M. Zytnicki},
	Booktitle = {International Joint Conference in Artificial Intelligence (IJCAI-2005)},
	Title = {Existential arc consistency: getting closer to full arc consistency in weighted CSPs.},
	Year = {2005}}

@inproceedings{allen03,
	Author = {D. Allen and A. Darwiche},
	Booktitle = {Uncertainty in Artificial Intelligence (UAI-2003)},
	Pages = {2--10},
	Title = {New advances in inference using recursive conditioning},
	Year = {2003}}

@inproceedings{allen03b,
	Author = {D. Allen and A. Darwiche},
	Booktitle = {International Joint Conference in Artificial Intelligence (IJCAI-2003)},
	Pages = {969--975},
	Title = {Optimal time-space tradeoff in probabilistic inference.},
	Year = {2003}}

@inproceedings{marinescu05,
	Author = {R. Marinescu and R. Dechter},
	Booktitle = {International Joint Conference on Artificial intelligence (IJCAI)},
	Pages = {224--229},
	Title = {{AND/OR} Branch-and-Bound for Graphical Models.},
	Year = {2005}}

@inproceedings{marinescu06a,
	Author = {R. Marinescu and R. Dechter},
	Booktitle = {International Conference on Integration of AI and OR techniques for Combinatorial Optimization (CPAIOR)},
	Pages = {152--166},
	Title = {AND/OR Branch-and-Bound Search for Pure 0/1 Integer Linear Programming Problems.},
	Year = {2006}}

@inproceedings{marinescu06b,
	Author = {R. Marinescu and R. Dechter},
	Booktitle = {National Conference on Artificial Intelligence (AAAI)},
	Title = {Memory Intensive Branch-and-Bound Search for Graphical Models.},
	Year = {2006}}

@inproceedings{marinescu06c,
	Author = {R. Marinescu and R. Dechter},
	Booktitle = {European Conference on Artificial Intelligence (ECAI)},
	Pages = {138--142},
	Title = {Dynamic Orderings for AND/OR Branch-and-Bound Search in Graphical Models.},
	Year = {2006}}

@article{dechter85,
	Author = {R. Dechter and J. Pearl},
	Journal = {In Journal of ACM},
	Number = {3},
	Pages = {505--536},
	Title = {Generalized Best-First Search Strategies and the Optimality of A*.},
	Volume = {32},
	Year = {1985}}

@inproceedings{degivry03,
	Author = {S. de Givry, J. Larrosa and T. Schiex},
	Booktitle = {Principles and Practice of Constraint Programming (CP)},
	Pages = {364-376},
	Title = {Solving Max-SAT as weighted CSP.},
	Year = {2003}}

@inproceedings{joy97,
	Author = {S. Joy and J. Mitchell and B. Borchers},
	Booktitle = {In Satisfiability Problem: Theory and Applications},
	Pages = {519--536},
	Title = {A branch and cut algorithm for Max-SAT and weighted Max-SAT.},
	Year = {1997}}

@book{koster99,
	Author = {A. Koster},
	Publisher = {Ph.D. disertation, University of Maastricht.},
	Title = {Frequency Assignment -- Models and Algorithms.},
	Year = {1999}}

@article{spot5,
	Author = {E. Bensana and M. Lemaitre and G. Verfaillie},
	Journal = {Constraints},
	Number = {3},
	Pages = {293--299},
	Title = {Earth observation satellite management.},
	Volume = {4},
	Year = {1999}}

@book{kanal88,
	Author = {L. Kanal and V. Kumar},
	Pages = {91--130},
	Publisher = {Springer-Verlag.},
	Title = {Search in artificial intelligence.},
	Year = {1988}}

@article{lawler66,
	Author = {E. Lawler and D. Wood},
	Journal = {Operations Research},
	Number = {4},
	Pages = {699--719},
	Title = {Branch-and-bound methods: A survey.},
	Volume = {14},
	Year = {1966}}

@article{chakrabati89,
	Author = {P. Chakrabati and S. Ghose and A. Acharya and S. de Sarkar},
	Journal = {In Artificial Intelligence},
	Number = {41},
	Pages = {197--221},
	Title = {Heuristic search in restricted memory.},
	Volume = {3},
	Year = {1989}}

@book{nemhauser88,
	Author = {G. Nemhauser and L. Wolsey},
	Publisher = {Wiley},
	Title = {Integer and combinatorial optimization.},
	Year = {1988}}

@article{larrosa04a,
	Author = {J. Larrosa and T. Schiex},
	Journal = {Artificial Intelligence},
	Number = {1--2},
	Pages = {1--26},
	Title = {Solving weighted CSP by maintaining arc consistency.},
	Volume = {159},
	Year = {2004}}

@article{cooper04,
	Author = {Martin C. Cooper and Thomas Schiex},
	Journal = {Artificial Intelligence},
	Number = {1-2},
	Pages = {199-227},
	Title = {Arc consistency for soft constraints},
	Volume = {154},
	Year = {2004}}

@article{karp72,
	Author = {R. Karp},
	Journal = {Complexity of Computer Computations, Plenum Press, NY},
	Pages = {85--103},
	Title = {Reducibility among combinatorial problems},
	Year = {1972}}

@article{hart68,
	Author = {P. Hart, N. Nilsson and B. Raphael},
	Journal = {IEEE Transactions on Systems Science and Cybernetics},
	Number = {2},
	Pages = {100--107},
	Title = {A formal basis for the heuristic determination of minimum cost paths},
	Volume = {8},
	Year = {1968}}

@inproceedings{meseguere-99,
	Author = {P. Meseguer and J. Larrosa and M. Sanchez},
	Booktitle = {Principles and Practice of Constraint Programming (CP)},
	Date-Modified = {2020-05-27 12:24:04 +0100},
	Title = {Lower bounds for non-binary constraint optimization problems.},
	Year = {1999}}

@article{cabon99,
	Author = {B. Cabon and S. de Givry and L. Lobjois and T. Schiex and J. Warners},
	Journal = {Constraints},
	Pages = {79--89},
	Title = {Radio Link Frequency Assignment.},
	Volume = {4},
	Year = {1999}}

@inproceedings{sandholm99,
	Author = {T. Sandholm},
	Booktitle = {International Joint Conference on Artificial Intelligence (IJCAI)},
	Pages = {542--547},
	Title = {An algorithm for optimal winner determination in combinatorial auctions},
	Year = {1999}}

@inproceedings{hadzic06a,
	Author = {T. Hadzic and H. R. Andersen},
	Booktitle = {National Conference on Artificial Intelligence (AAAI)},
	Title = {A bdd-based polytime algorithm for cost-bounded interactive configuration.},
	Year = {2006}}

@article{hadzic06b,
	Author = {T. Hadzic and J. Hooker},
	Journal = {Technical Report, Carnegie Mellon.},
	Title = {Postoptimality analysis for integer programming using binary decision diagrams.},
	Year = {2006}}

@inproceedings{marinescu07a,
	Author = {R. Marinescu and R. Dechter},
	Booktitle = {International Conference on Integration of AI and OR techniques for Combinatorial Optimization (CPAIOR)},
	Title = {Best-First AND/OR Search for 0/1 Integer Programming},
	Year = {2007}}

@inproceedings{marinescu07c,
	Author = {R. Marinescu and R. Dechter},
	Booktitle = {Uncertainty in Artificial Intelligence (UAI)},
	Title = {Best-First AND/OR Search for Most Probable Explanations},
	Year = {2007}}

@inproceedings{marinescu07b,
	Author = {R. Marinescu and R. Dechter},
	Booktitle = {AAAI Conference on Artificial Intelligence (AAAI)},
	Pages = {1171--1176},
	Title = {Best-first AND/OR Search for Graphical Models},
	Year = {2007}}

@inproceedings{marinescu07d,
	Author = {R. Mateescu, R. Marinescu and R. Dechter},
	Booktitle = {International Conference on Principles and Practice of Constraint Programming (CP)},
	Title = {AND/OR Multi-Valued Decision Diagrams for Constraint Optimization},
	Year = {2007}}

@inproceedings{schiex-bio05a,
	Author = {S. de Givry and I. Palhiere and Z. Vitezica and T. Schiex},
	Booktitle = {ICLP Workshop on Constraint Based Methods for Bioinformatics},
	Title = {Mendelian error detection in complex pedigree using weighted constraint satisfaction techniques},
	Year = {2005}}

@inproceedings{schiex-bio05b,
	Author = {P. Th\E9bault and S. de Givry and T. Schiex and C. Gaspin},
	Booktitle = {Fifth IJCAI-05 Workshop on Modelling and Solving Problems with Constraints},
	Title = {Combining constraint processing and pattern matching to describe and locate structured motifs in genomic sequences},
	Year = {2005}}

@article{kjaerulff90,
	Author = {U. Kj$\ae$aerulff},
	Journal = {Technical Report, University of Aalborg, Denmark},
	Title = {Triangulation of graph-based algorithms giving small total space.},
	Year = {1990}}

@article{spigelhalter88,
	Author = {S.L. Lauritzen and D.J. Spiegelhalter},
	Journal = {Journal of the Royal Statistical Society},
	Title = {Local computation with probabilities on graphical structures and their application to expert systems.},
	Year = {1988}}

@inproceedings{wah97,
	Author = {B. Wah and Y. Shang},
	Booktitle = {International Joint Conference on Artificial Intelligence (IJCAI)},
	Pages = {378--383},
	Title = {Discrete Lagrangian-based search for solving MAX-SAT problems},
	Year = {1997}}

@article{mills00,
	Author = {P. Mills and E. Tsang},
	Journal = {Journal of Automated Reasoning (JAR)},
	Title = {Guided local search for solving SAT and weighted MAX-SAT problems},
	Year = {2000}}

@inproceedings{park02,
	Author = {James Park},
	Booktitle = {National Conference on Artificial Intelligence (AAAI)},
	Title = {Using Weighted MAX-SAT Engines to Solve MPE},
	Year = {2002}}

@inproceedings{kask99,
	Author = {K. Kask and R. Dechter},
	Booktitle = {Workshop on AI and Statistics},
	Pages = {113-122},
	Title = {Stochastic Local Search for Bayesian Networks},
	Year = {1999}}

@article{dechter03,
	Author = {R. Dechter and I. Rish},
	Journal = {Journal of ACM},
	Number = {2},
	Pages = {107-153},
	Title = {Mini-buckets: A general scheme of approximating inference},
	Volume = {50},
	Year = 2003}

@book{clarke99,
	Author = {E. M. Clarke, O. Grumberg and D. Peled},
	Publisher = {MIT Press},
	Title = {Model Checking.},
	Year = {1999}}

@article{gorev94,
	Author = {J. Gergov and C. Meinel},
	Journal = {IEEE Trans. Computers},
	Pages = {1197-1209},
	Title = {Efficient boolean manipulation with OBDDs can be extended to FBDDs},
	Volume = {43},
	Year = {1994}}

@article{sieling94,
	Author = {D. Sieling and I. Wegner},
	Journal = {Theoretical Computer Science},
	Pages = {283-310},
	Title = {Graph driven \uppercase{BDD}s - a new data structure for boolean functions},
	Volume = {141},
	Year = {1994}}

@article{bryant86,
	Author = {R. E. Bryant},
	Journal = {IEEE Transaction on Computers},
	Pages = {677-691},
	Title = {Graph-based algorithms for boolean function manipulation},
	Volume = {35},
	Year = {1986}}

@article{bryant91,
	Author = {R. E. Bryant},
	Journal = {IEEE Transaction on Computers},
	Pages = {205-213},
	Title = {On the complexity of VLSI implementation and graph representations of boolean functions with application to integer multiplication},
	Volume = {40},
	Year = {1991}}

@article{bryant95,
	Author = {R. E. Bryant},
	Journal = {Proceedings of International Conference on Computer-Aided Design},
	Pages = {236-243},
	Title = {Binary decision diagrams and beyond: enabling technologies for formal verification},
	Year = {1995}}

@article{darwiche02,
	Author = {A. Darwiche and P. Marquis},
	Journal = {Journal of Artificial Intelligence Research (JAIR)},
	Pages = {229-264},
	Title = {A knowledge compilation map},
	Volume = {17},
	Year = {2002}}

@article{drechsler00,
	Author = {A. Zuzek and R. Drechsler and M. Thornton},
	Journal = {Integration, The VLSI journal},
	Pages = {101-116},
	Title = {Boolean Function Representation and Spectral Characterization using AND/OR graphs},
	Volume = {29},
	Year = {2000}}

@inproceedings{zero-supp93,
	Author = {{Shin-ichi} Minato},
	Booktitle = {30th ACM/IEEE Design Automation Conference (DAC\9293)},
	Pages = {272-277},
	Publisher = {ACM Press, 1993},
	Title = {Zero-suppressed BDDs for set manipulation in combinatorial problems}}

@inproceedings{huang-ijcai05,
	Author = {Jinbo Huang and Adnan Darwiche},
	Booktitle = {Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence (IJCAI'05)},
	Location = {Edinburgh, Scotland},
	Pages = {156-162},
	Title = {DPLL with a Trace: From SAT to Knowledge Compilation},
	Year = {2005}}

@book{clarke-book,
	Author = {E.M. Clarke and O. Grumberg and D. Peled},
	Publisher = {MIT Press},
	Title = {Model Checking},
	Year = {1999}}

@inproceedings{brayton82,
	Author = {R.K. Brayton and C. McMullen},
	Booktitle = {ISCAS, Proceedings of the International Symposium on Circuits and Systems},
	Pages = {49-54},
	Title = {The Decomposition and Factorization of Boolean Expressions},
	Year = {1982}}

@inproceedings{bertacco97,
	Author = {V. Bertacco and M. Damiani},
	Booktitle = {ICCAD, International Conference on Computer-Aided Design},
	Pages = {78-82},
	Title = {The disjunctive decomposition of logic functions},
	Year = {1997}}

@inproceedings{bertacco05a,
	Author = {S. Plaza and V. Bertacco},
	Booktitle = {ASPDAC-05, Asia-South Pacific Design Automation Conference},
	Title = {STACCATO: Disjoint Support Decompositions from BDDs through Symbolic Kernels},
	Year = {2005}}

@inproceedings{bertacco05b,
	Author = {S. Plaza and V. Bertacco},
	Booktitle = {International Workshop on Logic Synthesis, Lake Arrowhead},
	Title = {Boolean Operations on Decomposed Functions},
	Year = {2005}}

@article{fargier04,
	Author = {H. Fargier and M. Vilarem},
	Journal = {Constraints},
	Number = {4},
	Pages = {263-287},
	Title = {Compiling CSPs into Tree-Driven Automata for Interactive Solving},
	Volume = {9},
	Year = {2004}}

@inproceedings{cobb06,
	Author = {J. Cobb},
	Booktitle = {Report, Radcliffe fellowship, Cambridge, MA},
	Title = {Joining And/Or Networks},
	Year = {2006}}

@article{lee59,
	Author = {C.Y. Lee},
	Journal = {Bell System Technical Journal},
	Pages = {985-999},
	Title = {Representation of Switching Circuits by Binary-Decision Programs},
	Volume = {38},
	Year = {1959}}

@article{akers78,
	Author = {S.B. Akers},
	Journal = {\uppercase{IEEE} Transactions on Computers},
	Number = {6},
	Pages = {509-516},
	Title = {Binary Decision Diagrams},
	Volume = {C-27},
	Year = {1978}}

@inproceedings{chavira07,
	Author = {M. Chavira and A. Darwiche},
	Booktitle = {Proceedings of the Twentieth International Joint Conference on Artificial Intelligence},
	Pages = {2443-2449},
	Title = {Compiling Bayesian Networks Using Variable Elimination},
	Year = {2007}}

@inproceedings{vasquez01,
	Author = {M. Vasquez and J. Hao},
	Booktitle = {In International Joint Conference on Artificial Intelligence (IJCAI 2001)},
	Pages = {328--333},
	Title = {A hybrid approach for the 0/1 multidimensional knapsack approach.},
	Year = {2001}}

@article{gavish82,
	Author = {B. Gavish and H. Pirkul},
	Journal = {Management of Distributed Data Processing},
	Pages = {215--231},
	Title = {Allocation of data bases and processors in a distributed computing system.},
	Volume = {31},
	Year = {1982}}

@article{shih79,
	Author = {W. Shih},
	Journal = {Journal of the Operational Research Society},
	Pages = {369--378},
	Title = {A branch-and-bound method for the multiconstraint 0/1 knapsack problem.},
	Volume = {30},
	Year = {1979}}

@inproceedings{xing04,
	Author = {Z. Xing and W. Zhang},
	Booktitle = {Principles and Practice of Constraint Programming (CP-2004)},
	Pages = {660--705},
	Title = {Efficient Strategies for (Weighted) Maximum Satisfiability.},
	Year = {2004}}

@inproceedings{faloul02,
	Author = {F. Aloul and A. Ramani and I. Markov and K. Sakallah},
	Booktitle = {Symposium on the Theory and Applications of Satisfiability Testing (SAT'02)},
	Title = {PBS: A Backtrack Search Pseudo-Boolean Solver},
	Year = {2002}}

@book{walser99,
	Author = {J.P. Walser},
	Publisher = {Springer},
	Title = {Integer Optimization Local Search},
	Year = {1999}}

@inproceedings{dixon02,
	Author = {H. Dixon and M.L. Ginsberg},
	Booktitle = {National Conference on Artificial Intelligence (AAAI-2002)},
	Pages = {635--640},
	Title = {Inference methods for a pseudo-boolean satisfiability solver},
	Year = {2006}}

@book{wosley98,
	Author = {Laurence Wosley},
	Publisher = {John Wiley \& Sons},
	Title = {Integer Programming},
	Year = {1998}}

@inproceedings{applegate95,
	Author = {D. Applegate, R. Bixby, V. Chvatal and W. Cook},
	Booktitle = {Technical Report 95-05, DIMACS, Rutgers University},
	Title = {Finding cuts in the TSP (A preliminary report)},
	Year = {1995}}

@article{haralick80,
	Author = {R. Haralick and G. Elliot},
	Journal = {Artificial Intelligence},
	Number = {3},
	Pages = {263--313},
	Title = {Increasing tree search efficiency for constraint satisfaction problems},
	Volume = {14},
	Year = {1980}}

@inproceedings{bessiere96,
	Author = {C. Bessiere and J-C. Regin},
	Booktitle = {Principles and Practice of Constraint Programming (CP-1996)},
	Pages = {61--75},
	Title = {MAC and combined heuristics: two reasons to forsake FC (and CBJ) on hard problems},
	Year = {1996}}

@article{brelaz79,
	Author = {D. Brelaz},
	Journal = {Communications of the ACM},
	Number = {22},
	Pages = {251--256},
	Title = {New method to color the vertices of a graph},
	Volume = {4},
	Year = {1979}}

@inproceedings{boussemart04,
	Author = {F. Boussemart, F. Hemery, C. Lecoutre and L. Sais},
	Booktitle = {European Conference on Artificial Intelligence (ECAI-2004)},
	Pages = {146--150},
	Title = {Boosting systematic search by weighting constraints},
	Year = {2004}}

@inproceedings{lecoutre04,
	Author = {C. Lecoutre, F. Boussemart and F. Hemery},
	Booktitle = {Proceedings of ICTAI-2004},
	Pages = {549--557},
	Title = {Backjump-based techniques versus conflict directed heuristics},
	Year = {2004}}

@inproceedings{sang07,
	Author = {T. Sang, P. Beame and H. Kautz},
	Booktitle = {Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI-2007)},
	Pages = {549--557},
	Title = {A Dynamic Approach to MPE and Weighted MAX-SAT},
	Year = {2007}}

@inproceedings{montanari73,
	Author = {A. Martelli and U. Montanari},
	Booktitle = {Proceedings of International Joint Conference on Artificial Intelligence (IJCAI)},
	Pages = {1--11},
	Title = {Additive AND/OR graphs},
	Year = {1973}}

@inproceedings{bayardo00,
	Author = {R. Bayardo and J. D. Pehoushek},
	Booktitle = {National Conference of Artificial Intelligence (AAAI-2000)},
	Pages = {157-162},
	Title = {Counting Models Using Connected Components},
	Year = {2000}}

@inproceedings{marinescu03,
	Author = {R. Marinescu and K. Kask and R. Dechter},
	Booktitle = {Uncertainty in Artificial Intelligence (UAI-2003)},
	Pages = {394--402},
	Title = {Systematic vs non-systematic algorithms for solving the mpe task.},
	Year = {2003}}

@article{mceliece98,
	Author = {R.J. McEliece and D.J.C. MacKay and J.F. Cheng},
	Journal = {In IEEE Journal of Selected Areas in Communication},
	Number = {2},
	Pages = {140--152},
	Title = {Turbo decoding as an instance of pearl\92s belief propagation algorithm},
	Volume = {16},
	Year = {1998}}

@article{kschischang98,
	Author = {F. R. Kschischang and B. H. Frey},
	Journal = {In IEEE Journal of Selected Areas in Communication},
	Number = {2},
	Pages = {219--230},
	Title = {Iterative decoding of compound codes by probability propagation in graphical models},
	Volume = {16},
	Year = {1998}}

@article{mackay96,
	Author = {D.J.C. MacKay and R.M. Neal},
	Journal = {In Electronic Letters},
	Number = {1},
	Pages = {457--458},
	Title = {Near shannon limit performance of low density parity check codes},
	Volume = {33},
	Year = {1996}}

@inproceedings{sang05,
	Author = {T. Sang and P. Beame and H. Kautz},
	Booktitle = {National Conference of Artificial Intelligence (AAAI)},
	Pages = {475--482},
	Title = {Solving {B}ayesian Networks by Weighted Model Counting},
	Year = {2005}}

@book{ott99,
	Author = {Jurg Ott},
	Publisher = {The Johns Hopkins University Press},
	Title = {Analysis of Human Genetic Linkage},
	Year = {1999}}

@article{fishelson05,
	Author = {M. Fishelson and N. Dovgolevsky and D. Geiger},
	Journal = {Human Heredity},
	Title = {Maximum likelihood haplotyping for general pedigrees.},
	Year = {2005}}

@inproceedings{dechter01b,
	Author = {R. Dechter and D. Larkin},
	Booktitle = {Uncertainty in Artificial Intelligence (UAI)},
	Pages = {112--119},
	Title = {Hybrid processing of beliefs and constraints},
	Year = {2001}}

@article{rish00,
	Author = {I. Rish and R. Dechter},
	Journal = {Journal of Automated Reasoning},
	Number = {1-2},
	Pages = {225--275},
	Title = {Resolution vs. Search: two strategies for sat},
	Volume = {24},
	Year = {2000}}

@article{chavira06,
	Author = {M. Chavira and A. Darwiche and M. Jaeger},
	Journal = {International Journal of Approximate Reasoning},
	Number = {1--2},
	Pages = {4--20},
	Title = {Compiling Relational Bayesian Networks for Exact Inference},
	Volume = {42},
	Year = {2006}}

@inproceedings{smith94,
	Author = {B. Smith},
	Booktitle = {In European Conference on Artificial Intelligence (ECAI)},
	Pages = {100--104},
	Title = {Phase transition and the mushy region in constraint satisfaction},
	Year = {1994}}

@inproceedings{degivry06,
	Author = {S. de Givry and T. Schiex and G. Verfaillie},
	Booktitle = {National Conference on Artificial Intelligence (AAAI-2006)},
	Title = {Exploiting Tree Decomposition and Soft Local Consistency in Weighted CSP},
	Year = {2006}}

@inproceedings{hutter05,
	Author = {F. Hutter and H. Hoos and T. Stutzle},
	Booktitle = {International Joint Conference on Artificial Intelligence (IJCAI)},
	Pages = {169--174},
	Title = {Efficient Stochastic Local Search for MPE solving},
	Year = {2005}}

@inproceedings{wallace96,
	Author = {R. Wallace},
	Booktitle = {In Principles and Practice of Constraint Programming (CP)},
	Pages = {482--496},
	Title = {Analysis of heuristic methods for partial constraint satisfaction problems},
	Year = {1996}}

@article{shenoy86,
	Author = {P. Shenoy and G. Shafer},
	Journal = {In IEEE Expert},
	Number = {4},
	Pages = {43--52},
	Title = {Propagating belief functions with local computations},
	Volume = {1},
	Year = {1986}}

@article{peng89,
	Author = {Y. Peng and J.A. Reggia},
	Journal = {IEEE Transactions on Systems, Man and Cybernetics},
	Title = {A connectionist model for diagnostic problem solving},
	Year = {1989}}

@inproceedings{shimony91,
	Author = {S.E. Shimony and E. Charniak},
	Booktitle = {Uncertainty in Artificial Intelligence (UAI-1991)},
	Pages = {185--193},
	Title = {A new algorithm for finding map assignments to belief networks},
	Year = {1991}}

@inproceedings{santos91,
	Author = {E. Santos},
	Booktitle = {Uncertainty in Artificial Intelligence (UAI)},
	Pages = {339--347},
	Title = {On the generation of alternative explanations with implications for belief revision},
	Year = {1991}}

@inproceedings{li93,
	Author = {Z. Li and B. D\92Ambrosio},
	Booktitle = {Uncertainty in Artificial Intelligence (UAI-1993)},
	Pages = {342--349},
	Title = {An efficient approach for finding the mpe in belief networks},
	Year = {1993}}

@inproceedings{sy92,
	Author = {B. K. Sy},
	Booktitle = {National Conference of Artificial Intelligence (AAAI-1992)},
	Pages = {570--576},
	Title = {Reasoning mpe to multiply connected belief networks using message-passing},
	Year = {1992}}

@inproceedings{rollon05,
	Author = {E. Rollon and J. Larrosa},
	Booktitle = {Principles and Practice of Constraint Programming (CP)},
	Pages = {563-577},
	Title = {Depth-First Mini-Bucket Elimination},
	Year = {2005}}

@book{Schaeffer:Book2009,
	Author = {J. Schaeffer},
	Publisher = {Springer},
	Title = {One Jump Ahead: Computer Perfection at Checkers},
	Year = 2009}

@phdthesis{Lowe:2012,
	Author = {Daniel M. Lowe},
	School = {University of Cambridge},
	Title = {Extraction of Chemical Structures and Reactions from the Literature},
	Year = 2012}

@inproceedings{Duvenaud2015,
	Author = {D. K. Duvenaud and D. Maclaurin and J. Aguilera-Iparraguirre and R. G{\'o}mez-Bombarell and T. Hirzel and A. Aspuru-Guzik and R. P. Adams},
	Booktitle = {NIPS},
	Pages = {2224--2232},
	Title = {Convolutional Networks on Graphs for Learning Molecular Fingerprints},
	Year = 2015}

@inproceedings{Heifets:2012,
	Author = {Heifets, A. and Jurisica, I.},
	Booktitle = {AAAI},
	Pages = {1564--1570},
	Title = {Construction of New Medicines via Game Proof Search},
	Year = 2012}

@inproceedings{Jin:NIPS2017,
	Author = {Wengong Jin and Connor W. Coley and Regina Barzilay and Tommi Jaakkola},
	Booktitle = {NIPS},
	Note = {To appear. The preprint version is available at \url{https://arxiv.org/abs/1709.04555}},
	Title = {Predicting Organic Reaction Outcomes with {Weisfeiler}-{Lehman} Network},
	Year = 2017}

@inproceedings{Savage:RecSys2017,
	Author = {John Savage and Akihiro Kishimoto and Beat Buesser and Ernesto Diaz-Aviles and Carlos Alzate},
	Booktitle = {Proceedings of the 11th ACM Conference on Recommender Systems (RecSys)},
	Pages = {210--214},
	Title = {Chemical Reactant Recommendation Using a Network of Organic Chemistry},
	Year = 2017}

@techreport{Fleming:2007,
	Author = {G. Fleming and M. Ratner},
	Institution = {US Department of Energy, Office of Basic Energy Sciences},
	Note = {Available at \url{http://www.sc.doe.gov/bes/reports/abstracts.html#GC}},
	Title = {Directing Matter and Energy: Five Challenges for Science and the Imagination},
	Year = 2007}

@article{Allis:94,
	Author = {L. V. Allis and M. van der Meulen and H. J. van den Herik},
	Journal = {Artificial Intelligence},
	Number = 1,
	Pages = {91--124},
	Title = {Proof-Number Search},
	Volume = 66,
	Year = 1994}

@article{Campbell:2002,
	Author = {M. Campbell and A. Joseph Hoane Jr. and F.{-h.} Hsu},
	Journal = {Artificial Intelligence},
	Number = {1--2},
	Pages = {57-83},
	Title = {{Deep Blue}},
	Volume = 134,
	Year = 2002}

@inproceedings{Kitano:1997,
	Author = {Hiroaki Kitano and Minoru Asada and Yasuo Kuniyoshi and Itsuki Noda and Eiichi Osawa},
	Booktitle = {Proceedings of the 1st International Conference on Autonomous Agents},
	Pages = {340--347},
	Title = {{RoboCup}: The Robot World Cup Initiative},
	Year = 1997}

@article{Ferrucci:2010,
	Author = {David Ferrucci and Eric Brown and Jennifer Chu-Carroll and James Fan and David Gondek and Aditya A. Kalyanpur and Adam Lally and J. William Murdock and Eric Nyberg and John Prager and Nico Schlaefer and Chris Welty},
	Journal = {AI Magazine},
	Number = 3,
	Pages = {59--79},
	Title = {Building Watson: An Overview of the {DeepQA} Project},
	Volume = 31,
	Year = 2010}

@article{Dickson:2004,
	Author = {Michael Dickson and Jean Paul Gagnon},
	Journal = {Discovery Medicine},
	Number = 22,
	Pages = {172--179},
	Title = {The Cost of New Drug Discovery and Development},
	Volume = 4,
	Year = 2004}

@article{Scannell:2012,
	Author = {Jack W. Scannell and Alex Blanckley and Helen Boldon and Brian Warrington},
	Journal = {Nature Reviews Drug Discovery},
	Pages = {191--200},
	Title = {Diagnosing the decline in pharmaceutical R\&D efficiency},
	Year = 2012}

@article{Szymkuc:2015,
	Author = {Sara Szymku{\'c} and Ewa P. Gajewska and Tomasz Klucznik and Karol Molga and Piotr Dittwald and Michal Startek and Michal Bajczyk and Bartosz A. Grzybowski},
	Journal = {Angewandte Chemie International Edition},
	Number = 20,
	Pages = {5904--5937},
	Title = {Computer-Assisted Synthetic Planning: The End of the Beginning},
	Volume = 55,
	Year = 2016}

@book{Corey:1995,
	Author = {Corey, E. J. and Cheng, X.-M},
	Publisher = {Wiley},
	Title = {The Logic of Chemical Synthesis},
	Year = 1995}

@article{Law:2009,
	Author = {Law, James and Zsoldos, Zsolt and Simon, Aniko and Reid, Darryl and Liu, Yang and Khew, Sing Yoong and Johnson, A. Peter and Major, Sarah and Wade, Robert A. and Ando, Howard Y.},
	Journal = {Journal of Chemical Information and Modeling},
	Number = {3},
	Pages = {593--602},
	Title = {{Route Designer}: A Retrosynthetic Analysis Tool Utilizing Automated Retrosynthetic Rule Generation},
	Volume = {49},
	Year = {2009}}

@article{Kishimoto:ICGA2012,
	Author = {A. Kishimoto and M. Winands and M. M{\"u}ller and J.-T. Saito},
	Journal = {ICGA Journal, Vol. 35, No. 3},
	Number = 3,
	Pages = {131-156},
	Title = {Game-Tree Search using Proof Numbers: The First Twenty Years},
	Volume = 35,
	Year = 2012}

@article{Segler:2017a,
	Author = {Marwin H. S. Segler and Mark P. Waller},
	Journal = {Chemistry -- A European Journal},
	Number = 3765,
	Title = {Modelling Chemical Reasoning to Predict and Invent Reactions},
	Volume = 1521,
	Year = 2017}

@article{Segler:2017b,
	Author = {Segler, Marwin H. S. and Waller, Mark P.},
	Journal = {Chemistry -- A European Journal},
	Number = 3765,
	Title = {Neural-Symbolic Machine Learning for Retrosynthesis and Reaction Prediction},
	Volume = 1521,
	Year = 2017}

@misc{Segler:2017c,
	Author = {Marwin Segler and Mike Preu{\ss} and Mark P. Waller},
	Note = {Available at \url{https://arxiv.org/abs/1702.00020}},
	Title = {Towards ``{AlphaChem}'': Chemical Synthesis Planning with Tree Search and Deep Neural Network Policies},
	Year = 2017}

@misc{Segler:2017d,
	Author = {Marwin Segler and Mike Preu{\ss} and Mark P. Waller},
	Note = {Available at \url{https://arxiv.org/abs/1708.04202}},
	Title = {Learning to Plan Chemical Syntheses},
	Year = 2017}

@article{Segler:Nature2018,
	Author = {M. H. S. Segler and M. Preuss and M. P. Waller},
	Journal = {Nature},
	Pages = {604--610},
	Title = {Planning Chemical Syntheses with Deep Neural Networks and Symbolic {AI}},
	Volume = 555,
	Year = 2018}

@inproceedings{Kocsis:ECML2006,
	Author = {Levente Kocsis and Csaba Szepesv{\'a}ri},
	Booktitle = {Proceedings of the 17th European Conference on Machine Learning (ECML)},
	Optbibsource = {DBLP, http://dblp.uni-trier.de},
	Optcrossref = {DBLP:conf/ecml/2006},
	Optee = {http://dx.doi.org/10.1007/11871842_29},
	Pages = {282--293},
	Publisher = {Springer},
	Series = {Lecture Notes in Computer Science},
	Title = {Bandit Based {Monte-Carlo} Planning},
	Volume = {4212},
	Year = {2006}}

@article{Corey:1969,
	Author = {Corey, E. J. and Wipke, W. T.},
	Journal = {Science},
	Pages = {178--192},
	Title = {Computer-Assisted Design of Complex Organic Syntheses},
	Volume = 166,
	Year = 1969}

@article{Corey:1967,
	Author = {Corey, E. J.},
	Journal = {Pure and Applied Chemistry},
	Pages = {19--38},
	Title = {General methods for the construction of complex molecules},
	Volume = 14,
	Year = 1967}

@article{Coley:2017,
	Author = {Connor W. Coley and Regina Barzilay and Tommi S. Jaakkola and William H. Green and Klavs F. Jensen},
	Journal = {ACS Central Science},
	Pages = {434--443},
	Title = {Prediction of Organic Reaction Outcomes Using Machine Learning},
	Volume = 3,
	Year = 2017}

@phdthesis{Allis:PhD94,
	Author = {L. V. Allis},
	School = {University of Limburg},
	Title = {Searching for Solutions in Games and Artificial Intelligence},
	Year = 1994}

@article{Junghanns:AIJ2001,
	Author = {Andreas Junghanns and Jonathan Schaeffer},
	Journal = {Artificial Intelligence},
	Pages = {219--251},
	Title = {Sokoban: Enhancing general single-agent search methods using domain knowledge},
	Volume = 129,
	Year = 2001}

@article{Schlosser:ICGA1988,
	Author = {Michael Schlosser},
	Journal = {ICCA Journal, Vol. 11, No. 4},
	Number = 4,
	Pages = {151--155},
	Title = {Computers and Chess-Problem Composition},
	Volume = 11,
	Year = 1988}

@inproceedings{Hirose:ACC1997,
	Author = {M. Hirose and Hitoshi Matsubara and T. Itoh},
	Booktitle = {Advances in Computer Chess},
	Pages = {299--318},
	Title = {The Composition of Tsume-Shogi Problems},
	Volume = 8,
	Year = 1997}

@article{Bombarelli:2016,
	Journal = {Nature Materials},
	Pages = {1120--1127},
	Title = {Design of efficient molecular organic light-emitting diodes by a high-throughput virtual screening and experimental approach},
	Volume = 15,
	Year = 2016}

@article{Kowalik2012,
	Author = {Kowalik, Mikolaj and Gothard, Chris M. and Drews, Aaron M. and Gothard, Nosheen A. and Weckiewicz, Alex and Fuller, Patrick E. and Grzybowski, Bartosz A. and Bishop, Kyle J. M.},
	Journal = {Angewandte Chemie (International ed. in English)},
	Number = {32},
	Pages = {7928--32},
	Pmid = {22807100},
	Title = {Parallel optimization of synthetic pathways within the network of organic chemistry},
	Url = {http://www.ncbi.nlm.nih.gov/pubmed/22807100},
	Volume = {51},
	Year = {2012},
	Bdsk-Url-1 = {http://www.ncbi.nlm.nih.gov/pubmed/22807100}}

@article{Heifets:NAR2012,
	Author = {Abraham Heifets and Igor Jurisica},
	Journal = {Nucleic Acids Research},
	Number = {D1},
	Pages = {D428--D433},
	Title = {SCRIPDB: a portal for easy access to syntheses, chemicals and reactions in patents},
	Volume = 40,
	Year = 2012}

@article{Rogers:2010,
	Author = {D. Rogers and M. Hahn},
	Journal = {Journal of Chemical Information and Modeling},
	Number = 5,
	Pages = {742--754},
	Title = {Extended-connectivity fingerprints},
	Volume = 50,
	Year = 2010}

@article{Morgan:1965,
	Author = {H. L. Morgan},
	Journal = {Journal of Chemical Documentation},
	Number = 2,
	Pages = {107--113},
	Title = {The generation of a unique machine description for chemical structure},
	Volume = 5,
	Year = 1965}

@book{Lindsay:1980,
	Author = {R. K. Lindsay and B. G. Buchanan and E. A. Feigenbaum and J. Lederberg},
	Publisher = {McGraw-Hill},
	Title = {Application of Artificial Intelligence for Organic Chemistry: The Dendral Project},
	Year = 1980}

@article{Friedland:2004,
	Author = {N. S. Friedland and P. G. Allen and G. Matthews and M. Witbrock and D. Baxter and J. Curtis and B. Shepard and P. Miraglia and Jurgen Angele and S. Staab and E. Moench and H. Oppermann and D. Wenke and D. Israel and V. Chaudhri and B. Porter and K. Barker and J. Fan and S. Y. Chaw and P. Yeh and D Tecuci and Peter Clark},
	Journal = {AI Magazine},
	Number = 4,
	Pages = {29--47},
	Title = {Project Halo: Towards a Digital Aristotle},
	Volume = 25,
	Year = 2004}

@article{Dragone:2017,
	Author = {V. Dragone and V.r Sans and A. B. Henson and J. M. Granda and L. Cronin},
	Journal = {Nature Communications},
	Pages = {1--8},
	Title = {An autonomous organic reaction search engine for chemical reactivity},
	Volume = {8},
	Year = {2017}}

@article{Peplow:2014,
	Author = {M. Peplow},
	Journal = {Nature},
	Pages = {20--22},
	Title = {Organic synthesis: The robo-chemist},
	Volume = 512,
	Year = 2014}

@phdthesis{Nagai:2002,
	Author = {A. Nagai},
	School = {The University of Tokyo},
	Title = {Df-pn Algorithm for Searching {AND/OR} Trees and Its Applications},
	Year = 2002}

@inproceedings{Kishimoto:AAAI2005,
	Author = {A. Kishimoto and M. M{\"u}ller},
	Booktitle = {AAAI},
	Pages = {1374-1379},
	Title = {Search versus knowledge for solving life and death problems in {Go}},
	Year = 2005}

@mastersthesis{Nagai:1999,
	Address = {Tokyo, Japan},
	Author = {A. Nagai},
	School = {The University of Tokyo},
	Title = {A New Depth-First-Search Algorithm for {AND}/{OR} Trees},
	Year = 1999}

@article{Korf:AIJ1993,
	Author = {R. E. Korf},
	Journal = {Artificial Intelligence},
	Number = 1,
	Pages = {41-78},
	Title = {Linear-Space Best-First Search},
	Volume = 62,
	Year = 1993}

@article{Schaeffer:Science2007,
	Author = {J. Schaeffer and N. Burch and Y. Bj{\"o}rnsson and A. Kishimoto and M. M{\"u}ller and R. Lake and P. Lu and S. Sutphen},
	Journal = {Science},
	Number = 5844,
	Pages = {1518--1522},
	Title = {Checkers is Solved},
	Volume = 317,
	Year = 2007}

@inproceedings{Arneson:CG2010,
	Author = {B. Arneson and R. B. Hayward and P. Henderson},
	Booktitle = {Computers and Games 2010},
	Pages = {1-10},
	Publisher = {Springer, Berlin, Germany},
	Series = {Lecture Notes in Computer Science},
	Title = {Solving {Hex}: Beyond Humans},
	Volume = 6515,
	Year = 2011}

@inproceedings{Kishimoto:AAAI2004,
	Author = {A. Kishimoto and M. M{\"u}ller},
	Booktitle = {AAAI},
	Pages = {644-649},
	Title = {A General Solution to the Graph History Interaction Problem},
	Year = 2004}

@inproceedings{Kishimoto:ACG2003,
	Author = {A. Kishimoto and M. M{\"u}ller},
	Booktitle = {Advances in Computer Games 10: Many Games, Many Challenges},
	Pages = {125--141},
	Publisher = {Kluwer Academic Publishers},
	Title = {Df-pn in {Go}: An Application to the One-Eye Problem},
	Year = {2003}}

@inproceedings{Kishimoto:AAAI2010,
	Author = {A. Kishimoto},
	Booktitle = {AAAI},
	Pages = {108--113},
	Title = {Dealing with Infinite Loops, Underestimation, and Overestimation of Depth-First Proof-Number Search},
	Year = {2010}}

@inproceedings{Yoshizoe:IJCAI2007,
	Author = {K. Yoshizoe and A. Kishimoto and M. M{\"u}ller},
	Booktitle = {Proceedings of the 20th International Joint Conference on Artificial Intelligence (IJCAI-07)},
	Editor = {M.~M. Veloso},
	Pages = {2404-2409},
	Title = {Lambda Depth-First Proof Number Search and Its Application to {Go}},
	Year = 2007}

@inproceedings{Cao:IJCAI2017,
	Author = {Chao Gao and Martin M{\"u}ller and Ryan Hayward},
	Booktitle = {IJCAI},
	Pages = {3668-3674},
	Title = {Focused Depth-first Proof

license: MIT

license_type: permissive

branch_name: refs/heads/master

extension: bib