English   español  
Please use this identifier to cite or link to this item: http://hdl.handle.net/10261/133720
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 Implementation of a Multiple Output Algorithm for Defeasible Argumentation

AuthorsAlsinet, Teresa; Bejar, Ramon; Godo, Lluis ; Guitart, Francesc
KeywordsDefeasible logic programming
Sub-problems
Multiple outputs
Experimental evaluation
Encodings
Defeasible argumentation
Issue Date16-Sep-2013
PublisherSpringer
CitationLecture Notes in Computer Science 8078. Scalable Uncertainty Management, 7th International Conference, SUM 2013, Washington, DC, USA, September 16-18, 2013. Proceedings. pp. 71-77.
AbstractIn a previous work we defined a recursive warrant semantics for Defeasible Logic Programming based on a general notion of collective conflict among arguments. The main feature of this recursive semantics is that an output of a program is a pair consisting of a set of warranted and a set of blocked formulas. A program may have multiple outputs in case of circular definitions of conflicts among arguments. In this paper we design an algorithm for computing each output and we provide an experimental evaluation of the algorithm based on two SAT encodings defined for the two main combinatorial subproblems that arise when computing warranted and blocked conclusions for each output.
URIhttp://hdl.handle.net/10261/133720
DOI10.1007/978-3-642-40381-1_6
Identifiersdoi: 10.1007/978-3-642-40381-1_6
isbn: 978-3-642-40380-4
Appears in Collections:(IIIA) Comunicaciones congresos
Files in This Item:
File Description SizeFormat 
LNCS8078_71-77.pdf139,27 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.