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

Abdallah Arioua 1, 2 Madalina Croitoru 1
1 GRAPHIK - Graphs for Inferences on Knowledge
LIRMM - Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier, CRISAM - Inria Sophia Antipolis - Méditerranée
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.
Document type :
Conference papers
Liste complète des métadonnées

https://hal-lirmm.ccsd.cnrs.fr/lirmm-01333368
Contributor : Abdallah Arioua <>
Submitted on : Friday, June 17, 2016 - 12:45:52 PM
Last modification on : Friday, March 29, 2019 - 9:12:10 AM

Identifiers

Collections

Citation

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

Share

Metrics

Record views

223