Abductive reasoning

About: Abductive reasoning is a research topic. Over the lifetime, 1917 publications have been published within this topic receiving 44645 citations. The topic is also known as: abduction & abductive inference.

Did he jump or was he pushed?: abductive practical reasoning

Abstract: In this paper, we present a particular role for abductive reasoning in law by applying it in the context of an argumentation scheme for practical reasoning. We present a particular scheme, based on an established scheme for practical reasoning, that can be used to reason abductively about how an agent might have acted to reach a particular scenario, and the motivations for doing so. Plausibility here depends on a satisfactory explanation of why this particular agent followed these motivations in the particular situation. The scheme is given a formal grounding in terms of action-based alternating transition systems and we illustrate the approach with a running legal example.

Upside-down meta-interpretation of the model elimination theorem-proving procedure for deduction and abduction

Abstract: Typical bottom-up, forward-chaining reasoning systems such as hyperresolution lack goaldirectedness, while typical top-down, backward-chaining reasoning systems like Prolog or model elimination repeatedly solve the same goals. Reasoning systems that are goal-directed and avoid repeatedly solving the same goals can be constructed by formulating the top-down methods meta-theoretically for execution by a bottom-up reasoning system (hence, we use the term upside-down meta-interpretation). This formulation also facilitates the use of flexible search strategies, such as merit-ordered search, that are common to bottom-up reasoning systems. The model elimination theorem-proving procedure, its extension by an assumption rule for abduction, and its restriction to Horn clauses are adapted here for such upside-down meta-interpretation. This work can be regarded as an extension of the magic-sets or Alexander method for query evaluation in deductive databases to both non-Horn clauses and abductive reasoning.

REVISE: An Extended Logic Programming System for Revising Knowledge Bases

Abstract: In this paper we describe REVISE, an extended logic programming system for revising knowledge bases. REVISE is based on logic programming with explicit negation, plus a two-valued assumption revision to face contradiction, encompasses the notion of preference levels. Its reliance on logic programming allows efficient computation and declarativity, whilst its use of explicit negation, revision and preference levels enables modeling of a variety of problems including default reasoning, belief revision and model-based reasoning. It has been implemented as a Prolog-meta interpreter and tested on a spate of examples, namely the representation of diagnosis strategies in modelbased reasoning systems.

Case-based reasoning: An introduction

Abstract: Case-based reasoning is a method of solving a current problem by studying the solutions to previous, similar problems. This article presents an introduction to the case-based reasoning process, including an example of the creation and consultation use of the case base. Construction tools for case-based reasoning are identified, and key concepts in case-based reasoning are discussed.