English
Related papers

Related papers: Intuitions and the modelling of defeasible reasoni…

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

Nonmonotonic logics are usually characterized by the presence of some notion of 'conditional' that fails monotonicity. Research on nonmonotonic logics is therefore largely concerned with the defeasibility of argument forms and the…

Logic in Computer Science · Computer Science 2013-10-29 Katarina Britz , Ivan Varzinczak

In this paper, we provide more evidence for the contention that logical consequence should be understood in normative terms. Hartry Field and John MacFarlane covered the classical case. We extend their work, examining what it means for an…

Logic in Computer Science · Computer Science 2014-02-20 Julio Lemos

Dealing with uncertain, contradicting, and ambiguous information is still a central issue in Artificial Intelligence (AI). As a result, many formalisms have been proposed or adapted so as to consider non-monotonicity, with only a limited…

Artificial Intelligence · Computer Science 2023-11-15 Lucas Rizzo , Luca Longo

Defeasible reasoning is a kind of reasoning where some generalisations may not be valid in all circumstances, that is general conclusions may fail in some cases. Various formalisms have been developed to model this kind of reasoning, which…

Artificial Intelligence · Computer Science 2024-03-06 Gabriele Sacco , Loris Bozzato , Oliver Kutz

In two recent papers, I have proposed a description of decision analysis that differs from the Bayesian picture painted by Savage, Jeffrey and other classic authors. Response to this view has been either overly enthusiastic or unduly…

Artificial Intelligence · Computer Science 2013-04-08 Ronald P. Loui

Uncertainty may be taken to characterize inferences, their conclusions, their premises or all three. Under some treatments of uncertainty, the inferences itself is never characterized by uncertainty. We explore both the significance of…

Artificial Intelligence · Computer Science 2013-02-18 Henry E. Kyburg

Argumentation is a non-monotonic process. This reflects the fact that argumentation involves uncertain information, and so new information can cause a change in the conclusions drawn. However, the base logic does not need to be…

Artificial Intelligence · Computer Science 2018-09-05 Anthony Hunter

We extend the $ASPIC^+$ framework for structured argumentation so as to allow applications of the reasoning by cases inference scheme for defeasible arguments. Given an argument with conclusion `$A$ or $B$', an argument based on $A$ with…

Artificial Intelligence · Computer Science 2017-03-27 Mathieu Beirlaen , Jesse Heyninck , Christian Straßer

Defeasible reasoning is the mode of reasoning where conclusions can be overturned by taking into account new evidence. A commonly used method in cognitive science and logic literature is to handcraft argumentation supporting inference…

Computation and Language · Computer Science 2021-06-01 Aman Madaan , Dheeraj Rajagopal , Niket Tandon , Yiming Yang , Eduard Hovy

Recent technological advances have led to unprecedented amounts of generated data that originate from the Web, sensor networks and social media. Analytics in terms of defeasible reasoning - for example for decision making - could provide…

Logic in Computer Science · Computer Science 2021-02-16 Michael J. Maher , Ilias Tachmazidis , Grigoris Antoniou , Stephen Wade , Long Cheng

In this paper we analyse logic of false belief in intuitionistic setting. This logic, studied in its classical version by Steinsvold, Fan, Gilbert and Venturi, describes the following situation: a formula F is not satisfied in a given…

Logic · Mathematics 2020-12-16 Tomasz Witczak

Transparency is a fundamental requirement for decision making systems when these should be deployed in the real world. It is usually achieved by providing explanations of the system's behavior. A prominent and intuitive type of explanations…

Machine Learning · Computer Science 2021-07-23 André Artelt , Valerie Vaquet , Riza Velioglu , Fabian Hinder , Johannes Brinkrolf , Malte Schilling , Barbara Hammer

Since Austin introduced the term ``infelicity'', the linguistic literature has been flooded with its use, but no formal or computational explanation has been given for it. This thesis provides one for those infelicities that occur when a…

cmp-lg · Computer Science 2008-02-03 Daniel Marcu

This paper presents an extension of Defeasible Deontic Logic to deal with the Pragmatic Oddity problem. The logic applies three general principles: (1) the Pragmatic Oddity problem must be solved within a general logical treatment of CTD…

Logic in Computer Science · Computer Science 2022-09-13 Guido Governatori , Silvano Colombo Tosatto , Antonino Rotolo

In this paper we discuss contrastive explanations for formal argumentation - the question why a certain argument (the fact) can be accepted, whilst another argument (the foil) cannot be accepted under various extension-based semantics. The…

Artificial Intelligence · Computer Science 2022-01-26 AnneMarie Borg , Floris Bex

One main goal of argumentation theory is to evaluate arguments and to determine whether they should be accepted or rejected. When there is no clear answer, a third option, being undecided, has to be taken into account. Indecision is often…

Artificial Intelligence · Computer Science 2022-03-07 Daniela Schuster

Defeasible reasoning is the mode of reasoning where conclusions can be overturned by taking into account new evidence. Existing cognitive science literature on defeasible reasoning suggests that a person forms a mental model of the problem…

Artificial Intelligence · Computer Science 2021-10-26 Aman Madaan , Niket Tandon , Dheeraj Rajagopal , Peter Clark , Yiming Yang , Eduard Hovy

Defeasible logic is a rule-based nonmonotonic logic, with both strict and defeasible rules, and a priority relation on rules. We show that inference in the propositional form of the logic can be performed in linear time. This contrasts…

Artificial Intelligence · Computer Science 2009-09-29 Michael J. Maher

Defeasible conditionals are a form of non-monotonic inference which enable the expression of statements like "if $\phi$ then normally $\psi$". The KLM framework defines a semantics for the propositional case of defeasible conditionals by…

Artificial Intelligence · Computer Science 2025-04-25 Lucas Carr , Nicholas Leisegang , Thomas Meyer , Sergei Obiedkov
‹ Prev 1 2 3 10 Next ›