English
Related papers

Related papers: Defense semantics of argumentation: encoding reaso…

200 papers

We endow prioritised default logic (PDL) with argumentation semantics using the ASPIC+ framework for structured argumentation, and prove that the conclusions of the justified arguments are exactly the prioritised default extensions.…

Artificial Intelligence · Computer Science 2015-07-02 Anthony P. Young , Sanjay Modgil , Odinaldo Rodrigues

Recent works have empirically shown that there exist adversarial examples that can be hidden from neural network interpretability (namely, making network interpretation maps visually similar), or interpretability is itself susceptible to…

Machine Learning · Computer Science 2020-10-23 Akhilan Boopathy , Sijia Liu , Gaoyuan Zhang , Cynthia Liu , Pin-Yu Chen , Shiyu Chang , Luca Daniel

Recent papers in explainable AI have made a compelling case for counterfactual modes of explanation. While counterfactual explanations appear to be extremely effective in some instances, they are formally equivalent to adversarial examples.…

Artificial Intelligence · Computer Science 2020-12-21 Kieran Browne , Ben Swift

Gradual semantics within abstract argumentation associate a numeric score with every argument in a system, which represents the level of acceptability of this argument, and from which a preference ordering over arguments can be derived.…

Artificial Intelligence · Computer Science 2022-03-03 Nir Oren , Bruno Yun , Assaf Libman , Murilo S. Baptista

This paper combines two studies: a topological semantics for epistemic notions and abstract argumentation theory. In our combined setting, we use a topological semantics to represent the structure of an agent's collection of evidence, and…

Artificial Intelligence · Computer Science 2017-07-28 Chenwei Shi , Sonja Smets , Fernando R. Velázquez-Quesada

Structural measures of graphs, such as treewidth, are central tools in computational complexity resulting in efficient algorithms when exploiting the parameter. It is even known that modern SAT solvers work efficiently on instances of small…

Artificial Intelligence · Computer Science 2025-11-17 Yasir Mahmood , Markus Hecher , Johanna Groven , Johannes K. Fichte

In this paper, we compose a new task for deep argumentative structure analysis that goes beyond shallow discourse structure analysis. The idea is that argumentative relations can reasonably be represented with a small set of predefined…

Computation and Language · Computer Science 2017-12-08 Paul Reisert , Naoya Inoue , Naoaki Okazaki , Kentaro Inui

We introduce a new semantics for justification logic based on subset relations. Instead of using the established and more symbolic interpretation of justifications, we model justifications as sets of possible worlds. We introduce a new…

Logic · Mathematics 2020-08-19 Eveline Lehmann , Thomas Studer

Attack trees and attack graphs are both common graphical threat models used by organizations to better understand possible cybersecurity threats. These models have been primarily seen as separate entities, to be used and researched in…

Cryptography and Security · Computer Science 2021-10-07 Nathan Daniel Schiele , Olga Gadyatskaya

In this article, we present a novel approach for parsing argumentation structures. We identify argument components using sequence labeling at the token level and apply a new joint model for detecting argumentation structures. The proposed…

Computation and Language · Computer Science 2016-07-25 Christian Stab , Iryna Gurevych

Justification theory is a unifying framework for semantics of non-monotonic logics. It is built on the notion of a justification, which intuitively is a graph that explains the truth value of certain facts in a structure. Knowledge…

Logic in Computer Science · Computer Science 2019-05-16 Simon Marynissen

In this paper we propose a general approach to define a many-valued preferential interpretation of gradual argumentation semantics. The approach allows for conditional reasoning over arguments and boolean combination of arguments, with…

Artificial Intelligence · Computer Science 2025-06-10 Mario Alviano , Laura Giordano , Daniele Theseider Dupré

Many proofs in discrete mathematics and theoretical computer science are based on the probabilistic method. To prove the existence of a good object, we pick a random object and show that it is bad with low probability. This method is…

Information Theory · Computer Science 2017-08-01 Pat Morin , Wolfgang Mulzer , Tommy Reddad

Argumentation is the process of constructing arguments about propositions, and the assignment of statements of confidence to those propositions based on the nature and relative strength of their supporting arguments. The process is modelled…

Artificial Intelligence · Computer Science 2013-03-08 John Fox , Paul J. Krause , Morten Elvang-Gøransson

Recent e-graph applications have typically considered concrete semantics of expressions, where the notion of equivalence stems from concrete interpretation of expressions. However, equivalences that hold over one interpretation may not hold…

Logic in Computer Science · Computer Science 2022-03-30 Samuel Coward , George A. Constantinides , Theo Drane

This paper introduces a differentiable semantic reasoner, where rules are presented as a relevant set of graph transformations. These rules can be written manually or inferred by a set of facts and goals presented as a training set. While…

Artificial Intelligence · Computer Science 2021-10-26 Alberto Cetoli

Much like admissibility is the key concept underlying preferred semantics, strong admissibility is the key concept underlying grounded semantics, as membership of a strongly admissible set is sufficient to show membership of the grounded…

Artificial Intelligence · Computer Science 2022-04-08 Martin Caminada , Sri Harikrishnan

Framing involves the positive or negative presentation of an argument or issue depending on the audience and goal of the speaker (Entman 1983). Differences in lexical framing, the focus of our work, can have large effects on peoples'…

Computation and Language · Computer Science 2021-04-13 Tuhin Chakrabarty , Christopher Hidey , Smaranda Muresan

Abstract dialectical frameworks (ADFs) have been introduced as a formalism for modeling and evaluating argumentation allowing general logical satisfaction conditions. Different criteria used to settle the acceptance of arguments are called…

Artificial Intelligence · Computer Science 2020-12-14 Atefeh Keshavarzi Zafarghandi , Rineke Verbrugge , Bart Verheij

An abstract argumentation framework is a commonly used formalism to provide a static representation of a dialogue. However, the order of enunciation of the arguments in an argumentative dialogue is very important and can affect the outcome…

Artificial Intelligence · Computer Science 2024-10-01 Yann Munro , Camilo Sarmiento , Isabelle Bloch , Gauvain Bourgne , Catherine Pelachaud , Marie-Jeanne Lesot