Modeling argumentation based semantics using non-monotonic reasoning

Argumentation theory is an alternative style of formalizing non-monotonic reasoning. It seems, argumentation theory is a suitable framework for practical and uncertain reasoning, where arguments support conclusions. Dung's approach is an unifying framework which has played an influential role o...

ver descrição completa

Detalhes bibliográficos
Autores: Nieves, Juan Carlos, Cortés García, Claudio Ulises|||0000-0003-0192-3096, Osorio Galindo, Mauricio
Formato: informe técnico
Fecha de publicación:2005
País:España
Recursos:Universitat Politècnica de Catalunya (UPC)
Repositorio:UPCommons. Portal del coneixement obert de la UPC
Idioma:inglés
OAI Identifier:oai:upcommons.upc.edu:2117/85802
Acesso em linha:https://hdl.handle.net/2117/85802
Access Level:acceso abierto
Palavra-chave:Answer set programming
Argumentation based semantics
Logic programming
Àrees temàtiques de la UPC::Informàtica::Intel·ligència artificial
id ES_171b3a43d57a44304859cdafc2806140
oai_identifier_str oai:upcommons.upc.edu:2117/85802
network_acronym_str ES
network_name_str España
repository_id_str
spelling Modeling argumentation based semantics using non-monotonic reasoningNieves, Juan CarlosCortés García, Claudio Ulises|||0000-0003-0192-3096Osorio Galindo, MauricioAnswer set programmingArgumentation based semanticsLogic programmingÀrees temàtiques de la UPC::Informàtica::Intel·ligència artificialArgumentation theory is an alternative style of formalizing non-monotonic reasoning. It seems, argumentation theory is a suitable framework for practical and uncertain reasoning, where arguments support conclusions. Dung's approach is an unifying framework which has played an influential role on argumentation research and Artificial Intelligence. Even though the success of the argumentation theory, it seems that argumentation theory is so far from being efficiently implemented like the logic programming approach. We present a case of use of the well-known enumerate and eliminate approach to solve the decision problem of the admissible sets and the preferred semantics. By considering this approach, we identify a relationship between the decision problem of the Dung's preferred semantics and the decision problems of the value-based argumentation's preferred semantics. Moreover, we introduce an efficient, clear, and elegant methodology to implement Dung's approach based on the high-level representation of Answer Set Programming (ASP). This methodology is based on the definition of polynomial time mappings from an argumentation framework to logic programs. By using this methodology, we define a direct relationship between the preferred semantics and minimal models of logic programs. On the other hand, our methodology help us to define efficient extensions of the grounded semantics based on extensions of Well-Founded Semantics (WFS). We point out that our extensions of the grounded semantics offer some advantages to solve an open problem in argumentation based semantics.20052005-12-0120162016-04-18reporthttp://purl.org/coar/resource_type/c_93fcVoRhttp://purl.org/coar/version/c_970fb48d4fbd8a85info:eu-repo/semantics/reportapplication/pdfhttps://hdl.handle.net/2117/85802reponame:UPCommons. Portal del coneixement obert de la UPCinstname:Universitat Politècnica de Catalunya (UPC)Inglésengopen accesshttp://purl.org/coar/access_right/c_abf2info:eu-repo/semantics/openAccessoai:upcommons.upc.edu:2117/858022026-05-27T15:37:01Z
dc.title.none.fl_str_mv Modeling argumentation based semantics using non-monotonic reasoning
title Modeling argumentation based semantics using non-monotonic reasoning
spellingShingle Modeling argumentation based semantics using non-monotonic reasoning
Nieves, Juan Carlos
Answer set programming
Argumentation based semantics
Logic programming
Àrees temàtiques de la UPC::Informàtica::Intel·ligència artificial
title_short Modeling argumentation based semantics using non-monotonic reasoning
title_full Modeling argumentation based semantics using non-monotonic reasoning
title_fullStr Modeling argumentation based semantics using non-monotonic reasoning
title_full_unstemmed Modeling argumentation based semantics using non-monotonic reasoning
title_sort Modeling argumentation based semantics using non-monotonic reasoning
dc.creator.none.fl_str_mv Nieves, Juan Carlos
Cortés García, Claudio Ulises|||0000-0003-0192-3096
Osorio Galindo, Mauricio
author Nieves, Juan Carlos
author_facet Nieves, Juan Carlos
Cortés García, Claudio Ulises|||0000-0003-0192-3096
Osorio Galindo, Mauricio
author_role author
author2 Cortés García, Claudio Ulises|||0000-0003-0192-3096
Osorio Galindo, Mauricio
author2_role author
author
dc.subject.none.fl_str_mv Answer set programming
Argumentation based semantics
Logic programming
Àrees temàtiques de la UPC::Informàtica::Intel·ligència artificial
topic Answer set programming
Argumentation based semantics
Logic programming
Àrees temàtiques de la UPC::Informàtica::Intel·ligència artificial
description Argumentation theory is an alternative style of formalizing non-monotonic reasoning. It seems, argumentation theory is a suitable framework for practical and uncertain reasoning, where arguments support conclusions. Dung's approach is an unifying framework which has played an influential role on argumentation research and Artificial Intelligence. Even though the success of the argumentation theory, it seems that argumentation theory is so far from being efficiently implemented like the logic programming approach. We present a case of use of the well-known enumerate and eliminate approach to solve the decision problem of the admissible sets and the preferred semantics. By considering this approach, we identify a relationship between the decision problem of the Dung's preferred semantics and the decision problems of the value-based argumentation's preferred semantics. Moreover, we introduce an efficient, clear, and elegant methodology to implement Dung's approach based on the high-level representation of Answer Set Programming (ASP). This methodology is based on the definition of polynomial time mappings from an argumentation framework to logic programs. By using this methodology, we define a direct relationship between the preferred semantics and minimal models of logic programs. On the other hand, our methodology help us to define efficient extensions of the grounded semantics based on extensions of Well-Founded Semantics (WFS). We point out that our extensions of the grounded semantics offer some advantages to solve an open problem in argumentation based semantics.
publishDate 2005
dc.date.none.fl_str_mv 2005
2005-12-01
2016
2016-04-18
dc.type.none.fl_str_mv report
http://purl.org/coar/resource_type/c_93fc
VoR
http://purl.org/coar/version/c_970fb48d4fbd8a85
dc.type.openaire.fl_str_mv info:eu-repo/semantics/report
format report
dc.identifier.none.fl_str_mv https://hdl.handle.net/2117/85802
url https://hdl.handle.net/2117/85802
dc.language.none.fl_str_mv Inglés
eng
language_invalid_str_mv Inglés
language eng
dc.rights.none.fl_str_mv open access
http://purl.org/coar/access_right/c_abf2
dc.rights.openaire.fl_str_mv info:eu-repo/semantics/openAccess
rights_invalid_str_mv open access
http://purl.org/coar/access_right/c_abf2
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv application/pdf
dc.source.none.fl_str_mv reponame:UPCommons. Portal del coneixement obert de la UPC
instname:Universitat Politècnica de Catalunya (UPC)
instname_str Universitat Politècnica de Catalunya (UPC)
reponame_str UPCommons. Portal del coneixement obert de la UPC
collection UPCommons. Portal del coneixement obert de la UPC
repository.name.fl_str_mv
repository.mail.fl_str_mv
_version_ 1869403900342173696
score 15,301629

Registos relacionados