DocumentCode :
1842127
Title :
MUS-based generation of arguments and counter-arguments
Author :
Besnard, Philippe ; Grégoire, Eric ; Piette, Cédric ; Raddaoui, Badran
Author_Institution :
IRIT-CNRS, Univ. de Toulouse, Toulouse, France
fYear :
2010
fDate :
4-6 Aug. 2010
Firstpage :
239
Lastpage :
244
Abstract :
Most of the approaches of computational argumentation define an argument as a pair consisting of premises and a conclusion, where the latter is entailed by the former. However, the matter of computing arguments and counter-arguments remains largely unsettled. We propose here a method to compute arguments and counter-arguments in the context of propositional logic, by using the concept of a MUS (Minimally Unsatisfiable Subset). The idea relies on the fact that reduction ad absurdum is valid in propositional logic: 〈Φ,α〉 is an argument induced from a knowledge base Δ iff Φ ∪ {¬α} is inconsistent. Therefore, if Φ ∪ {¬α} is a MUS of Δ ∪ {¬α} that contains ¬α then 〈Φ,α〉 is an argument from Δ. Not only do we present an algorithm that generates arguments, we also present an algorithm generating the complete argumentation tree induced by a given argument. We include a report on computational experimentations with both algorithms.
Keywords :
case-based reasoning; formal logic; MUS-based generation; argumentation tree; computational argumentation; counter-arguments; minimally unsatisfiable subset; propositional logic; reduction ad absurdum; Barium; Computational modeling; Decision making; Kernel; Knowledge based systems; Pediatrics; Random access memory; Argumentation; MUS;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Information Reuse and Integration (IRI), 2010 IEEE International Conference on
Conference_Location :
Las Vegas, NV
Print_ISBN :
978-1-4244-8097-5
Type :
conf
DOI :
10.1109/IRI.2010.5558935
Filename :
5558935
Link To Document :
بازگشت