Introducing equational semantics for argumentation networks

Dov M. Gabbay

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

20 Scopus citations

Abstract

This paper provides equational semantics for Dung's argumentation networks. The network nodes get numerical values in [0,1], and are supposed to satisfy certain equations. The solutions to these equations correspond to the "extensions" of the network. This approach is very general and includes the Caminada labelling as a special case, as well as many other so-called network extensions, support systems, higher level attacks, Boolean networks, dependence on time, etc, etc. The equational approach has its conceptual roots in the 19th century following the algebraic equational approach to logic by George Boole, Louis Couturat and Ernst Schroeder.

Original languageEnglish
Title of host publicationSymbolic and Quantitative Approaches to Reasoning with Uncertainty - 11th European Conference, ECSQARU 2011, Proceedings
Pages19-35
Number of pages17
DOIs
StatePublished - 2011
Event11th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty, ECSQARU 2011 - Belfast, United Kingdom
Duration: 29 Jun 20111 Jul 2011

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume6717 LNAI
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference11th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty, ECSQARU 2011
Country/TerritoryUnited Kingdom
CityBelfast
Period29/06/111/07/11

Fingerprint

Dive into the research topics of 'Introducing equational semantics for argumentation networks'. Together they form a unique fingerprint.

Cite this