Test Generation for Model-Based Diagnosis

被引:0
作者
Provan, Gregory [1 ]
机构
[1] Natl Univ Ireland Univ Coll Cork, Dept Comp Sci, Cork, Ireland
来源
ECAI 2008, PROCEEDINGS | 2008年 / 178卷
关键词
COMPLEXITY;
D O I
10.3233/978-1-58603-891-5-199
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
This article formalises the dual problem to model-based diagnosis (MBD), i.e., generating tests to isolate multiple simultaneous faults. Using a standard propositional MBD framework, we first define a test of minimal size that can isolate multiple simultaneous faults of an arbitrary nature. Second, we prove complexity results for multiple-fault tests of minimal size in propositional system models, showing such problems have complexity similar to those of MBD problems, i.e., complexity at the second level of the polynomial hierarchy.
引用
收藏
页码:199 / +
页数:2
相关论文
共 19 条
[1]   THE COMPUTATIONAL-COMPLEXITY OF ABDUCTION [J].
BYLANDER, T ;
ALLEMANG, D ;
TANNER, MC ;
JOSEPHSON, JR .
ARTIFICIAL INTELLIGENCE, 1991, 49 (1-3) :25-60
[2]   AN ASSUMPTION-BASED TMS [J].
DEKLEER, J .
ARTIFICIAL INTELLIGENCE, 1986, 28 (02) :127-162
[3]  
DRECHSLER R, 2006, LNCS, P30
[4]   THE COMPLEXITY OF LOGIC-BASED ABDUCTION [J].
EITER, T ;
GOTTLOB, G .
JOURNAL OF THE ACM, 1995, 42 (01) :3-42
[5]  
FELDMAN A, 2008, P AAAI 08 JUL
[6]  
Friedrich G., 1990, P AAAI
[7]  
HERMANN M, 2007, IJCAI, P417
[8]   POLYNOMIALLY COMPLETE FAULT DETECTION PROBLEMS [J].
IBARRA, OH ;
SAHNI, SK .
IEEE TRANSACTIONS ON COMPUTERS, 1975, C 24 (03) :242-249
[9]  
KO KI, 1995, MINIMAX APPL
[10]   ON THE COMPLEXITY OF ESTIMATING THE SIZE OF A TEST SET [J].
KRISHNAMURTHY, B ;
AKERS, SB .
IEEE TRANSACTIONS ON COMPUTERS, 1984, 33 (08) :750-753