English
Related papers

Related papers: Dialectical Roots for Interest Prohibition Theory

200 papers

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

The problem of explaining inconsistency-tolerant reasoning in knowledge bases (KBs) is a prominent topic in Artificial Intelligence (AI). While there is some work on this problem, the explanations provided by existing approaches often lack…

Artificial Intelligence · Computer Science 2025-02-18 Loan Ho , Stefan Schlobach

In this paper we show how the defense relation among abstract arguments can be used to encode the reasons for accepting arguments. After introducing a novel notion of defenses and defense graphs, we propose a defense semantics together with…

Artificial Intelligence · Computer Science 2017-08-03 Beishui Liao , Leendert van der Torre

Abstract argumentation has emerged as a method for non-monotonic reasoning that has gained popularity in the symbolic artificial intelligence community. In the literature, the different approaches to abstract argumentation that were refined…

Artificial Intelligence · Computer Science 2021-01-11 Timotheus Kampik , Juan Carlos Nieves

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

One can argue that one of the main roles of the subject of statistics is to characterize what the evidence in collected data says about questions of scientific interest. There are two broad questions that we will refer to as the estimation…

Statistics Theory · Mathematics 2024-06-11 Michael Evans

We uncover a close relationship between combinatorial and syntactic proofs for first-order logic (without equality). Whereas syntactic proofs are formalized in a deductive proof system based on inference rules, a combinatorial proof is a…

Logic in Computer Science · Computer Science 2021-04-28 Dominic Hughes , Lutz Straßburger , Jui-Hsuan Wu

This paper introduces the axiom of Negative Dominance, stating that if a lottery $f$ is strictly preferred to a lottery $g$, then some outcome in the support of $f$ is strictly preferred to some outcome in the support of $g$. It is shown…

Theoretical Economics · Economics 2023-11-16 Harvey Lederman

The purpose of this paper is to show that the use of heavy-tailed distributions in Financial problems is theoretically baseless and can lead to significant misunderstandings. The reason for this the authors see in an incorrect…

Probability · Mathematics 2015-07-29 Lev B Klebanov , Irina V Volchenkova

The logic of bunched implication BI provides a framework for reasoning about resource composition and forms the basis for an assertion language of separation logic which is used to reason about software programs. Propositional BI is…

Logic in Computer Science · Computer Science 2026-01-06 Revantha Ramanayake

The paper studies a cluster of systems for fully disquotational truth based on the restriction of initial sequents. Unlike well-known alternative approaches, such systems display both a simple and intuitive model theory and remarkable…

Logic · Mathematics 2020-06-30 Carlo Nicolai

We are aiming at a semantics of logic programs with preferences defined on rules, which always selects a preferred answer set, if there is a non-empty set of (standard) answer sets of the given program. It is shown in a seminal paper by…

Logic in Computer Science · Computer Science 2011-09-05 Jan Sefranek , Alexander Simko

In Part I of this work we defined a generalization of the concept of effective resistance to directed graphs, and we explored some of the properties of this new definition. Here, we use the theory developed in Part I to compute effective…

Optimization and Control · Mathematics 2013-10-23 George Forrest Young , Luca Scardovi , Naomi Ehrich Leonard

An approach to reasoning with default rules where the proportion of exceptions, or more generally the probability of encountering an exception, can be at least roughly assessed is presented. It is based on local uncertainty propagation…

Artificial Intelligence · Computer Science 2013-03-26 Stephane Amarger , Didier Dubois , Henri Prade

This paper is an original attempt to understand the foundations of economic reasoning. It endeavors to rigorously define the relationship between subjective interpretations and objective valuations of such interpretations in the context of…

Logic in Computer Science · Computer Science 2024-05-20 Daniel Lu

In this paper we propose an extension of Defeasible Logic to represent and compute three concepts of defeasible permission. In particular, we discuss different types of explicit permissive norms that work as exceptions to opposite…

Logic in Computer Science · Computer Science 2022-09-13 Guido Governatori , Francesco Olivieri , Antonino Rotolo , Simone Scannapieco

Sub-sub-intuitionistic logic is obtained from intuitionistic logic by weakening the implication and removing distributivity. It can alternatively be viewed as conditional weak positive logic. We provide semantics for sub-sub-intuitionistic…

Logic · Mathematics 2024-08-23 Jonte Deakin , Jim de Groot

Humans currently use arguments for explaining choices which are already made, or for evaluating potential choices. Each potential choice has usually pros and cons of various strengths. In spite of the usefulness of arguments in a decision…

Artificial Intelligence · Computer Science 2012-07-19 Leila Amgoud , Henri Prade

A logic calculus is presented that is a conservative extension of linear logic. The motivation beneath this work concerns lazy evaluation, true concurrency and interferences in proof search. The calculus includes two new connectives to deal…

Logic in Computer Science · Computer Science 2007-06-25 Christophe Fouqueré

We introduce matrix and its block to the Dung's theory of argumentation framework. It is showed that each argumentation framework has a matrix representation, and the indirect attack relation and indirect defence relation can be…

Artificial Intelligence · Computer Science 2011-10-21 Xu Yuming