Sciweavers

IBERAMIA
2010
Springer
13 years 3 months ago
A Computational Method for Defeasible Argumentation Based on a Recursive Warrant Semantics
In a recent paper [2] the authors have formalized a recursive semantics for warranted conclusions in a general defeasible argumentation framework based on a propositional logic. Th...
Teresa Alsinet, Ramón Béjar, Lluis G...
KES
2006
Springer
13 years 5 months ago
Solving power and trust conflicts through argumentation in agent-mediated knowledge distribution
Distributing pieces of knowledge in large, usually distributed organizations is a central problem in Knowledge and Organization management. Policies for distributing knowledge and...
Carlos Iván Chesñevar, Ramón ...
FOIKS
2008
Springer
13 years 6 months ago
An Alternative Foundation for DeLP: Defeating Relations and Truth Values
Abstract. In this paper we recast the formalism of argumentation formalism known as DeLP (Defeasible Logic Programming) in game-theoretic terms. By considering a game between a Pro...
Ignacio D. Viglizzo, Fernando A. Tohmé, Gui...
NMR
2004
Springer
13 years 10 months ago
Preferential defeasibility: utility in defeasible logic programming
The development of Logic Programming and Defeasible Argumentation lead to Defeasible Logic Programming. Its core resides in the characterization of the warrant procedure. Defeasib...
Fernando A. Tohmé, Guillermo Ricardo Simari
ARGMAS
2004
Springer
13 years 10 months ago
Negotiation Among DDeLP Agents
Negotiation can be conceived as the exchange of messages among self-interested agents in order to settle on an agreement over a given issue. They decide which messages to send acco...
Fernando A. Tohmé, Guillermo Ricardo Simari
ARGMAS
2009
Springer
13 years 11 months ago
Realizing Argumentation in Multi-agent Systems Using Defeasible Logic Programming
We describe a working multi-agent architecture based on Defeasible Logic Programming (DeLP) by Garc´ıa and Simari where agents are engaged in an argumentation to reach a common c...
Matthias Thimm