English   español  
Please use this identifier to cite or link to this item: http://hdl.handle.net/10261/131939
Share/Impact:
Statistics
logo share SHARE   Add this article to your Mendeley library MendeleyBASE

Visualizar otros formatos: MARC | Dublin Core | RDF | ORE | MODS | METS | DIDL
Exportar a otros formatos:

Title

On the Characterization of the Maximal Ideal Recursive Semantics of RP-DeLP

AuthorsAlsinet, Teresa; Bejar, Ramon; Godo, Lluis ; Guitart, Francesc
KeywordsArgumentation, Logic programming, Uncertainty, Non-monotonic inference
Issue Date22-Oct-2014
PublisherIOS Press
CitationFrontiers in Artificial Intelligence and Applications 17th International Conference of the Catalan Association for Artificial Intelligence, CCIA 2014; Barcelona; Spain; 22 October 2014 through 24 October 2014, vol. 269, pp. 215-224
AbstractPossibilistic Defeasible Logic Programming (P-DeLP) is a logic programming framework which combines features from argumentation theory and logic programming, in which defeasible rules are attached with weights expressing their relative belief or preference strength. In P-DeLP a conclusion succeeds if there exists an argument that entails the conclusion and this argument is found to be undefeated by a warrant procedure that systematically explores the universe of arguments in order to present an exhaustive synthesis of the relevant chains of pros and cons for the given conclusion. Recently, we have proposed a new warrant recursive semantics for P-DeLP, called Recursive P-DeLP (RP-DeLP for short), based on the claim that the acceptance of an argument should imply also the acceptance of all its subarguments which reflect the different premises on which the argument is based. In RP-DeLP, an output of a program is a pair of sets, a set of warranted and a set of blocked conclusions. Arguments for both warranted and blocked conclusions are recursively based on warranted conclusions but, while warranted conclusions do not generate any conflict with the set of already warranted conclusions and the strict part of program (information we take for granted they hold true), blocked conclusions do. Conclusions that are neither warranted nor blocked correspond to rejected conclusions. This paper explores the relationship between the exhaustive dialectical analysis based semantics of P-DeLP and the recursive based semantics of RP-DeLP, and analyzes a non-monotonic inference operator for RP-DeLP which models the expansion of a given program by adding new weighed facts associated with warranted conclusions.
URIhttp://hdl.handle.net/10261/131939
DOI10.3233/978-1-61499-452-7-215
Identifiersdoi: 10.3233/978-1-61499-452-7-215
issn: 09226389
isbn: 978-161499451-0
Appears in Collections:(IIIA) Comunicaciones congresos
Files in This Item:
File Description SizeFormat 
FAIA269_215-24.null261,08 kBUnknownView/Open
Show full item record
Review this work
 


WARNING: Items in Digital.CSIC are protected by copyright, with all rights reserved, unless otherwise indicated.