Semantic-based construction of arguments: an answer set programming approach
2015 (English)In: International Journal of Approximate Reasoning, ISSN 0888-613X, E-ISSN 1873-4731, Vol. 64, 54-74 p.Article in journal (Refereed) Published
In this paper, we introduce an argumentation approach which takes an extended logic program as input and gives a set of arguments with the respective disagreements among them as output. We establish the notion of an argument under the Well-Founded semantics and Stable semantics inferences, allowing us to identify arguments with stratified programs as support, even when the input for the argument engine is a non-stratified program. We propose a set of rationality postulates for argument-based systems under extended logic programs, which are based on a definition of closure for a set of clauses that consider the well-known Gelfond-Lifschitz reduction. We establish the conditions under which our approach satisfies these principles. In addition, we present a standalone argumentation-tool based on the XSB system which implements our argumentation approach.
Place, publisher, year, edition, pages
Elsevier, 2015. Vol. 64, 54-74 p.
Argumentation, Logic programming, Well-founded semantics, Argumentation tools, Stable model semantics, Answer set programming
IdentifiersURN: urn:nbn:se:umu:diva-101451DOI: 10.1016/j.ijar.2015.06.009ISI: 000359175800004OAI: oai:DiVA.org:umu-101451DiVA: diva2:799300