English
Related papers

Related papers: Why not? Developing ABox Abduction beyond Repairs

200 papers

`All models are wrong but some are useful' (George Box 1979). But, how to find those useful ones starting from an imperfect model? How to make informed data-driven decisions equipped with an imperfect model? These fundamental questions…

Econometrics · Economics 2023-03-09 Subhadeep , Mukhopadhyay

With the increased use of ontologies in semantically-enabled applications, the issue of debugging defects in ontologies has become increasingly important. These defects can lead to wrong or incomplete results for the applications. Debugging…

Artificial Intelligence · Computer Science 2023-11-13 Patrick Lambrix , Zlatan Dragisic , Valentina Ivanova

Biabduction-based shape analysis is a compositional verification and analysis technique that can prove memory safety in the presence of complex, linked data structures. Despite its usefulness, several open problems persist for this kind of…

Logic in Computer Science · Computer Science 2025-02-17 Florian Sextl , Adam Rogalewicz , Tomáš Vojnar , Florian Zuleger

Description Logic Knowledge and Action Bases (KABs) have been recently introduced as a mechanism that provides a semantically rich representation of the information on the domain of interest in terms of a DL KB and a set of actions to…

Artificial Intelligence · Computer Science 2013-04-25 Diego Calvanese , Evgeny Kharlamov , Marco Montali , Ario Santoso , Dmitriy Zheleznyakov

General-purpose knowledge bases (KBs) are a cornerstone of knowledge-centric AI. Many of them are constructed pragmatically from Web sources, and are thus far from complete. This poses challenges for the consumption as well as the curation…

Artificial Intelligence · Computer Science 2023-12-07 Simon Razniewski , Hiba Arnaout , Shrestha Ghosh , Fabian Suchanek

The paper proposes a new static analysis designed to handle open programs, i.e., fragments of programs, with dynamic pointer-linked data structures - in particular, various kinds of lists - that employ advanced low-level pointer operations.…

Logic in Computer Science · Computer Science 2022-05-06 Lukáš Holík , Petr Peringer , Adam Rogalewicz , Veronika Šoková , Tomáš Vojnar , Florian Zuleger

Abductive reasoning aims to find plausible explanations for an event. This style of reasoning is critical for commonsense tasks where there are often multiple plausible explanations. Existing approaches for abductive reasoning in natural…

Computation and Language · Computer Science 2023-05-25 Wenting Zhao , Justin T. Chiu , Claire Cardie , Alexander M. Rush

Counterfactual reasoning, a hallmark of intelligence, consists of three steps: inferring latent variables from observations (abduction), constructing alternatives (interventions), and predicting their outcomes (prediction). This skill is…

Machine Learning · Computer Science 2025-10-03 Aniket Vashishtha , Qirun Dai , Hongyuan Mei , Amit Sharma , Chenhao Tan , Hao Peng

Knowledge Bases (KBs) require constant up-dating to reflect changes to the world they represent. For general purpose KBs, this is often done through Relation Extraction (RE), the task of predicting KB relations expressed in text mentioning…

Computation and Language · Computer Science 2019-05-13 Peng Xu , Denilson Barbosa

The Game Description Language (GDL) is a widely used formalism for specifying the rules of general games. Writing correct GDL descriptions can be challenging, especially for non-experts. Automated theorem proving has been proposed to assist…

Logic in Computer Science · Computer Science 2025-08-15 Yifan He , Munyque Mittelmann , Aniello Murano , Abdallah Saffidine , Michael Thielscher

In this paper we explore a unifying approach --- that of hypotheses assumption --- as a means to provide a semantics for all Normal Logic Programs (NLPs), the Minimal Hypotheses (MH) semantics. This semantics takes a positive hypotheses…

Logic in Computer Science · Computer Science 2011-08-31 Alexandre Miguel Pinto , Luś Moniz Pereira

The Boolean satisfiability problem (SAT) is a well-known example of monotonic reasoning, of intense practical interest due to fast solvers, complemented by rigorous fine-grained complexity results. However, for non-monotonic reasoning,…

Computational Complexity · Computer Science 2025-05-16 Victor Lagerkvist , Mohamed Maizia , Johannes Schmidt

This paper presents a method of computing a revision of a function-free normal logic program. If an added rule is inconsistent with a program, that is, if it leads to a situation such that no stable model exists for a new program, then…

Artificial Intelligence · Computer Science 2007-05-23 Ken Satoh

As machine learning is increasingly used to inform consequential decision-making (e.g., pre-trial bail and loan approval), it becomes important to explain how the system arrived at its decision, and also suggest actions to achieve a…

Machine Learning · Computer Science 2020-10-09 Amir-Hossein Karimi , Bernhard Schölkopf , Isabel Valera

Abductive Learning (ABL) integrates machine learning with logical reasoning in a loop: a learning model predicts symbolic concept labels from raw inputs, which are revised through abduction using domain knowledge and then fed back for…

Machine Learning · Computer Science 2025-10-31 Wen-Chao Hu , Qi-Jie Li , Lin-Han Jia , Cunjing Ge , Yu-Feng Li , Yuan Jiang , Zhi-Hua Zhou

Large Language Models (LLMs) enhanced with retrieval -- commonly referred to as Retrieval-Augmented Generation (RAG) -- have demonstrated strong performance in knowledge-intensive tasks. However, RAG pipelines often fail when retrieved…

Computation and Language · Computer Science 2025-11-07 Shiyin Lin

Description logics (DL) are a family of formal languages for representing and reasoning about structured knowledge in terms of concepts and their relationships. A central reasoning problem in DL is concept subsumption. Although this problem…

Logic in Computer Science · Computer Science 2026-05-14 Michał Henne , Barbara Morawska , Paweł Parys

A growing body of work makes use of probing to investigate the working of neural models, often considered black boxes. Recently, an ongoing debate emerged surrounding the limitations of the probing paradigm. In this work, we point out the…

Computation and Language · Computer Science 2021-02-22 Yanai Elazar , Shauli Ravfogel , Alon Jacovi , Yoav Goldberg

Current discussions of "Explainable AI" (XAI) do not much consider the role of abduction in explanatory reasoning (see Mueller, et al., 2018). It might be worthwhile to pursue this, to develop intelligent systems that allow for the…

Artificial Intelligence · Computer Science 2020-10-02 Robert R. Hoffman , William J. Clancey , Shane T. Mueller

The aim of this paper is to introduce a new framework for defining abductive reasoning operators based on a notion of retraction in arbitrary logics defined as satisfaction systems. We show how this framework leads to the design of…

Artificial Intelligence · Computer Science 2018-03-06 Marc Aiguier , Jamal Atif , Isabelle Bloch , Ramón Pino-Pérez
‹ Prev 1 3 4 5 6 7 10 Next ›