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

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

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

AuthorsAlsinet, Teresa; Béjar, Ramón; Godo, Lluis ; Guitart, Francesc
KeywordsArgumentation
Defeasible reasoning
Dialectical semantics
Non-monotonic inference
Recursive semantics
Issue Date2016
PublisherTaylor & Francis
CitationJournal of Experimental and Theoretical Artificial Intelligence 28: 275- 294 (2016)
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 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
Identifiersdoi: 10.1080/0952813X.2015.1024490
issn: 1362-3079
Appears in Collections:(IIIA) Artículos
Files in This Item:
File Description SizeFormat 
accesoRestringido.pdf15,38 kBAdobe PDFThumbnail
View/Open
Show full item record
Review this work
 


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