A variant of Reiter's hitting-set algorithm

被引：69

作者：

Wotawa, F ^{[1
]}

机构：

[1] Tech Univ Vienna, Inst Informat, Database & Artificial Intelligence Grp, A-1040 Vienna, Austria

来源：

INFORMATION PROCESSING LETTERS | 2001年 / 79卷 / 01期

基金：

奥地利科学基金会;

关键词：

algorithms; hitting-set algorithm; model-based diagnosis;

D O I：

10.1016/S0020-0190(00)00166-6

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

In this paper we introduce a variant of Reiter's hitting-set algorithm. This variant produces a hitting-set tree instead of an acyclic directed graph. As an advantage some subset checks necessary for reducing the graph during search can be avoided. (C) 2001 Elsevier Science B.V. All rights reserved.

引用

页码：45 / 51

页数：7

共 14 条

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

DEKLEER, J .

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

[2] DIAGNOSING MULTIPLE FAULTS [J].

DEKLEER, J ;

WILLIAMS, BC .

ARTIFICIAL INTELLIGENCE, 1987, 32 (01) :97-130

[3]

DEKLEER J, 1991, PROCEEDINGS : NINTH NATIONAL CONFERENCE ON ARTIFICIAL INTELLIGENCE, VOLS 1 AND 2, P842

[4]

DEKLEER J, 1990, P 1 INT WORKSH PRINC

[5]

DRESSLER O, 1990, P WORKSH MOD BAS REA, P106

[6]

ELFATTAH Y, 1995, P 14 INT JOINT C ART, P1742

[7]

FORBUS KD, 1988, P AAAI 88 ST PAUL, P193

[8]

FROHLICH P, 1997, P 15 INT JOINT C ART

[9] A CORRECTION TO THE ALGORITHM IN REITERS THEORY OF DIAGNOSIS [J].

GREINER, R ;

SMITH, BA ;

WILKERSON, RW .

ARTIFICIAL INTELLIGENCE, 1989, 41 (01) :79-88

[10] LTUR - A SIMPLIFIED LINEAR-TIME UNIT RESOLUTION ALGORITHM FOR HORN FORMULAS AND COMPUTER IMPLEMENTATION [J].

MINOUX, M .

INFORMATION PROCESSING LETTERS, 1988, 29 (01) :1-12

← 1 2 →