dc.creatorAlsinet, Teresa
dc.creatorChesñevar, Carlos Iván
dc.creatorGodo, Lluís
dc.creatorSimari, Guillermo Ricardo
dc.date.accessioned2019-05-08T20:23:14Z
dc.date.accessioned2022-10-15T10:41:50Z
dc.date.available2019-05-08T20:23:14Z
dc.date.available2022-10-15T10:41:50Z
dc.date.created2019-05-08T20:23:14Z
dc.date.issued2008-05-16
dc.identifierAlsinet, Teresa; Chesñevar, Carlos Iván; Godo, Lluís; Simari, Guillermo Ricardo; A logic programming framework for possibilistic argumentation: Formalization and logical properties; Elsevier Science; Fuzzy Sets and Systems; 159; 10; 16-5-2008; 1208-1228
dc.identifier0165-0114
dc.identifierhttp://hdl.handle.net/11336/75911
dc.identifierCONICET Digital
dc.identifierCONICET
dc.identifier.urihttps://repositorioslatinoamericanos.uchile.cl/handle/2250/4376800
dc.description.abstractIn 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 both explicit uncertainty and vague knowledge, as defeasibility is directly encoded in the object language. This paper presents possibilistic defeasible 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ödel 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 by adding new weighed facts associated with argument conclusions and warranted literals, respectively. Different logical properties for the proposed operators are studied.
dc.languageeng
dc.publisherElsevier Science
dc.relationinfo:eu-repo/semantics/altIdentifier/url/https://www.sciencedirect.com/science/article/pii/S0165011407005337
dc.relationinfo:eu-repo/semantics/altIdentifier/doi/http://dx.doi.org/10.1016/j.fss.2007.12.013
dc.rightshttps://creativecommons.org/licenses/by-nc-sa/2.5/ar/
dc.rightsinfo:eu-repo/semantics/restrictedAccess
dc.subjectDEFEASIBLE ARGUMENTATION
dc.subjectINTELLIGENT SYSTEMS
dc.subjectPOSSIBILISTIC LOGIC
dc.subjectVAGUE KNOWLEDGE
dc.titleA logic programming framework for possibilistic argumentation: Formalization and logical properties
dc.typeinfo:eu-repo/semantics/article
dc.typeinfo:ar-repo/semantics/artículo
dc.typeinfo:eu-repo/semantics/publishedVersion


Este ítem pertenece a la siguiente institución