Linear Logic, Partial Deduction and Cooperative Problem Solving
Agentlink Clearinghouse is powered by GNU EPrints developed by the School of Electronics and Computer Science of the University of Southampton.
Type: Conference or Workshop Item (Paper)

Küngas, Peep and Matskin, Mihhail (2004) Linear Logic, Partial Deduction and Cooperative Problem Solving. In: First International Workshop on Declarative Agent Languages and Technologies, 15 July, 2003, Melbourne, Australia.

Full text not available from this archive.


In this paper we present a model of cooperative problem solving (CPS). Linear Logic (LL) is used for encoding agents' states, goals and capabilities. LL theorem proving is applied by each agent to determine whether the particular agent is capable of solving the problem alone. If no individual solution can be constructed, then the agent may start negotiation with other agents in order to find a cooperative solution. Partial deduction in LL is used to derive a possible deal. Finally proofs are generated and plans are extracted from the proofs. The extracted plans determine agents' responsibilities in cooperative solutions.

Deposited by Mr Peep Küngas on 14 March 2005

Archive Staff Only: edit this record


AgentLink is the European Commission's IST-funded Coordination Action for Agent-Based Computing
and is coordinated by the
University of Liverpool and University of Southampton
If you encounter any problems with these pages please contact