Loop checking in logic programming
Loop checking in logic programming
Reaching agreements through argumentation: a logical model and implementation
Artificial Intelligence
Speculative computation with multi-agent belief revision
Proceedings of the first international joint conference on Autonomous agents and multiagent systems: part 2
From logic programming towards multi-agent systems
Annals of Mathematics and Artificial Intelligence
Categories of Artificial Societies
ESAW '01 Proceedings of the Second International Workshop on Engineering Societies in the Agents World II
Issues in Agent Communication
Dialogues for Negotiation: Agent Varieties and Dialogue Sequences
ATAL '01 Revised Papers from the 8th International Workshop on Intelligent Agents VIII
Negotiation among self-interested computationally limited agents
Negotiation among self-interested computationally limited agents
Argumentation-based negotiation
The Knowledge Engineering Review
Theory and Practice of Logic Programming
Assimilating ontological additions in convergent negotiation protocols
Proceedings of the ninth international conference on Electronic commerce
Argumentation in artificial intelligence
Artificial Intelligence
A negotiation strategy for the Temporal Resource Reallocation Problem in multi-agent systems
International Journal of Internet Protocol Technology
Extracting the Core of a Persuasion Dialog to Evaluate Its Quality
ECSQARU '09 Proceedings of the 10th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty
A new framework for knowledge revision of abductive agents through their interaction
CLIMA IV'04 Proceedings of the 4th international conference on Computational Logic in Multi-Agent Systems
| Hi-index | 0.00 |
Dialogue represents a powerful means to solve problems using agents that have an explicit knowledge representation, and exhibit a goal-oriented behaviour. In recent years, computational logic gave a relevant contribution to the development of Multi-Agent Systems, showing that a logic-based formalism can be effectively used to model and implement the agent knowledge, reasoning, and interactions, and can be used to generate dialogues among agents and to prove properties such as termination and success. In this paper, we discuss the meaning of termination in agent dialogue, and identify a trade-off between ensuring dialogue termination, and therefore robustness in the agent system, and achieving completeness in problem solving. Then, building on an existing negotiation framework, where dialogues are obtained as a product of the combination of the reasoning activity of two agents on a logic program, we define a syntactic transformation of existing agent programs, with the purpose to ensure termination in the negotiation process. We show how such transformations can make existing agent systems more robust against possible situations of non-terminating dialogues, while reducing the class of reachable solutions in a specific application domain, that of resource reallocation.