Deciding provability of linear logic formulas
Proceedings of the workshop on Advances in linear logic
Plan reuse versus plan generation: a theoretical and empirical analysis
Artificial Intelligence - Special volume on planning and scheduling
Methods for task allocation via agent coalition formation
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
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)
Partial deduction for linear logic—the symbolic negotiation perspective
DALT'04 Proceedings of the Second international conference on Declarative Agent Languages and Technologies
| Hi-index | 0.00 |
In this paper we present a formalism for symbolic negotiation. We regard symbolic negotiation as cooperative problem solving (CPS), which is based on symbolic reasoning and is extended with negotiation-specific rules. The underlying CPS formalism based on linear logic was previously presented in [7]. Here we extend the formalism with symbolic negotiation and coalition formation rules. Moreover, we position symbolic negotiation regarding other distributed problem solving mechanisms. Although there exist currently several formalisms for symbolic negotiation, none of them seems to involve coalition formation.