A Dialectical Proof Theory for Universal Acceptance in Coherent Logic-based Argumentation Frameworks - LIRMM - Laboratoire d’Informatique, de Robotique et de Microélectronique de Montpellier Access content directly
Conference Papers Year : 2016

A Dialectical Proof Theory for Universal Acceptance in Coherent Logic-based Argumentation Frameworks

Abstract

Given a logic-based argumentation framework built over a knowledge base in a logical language and a query in that language. The query is universally accepted if it is entailed from all extensions. As shown in [2, 14], universal acceptance is different from skeptical acceptance as a query may be entailed from different arguments distributed over all extensions but not necessarily skeptical ones. In this paper we provide a dialectical proof theory for universal acceptance in coherent logic-based argumentation frameworks. We prove its finiteness, soundness, completeness, consistency and study its dispute complexity. We give an exact characterization for non-universal acceptance and provide an upper-bound for universal acceptance.
Fichier principal
Vignette du fichier
Arioua-ECAI-2016_1.pdf (399.28 Ko) Télécharger le fichier
Origin Publisher files allowed on an open archive
Loading...

Dates and versions

lirmm-01333368 , version 1 (03-06-2020)

Licence

Identifiers

Cite

Abdallah Arioua, Madalina Croitoru. A Dialectical Proof Theory for Universal Acceptance in Coherent Logic-based Argumentation Frameworks. ECAI 2016 - 22nd European Conference on Artificial Intelligence, Aug 2016, The Hague, Netherlands. pp.55-63, ⟨10.3233/978-1-61499-672-9-55⟩. ⟨lirmm-01333368⟩
221 View
78 Download

Altmetric

Share

Gmail Mastodon Facebook X LinkedIn More