dc.creatorBudan, Maximiliano Celmo David
dc.creatorGomez Lucero, Mauro Javier
dc.creatorSimari, Guillermo Ricardo
dc.date.accessioned2019-07-10T19:57:32Z
dc.date.accessioned2022-10-15T16:15:22Z
dc.date.available2019-07-10T19:57:32Z
dc.date.available2022-10-15T16:15:22Z
dc.date.created2019-07-10T19:57:32Z
dc.date.issued2012-08-01
dc.identifierBudan, Maximiliano Celmo David; Gomez Lucero, Mauro Javier; Simari, Guillermo Ricardo; An approach for temporal argumentation using labeled defeasible logic programming (l-DeLP); Universidad Nacional de La Plata. Facultad de Informática; Journal of Computer Science and Technology; 12; 2; 1-8-2012; 56-63
dc.identifier1666-6046
dc.identifierhttp://hdl.handle.net/11336/79326
dc.identifier1666-6038
dc.identifierCONICET Digital
dc.identifierCONICET
dc.identifier.urihttps://repositorioslatinoamericanos.uchile.cl/handle/2250/4407853
dc.description.abstractIn the last decade, several argument-based formalisms have emerged, with application in many areas, such as legal reasoning, autonomous agents and multi-agent systems; many are based on Dung´s seminal work characterizing Abstract Argumentation Frameworks (AF). Recent research in the area has led to Temporal Argumentation Frameworks (TAF), that extend AF by considering the temporal availability of arguments. On the other hand, different more concrete argumentation systems exists, such as Defeasible Logic Programming(DeLP), specifying a knowledge representation language, and how arguments are built. In this work we combine time representation capabilities of TAF with the representation language and argument structure of DeLP, defining a rule based argumentation framework that considers time at the object language level. In order to do this, we use an extension of DeLP, called Labeled DeLP (L-DeLP) to establish, for each program clause, the set of time intervals in which it is available, and to determine from this information the temporal availability of arguments. Acceptability semantics for TAF can then be applied to determine argument acceptability on time.
dc.languageeng
dc.publisherUniversidad Nacional de La Plata. Facultad de Informática
dc.relationinfo:eu-repo/semantics/altIdentifier/url/http://journal.info.unlp.edu.ar/JCST/article/view/653
dc.rightshttps://creativecommons.org/licenses/by-nc/2.5/ar/
dc.rightsinfo:eu-repo/semantics/openAccess
dc.subjectARGUMENTATION
dc.subjectTEMPORAL AVAILABILITY
dc.subjectDEFEASIBLE LOGIC PROGRAMMING
dc.subjectLABELED DEFEASIBLE LOGIC PROGRAMMING
dc.titleAn approach for temporal argumentation using labeled defeasible logic programming (l-DeLP)
dc.typeinfo:eu-repo/semantics/article
dc.typeinfo:ar-repo/semantics/artículo
dc.typeinfo:eu-repo/semantics/publishedVersion


Este ítem pertenece a la siguiente institución