English
Related papers

Related papers: Foundations of Symbolic Languages for Model Interp…

200 papers

This paper presents matching logic, a first-order logic (FOL) variant for specifying and reasoning about structure by means of patterns and pattern matching. Its sentences, the patterns, are constructed using variables, symbols, connectives…

Logic in Computer Science · Computer Science 2019-03-14 Grigore Rosu

We argue that existing definitions of interpretability are not actionable in that they fail to inform users about general, sound, and robust interpretable model design. This makes current interpretability research fundamentally ill-posed.…

Machine Learning · Computer Science 2025-08-04 Pietro Barbiero , Mateo Espinosa Zarlenga , Alberto Termine , Mateja Jamnik , Giuseppe Marra

The rise of foundation models has transformed machine learning research, prompting efforts to uncover their inner workings and develop more efficient and reliable applications for better control. While significant progress has been made in…

Declarative approaches to process modeling are regarded as well suited for highly volatile environments as they provide a high degree of flexibility. However, problems in understanding and maintaining declarative business process models…

Software Engineering · Computer Science 2015-11-12 Cornelia Haisjackl , Stefan Zugal , Pnina Soffer , Irit Hadar , Manfred Reichert , Jakob Pinggera , Barbara Weber

We take inspiration from the study of human explanation to inform the design and evaluation of interpretability methods in machine learning. First, we survey the literature on human explanation in philosophy, cognitive science, and the…

Artificial Intelligence · Computer Science 2021-09-21 David Alvarez-Melis , Harmanpreet Kaur , Hal Daumé , Hanna Wallach , Jennifer Wortman Vaughan

Verification of properties of first order logic with two variables FO2 has been investigated in a number of contexts. Over arbitrary structures it is known to be decidable with NEXPTIME complexity, with finitely satisfiable formulas having…

Logic in Computer Science · Computer Science 2013-06-03 Saguy Benaim , Michael Benedikt , Rastislav Lenhardt , James Worrell

We regard explanations as a blending of the input sample and the model's output and offer a few definitions that capture various desired properties of the function that generates these explanations. We study the links between these…

Machine Learning · Computer Science 2020-01-16 Lior Wolf , Tomer Galanti , Tamir Hazan

As the use of machine learning (ML) models in product development and data-driven decision-making processes became pervasive in many domains, people's focus on building a well-performing model has increasingly shifted to understanding how…

Human-Computer Interaction · Computer Science 2020-06-02 Sungsoo Ray Hong , Jessica Hullman , Enrico Bertini

Machine learning models have had discernible achievements in a myriad of applications. However, most of these models are black-boxes, and it is obscure how the decisions are made by them. This makes the models unreliable and untrustworthy.…

Machine Learning · Computer Science 2020-03-23 Raha Moraffah , Mansooreh Karami , Ruocheng Guo , Adrienne Raglin , Huan Liu

Pattern-based, modular ontologies have several beneficial properties that lend themselves to FAIR data practices, especially as it pertains to Interoperability and Reusability. However, developing such ontologies has a high upfront cost,…

Artificial Intelligence · Computer Science 2019-04-12 Cogan Shimizu , Quinn Hirt , Pascal Hitzler

Claim verification plays a crucial role in combating misinformation. While existing works on claim verification have shown promising results, a crucial piece of the puzzle that remains unsolved is to understand how to verify claims without…

Computation and Language · Computer Science 2023-10-23 Haoran Wang , Kai Shu

First-order linear temporal logic (FOLTL) is a flexible and expressive formalism capable of naturally describing complex behaviors and properties. Although the logic is in general highly undecidable, the idea of using it as a specification…

Logic in Computer Science · Computer Science 2024-05-31 Luca Geatti , Alessandro Gianola , Nicola Gigante

Recent efforts in Machine Learning (ML) interpretability have focused on creating methods for explaining black-box ML models. However, these methods rely on the assumption that simple approximations, such as linear models or decision-trees,…

Machine Learning · Computer Science 2019-06-13 Owen Lahav , Nicholas Mastronarde , Mihaela van der Schaar

There has been increasing interest in evaluations of language models for a variety of risks and characteristics. Evaluations relying on natural language understanding for grading can often be performed at scale by using other language…

Computation and Language · Computer Science 2023-12-11 Simon Lermen , Ondřej Kvapil

Large language models have exhibited impressive performance across a broad range of downstream tasks in natural language processing. However, how a language model predicts the next token and generates content is not generally understandable…

This work presents a novel systematic methodology to analyse the capabilities and limitations of Large Language Models (LLMs) with feedback from a formal inference engine, on logic theory induction. The analysis is complexity-graded w.r.t.…

Computation and Language · Computer Science 2025-01-15 João Pedro Gandarela , Danilo S. Carvalho , André Freitas

In this paper, we study whether transformer-based language models can extract predicate argument structure from simple sentences. We firstly show that language models sometimes confuse which predicates apply to which objects. To mitigate…

Computation and Language · Computer Science 2024-10-07 Akshay Chaturvedi , Nicholas Asher

The large and still increasing popularity of deep learning clashes with a major limit of neural network architectures, that consists in their lack of capability in providing human-understandable motivations of their decisions. In situations…

Machine Learning · Computer Science 2023-05-22 Gabriele Ciravegna , Pietro Barbiero , Francesco Giannini , Marco Gori , Pietro Lió , Marco Maggini , Stefano Melacci

Transformer language models are state of the art in a multitude of NLP tasks. Despite these successes, their opaqueness remains problematic. Recent methods aiming to provide interpretability and explainability to black-box models primarily…

Computation and Language · Computer Science 2022-03-14 Felix Friedrich , Patrick Schramowski , Christopher Tauchmann , Kristian Kersting

Logical reasoning is a fundamental task in natural language processing that presents significant challenges to Large Language Models (LLMs). The inherent characteristics of logical reasoning makes it well-suited for symbolic representations…

Computation and Language · Computer Science 2024-09-26 Ramya Keerthy Thatikonda , Jiuzhou Han , Wray Buntine , Ehsan Shareghi