TREE CLUSTERING FOR CONSTRAINT NETWORKS

被引：259

作者：

DECHTER, R

PEARL, J

机构：

来源：

ARTIFICIAL INTELLIGENCE | 1989年 / 38卷 / 03期

关键词：

D O I：

10.1016/0004-3702(89)90037-4

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

引用

页码：353 / 366

页数：14

共 25 条

[1] COMPLEXITY OF FINDING EMBEDDINGS IN A K-TREE [J].

ARNBORG, S ;

CORNEIL, DG ;

PROSKUROWSKI, A .

SIAM JOURNAL ON ALGEBRAIC AND DISCRETE METHODS, 1987, 8 (02) :277-284

[2]

ARNBORG S, 1988, 15TH P INT C AUT LAN

[3] ON THE DESIRABILITY OF ACYCLIC DATABASE SCHEMES [J].

BEERI, C ;

FAGIN, R ;

MAIER, D ;

YANNAKAKIS, M .

JOURNAL OF THE ACM, 1983, 30 (03) :479-513

[4]

Bertele Umberto, 1972, NONSERIAL DYNAMIC PR

[5] THE PROGRAMMING LANGUAGE ASPECTS OF THINGLAB, A CONSTRAINT-ORIENTED SIMULATION LABORATORY [J].

BORNING, A .

ACM TRANSACTIONS ON PROGRAMMING LANGUAGES AND SYSTEMS, 1981, 3 (04) :353-387

[6]

Dechter A., 1987, P AAAI 87, P105

[7]

DECHTER R., 1988, ARTIF INTELL, V34, P1, DOI DOI 10.1016/0004-3702(87)90002-6

[8]

DECHTER R, 1988, P BERKELEY C INFLUEN

[9]

DECHTER R, 1988, P 7 NAT C ART INT AA, P37

[10] AN ASSUMPTION-BASED TMS [J].

DEKLEER, J .

ARTIFICIAL INTELLIGENCE, 1986, 28 (02) :127-162

← 1 2 3 →