31,520 research outputs found
Initial Sets in Abstract Argumentation Frameworks
Dung’s abstract argumentation provides us with a general framework to deal with argumentation, non-monotonic reasoning and logic programming. For the extension-based semantics, one of the basic principles is I-maximality which is in particular related with the notion of skeptical justification. Another one is directionality which can be employed for the study of dynamics of argumentation. In this paper, we introduce two new extension-based semantics into Dung’s abstract argumentation, called grounded-like semantics and initial semantics which satisfy the I-maximality and directionality principles. The initial semantics has many good properties and can be expected to play a central role in studying other extension-based semantics, such as admissible, complete and preferred semantics
Abstract Argumentation / Persuasion / Dynamics
The act of persuasion, a key component in rhetoric argumentation, may be
viewed as a dynamics modifier. We extend Dung's frameworks with acts of
persuasion among agents, and consider interactions among attack, persuasion and
defence that have been largely unheeded so far. We characterise basic notions
of admissibilities in this framework, and show a way of enriching them through,
effectively, CTL (computation tree logic) encoding, which also permits
importation of the theoretical results known to the logic into our
argumentation frameworks. Our aim is to complement the growing interest in
coordination of static and dynamic argumentation.Comment: Arisaka R., Satoh K. (2018) Abstract Argumentation / Persuasion /
Dynamics. In: Miller T., Oren N., Sakurai Y., Noda I., Savarimuthu B., Cao
Son T. (eds) PRIMA 2018: Principles and Practice of Multi-Agent Systems.
PRIMA 2018. Lecture Notes in Computer Science, vol 11224. Springer, Cha
Extension-based Semantics of Abstract Dialectical Frameworks
One of the most prominent tools for abstract argumentation is the Dung's
framework, AF for short. It is accompanied by a variety of semantics including
grounded, complete, preferred and stable. Although powerful, AFs have their
shortcomings, which led to development of numerous enrichments. Among the most
general ones are the abstract dialectical frameworks, also known as the ADFs.
They make use of the so-called acceptance conditions to represent arbitrary
relations. This level of abstraction brings not only new challenges, but also
requires addressing existing problems in the field. One of the most
controversial issues, recognized not only in argumentation, concerns the
support cycles. In this paper we introduce a new method to ensure acyclicity of
the chosen arguments and present a family of extension-based semantics built on
it. We also continue our research on the semantics that permit cycles and fill
in the gaps from the previous works. Moreover, we provide ADF versions of the
properties known from the Dung setting. Finally, we also introduce a
classification of the developed sub-semantics and relate them to the existing
labeling-based approaches.Comment: To appear in the Proceedings of the 15th International Workshop on
Non-Monotonic Reasoning (NMR 2014
Improved Answer-Set Programming Encodings for Abstract Argumentation
The design of efficient solutions for abstract argumentation problems is a
crucial step towards advanced argumentation systems. One of the most prominent
approaches in the literature is to use Answer-Set Programming (ASP) for this
endeavor. In this paper, we present new encodings for three prominent
argumentation semantics using the concept of conditional literals in
disjunctions as provided by the ASP-system clingo. Our new encodings are not
only more succinct than previous versions, but also outperform them on standard
benchmarks.Comment: To appear in Theory and Practice of Logic Programming (TPLP),
Proceedings of ICLP 201
- …