13,529 research outputs found
Some Supplementaries to The Counting Semantics for Abstract Argumentation
Dung's abstract argumentation framework consists of a set of interacting
arguments and a series of semantics for evaluating them. Those semantics
partition the powerset of the set of arguments into two classes: extensions and
non-extensions. In order to reason with a specific semantics, one needs to take
a credulous or skeptical approach, i.e. an argument is eventually accepted, if
it is accepted in one or all extensions, respectively. In our previous work
\cite{ref-pu2015counting}, we have proposed a novel semantics, called
\emph{counting semantics}, which allows for a more fine-grained assessment to
arguments by counting the number of their respective attackers and defenders
based on argument graph and argument game. In this paper, we continue our
previous work by presenting some supplementaries about how to choose the
damaging factor for the counting semantics, and what relationships with some
existing approaches, such as Dung's classical semantics, generic gradual
valuations. Lastly, an axiomatic perspective on the ranking semantics induced
by our counting semantics are presented.Comment: 8 pages, 3 figures, ICTAI 201
Preservation of Semantic Properties during the Aggregation of Abstract Argumentation Frameworks
An abstract argumentation framework can be used to model the argumentative
stance of an agent at a high level of abstraction, by indicating for every pair
of arguments that is being considered in a debate whether the first attacks the
second. When modelling a group of agents engaged in a debate, we may wish to
aggregate their individual argumentation frameworks to obtain a single such
framework that reflects the consensus of the group. Even when agents disagree
on many details, there may well be high-level agreement on important semantic
properties, such as the acceptability of a given argument. Using techniques
from social choice theory, we analyse under what circumstances such semantic
properties agreed upon by the individual agents can be preserved under
aggregation.Comment: In Proceedings TARK 2017, arXiv:1707.0825
A structured argumentation framework for detaching conditional obligations
We present a general formal argumentation system for dealing with the
detachment of conditional obligations. Given a set of facts, constraints, and
conditional obligations, we answer the question whether an unconditional
obligation is detachable by considering reasons for and against its detachment.
For the evaluation of arguments in favor of detaching obligations we use a
Dung-style argumentation-theoretical semantics. We illustrate the modularity of
the general framework by considering some extensions, and we compare the
framework to some related approaches from the literature.Comment: This is our submission to DEON 2016, including the technical appendi
A Framework for Combining Defeasible Argumentation with Labeled Deduction
In the last years, there has been an increasing demand of a variety of
logical systems, prompted mostly by applications of logic in AI and other
related areas. Labeled Deductive Systems (LDS) were developed as a flexible
methodology to formalize such a kind of complex logical systems. Defeasible
argumentation has proven to be a successful approach to formalizing commonsense
reasoning, encompassing many other alternative formalisms for defeasible
reasoning. Argument-based frameworks share some common notions (such as the
concept of argument, defeater, etc.) along with a number of particular features
which make it difficult to compare them with each other from a logical
viewpoint. This paper introduces LDSar, a LDS for defeasible argumentation in
which many important issues concerning defeasible argumentation are captured
within a unified logical framework. We also discuss some logical properties and
extensions that emerge from the proposed framework.Comment: 15 pages, presented at CMSRA Workshop 2003. Buenos Aires, Argentin
Argument-based Belief in Topological Structures
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 we use argumentation theory to single out the relevant sets of
evidence through which a notion of beliefs grounded on arguments is defined. We
discuss the formal properties of this newly defined notion, providing also a
formal language with a matching modality together with a sound and complete
axiom system for it. Despite the fact that our agent can combine her evidence
in a 'rational' way (captured via the topological structure), argument-based
beliefs are not closed under conjunction. This illustrates the difference
between an agent's reasoning abilities (i.e. the way she is able to combine her
available evidence) and the closure properties of her beliefs. We use this
point to argue for why the failure of closure under conjunction of belief
should not bear the burden of the failure of rationality.Comment: In Proceedings TARK 2017, arXiv:1707.0825
Reasoning about Action: An Argumentation - Theoretic Approach
We present a uniform non-monotonic solution to the problems of reasoning
about action on the basis of an argumentation-theoretic approach. Our theory is
provably correct relative to a sensible minimisation policy introduced on top
of a temporal propositional logic. Sophisticated problem domains can be
formalised in our framework. As much attention of researchers in the field has
been paid to the traditional and basic problems in reasoning about actions such
as the frame, the qualification and the ramification problems, approaches to
these problems within our formalisation lie at heart of the expositions
presented in this paper
- …