A logic programming framework for possibilistic argumentation: formalization and logical properties

In the last decade defeasible argumentation frameworks have evolved to become a sound setting to formalize commonsense, qualitative reasoning. The logic programming paradigm has shown to be particularly useful for developing different argument-based frameworks on the basis of different variants of l...

ver descrição completa

Detalhes bibliográficos
Autores: Alsinet, Teresa, Chesñevar, Carlos Iván, Godo i Lacasa, Lluís, Simari, Guillermo Ricardo
Formato: artículo
Estado:Versión enviada para evaluación y publicación
Fecha de publicación:2008
País:España
Recursos:Universitat de Lleida (UdL)
Repositorio:Repositori Obert UdL
OAI Identifier:oai:repositori.udl.cat:10459.1/46636
Acesso em linha:https://doi.org/10.1016/j.fss.2007.12.013
http://hdl.handle.net/10459.1/46636
Access Level:acceso abierto
Palavra-chave:Possibilistic logic
Vague knowledge
Defeasible argumentation
Intelligent systems
Programació lògica
id ES_ddda3623a38fde5b1a4f9f5e7c95781a
oai_identifier_str oai:repositori.udl.cat:10459.1/46636
network_acronym_str ES
network_name_str España
repository_id_str
spelling A logic programming framework for possibilistic argumentation: formalization and logical propertiesAlsinet, TeresaChesñevar, Carlos IvánGodo i Lacasa, LluísSimari, Guillermo RicardoPossibilistic logicVague knowledgeDefeasible argumentationIntelligent systemsProgramació lògicaIn the last decade defeasible argumentation frameworks have evolved to become a sound setting to formalize commonsense, qualitative reasoning. The logic programming paradigm has shown to be particularly useful for developing different argument-based frameworks on the basis of different variants of logic programming which incorporate defeasible rules. Most of such frameworks, however, are unable to deal with explicit uncertainty, nor with vague knowledge, as defeasibility is directly encoded in the object language. This paper presents Possibilistic Logic Programming (P-DeLP), a new logic programming language which combines features from argumentation theory and logic programming, incorporating as well the treatment of possibilistic uncertainty. Such features are formalized on the basis of PGL, a possibilistic logic based on G¨odel fuzzy logic. One of the applications of P-DeLP is providing an intelligent agent with non-monotonic, argumentative inference capabilities. In this paper we also provide a better understanding of such capabilities by defining two non-monotonic operators which model the expansion of a given program P by adding new weighed facts associated with argument conclusions and warranted literals, respectively. Different logical properties for the proposed operators are studiedElsevier2008info:eu-repo/semantics/articleinfo:eu-repo/semantics/submittedVersionhttps://doi.org/10.1016/j.fss.2007.12.013http://hdl.handle.net/10459.1/46636reponame:Repositori Obert UdL instname:Universitat de Lleida (UdL)InglésVersió preprint del document publicat a: https://doi.org/10.1016/j.fss.2007.12.013Fuzzy Sets and Systems, 2008, vol. 159, núm. 10, pàg. 1208-1228(c) Elsevier, 2008info:eu-repo/semantics/openAccessoai:repositori.udl.cat:10459.1/466362026-06-24T12:42:17Z
dc.title.none.fl_str_mv A logic programming framework for possibilistic argumentation: formalization and logical properties
title A logic programming framework for possibilistic argumentation: formalization and logical properties
spellingShingle A logic programming framework for possibilistic argumentation: formalization and logical properties
Alsinet, Teresa
Possibilistic logic
Vague knowledge
Defeasible argumentation
Intelligent systems
Programació lògica
title_short A logic programming framework for possibilistic argumentation: formalization and logical properties
title_full A logic programming framework for possibilistic argumentation: formalization and logical properties
title_fullStr A logic programming framework for possibilistic argumentation: formalization and logical properties
title_full_unstemmed A logic programming framework for possibilistic argumentation: formalization and logical properties
title_sort A logic programming framework for possibilistic argumentation: formalization and logical properties
dc.creator.none.fl_str_mv Alsinet, Teresa
Chesñevar, Carlos Iván
Godo i Lacasa, Lluís
Simari, Guillermo Ricardo
author Alsinet, Teresa
author_facet Alsinet, Teresa
Chesñevar, Carlos Iván
Godo i Lacasa, Lluís
Simari, Guillermo Ricardo
author_role author
author2 Chesñevar, Carlos Iván
Godo i Lacasa, Lluís
Simari, Guillermo Ricardo
author2_role author
author
author
dc.subject.none.fl_str_mv Possibilistic logic
Vague knowledge
Defeasible argumentation
Intelligent systems
Programació lògica
topic Possibilistic logic
Vague knowledge
Defeasible argumentation
Intelligent systems
Programació lògica
description In the last decade defeasible argumentation frameworks have evolved to become a sound setting to formalize commonsense, qualitative reasoning. The logic programming paradigm has shown to be particularly useful for developing different argument-based frameworks on the basis of different variants of logic programming which incorporate defeasible rules. Most of such frameworks, however, are unable to deal with explicit uncertainty, nor with vague knowledge, as defeasibility is directly encoded in the object language. This paper presents Possibilistic Logic Programming (P-DeLP), a new logic programming language which combines features from argumentation theory and logic programming, incorporating as well the treatment of possibilistic uncertainty. Such features are formalized on the basis of PGL, a possibilistic logic based on G¨odel fuzzy logic. One of the applications of P-DeLP is providing an intelligent agent with non-monotonic, argumentative inference capabilities. In this paper we also provide a better understanding of such capabilities by defining two non-monotonic operators which model the expansion of a given program P by adding new weighed facts associated with argument conclusions and warranted literals, respectively. Different logical properties for the proposed operators are studied
publishDate 2008
dc.date.none.fl_str_mv 2008
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.1016/j.fss.2007.12.013
http://hdl.handle.net/10459.1/46636
url https://doi.org/10.1016/j.fss.2007.12.013
http://hdl.handle.net/10459.1/46636
dc.language.none.fl_str_mv Inglés
language_invalid_str_mv Inglés
dc.relation.none.fl_str_mv Versió preprint del document publicat a: https://doi.org/10.1016/j.fss.2007.12.013
Fuzzy Sets and Systems, 2008, vol. 159, núm. 10, pàg. 1208-1228
dc.rights.none.fl_str_mv (c) Elsevier, 2008
info:eu-repo/semantics/openAccess
rights_invalid_str_mv (c) Elsevier, 2008
eu_rights_str_mv openAccess
dc.publisher.none.fl_str_mv Elsevier
publisher.none.fl_str_mv Elsevier
dc.source.none.fl_str_mv reponame:Repositori Obert UdL
instname:Universitat de Lleida (UdL)
instname_str Universitat de Lleida (UdL)
reponame_str Repositori Obert UdL
collection Repositori Obert UdL
repository.name.fl_str_mv
repository.mail.fl_str_mv
_version_ 1869421920775045120
score 15,198674