English   español  
Por favor, use este identificador para citar o enlazar a este item: http://hdl.handle.net/10261/136842
Compartir / Impacto:
Estadísticas
Add this article to your Mendeley library MendeleyBASE
Visualizar otros formatos: MARC | Dublin Core | RDF | ORE | MODS | METS | DIDL
Título

Formalisation and logical properties of the maximal ideal recursive semantics for weighted defeasible logic programming

AutorAlsinet, Teresa; Béjar, Ramón; Godo, Lluis; Guitart, Francesc
Palabras claveArgumentation
Defeasible reasoning
Dialectical semantics
Non-monotonic inference
Recursive semantics
Fecha de publicación2016
EditorTaylor & Francis
CitaciónJournal of Experimental and Theoretical Artificial Intelligence 28: 275- 294 (2016)
ResumenPossibilistic 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 sub-arguments which reflect the different premises on which the argument is based. This paper explores the relationship between the exhaustive dialectical analysis-based semantics of P-DeLP and the recursive-based semantics of RP-DeLP, and analyses a non-monotonic inference operator for RP-DeLP which models the expansion of a given program by adding new weighted facts associated with warranted conclusions. Given the recursive-based semantics of RP-DeLP, we have also implemented an argumentation framework for RP-DeLP that is able to compute not only the output of warranted and blocked conclusions, but also explain the reasons behind the status of each conclusion. We have developed this framework as a stand-alone application with a simple text-based input/output interface to be able to use it as part of other artificial intelligence systems.
URIhttp://hdl.handle.net/10261/136842
DOI10.1080/0952813X.2015.1024490
Identificadoresdoi: 10.1080/0952813X.2015.1024490
issn: 1362-3079
Aparece en las colecciones: (IIIA) Artículos
Ficheros en este ítem:
Fichero Descripción Tamaño Formato  
accesoRestringido.pdf15,38 kBAdobe PDFVista previa
Visualizar/Abrir
Mostrar el registro completo
 


NOTA: Los ítems de Digital.CSIC están protegidos por copyright, con todos los derechos reservados, a menos que se indique lo contrario.