Buscar
Mostrando ítems 1-10 de 149
Defeasible logic programming: DeLP-servers, contextual queries, and explanations for answers
(Taylor & Francis, 2014-02)
Argumentation represents a way of reasoning over a knowledge base containing possibly incomplete and/or inconsistent information, to obtain useful conclusions. As a reasoning mechanism, the way an argumentation reasoning ...
An approach for temporal argumentation using labeled defeasible logic programming (l-DeLP)
(Universidad Nacional de La Plata. Facultad de Informática, 2012-08-01)
In 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 ...
Backing and undercutting in defeasible logic programming
(Springer, 2011-07)
Two important notions within the field of classical argumentation are undercutting defeaters and backings. The former represent an attack to an inference step, and the latter intend to provide defense against this type of ...
Relational databases as a massive information source for defeasible argumentation
(Elsevier Science, 2013-10)
Argumentation provides a sophisticated yet powerful mechanism for the formalization of commonsense reasoning in knowledge-based systems, with application in many areas of Artificial Intelligence. Nowadays, most argumentation ...
Defeasible argumentation over relational databases
(IOS Press, 2017-05-09)
Defeasible argumentation has been applied successfully in several real-world domains in which it is necessary to handle incomplete and contradictory information. In recent years, there have been interesting attempts to ...