COMMENTS ON MOHR AND HENDERSON PATH CONSISTENCY ALGORITHM

被引：36

作者：

HAN, CC

LEE, CH

机构：

[1] Purdue Univ, West Lafayette, IN, USA, Purdue Univ, West Lafayette, IN, USA

来源：

ARTIFICIAL INTELLIGENCE | 1988年 / 36卷 / 01期

关键词：

The idea of the arc consistency algorithm introduced by Mackworth [2] is based on the notion of support. Mohr and Henderson further made this support evident by using some data structures to record the relevant supporting information. They use a counter for each arc-label pair [(i; j); b] to indicate the number of labels at node j that support (are consistent with) the label b at node i. In addition; for each label c at node j; the member (i; b) of set S/c is the label b at node i that is supported by label c at node ]. They also use a table; M; to keep track of which labels have been deleted from which nodes; and a list; List; to control the propagation of constraints. This idea has also been applied to the path consistency algorithm PC-3 straightforwardly. However; * This work is supported by National Science Foundation under grant IRI-8702053;

D O I：

10.1016/0004-3702(88)90081-1

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

引用

页码：125 / 130

页数：6

共 4 条

[1] CONSISTENCY IN NETWORKS OF RELATIONS [J].