Declarative Reasoning on Explanations Using Constraint Logic Programming

Laura State, Salvatore Ruggieri, Franco Turini
9/1/2023
cs.AIcs.CYcs.LG

No official code found. Best implementation: lstate/REASONX (5 stars, MIT, last commit 2026-02-23).

Abstract

Explaining opaque Machine Learning (ML) models is an increasingly relevant problem. Current explanation in AI (XAI) methods suffer several shortcomings, among others an insufficient incorporation of background knowledge, and a lack of abstraction and interactivity with the user. We propose REASONX, an explanation method based on Constraint Logic Programming (CLP). REASONX can provide declarative, interactive explanations for decision trees, which can be the ML models under analysis or global/local surrogate models of any black-box model. Users can express background or common sense knowledge using linear constraints and MILP optimization over features of factual and contrastive instances, and interact with the answer constraints at different levels of abstraction through constraint projection. We present here the architecture of REASONX, which consists of a Python layer, closer to the user, and a CLP layer. REASONX's core execution engine is a Prolog meta-program with declarative semantics in terms of logic theories.

View on arXivView PDF

Code Implementations(1)

lstate/REASONXCommunity100%
MIT

REASONX (reason to explain)

51R, PrologMay 29, 20238 months agoMIT

Similar Papers

Cite this paper

@article{state2023declarative,
  title  = {Declarative Reasoning on Explanations Using Constraint Logic Programming},
  author = {Laura State and Salvatore Ruggieri and Franco Turini},
  year   = {2023},
  eprint = {2309.00422},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2309.00422v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2309.00422.svg)](https://codeofpaper.com/paper/2309.00422)

Discussion