RP-DeLP: a weighted defeasible argumentation framework based on a recursive semantics

In this paper we first define a recursive semantics for warranted formulas in a general defeasible argumentation framework by formalizing a notion of collective (non-binary) conflict among arguments. The recursive semantics for warranted formulas is based on the fact that if the argument is rejected...

ver descrição completa

Detalhes bibliográficos
Autores: Alsinet, Teresa, Béjar Torres, Ramón, Godo i Lacasa, Lluís, Guitart Bravo, Francesc
Formato: artículo
Estado:Versión enviada para evaluación y publicación
Fecha de publicación:2016
País:España
Recursos:Varias* (Consorci de Biblioteques Universitáries de Catalunya, Centre de Serveis Científics i Acadèmics de Catalunya)
Repositorio:Recercat. Dipósit de la Recerca de Catalunya
OAI Identifier:oai:recercat.cat:10459.1/63092
Acesso em linha:https://doi.org/10.1093/logcom/exu008
http://hdl.handle.net/10459.1/63092
Access Level:acceso abierto
Palavra-chave:Defeasible reasoning
Recursive semantics
Collective conflict
id ES_569a9906de35b06c8a98425527cf0ded
oai_identifier_str oai:recercat.cat:10459.1/63092
network_acronym_str ES
network_name_str España
repository_id_str
spelling RP-DeLP: a weighted defeasible argumentation framework based on a recursive semanticsAlsinet, TeresaBéjar Torres, RamónGodo i Lacasa, LluísGuitart Bravo, FrancescDefeasible reasoningRecursive semanticsCollective conflictIn this paper we first define a recursive semantics for warranted formulas in a general defeasible argumentation framework by formalizing a notion of collective (non-binary) conflict among arguments. The recursive semantics for warranted formulas is based on the fact that if the argument is rejected, then all arguments built on it should also be rejected. The main characteristic of our recursive semantics is that an output (extension) of a knowledge base is a pair of sets of warranted and blocked formulas. Arguments for both warranted and blocked formulas are recursively based on warranted formulas but, while warranted formulas do not generate any collective conflict, blocked conclusions do. Formulas that are neither warranted nor blocked correspond to rejected formulas. Second we extend the general defeasible argumentation framework by attaching levels of preference to defeasible knowledge items and by providing a level-wise definition of warranted and blocked formulas. Third we formalize the warrant recursive semantics for the particular framework of Possibilistic Defeasible Logic Programming, we call this particular framework Recursive Possibilistic Defeasible Logic Programming (\mbox{RP-DeLP} for short), and we show its relevance in the scope of Political debates. An RP-DeLP program may have multiple outputs in case of circular definitions of conflicts among arguments. So, we tackle the problem of which output one should consider for an RP-DeLP program with multiple outputs. To this end we define the maximal ideal output of an RP-DeLP program as the set of conclusions which are ultimately warranted and we present an algorithm for computing them in polynomial space and with an upper bound on complexity equal to P^{NP}. Finally, we propose an efficient and scalable implementation of this algorithm that is based on implementing the two main queries of the system, looking for valid arguments and collective conflicts between arguments, using SAT encodings. We perform an experimental evaluation of our SAT based approach when solving test sets of instances with single and multiple preference levels for defeasible knowledge.The authors are very thankful to the anonymous reviewers for their helpful and constructive comments. This research was partially supported by the Spanish projects ARINF (TIN2009- 14704-C03-01), TASSAT (TIN2010-20967-C04-03), EdeTRI (TIN2012-39348-C02-01) and AT (CONSOLIDER- INGENIO 2010, CSD2007-00022).Oxford University Press2016info:eu-repo/semantics/articleinfo:eu-repo/semantics/submittedVersionapplication/pdfhttps://doi.org/10.1093/logcom/exu008http://hdl.handle.net/10459.1/63092reponame:Recercat. Dipósit de la Recerca de Catalunyainstname:Varias* (Consorci de Biblioteques Universitáries de Catalunya, Centre de Serveis Científics i Acadèmics de Catalunya)Inglésinfo:eu-repo/grantAgreement/MICINN//TIN2009-14704-C03-01info:eu-repo/grantAgreement/MICINN//TIN2010-20967-C04-03info:eu-repo/grantAgreement/MINECO//TIN2012-39348-C02-01Versió preprint del document publicat a https://doi.org/10.1093/logcom/exu008Journal of Logic and Computation, 2016, vol. 26, núm. 4, p. 1315-1360© The Author, 2014. Published by Oxford University Press, 2014info:eu-repo/semantics/openAccessoai:recercat.cat:10459.1/630922026-05-29T05:05:01Z
dc.title.none.fl_str_mv RP-DeLP: a weighted defeasible argumentation framework based on a recursive semantics
title RP-DeLP: a weighted defeasible argumentation framework based on a recursive semantics
spellingShingle RP-DeLP: a weighted defeasible argumentation framework based on a recursive semantics
Alsinet, Teresa
Defeasible reasoning
Recursive semantics
Collective conflict
title_short RP-DeLP: a weighted defeasible argumentation framework based on a recursive semantics
title_full RP-DeLP: a weighted defeasible argumentation framework based on a recursive semantics
title_fullStr RP-DeLP: a weighted defeasible argumentation framework based on a recursive semantics
title_full_unstemmed RP-DeLP: a weighted defeasible argumentation framework based on a recursive semantics
title_sort RP-DeLP: a weighted defeasible argumentation framework based on a recursive semantics
dc.creator.none.fl_str_mv Alsinet, Teresa
Béjar Torres, Ramón
Godo i Lacasa, Lluís
Guitart Bravo, Francesc
author Alsinet, Teresa
author_facet Alsinet, Teresa
Béjar Torres, Ramón
Godo i Lacasa, Lluís
Guitart Bravo, Francesc
author_role author
author2 Béjar Torres, Ramón
Godo i Lacasa, Lluís
Guitart Bravo, Francesc
author2_role author
author
author
dc.subject.none.fl_str_mv Defeasible reasoning
Recursive semantics
Collective conflict
topic Defeasible reasoning
Recursive semantics
Collective conflict
description In this paper we first define a recursive semantics for warranted formulas in a general defeasible argumentation framework by formalizing a notion of collective (non-binary) conflict among arguments. The recursive semantics for warranted formulas is based on the fact that if the argument is rejected, then all arguments built on it should also be rejected. The main characteristic of our recursive semantics is that an output (extension) of a knowledge base is a pair of sets of warranted and blocked formulas. Arguments for both warranted and blocked formulas are recursively based on warranted formulas but, while warranted formulas do not generate any collective conflict, blocked conclusions do. Formulas that are neither warranted nor blocked correspond to rejected formulas. Second we extend the general defeasible argumentation framework by attaching levels of preference to defeasible knowledge items and by providing a level-wise definition of warranted and blocked formulas. Third we formalize the warrant recursive semantics for the particular framework of Possibilistic Defeasible Logic Programming, we call this particular framework Recursive Possibilistic Defeasible Logic Programming (\mbox{RP-DeLP} for short), and we show its relevance in the scope of Political debates. An RP-DeLP program may have multiple outputs in case of circular definitions of conflicts among arguments. So, we tackle the problem of which output one should consider for an RP-DeLP program with multiple outputs. To this end we define the maximal ideal output of an RP-DeLP program as the set of conclusions which are ultimately warranted and we present an algorithm for computing them in polynomial space and with an upper bound on complexity equal to P^{NP}. Finally, we propose an efficient and scalable implementation of this algorithm that is based on implementing the two main queries of the system, looking for valid arguments and collective conflicts between arguments, using SAT encodings. We perform an experimental evaluation of our SAT based approach when solving test sets of instances with single and multiple preference levels for defeasible knowledge.
publishDate 2016
dc.date.none.fl_str_mv 2016
dc.type.none.fl_str_mv info:eu-repo/semantics/article
info:eu-repo/semantics/submittedVersion
format article
status_str submittedVersion
dc.identifier.none.fl_str_mv https://doi.org/10.1093/logcom/exu008
http://hdl.handle.net/10459.1/63092
url https://doi.org/10.1093/logcom/exu008
http://hdl.handle.net/10459.1/63092
dc.language.none.fl_str_mv Inglés
language_invalid_str_mv Inglés
dc.relation.none.fl_str_mv info:eu-repo/grantAgreement/MICINN//TIN2009-14704-C03-01
info:eu-repo/grantAgreement/MICINN//TIN2010-20967-C04-03
info:eu-repo/grantAgreement/MINECO//TIN2012-39348-C02-01
Versió preprint del document publicat a https://doi.org/10.1093/logcom/exu008
Journal of Logic and Computation, 2016, vol. 26, núm. 4, p. 1315-1360
dc.rights.none.fl_str_mv © The Author, 2014. Published by Oxford University Press, 2014
info:eu-repo/semantics/openAccess
rights_invalid_str_mv © The Author, 2014. Published by Oxford University Press, 2014
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv application/pdf
dc.publisher.none.fl_str_mv Oxford University Press
publisher.none.fl_str_mv Oxford University Press
dc.source.none.fl_str_mv reponame:Recercat. Dipósit de la Recerca de Catalunya
instname:Varias* (Consorci de Biblioteques Universitáries de Catalunya, Centre de Serveis Científics i Acadèmics de Catalunya)
instname_str Varias* (Consorci de Biblioteques Universitáries de Catalunya, Centre de Serveis Científics i Acadèmics de Catalunya)
reponame_str Recercat. Dipósit de la Recerca de Catalunya
collection Recercat. Dipósit de la Recerca de Catalunya
repository.name.fl_str_mv
repository.mail.fl_str_mv
_version_ 1869408391573536768
score 15.81155

Registos relacionados