English
Related papers

Related papers: Defeasible Reasoning on Concepts

200 papers

Defeasible logics provide several linguistic features to support the expression of defeasible knowledge. There is also a wide variety of such logics, expressing different intuitions about defeasible reasoning. However, the logics can only…

Logic in Computer Science · Computer Science 2021-02-16 Guido Governatori , Michael J. Maher

Building explainable systems is a critical problem in the field of Natural Language Processing (NLP), since most machine learning models provide no explanations for the predictions. Existing approaches for explainable machine learning…

Computation and Language · Computer Science 2019-06-12 Hui Liu , Qingyu Yin , William Yang Wang

Large Language Models (LLMs) apply uniform computation to all tokens, despite language exhibiting highly non-uniform information density. This token-uniform regime wastes capacity on locally predictable spans while under-allocating…

The class of defeasible logics is only vaguely defined -- it is defined by a few exemplars and the general idea of efficient reasoning with defeasible rules. The recent definition of the defeasible logic $DL(\partial_{||})$ introduced new…

Logic in Computer Science · Computer Science 2024-05-30 Michael J. Maher

Concept-Based Models (CBMs) are a class of deep learning models that provide interpretability by explaining predictions through high-level concepts. These models first predict concepts and then use them to perform a downstream task.…

Machine Learning · Computer Science 2025-06-27 David Debot , Pietro Barbiero , Gabriele Dominici , Giuseppe Marra

This is a system description for the OSCAR defeasible reasoner.

Artificial Intelligence · Computer Science 2007-05-23 John L. Pollock

Concise granule descriptions for definable granules and approaching descriptions for indefinable granules are challenging and important issues in granular computing. The concept with only common attributes has been intensively studied. To…

Artificial Intelligence · Computer Science 2022-01-10 Jianqin Zhou , Sichun Yang , Xifeng Wang , Wanquan Liu

Causal reasoning and compositional reasoning are two core aspirations in AI. Measuring the extent of these behaviors requires principled evaluation methods. We explore a unified perspective that considers both behaviors simultaneously,…

Computation and Language · Computer Science 2025-06-11 Jacqueline R. M. A. Maasch , Alihan Hüyük , Xinnuo Xu , Aditya V. Nori , Javier Gonzalez

Large language models (LLMs) are increasingly used in domains where causal reasoning matters, yet it remains unclear whether their judgments reflect normative causal computation, human-like shortcuts, or brittle pattern matching. We…

Artificial Intelligence · Computer Science 2026-03-16 Hanna M. Dettki , Charley M. Wu , Bob Rehder

Uncertainty in Logic Programming has been investigated during the last decades, dealing with various extensions of the classical LP paradigm and different applications. Existing proposals rely on different approaches, such as clause…

Logic in Computer Science · Computer Science 2011-01-17 Mario Rodríguez-Artalejo , Carlos A. Romero-Díaz

Causal reasoning is viewed as crucial for achieving human-level machine intelligence. Recent advances in language models have expanded the horizons of artificial intelligence across various domains, sparking inquiries into their potential…

Computation and Language · Computer Science 2024-05-02 Sirui Chen , Bo Peng , Meiqi Chen , Ruiqi Wang , Mengying Xu , Xingyu Zeng , Rui Zhao , Shengjie Zhao , Yu Qiao , Chaochao Lu

We address the problem of compiling defeasible theories to Datalog$^\neg$ programs. We prove the correctness of this compilation, for the defeasible logic $DL(\partial_{||})$, but the techniques we use apply to many other defeasible logics.…

Logic in Computer Science · Computer Science 2024-08-28 Michael J. Maher

Curriculum learning (CL), motivated by the intuition that learning in increasing order of difficulty should ease generalization, is commonly adopted both in pre-training and post-training of large language models (LLMs). The intuition of CL…

Computation and Language · Computer Science 2026-03-31 Maximilian Mordig , Andreas Opedal , Weiyang Liu , Bernhard Schölkopf

This paper introduces an approach to increasing the explainability of artificial intelligence (AI) systems by embedding Large Language Models (LLMs) within standardized analytical processes. While traditional explainable AI (XAI) methods…

Artificial Intelligence · Computer Science 2025-11-11 Marc Jansen , Marcel Pehlke

Recent advances in the intrinsic reasoning capabilities of large language models (LLMs) have given rise to LLM-based agent systems that exhibit near-human performance on a variety of automated tasks. However, although these systems share…

Artificial Intelligence · Computer Science 2025-08-26 Bingxi Zhao , Lin Geng Foo , Ping Hu , Christian Theobalt , Hossein Rahmani , Jun Liu

The concept bottleneck model (CBM) is an interpretable-by-design framework that makes decisions by first predicting a set of interpretable concepts, and then predicting the class label based on the given concepts. Existing CBMs are trained…

Computer Vision and Pattern Recognition · Computer Science 2024-08-06 Andong Tan , Fengtao Zhou , Hao Chen

The lack of transparency in the decision-making processes of deep learning systems presents a significant challenge in modern artificial intelligence (AI), as it impairs users' ability to rely on and verify these systems. To address this…

Artificial Intelligence · Computer Science 2024-11-18 David Debot , Pietro Barbiero , Francesco Giannini , Gabriele Ciravegna , Michelangelo Diligenti , Giuseppe Marra

Building software-driven systems that are easily understood becomes a challenge, with their ever-increasing complexity and autonomy. Accordingly, recent research efforts strive to aid in designing explainable systems. Nevertheless, a common…

Artificial Intelligence · Computer Science 2019-02-11 Dimitri Bohlender , Maximilian A. Köhl

While LLMs exhibit impressive fluency and factual recall, they struggle with robust causal reasoning, often relying on spurious correlations and brittle patterns. Similarly, traditional Reinforcement Learning agents also lack causal…

Machine Learning · Computer Science 2025-09-26 Abi Aryan , Zac Liu

Matching patients to clinical trials demands a systematic and reasoned interpretation of documents which require significant expert-level background knowledge, over a complex set of well-defined eligibility criteria. Moreover, this…

Computation and Language · Computer Science 2024-10-01 Mael Jullien , Alex Bogatu , Harriet Unsworth , Andre Freitas
‹ Prev 1 3 4 5 6 7 10 Next ›