Partial deduction for linear logic - The symbolic negotiation perspective
2005 (English)In: Agents and Peer-To-Peer Computing / [ed] Leite, J; Omicini, A; Torroni, P; Yolum, P, BERLIN: SPRINGER , 2005, Vol. 3476, 35-52 p.Conference paper (Refereed)
Symbolic negotiation is regarded in the field of computer science as a process, where parties try to reach an agreement on the high-level means for achieving their goals by applying symbolic reasoning techniques. It has been proposed  that symbolic negotiation could be formalised as Partial Deduction (PD) in Linear Logic (LL). However, the paper  did not provided a formalisation of the PD process in LL. In this paper we fill the gap by providing a formalisation of PD for !-Horn fragment of LL. The framework can be easily extended for other fragments of LL as well such that more comprehensive aspects of negotiation can be described. In this paper we consider also soundness and completeness of the formalism. It turns out that, given a certain PD procedure, PD for LL in !-Horn fragment is sound and complete. We adopt the hypothesis that an essential component of symbolic negotiation is Cooperative Problem Solving (CPS). Thus a formal system for symbolic negotiation would consist of CPS rules plus negotiationspecific rules. In this paper only CPS rules are under investigation while negotiation-specific rules shall be published in another paper.
Place, publisher, year, edition, pages
BERLIN: SPRINGER , 2005. Vol. 3476, 35-52 p.
Arbete och HälsaCESIS Working Paper Series in Economics and Institutions of Innovation
, Lecture Notes in Artificial Intelligence, ISSN 0302-9743 ; 4118
Artificial intelligence, Computational complexity, Computer science
IdentifiersURN: urn:nbn:se:kth:diva-43210ISI: 000230354400003ScopusID: 2-s2.0-26844495338ISBN: 3-540-26172-9OAI: oai:DiVA.org:kth-43210DiVA: diva2:447825
2nd International Workshop on Declarative Agent Languages and Technologies. New York, NY. JUL 19, 2004
QC 201110132011-10-132011-10-132016-05-18Bibliographically approved