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 条
  • [41] Lilotane: A Lifted SAT-Based Approach to Hierarchical Planning
    Schreiber, Dominik
    JOURNAL OF ARTIFICIAL INTELLIGENCE RESEARCH, 2021, 70 : 1117 - 1181
  • [42] A SAT-Based Approach for SDN Rule Table Distribution
    Ogasawara, Ryota
    Arai, Masayuki
    2018 IEEE 23RD PACIFIC RIM INTERNATIONAL SYMPOSIUM ON DEPENDABLE COMPUTING (PRDC), 2018, : 191 - 192
  • [43] SAT-based Unbounded Model Checking of Timed Automata
    Penczek, Wojciech
    Szreter, Maciej
    FUNDAMENTA INFORMATICAE, 2008, 85 (1-4) : 425 - 440
  • [44] Interpolant Learning and Reuse in SAT-Based Model Checking
    Marques-Silva, Joao
    ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE, 2007, 174 (03) : 31 - 43
  • [45] Simultaneous SAT-based model checking of safety properties
    Khasidashvili, Z
    Nadel, A
    Palti, A
    Hanna, Z
    HARDWARE AND SOFTWARE VERIFICATION AND TESTING, 2006, 3875 : 56 - 75
  • [46] Solving Linear Arithmetic with SAT-based Model Checking
    Vizel, Yakir
    Nadel, Alexander
    Malik, Sharad
    PROCEEDINGS OF THE 17TH CONFERENCE ON FORMAL METHODS IN COMPUTER AIDED DESIGN (FMCAD 2017), 2017, : 47 - 54
  • [47] SATMC: A SAT-based model checker for security protocols
    Armando, A
    Compagna, L
    LOGICS IN ARTIFICIAL INTELLIGENCE, PROCEEDINGS, 2004, 3229 : 730 - 733
  • [48] Improvement of SAT-based Model Checking of Security Protocols
    Yang, Yuanyuan
    Ma, Wenping
    2009 INTERNATIONAL CONFERENCE ON E-BUSINESS AND INFORMATION SYSTEM SECURITY, VOLS 1 AND 2, 2009, : 223 - 227
  • [49] A Two-Variable Model for SAT-Based ATPG
    Chen, Huan
    Marques-Silva, Joao
    IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS, 2013, 32 (12) : 1943 - 1956
  • [50] Beyond safety: Customized SAT-based model checking
    Ganai, MK
    Gupta, A
    Ashar, P
    42nd Design Automation Conference, Proceedings 2005, 2005, : 738 - 743