Theoretical Computer Science
Partial evaluation in logic programming
Journal of Logic Programming
ACM SIGACT News
Journal of Symbolic Logic
Deciding provability of linear logic formulas
Proceedings of the workshop on Advances in linear logic
Collaborative plans for complex group action
Artificial Intelligence
Reaching agreements through argumentation: a logical model and implementation
Artificial Intelligence
Agent negotiation as proof search in linear logic
Proceedings of the first international joint conference on Autonomous agents and multiagent systems: part 2
A taxonomy of parallel strategies for deduction
Annals of Mathematics and Artificial Intelligence
Conversational Case-Based Planning for Agent Team Coordination
ICCBR '01 Proceedings of the 4th International Conference on Case-Based Reasoning: Case-Based Reasoning Research and Development
Requirement-Based Cooperative Theorem Proving
JELIA '98 Proceedings of the European Workshop on Logics in Artificial Intelligence
Distributed Problem-Solving as Concurrent Theorem Proving
Proceedings of the 8th European Workshop on Modelling Autonomous Agents in a Multi-Agent World: Multi-Agent Rationality
Temporal Linear Logic Specifications for Concurrent Processes
LICS '97 Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science
Characterizing Simple Negotiation as Distributed Agent-Based Theorem-Proving - A Preliminary Report
ICMAS '00 Proceedings of the Fourth International Conference on MultiAgent Systems (ICMAS-2000)
AAAI'90 Proceedings of the eighth National conference on Artificial intelligence - Volume 1
Plans, Actions and Dialogues Using Linear Logic
Journal of Logic, Language and Information
Modeling agents' choices in temporal linear logic
DALT'07 Proceedings of the 5th international conference on Declarative agent languages and technologies V
Modelling Multilateral Negotiation in Linear Logic
Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence
Hi-index | 0.00 |
Negotiation over resources and multi-agent planning are important issues in multi-agent systems research. Previously it has been demonstrated [18] how symbolic negotiation and distributed planning together could be formalised as distributed Linear Logic (LL) theorem proving. LL has been chosen mainly because of its expressive power for representation of resources and its computation-oriented nature. This paper extends the previous work by taking advantage of a richer fragment of LL and introducing two sorts of nondeterministic choices into negotiation. This allows agents to reason and negotiate under certain degree of uncertainty. Additionally, a way of granting unbounded access to resources during negotiation is considered. Finally we extend our framework with first-order LL for expressing more complex offers during negotiation.