2024-03-28T10:26:17Zhttp://digital.csic.es/dspace-oai/requestoai:digital.csic.es:10261/1337202018-07-31T11:10:38Zcom_10261_60com_10261_4col_10261_439
Alsinet, Teresa
Bejar, Ramon
Godo, Lluis
Guitart, Francesc
2016-06-17T13:53:27Z
2016-06-17T13:53:27Z
2013-09-16
Lecture Notes in Computer Science 8078. Scalable Uncertainty Management, 7th International Conference, SUM 2013, Washington, DC, USA, September 16-18, 2013. Proceedings. pp. 71-77.
http://hdl.handle.net/10261/133720
10.1007/978-3-642-40381-1_6
http://dx.doi.org/10.13039/501100003329
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.
eng
openAccess
Defeasible logic programming
Sub-problems
Multiple outputs
Experimental evaluation
Encodings
Defeasible argumentation
On the Implementation of a Multiple Output Algorithm for Defeasible Argumentation
capĂtulo de libro