English
Related papers

Related papers: On Logic-Based Explainability with Partially Speci…

200 papers

Understanding the behavior of learned classifiers is an important task, and various black-box explanations, logical reasoning approaches, and model-specific methods have been proposed. In this paper, we introduce probabilistic sufficient…

Machine Learning · Computer Science 2021-05-24 Eric Wang , Pasha Khosravi , Guy Van den Broeck

We describe a representation and a set of inference methods that combine logic programming techniques with probabilistic network representations for uncertainty (influence diagrams). The techniques emphasize the dynamic construction and…

Artificial Intelligence · Computer Science 2013-04-11 John S. Breese , Edison Tse

In recent years, the impact of machine learning (ML) and artificial intelligence (AI) in society has been absolutely remarkable. This impact is expected to continue in the foreseeable future. However,the adoption of AI/ML is also a cause of…

Artificial Intelligence · Computer Science 2024-06-19 Joao Marques-Silva

A task of interest in machine learning (ML) is that of ascribing explanations to the predictions made by ML models. Furthermore, in domains deemed high risk, the rigor of explanations is paramount. Indeed, incorrect explanations can and…

Artificial Intelligence · Computer Science 2025-07-11 Mohamed Siala , Jordi Planes , Joao Marques-Silva

This paper is a reflexion on the computability of natural language semantics. It does not contain a new model or new results in the formal semantics of natural language: it is rather a computational analysis of the logical models and…

Computation and Language · Computer Science 2016-05-16 Richard Moot , Christian Retoré

The current state-of-the-art in many natural language processing and automated knowledge base completion tasks is held by representation learning methods which learn distributed vector representations of symbols via gradient-based…

Neural and Evolutionary Computing · Computer Science 2017-12-29 Tim Rocktäschel

Plausible reasoning concerns situations whose inherent lack of precision is not quantified; that is, there are no degrees or levels of precision, and hence no use of numbers like probabilities. A hopefully comprehensive set of principles…

Artificial Intelligence · Computer Science 2017-04-05 David Billington

There is a growing concern about typically opaque decision-making with high-performance machine learning algorithms. Providing an explanation of the reasoning process in domain-specific terms can be crucial for adoption in risk-sensitive…

Computer Vision and Pattern Recognition · Computer Science 2022-11-28 Aditya Chattopadhyay , Stewart Slocum , Benjamin D. Haeffele , Rene Vidal , Donald Geman

Learning and logic are distinct and remarkable approaches to prediction. Machine learning has experienced a surge in popularity because it is robust to noise and achieves high performance; however, ML experiences many issues with knowledge…

Artificial Intelligence · Computer Science 2018-07-16 Jeffrey Cheng

The main objective of explanations is to transmit knowledge to humans. This work proposes to construct informative explanations for predictions made from machine learning models. Motivated by the observations from social sciences, our…

Artificial Intelligence · Computer Science 2018-05-29 Freddy Lecue , Jiewen Wu

Many techniques for handling missing data have been proposed in the literature. Most of these techniques are overly complex. This paper explores an imputation technique based on rough set computations. In this paper, characteristic…

Computer Vision and Pattern Recognition · Computer Science 2007-05-23 Fulufhelo Vincent Nelwamondo , Tshilidzi Marwala

The ability of Large Language Models (LLMs) to perform reasoning tasks such as deduction has been widely investigated in recent years. Yet, their capacity to generate proofs-faithful, human-readable explanations of why conclusions…

Artificial Intelligence · Computer Science 2026-01-21 Hui Yang , Jiaoyan Chen , Uli Sattler

The most common methods in explainable artificial intelligence are post-hoc techniques which identify the most relevant features used by pretrained opaque models. Some of the most advanced post hoc methods can generate explanations that…

Artificial Intelligence · Computer Science 2026-03-11 Stefano Fioravanti , Francesco Giannini , Paolo Frazzetto , Fabio Zanasi , Pietro Barbiero

Neural rationale models are popular for interpretable predictions of NLP tasks. In these, a selector extracts segments of the input text, called rationales, and passes these segments to a classifier for prediction. Since the rationale is…

Computation and Language · Computer Science 2022-07-26 Yiming Zheng , Serena Booth , Julie Shah , Yilun Zhou

The requirements on explainability imposed by European laws and their implications for machine learning (ML) models are not always clear. In that perspective, our research analyzes explanation obligations imposed for private and public…

Artificial Intelligence · Computer Science 2020-07-13 Adrien Bibal , Michael Lognoul , Alexandre de Streel , Benoît Frénay

Existing algorithms for generating Counterfactual Explanations (CXs) for Machine Learning (ML) typically assume fully specified inputs. However, real-world data often contains missing values, and the impact of these incomplete inputs on the…

Artificial Intelligence · Computer Science 2026-04-10 Francesco Leofante , Daniel Neider , Mustafa Yalçıner

We introduce a lazy approach to the explanation-based approximation of probabilistic logic programs. It uses only the most significant part of the program when searching for explanations. The result is a fast and anytime approximate…

Artificial Intelligence · Computer Science 2015-07-13 Joris Renkens , Angelika Kimmig , Luc De Raedt

In recent years, machine learning (ML) has become a key enabling technology for the sciences and industry. Especially through improvements in methodology, the availability of large databases and increased computational power, today's ML…

Artificial Intelligence · Computer Science 2019-09-27 Wojciech Samek , Klaus-Robert Müller

The self-rationalising capabilities of large language models (LLMs) have been explored in restricted settings, using task/specific data sets. However, current LLMs do not (only) rely on specifically annotated data; nonetheless, they…

Computation and Language · Computer Science 2024-12-18 Jenny Kunz , Marco Kuhlmann

Mathematical optimization, although often leading to NP-hard models, is now capable of solving even large-scale instances within reasonable time. However, the primary focus is often placed solely on optimality. This implies that while…

Optimization and Control · Mathematics 2025-12-23 Kevin-Martin Aigner , Marc Goerigk , Michael Hartisch , Frauke Liers , Arthur Miehlich , Florian Rösel