Endre søk
RefereraExporteraLink to record
Permanent link

Direct link
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annet format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annet språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
Partial deduction for linear logic - The symbolic negotiation perspective
KTH, Skolan för informations- och kommunikationsteknik (ICT), Kommunikation: Infrastruktur och tjänster (Stängd 20120101), Programvaru- och datorsystem, SCS (Stängd 20120101).ORCID-id: 0000-0002-4722-0823
2005 (engelsk)Inngår i: Agents and Peer-To-Peer Computing / [ed] Leite, J; Omicini, A; Torroni, P; Yolum, P, BERLIN: SPRINGER , 2005, Vol. 3476, s. 35-52Konferansepaper, Publicerat paper (Fagfellevurdert)
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.

sted, utgiver, år, opplag, sider
BERLIN: SPRINGER , 2005. Vol. 3476, s. 35-52
Serie
Arbete och HälsaCESIS Working Paper Series in Economics and Institutions of Innovation
Serie
Lecture Notes in Artificial Intelligence, ISSN 0302-9743 ; 4118
Emneord [en]
Artificial intelligence, Computational complexity, Computer science
HSV kategori
Identifikatorer
URN: urn:nbn:se:kth:diva-43210ISI: 000230354400003Scopus ID: 2-s2.0-26844495338ISBN: 3-540-26172-9 (tryckt)OAI: oai:DiVA.org:kth-43210DiVA, id: diva2:447825
Konferanse
2nd International Workshop on Declarative Agent Languages and Technologies. New York, NY. JUL 19, 2004
Merknad

QC 20111013

Tilgjengelig fra: 2011-10-13 Laget: 2011-10-13 Sist oppdatert: 2018-01-12bibliografisk kontrollert

Open Access i DiVA

Fulltekst mangler i DiVA

Scopus

Personposter BETA

Matskin, Mihhail

Søk i DiVA

Av forfatter/redaktør
Kungas, PeepMatskin, Mihhail
Av organisasjonen

Søk utenfor DiVA

GoogleGoogle Scholar

isbn
urn-nbn

Altmetric

isbn
urn-nbn
Totalt: 68 treff
RefereraExporteraLink to record
Permanent link

Direct link
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annet format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annet språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf