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 条
  • [21] Symbolic Model Checking of Product-Line Requirements Using SAT-Based Methods
    Ben-David, Shoham
    Sterin, Baruch
    Atlee, Joanne M.
    Beidu, Sandy
    2015 IEEE/ACM 37TH IEEE INTERNATIONAL CONFERENCE ON SOFTWARE ENGINEERING, VOL 1, 2015, : 189 - 199
  • [22] "I do not know! but why?"- Local model-agnostic example-based explanations of reject
    Artelt, Andre
    Visser, Roel
    Hammer, Barbara
    NEUROCOMPUTING, 2023, 558
  • [23] Toward Learning Model-Agnostic Explanations for Deep Learning-Based Signal Modulation Classifiers
    Tian, Yunzhe
    Xu, Dongyue
    Tong, Endong
    Sun, Rui
    Chen, Kang
    Li, Yike
    Baker, Thar
    Niu, Wenjia
    Liu, Jiqiang
    IEEE TRANSACTIONS ON RELIABILITY, 2024, 73 (03) : 1529 - 1543
  • [24] A SAT-based approach to multiple sequence alignment
    Prestwich, S
    Higgins, D
    O'Sullivan, O
    PRINCIPLES AND PRACTICE OF CONSTRAINT PROGRAMMING - CP 2003, PROCEEDINGS, 2003, 2833 : 940 - 944
  • [25] The SAT-based approach for classical modal logics
    Giunchiglia, E
    Giunchiglia, F
    Tacchella, A
    AI*IA 99: ADVANCES IN ARTIFICIAL INTELLIGENCE, 2000, 1792 : 95 - 106
  • [26] A SAT-Based Approach For PSPACE Modal Logics
    Lagniez, Jean-Marie
    Le Berre, Daniel
    de Lima, Tiago
    Montmirail, Valentin
    SIXTEENTH INTERNATIONAL CONFERENCE ON PRINCIPLES OF KNOWLEDGE REPRESENTATION AND REASONING, 2018, : 651 - 652
  • [27] Sat-based model checking for region automata
    Yu, Fang
    Wang, Bow-Yaw
    INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 2006, 17 (04) : 775 - 795
  • [28] SAT-Based Model Checking without Unrolling
    Bradley, Aaron R.
    VERIFICATION, MODEL CHECKING, AND ABSTRACT INTERPRETATION, 2011, 6538 : 70 - 87
  • [29] Symmetry reduction in SAT-based model checking
    Tang, DJ
    Malik, S
    Gupta, A
    Ip, CN
    COMPUTER AIDED VERIFICATION, PROCEEDINGS, 2005, 3576 : 125 - 138
  • [30] Certifying proofs for SAT-based model checking
    Alberto Griggio
    Marco Roveri
    Stefano Tonetta
    Formal Methods in System Design, 2021, 57 : 178 - 210