Dialogue Games in Defeasible Logic

In this paper we show how to capture dialogue games in Defeasible Logic. We argue that Defeasible Logic is a natural candidate and general representation formalism to capture dialogue games even with requirements more complex than existing formalisms for this kind of games. We parse the dialogue into defeasible rules with time of the dialogue as time of the rule. As the dialogue evolves we allow an agent to upgrade the strength of unchallenged rules. The proof procedures of (Antoniou, Billington, Governatori, Maher 2001) are used to determine the winner of a dialogue game

An empirical study of argumentation schemes in deliberative dialogue

Publisher PD

Dialoguing DeLP-based agents

A multi-agent system is made up of multiple interacting autonomous agents. It can be viewed as a society in which each agent performs its activity cooperating to achieve common goals, or competing for them. They establish dialogues via some kind of agent-communication language, under some communication protocol. We think argumentation is suitable to model several kind of dialogues in multi-agents systems. In this paper we define dialogues and persuasion dialogues between two agents using Defeasible Logic Programs as a knowledge base, together with an algorithm defining how this dialogue may be engaged. We also show an indication of how an agent could use opponent’s information for its own benefit.Eje: AgentesRed de Universidades con Carreras en Informática (RedUNCI

Properties for a formal model of collaborative dialogue

We propose a basic set of desirable properties for an abstract model of collaborative dialogue among agents. The abstraction comprehends the underlying logic of the agents, as well as the interaction protocol. The properties pursue the characterization of finite dialogues, with reasonable conclusions (based on what the participants have said), in which everything said is relevant and everything relevant is said. To this end, two levels of relevance (direct and potential ) are defined, based on the notions of inference and abduction, respectively. Illustrative examples, using mainly the DeLP formalism, are provided.Workshop de Agentes y Sistemas Inteligentes (WASI)Red de Universidades con Carreras en Informática (RedUNCI