English
Related papers

Related papers: Bisimulation-Based Comparisons for Interpretations…

200 papers

*Concept-based explanations* offer a promising approach for explaining the predictions of deep neural networks in terms of high-level, human-understandable concepts. However, existing methods either do not establish a causal connection…

Machine Learning · Computer Science 2026-05-08 Ronaldo Canizales , Divya Gopinath , Corina Păsăreanu , Ravi Mangal

We prove a compactness theorem in the context of Hennessy-Milner logic. It is used to derive a sufficient condition on modal characterizations for the Approximation Induction Principle to be sound modulo the corresponding process…

Logic in Computer Science · Computer Science 2009-11-12 Maciej Gazda , Wan Fokkink

Recently, much work has been carried out to study simplicial interpretations of modal logic. While notions of (distributed) knowledge have been well investigated in this context, it has been open how to model belief in simplicial models. We…

Logic in Computer Science · Computer Science 2026-01-13 Christian Cachin , David Lehnherr , Thomas Studer

In probabilistic transition systems, behavioural metrics provide a more fine-grained and stable measure of system equivalence than crisp notions of bisimilarity. They correlate strongly to quantitative probabilistic logics, and in fact the…

Logic in Computer Science · Computer Science 2019-06-05 Paul Wild , Lutz Schröder , Dirk Pattinson , Barbara König

Recent advances in language models have substantially improved Natural Language Understanding (NLU). Although widely used benchmarks suggest that Large Language Models (LLMs) can effectively disambiguate, their practical applicability in…

Computation and Language · Computer Science 2026-04-20 Deshan Sumanathilaka , Nicholas Micallef , Julian Hough , Saman Jayasinghe

A categorical approach to study model comparison games in terms of comonads was recently initiated by Abramsky et al. In this work, we analyse games that appear naturally in the context of description logics and supplement them with…

Logic in Computer Science · Computer Science 2022-11-18 Mateusz Urbańczyk

The logical negation property (LNP), which implies generating different predictions for semantically opposite inputs, is an important property that a trustworthy language model must satisfy. However, much recent evidence shows that…

Computation and Language · Computer Science 2022-08-12 Myeongjun Jang , Frank Mtumbuka , Thomas Lukasiewicz

Simile interpretation is a crucial task in natural language processing. Nowadays, pre-trained language models (PLMs) have achieved state-of-the-art performance on many tasks. However, it remains under-explored whether PLMs can interpret…

Computation and Language · Computer Science 2022-03-17 Qianyu He , Sijie Cheng , Zhixu Li , Rui Xie , Yanghua Xiao

Concept-based explanations have emerged as a popular way of extracting human-interpretable representations from deep discriminative models. At the same time, the disentanglement learning literature has focused on extracting similar…

Machine Learning · Computer Science 2021-04-15 Dmitry Kazhdan , Botty Dimanov , Helena Andres Terre , Mateja Jamnik , Pietro Liò , Adrian Weller

With the growing popularity of general-purpose Large Language Models (LLMs), comes a need for more global explanations of model behaviors. Concept-based explanations arise as a promising avenue for explaining high-level patterns learned by…

Artificial Intelligence · Computer Science 2024-10-07 Meng Li , Haoran Jin , Ruixuan Huang , Zhihao Xu , Defu Lian , Zijia Lin , Di Zhang , Xiting Wang

We study the logic of comparative concept similarity $\CSL$ introduced by Sheremet, Tishkovsky, Wolter and Zakharyaschev to capture a form of qualitative similarity comparison. In this logic we can formulate assertions of the form " objects…

Artificial Intelligence · Computer Science 2009-02-06 Régis Alenda , Nicola Olivetti , Camilla Schwind

Aiming to harmonise finite and infinite model reasoning, we initiate the study of partially finite models, where the reasoning task comes with a formula that specifies a part of the model that must be finite. We focus on the problem of…

Logic in Computer Science · Computer Science 2026-04-29 Tomasz Gogacz , Filip Murlak , Marcin Przybyłko , Alexandra Rogova , Michał Skrzypczak

Concept Bottleneck Models (CBMs) provide a basis for semantic abstractions within a neural network architecture. Such models have primarily been seen through the lens of interpretability so far, wherein they offer transparency by inferring…

Computer Vision and Pattern Recognition · Computer Science 2025-12-09 Deepika SN Vemuri , Gautham Bellamkonda , Aditya Pola , Vineeth N Balasubramanian

Description Logics (DLs) are a family of knowledge representation formalisms mainly characterised by constructors to build complex concepts and roles from atomic ones. Expressive role constructors are important in many applications, but can…

Logic in Computer Science · Computer Science 2007-05-23 Ian Horrocks , Ulrike Sattler , Stephan Tobies

In this paper, we introduce the simulations and bisimulations on polarity-based semantics for non-distributive modal logic, which are natural generalizations of those notions on Kripke semantics for modal logic. We also generalize other…

Logic · Mathematics 2024-04-09 Yiwen Ding , Krishna Manoorkar , Mattia Panettiere , Ruoding Wang

We define a general notion of transition system where states and action labels can be from arbitrary nominal sets, actions may bind names, and state predicates from an arbitrary logic define properties of states. A Hennessy-Milner logic for…

Logic in Computer Science · Computer Science 2023-06-22 Joachim Parrow , Johannes Borgström , Lars-Henrik Eriksson , Ramūnas Forsberg Gutkovas , Tjark Weber

This paper presents complexity analysis and variational methods for inference in probabilistic description logics featuring Boolean operators, quantification, qualified number restrictions, nominals, inverse roles and role hierarchies.…

Artificial Intelligence · Computer Science 2012-05-14 Fabio Gagliardi Cozman , Rodrigo Bellizia Polastro

We study coupled logical bisimulation (CLB) to reason about contextual equivalence in the lambda-calculus. CLB originates in a work by Dal Lago, Sangiorgi and Alberti, as a tool to reason about a lambda-calculus with probabilistic…

Logic in Computer Science · Computer Science 2014-10-13 Ryan Kavanagh , Jean-Marie Madiot

This paper formulates and studies the concepts of approximate (alternating) bisimulation relations characterizing equivalence relations between interconnected systems and their abstractions. These equivalence relations guarantee that the…

Systems and Control · Electrical Eng. & Systems 2022-11-21 Belamfedel Alaoui Sadek , Saharsh , Pushpak Jagtap , Adnane Saoud

Interpretability methods in NLP aim to provide insights into the semantics underlying specific system architectures. Focusing on word embeddings, we present a supervised-learning method that, for a given domain (e.g., sports, professions),…

Computation and Language · Computer Science 2023-10-17 Natalia Flechas Manrique , Wanqian Bao , Aurelie Herbelot , Uri Hasson
‹ Prev 1 3 4 5 6 7 10 Next ›