Abstract
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.
Cite
CITATION STYLE
Küngas, P., & Matskin, M. (2004). Linear logic, partial deduction and cooperative problem solving. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2990, pp. 263–279). Springer Verlag. https://doi.org/10.1007/978-3-540-25932-9_14
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
