Computational Logic in Multi-Agent Systems

  • Wyner A
  • Bench-Capon T
  • Dunne P
N/ACitations
Citations of this article
59Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Abstract Argumentation Frameworks (afs) provide a fruitful basis for exploring issues of defeasible reasoning. Their power largely derives from the abstract nature of the arguments within the framework, where arguments are atomic nodes in an undifferentiated relation of attack. This abstraction conceals different conceptions of argument, and concrete instantiations encounter difficulties as a result of conflating these conceptions. We distinguish three distinct senses of the term. We provide an approach to instantiating AF in which the nodes are restricted to literals and rules, encoding the underlying theory directly. Arguments, in each of the three senses, then emerge from this framework as distinctive structures of nodes and paths. Our framework retains the theoretical and computational benefits of an abstract af, while keeping notions distinct which are conflated in other approaches to instantiation.

Cite

CITATION STYLE

APA

Wyner, A., Bench-Capon, T., & Dunne, P. (2013). Computational Logic in Multi-Agent Systems. Proceedings of 14th International Workshop on Computational Logic in Multi-Agent Systems (Vol. 8143). https://doi.org/10.1007/978-3-642-40624-9

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free