On the Implementation of a Multiple Output Algorithm for Defeasible Argumentation
In 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 f...
| Autores: | , , , |
|---|---|
| Tipo de documento: | outro |
| Estado: | Versión aceptada para publicación |
| Data de publicação: | 2013 |
| País: | España |
| Recursos: | Consejo Superior de Investigaciones Científicas (CSIC) |
| Repositório: | DIGITAL.CSIC. Repositorio Institucional del CSIC |
| OAI Identifier: | oai:digital.csic.es:10261/133720 |
| Acesso em linha: | http://hdl.handle.net/10261/133720 |
| Access Level: | Acceso aberto |
| Palavra-chave: | Defeasible logic programming Sub-problems Multiple outputs Experimental evaluation Encodings Defeasible argumentation |
| Resumo: | In 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. |
|---|