Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Partial deduction for linear logic - The symbolic negotiation perspective
KTH, School of Information and Communication Technology (ICT), Communication: Services and Infrastucture (Closed 20120101), Software and Computer Systems, SCS (Closed 20120101).ORCID iD: 0000-0002-4722-0823
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, Published paper (Refereed)
Abstract [en]

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 [1] that symbolic negotiation could be formalised as Partial Deduction (PD) in Linear Logic (LL). However, the paper [1] 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.
Series
Arbete och HälsaCESIS Working Paper Series in Economics and Institutions of Innovation
Series
Lecture Notes in Artificial Intelligence, ISSN 0302-9743 ; 4118
Keyword [en]
Artificial intelligence, Computational complexity, Computer science
National Category
Computer Science
Identifiers
URN: urn:nbn:se:kth:diva-43210ISI: 000230354400003Scopus ID: 2-s2.0-26844495338ISBN: 3-540-26172-9 (print)OAI: oai:DiVA.org:kth-43210DiVA: diva2:447825
Conference
2nd International Workshop on Declarative Agent Languages and Technologies. New York, NY. JUL 19, 2004
Note

QC 20111013

Available from: 2011-10-13 Created: 2011-10-13 Last updated: 2016-05-18Bibliographically approved

Open Access in DiVA

No full text

Scopus

Authority records BETA

Matskin, Mihhail

Search in DiVA

By author/editor
Kungas, PeepMatskin, Mihhail
By organisation
Software and Computer Systems, SCS (Closed 20120101)
Computer Science

Search outside of DiVA

GoogleGoogle Scholar

isbn
urn-nbn

Altmetric score

isbn
urn-nbn
Total: 28 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf