ASTERYX: A model-Agnostic SaT-basEd appRoach for sYmbolic and score-based eXplanations

被引:17
|
作者
Boumazouza, Ryma [1 ]
Cheikh-Alili, Fahima [1 ]
Mazure, Bertrand [1 ]
Tabia, Karim [1 ]
机构
[1] Univ Artois, CNRS, CRIL, Lens, France
关键词
XAI; Symbolic explanations; Score-based explanation; Model-Agnostic; Satisfiability testing;
D O I
10.1145/3459637.3482321
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
The ever increasing complexity of machine learning techniques used more and more in practice, gives rise to the need to explain the outcomes of these models, often used as black-boxes. Explainable AI approaches are either numerical feature-based aiming to quantify the contribution of each feature in a prediction or symbolic providing certain forms of symbolic explanations such as counterfactuals. This paper proposes a generic agnostic approach named ASTERYX allowing to generate both symbolic explanations and score-based ones. Our approach is declarative and it is based on the encoding of the model to be explained in an equivalent symbolic representation. This latter serves to generate in particular two types of symbolic explanations which are sufficient reasons and counterfactuals. We then associate scores reflecting the relevance of the explanations and the features w.r.t to some properties. Our experimental results show the feasibility of the proposed approach and its effectiveness in providing symbolic and score-based explanations.
引用
收藏
页码:120 / 129
页数:10
相关论文
共 50 条
  • [1] SAT-based unbounded symbolic model checking
    Kang, HJ
    Park, IC
    40TH DESIGN AUTOMATION CONFERENCE, PROCEEDINGS 2003, 2003, : 840 - 843
  • [2] SAT-based unbounded symbolic model checking
    Kang, HJ
    Park, IC
    IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS, 2005, 24 (02) : 129 - 140
  • [3] Integrating BDD-based and SAT-based symbolic model checking
    Cimatti, A
    Giunchiglia, E
    Pistore, M
    Roveri, M
    Sebastiani, R
    Tacchella, A
    FRONTIERS OF COMBINING SYSTEMS, 2002, 2309 : 49 - 56
  • [4] A Novel SAT-Based Approach to Model Based Diagnosis
    Metodi, Amit
    Stern, Roni
    Kalech, Meir
    Codish, Michael
    JOURNAL OF ARTIFICIAL INTELLIGENCE RESEARCH, 2014, 51 : 377 - 411
  • [5] SAT-Based Rigorous Explanations for Decision Lists
    Ignatiev, Alexey
    Marques-Silva, Joao
    THEORY AND APPLICATIONS OF SATISFIABILITY TESTING, SAT 2021, 2021, 12831 : 251 - 269
  • [6] Stable local interpretable model-agnostic explanations based on a variational autoencoder
    Xiang, Xu
    Yu, Hong
    Wang, Ye
    Wang, Guoyin
    APPLIED INTELLIGENCE, 2023, 53 (23) : 28226 - 28240
  • [7] Pixel-Based Clustering for Local Interpretable Model-Agnostic Explanations
    Qian, Junyan
    Wen, Tong
    Ling, Ming
    Du, Xiaofu
    Ding, Hao
    JOURNAL OF ARTIFICIAL INTELLIGENCE AND SOFT COMPUTING RESEARCH, 2025, 15 (03) : 257 - 277
  • [8] Stable local interpretable model-agnostic explanations based on a variational autoencoder
    Xu Xiang
    Hong Yu
    Ye Wang
    Guoyin Wang
    Applied Intelligence, 2023, 53 : 28226 - 28240
  • [9] A SAT-based algorithm for reparameterization in symbolic simulation
    Chauhan, P
    Clarke, EM
    Kroening, D
    41ST DESIGN AUTOMATION CONFERENCE, PROCEEDINGS 2004, 2004, : 524 - 529
  • [10] A SAT-Based Approach to MinSAT
    Ansotegui, Carlos
    Li, Chu Min
    Manya, Felip
    Zhu, Zhu
    ARTIFICIAL INTELLIGENCE RESEARCH AND DEVELOPMENT, 2012, 248 : 185 - +