Tree clustering for constraint networks
Tài liệu tham khảo
Arnborg, 1987, Complexity of finding embeddings in a k-tree, SIAM J. Algebraic Discrete Methods, 8, 277, 10.1137/0608024
Arnborg, 1988, Problems easy for tree-decomposable graphs
Beeri, 1983, On the desirability of acyclic database schemes, J. ACM, 30, 479, 10.1145/2402.322389
Bertelé, 1972
Borning, 1981, The programming language aspects of Thinglab, a constraint-oriented simulation laboratory, ACM Trans. Program. Lang. Syst., 3, 353, 10.1145/357146.357147
Dechter, 1987, Removing redundancies in constraint networks, 105
Dechter, 1988, Network-based heuristics for constraint-satisfaction problems, Artificial Intelligence, 34, 1, 10.1016/0004-3702(87)90002-6
Dechter, 1987, The cycle-cutset method for improving search performance in AI applications, 224
Dechter, 1988, Belief maintenance in dynamic constraint networks, 37
Dechter, 1988, Optimization in constraint-networks
de Kleer, 1986, An assumption-based TMS, Artificial Intelligence, 28, 127, 10.1016/0004-3702(86)90080-9
Doyle, 1979, A truth maintenance system, Artificial Intelligence, 12, 231, 10.1016/0004-3702(79)90008-0
Freuder, 1978, Synthesizing constraint expressions, Commun. ACM, 21, 958, 10.1145/359642.359654
Freuder, 1982, A sufficient condition of backtrack-free search, J. ACM, 29, 24, 10.1145/322290.322292
Lauritzen, 1988, Local computations with probabilities on graphical structures and their applications to expert systems, J. R. Stat. Soc. B., 50, 127
Mackworth, 1985, The complexity of some polynomial network consistency algorithms for constraint satisfaction problems, Artificial Intelligence, 25, 65, 10.1016/0004-3702(85)90041-4
Maier, 1983
Malvestuto, 1987, Answering queries in categorical databases, 87
Mohr, 1986, Arc and path consistency revisited, Artificial Intelligence, 28, 225, 10.1016/0004-3702(86)90083-4
Montanari, 1974, Networks of constraints: Fundamental properties and applications to picture processing, Inf. Sci., 7, 95, 10.1016/0020-0255(74)90008-5
Pearl, 1988
Seidel, 1981, A new method for solving constraint-satisfaction problems, 338
Shafer, 1988, Bayesian and belief-function propagation
Sussman, 1980, CONSTRAINTS: A language for expressing almost-hierarchical descriptions, Artificial Intelligence, 14, 1, 10.1016/0004-3702(80)90032-6
Tarjan, 1984, Simple linear-time algorithms to test chordality of graphs, test acyclicity of hypergraphs and selectively reduce acyclic hypergraphs, SIAM J. Comput., 13, 566, 10.1137/0213035