English   español  
Por favor, use este identificador para citar o enlazar a este item: http://hdl.handle.net/10261/133720
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

On the Implementation of a Multiple Output Algorithm for Defeasible Argumentation

AutorAlsinet, Teresa; Bejar, Ramon; Godo, Lluis; Guitart, Francesc
Palabras claveDefeasible logic programming
Sub-problems
Multiple outputs
Experimental evaluation
Encodings
Defeasible argumentation
Fecha de publicación16-sep-2013
EditorSpringer
CitaciónLecture Notes in Computer Science 8078. Scalable Uncertainty Management, 7th International Conference, SUM 2013, Washington, DC, USA, September 16-18, 2013. Proceedings. pp. 71-77.
ResumenIn 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
Identificadoresdoi: 10.1007/978-3-642-40381-1_6
isbn: 978-3-642-40380-4
Aparece en las colecciones: (IIIA) Comunicaciones congresos
Ficheros en este ítem:
Fichero Descripción Tamaño Formato  
LNCS8078_71-77.pdf139,27 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.