CORTEXA
← Browse
arxivcs.AI2026-07-01

PACE: A Neuro-Symbolic Framework for Plausible and Actionable Counterfactual Explanations

Pavel Iakovets, Liyanapathiranage Sudeepika Wajirakumari Samarathunga, Martin Thomas Horsch, Fadi Al Machot

Counterfactual explanations explain machine learning predictions by identifying minimal input changes that would alter a model's decision. Although many existing methods successfully generate prediction-changing alternatives, they often produce unrealistic or infeasible recommendations due to a lack of explicit mechanisms for incorporating domain knowledge and intervention constraints. Neuro-symbolic AI offers a promising direction by combining data-driven predictive models with symbolic reasoning capable of representing human-understandable rules and feasible actions. This paper presents PACE, a modular neuro-symbolic framework for generating feasibility-aware counterfactual explanations. The framework separates prediction and reasoning into two components: a neural predictive model for classification and a symbolic reasoning layer that enforces domain-specific constraints during counterfactual generation. By explicitly modeling feasible interventions, the framework produces explanations consistent with domain knowledge while remaining interpretable and actionable. The approach is model-agnostic and adaptable to domains requiring realistic decision support. A case study is conducted on the Adult Income dataset, combining a multilayer perceptron classifier with Answer Set Programming (ASP) rules encoding feasible modifications to education, occupation, and working hours while preserving immutable attributes. Results highlight the trade-off between counterfactual validity and plausibility and show that symbolic constraints yield explanations that better satisfy domain-specific feasibility requirements, illustrating the potential of neuro-symbolic methods for transparent, feasibility-aware counterfactual explanation in explainable AI.

View free PDFSource page

Related papers

arxivcs.AI2026-07-24

Learning Structural Convergence: A Neuro-Symbolic Benchmark for Temporal Reasoning

Michael Romei De Socio, Gian Luca Pozzato, Alessio Merlo

High-complexity operational environments require methods that detect and anticipate temporally distributed patterns rather than classify isolated events. This paper introduces TRACTA (Temporal Reasoning and Capability-Trajectory Analysis), a controlled synthetic benchmark for tem…

View free PDFSource page
arxivcs.LGcs.AI2026-07-24

CEL: Comprehensive Counterfactual Explanations Library and Benchmark

Oleksii Furman, Łukasz Lenkiewicz, Marcel Musiałek, Maciej Zięba

Counterfactual explanations are a prominent approach in explainable artificial intelligence (xAI), providing actionable guidance on what input changes would alter a model's prediction to a desired outcome. While early methods primarily focused on minimal feature changes, recent w…

View free PDFSource page
arxivcs.LGcs.AI2026-07-23

Beyond Sufficiency: Time Series Explanation with Counterfactual Necessity

Hongnan Ma, Yiwei Shi, Mengyue Yang, Weiru Liu

Faithful explanations of time-series classifiers should identify subsequences that are not only sufficient to preserve a black-box model's prediction, but also necessary for maintaining it. However, existing sufficiency-oriented methods can assign high importance to spurious subs…

View free PDFSource page
arxivcs.AI2026-07-23

Identifying Good Rules for Efficient SAT Encodings of Single-Constant Multiplication Using Machine Learning

Chufeng Jiang, Neng-Fa Zhou

The Single Constant Multiplication problem is a fundamental NP-hard optimization task in hardware design, which seeks to decompose a fixed constant using only additions, subtractions, and bit-shifts. Although dynamic programming methods can produce near-optimal SAT encodings for…

View free PDFSource page