260 likes | 382 Views
Abductive Validation of a Power-Grid Expert System Diagnoser. José G F Castro / Luis Moniz Pereira Universidade Nova de Lisboa. The Objective. Put Together: Abdual: An abductive Framework Sparse: An Expert-System for Diagnose of Electrical Incidents. Abdual (Abduction/Dual).
E N D
Abductive Validation of a Power-Grid Expert System Diagnoser José G F Castro / Luis Moniz Pereira Universidade Nova de Lisboa
The Objective Put Together: • Abdual: An abductive Framework • Sparse: An Expert-System for Diagnose of Electrical Incidents
Abdual (Abduction/Dual) • Abduction: Finding Explanations • Rules • Abducibles • Constraints • “Dual”: A program transformation to simplify abduction over negation
Abduction present ← approved, cash, not crash present ← invited, not crash, born approved ← submitted, kind_review crash ← poor_maintenance crash ← bad_pilot
Abduction present ← approved, cash, notcrash present ← invited, notcrash, born approved ← submitted, kind_review crash ← poor_maintenance crash ← bad_pilot Abducibles
Abduction present ← approved, cash, notcrash present ← invited, notcrash, born approved ← submitted, kind_review crash ← poor_maintenance crash ← bad_pilot ← - born, invited ← - submitted, kind_review
Dual Rules approved ← submitted, kind_review not approved ← not submitted not approved ← not kind_review crash ← poor_maintenance crash ← bad_pilot not crash ← not poor_maintenance, not bad_pilot
Nice Things About Abdual • Allows for Several Semantics • WFS • Stable Models • Answer Sets • Efficient • Available in the Net
SPARSE Overview Inference Engine Rules SPARSE Inference Engine Automatic Data Aquisition Dynamical Database of Sparse Facts
Sparse Rules TRANSLATION Rules for Abdual Problem Definition deduction Assert: New Conclusions Retract: SCADA facts and Previous Conclusions SPARSE INFERENCE ENGINE SCADA facts Time Constraints Previous Conclusions SCADA facts and their related Time Constraints Query ABDUAL FRAMEWORK abduction
Problem Definition Problems found in applying Abdual to SPARSE • Infinite regressions in time • Logical links between SPARSE rules through the introduction and removal of facts. • Use of subsets in the body of a SPARSE rule to produce several conclusions
SPARSE RULES regra g1 : 'PASSAGEM A OPERADOR MANUAL' : [[ mensagem(Data,Hora,[Inst,_,_],'INST.COM OPERADOR','00') at T1 e automatico(_,_,Inst) ]] ==> [ retira_facto(automatico(_,_,Inst),_,T1), cria_facto(FactNo,manual(Data,Hora,Inst),T1) ]. regra g2 : 'PASSAGEM A OPERADOR AUTOMATICO' : [[ mensagem(Data,Hora,[Inst,_,_],'INST.COM OPERADOR','01') at T1 e manual(_,_,Inst) ]] ==> [ retira_facto(manual(_,_,Inst),_,T1), cria_facto(FactNo,automatico(Data,Hora,Inst),T1) ]. G1 and G2 Rules
TRANSLATION abds([facto0/5, condicao/4]). /* g1-1 producao 2 */ facto(manual(Inst), T1) <- facto0(g1,1,2,mensagem([Inst,_P,_I2,inst_com_operador,oo), T1), facto(automatico(Inst),_T2). /* g2-1 producao 2 */ facto(automatico(Inst), T1) <- facto0(g2,1,2,mensagem([Inst,_P,_I2,inst_com_operador,oi),T1), facto(manual(Inst),_T2). /* inic */ facto(manual(inst1),t0) <- facto0(inic,1,1,manual(inst1),t0). Translated G1 and G2 Rules
Abdual Output /* Ficheiro de Solucoes Abdutivas para o Golo: facto(manual(inst1),tp) as solucoes duplicadas foram eliminadas */ facto0(g1,1,2,mensagem([inst1,_h176,_h178],inst_com_operador,oo),tp) facto0(g1,1,2,mensagem([inst1,_h194,_h196],inst_com_operador,oo),_h187) facto0(g2,1,2,mensagem([inst1,_h212,_h214],inst_com_operador,oi),_h205) facto0(inic,1,1,manual(inst1),t0) facto0(g1,1,2,mensagem([inst1,_h122,_h124],inst_com_operador,oo),tp) facto0(g2,1,2,mensagem([inst1,_h140,_h142],inst_com_operador,oi),_h133) facto0(inic,1,1,manual(inst1),t0)
Logical links between SPARSE rules through the introduction and removal of facts. D8: Automatic Reclosure of Circuit Breaker J15: Local Manual Reclosure of Circuit Breaker Trigger: CB opens at tg Rule D8 production at tg + 0,8 Rule J15 production at tg + 5,3 - 0,8 D8 +0,8 CB Reclosure 0 J15 +5,3
Logical links between SPARSE rules through the introduction and removal of facts. D8: Automatic Reclosure of Circuit Breaker J15: Local Manual Reclosure of Circuit Breaker Trigger: CB opens at tg Rule D8 production at tg + 0,8 Rule J15 production in at tg + 5,3 - 0,8 D8 +0,8 CB Reclosure 0 J15 +5,3
Logical links between SPARSE rules through the introduction and removal of facts. D8: Automatic Reclosure of Circuit Breaker J15: Local Manual Reclosure of Circuit Breaker Trigger: CB opens at tg Rule D8 production at tg + 0,8 New Trigger: CB opens at tg2 Rule J15 production at tg + 5,3 - 0,8 D8 +0,8 - 0,8 D8 +0,8 CB reclosure CB reclosure 0 J15 +5,3 0... ..........
Logical links between SPARSE rules through the introduction and removal of facts. D8: Automatic Reclosure of Circuit Breaker J15: Local Manual Reclosure of Circuit Breaker Trigger: CB opens at tg Rule D8 production at tg + 0,8 New Trigger: CB opens at tg2 Rule J15 production at tg + 5,3 CB reclosure - 0,8 D8 +0,8 - 0,8 D8 +0,8 0 J15 +5,3
Sparse Rules TRANSLATION Rules for Abdual Work Done deduction Assert: New Conclusions Retract: SCADA facts and Previous Conclusions SPARSE INFERENCE ENGINE SCADA facts Time Constraints Previous Conclusions Tools to Analyse Rules SCADA facts and their related Time Constraints Query ABDUAL FRAMEWORK abduction
Sparse Rules TRANSLATION Rules for Abdual Work Done deduction Assert: New Conclusions Retract: SCADA facts and Previous Conclusions SPARSE INFERENCE ENGINE SCADA facts Time Constraints Previous Conclusions Tools to Analyse Rules Automatic Translation of Rules SCADA facts and their related Time Constraints Query ABDUAL FRAMEWORK abduction
Sparse Rules TRANSLATION Rules for Abdual Work Done deduction Assert: New Conclusions Retract: SCADA facts and Previous Conclusions SPARSE INFERENCE ENGINE SCADA facts Time Constraints Previous Conclusions Tools to Analyse Rules Automatic Translation of Rules Alphabetic Similarity Implementation SCADA facts and their related Time Constraints Query ABDUAL FRAMEWORK abduction
Sparse Rules TRANSLATION Rules for Abdual Work Done deduction Assert: New Conclusions Retract: SCADA facts and Previous Conclusions SPARSE INFERENCE ENGINE SCADA facts Time Constraints Previous Conclusions Tools to Analyse Rules Automatic Translation of Rules Alphabetic Similarity Implementation SCADA facts and their related Time Constraints Query ABDUAL FRAMEWORK Querys for Subsets Of Rules abduction
Sparse Rules TRANSLATION Rules for Abdual Work Done deduction Assert: New Conclusions Retract: SCADA facts and Previous Conclusions SPARSE INFERENCE ENGINE SCADA facts Time Constraints Previous Conclusions Tools to Analyse Rules Automatic Translation of Rules Alphabetic Similarity Implementation SCADA facts and their related Time Constraints Query ABDUAL FRAMEWORK Querys for Subsets Of Rules Present Solutions in a More Readable Format abduction
Sparse Rules TRANSLATION Rules for Abdual Work Done deduction Assert: New Conclusions Retract: SCADA facts and Previous Conclusions SPARSE INFERENCE ENGINE SCADA facts Time Constraints Previous Conclusions Tools to Analyse Rules Automatic Translation of Rules Alphabetic Similarity Implementation Tools to Analyze Abductive Solutions SCADA facts and their related Time Constraints Query ABDUAL FRAMEWORK Querys for Subsets Of Rules Present Solutions in a More Readable Format abduction
Conclusions • ABDUAL was shown to be useful to analyse and develop the SPARSE set of rules... • ... But translation of rules could not guarantee same meaning
Future Work • New SCADA is now being implemented... • ... analyse the new SPARSE set of rules.