Tractable structures for constraint satisfaction problems

Tractable structures for constraint satisfaction problems (2006)

Cached

Download Links

by Rina Dechter

Venue:	Handbook of Constraint Programming, part I, chapter 7
Citations:	1 - 0 self

BibTeX

@INPROCEEDINGS{Dechter06tractablestructures,
    author = {Rina Dechter},
    title = {Tractable structures for constraint satisfaction problems},
    booktitle = {Handbook of Constraint Programming, part I, chapter 7},
    year = {2006},
    pages = {209--244},
    publisher = {Elsevier}
}

Bookmark

OpenURL

Abstract

Citations

1081	Local Computations with Probabilities on graphical structures and their applications to expert systems (with discussion - Lauritzen, Spiegelhalter
918	Consistency in networks of relations - Mackworth - 1977
837	Temporal constraint networks - Dechter, Meiri, et al. - 1991
432	Constraint Processing - Dechter
390	Partial constraint satisfaction - Freuder, Wallace - 1992
384	Theory of Relational Databases - Maier - 1983
360	Network-based heuristics for constraint satisfaction problems - Dechter, Pearl - 1987
312	Graph Algorithms - Even - 1979
267	Complexity of finding embeddings in a k-tree - Arnborg, Corneil, et al. - 1987
250	Enhancement schemes for constraint processing: Backjumping, learning and cutset decomposition - Dechter - 1990
247	The complexity of some polynomial network consistency algorithms for constraint satisfaction problems - Mackworth, Freuder - 1985
238	A Sufficient condition for backtrack-free search - Freuder
230	Tree clustering for constraint networks - Dechter, Pearl - 1989
229	Bucket elimination: a unifying framework for reasoning - Dechter - 1999
206	Simple linear-time algorithms to test chordality of graphs, test acyclicity of hypergraphs, and selectively reduce acyclic hypergraphs - Tarjan, Yannakakis - 1984
183	Efficient algorithms for combinatorial problems on graphs with bounded decomposability - a survey - Arnborg - 1985
153	Nonserial Dynamic Programming - Bertele, Brioschi - 1972
137	A sufficient condition for backtrack-bounded search - Freuder - 1985
113	Treewidth: algorithmic techniques and results - Bodlaender - 1997
75	And/or search spaces for graphical models - Dechter - 2004
73	A complexity analysis of space-bound learning algorithms for the constraint satisfaction problem - Bayardo, Miranker - 1996
68	Decomposing constraint satisfaction problems using database techniques - Gyssens, Jeavons, et al. - 1994
67	Random algorithms for the loop cutset problem - Becker, Bar-Yehuda, et al. - 1999
62	A sufficiently fast algorithm for finding close to optimal clique trees - Becker, Geiger
46	A practical algorithm for finding optimal triangulations, in: AAAI’97: Proceedings of the 14th national conference on Artificial intelligence - Shoikhet, Geiger - 1997
43	Exact genetic linkage computations for general pedigrees - Fishelson, Geiger - 2002
41	Approximating treewidth, pathwidth and minimum elimination tree-height - Bodlaender, Gilbert - 1991
34	A new method for solving constraint satisfaction problems - Seidel - 1981
22	Maximum likelihood haplotyping for general pedigrees - Fishelson, Dovgolevsky, et al. - 2002
20	Resolution vs. search; two strategies for sat - Rish, Dechter - 2000
18	The impact of and/or search spaces on constraint satisfaction and counting - Dechter, Mateescu - 2004
17	Binary join trees, in - Shenoy - 1996
14	Performance measurement and analysis of search algorithms - Gaschnig - 1979
12	Unifying tree decomposition for reasoning in graphical models - Kask, Dechter, et al.
9	The use of lineal spanning trees to represent constraint satisfaction problems - Freuder, Quinn - 1987
8	Approximation algorithms for graphical models - Kask - 2001
4	Weighted Hypertree Decompositions and Optimal Query Plans - Scarcello, Greco, et al. - 2004
4	Dynamic combination of search and variable-elimination - Larossa, Dechter - 2003
3	Georg Gottlob and Francesco Scarello. A comparison of structural csp decomposition methods - Leone - 1999
2	On the desirability of acyclic database ochemes - Beeri, Fagin, et al. - 1983
2	Non-binary constraints and optimal dual-graph representations - Greco, Scarcello - 2003
1	On finding w-cutset in bayesian networks - Bidyuk, Dechter - 2004
1	Optimizing exact genetic linkage computations. RECOMB - Fishelson, Geiger - 2003
1	Taking adventage of stable sets of variables in constraint staisfaction problems - Freuder, Quinn - 1985
1	Georg Gottlob and Francesco Scarcello. A comparison of structural csp decomposition methods - Leone - 2000
1	Bucket elimination and hypertree decompositions - McMahan - 2004
1	Hypertree decomposition via branch-decomposition - Samer - 2005