Ändra sökning
RefereraExporteraLänk till posten
Permanent länk

Direktlänk
Referera
Referensformat
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
Composition of semantic web services using linear logic theorem proving
KTH, Skolan för informations- och kommunikationsteknik (ICT), Kommunikation: Infrastruktur och tjänster, Programvaru- och datorsystem, SCS.ORCID-id: 0000-0002-4722-0823
2006 (Engelska)Ingår i: Information Systems, ISSN 0306-4379, E-ISSN 1873-6076, Vol. 31, nr 05-4, s. 340-360Artikel i tidskrift (Refereegranskat) Published
Abstract [en]

This paper introduces a method for automatic composition of Semantic Web services using Linear Logic (LL) theorem proving. The method uses a Semantic Web service language (DAML-S) for external presentation of Web services, while, internally, the services are presented by extralogical axioms and proofs in LL. LL, as a resource conscious logic, enables us to capture the concurrent features of Web services formally (including parameters, states and non-functional attributes). We use a process calculus to present the process model of the composite service. The process calculus is attached to the LL inference rules in the style of type theory. Thus, the process model for a composite service can be generated directly from the complete proof. We introduce a set of subtyping rules that defines a valid dataflow for composite services. The subtyping rules that are used for semantic reasoning are presented with LL inference figures. We propose a system architecture where the DAML-S Translator, LL Theorem Prover and Semantic Reasoner can operate together. This architecture has been implemented in Java.

Ort, förlag, år, upplaga, sidor
2006. Vol. 31, nr 05-4, s. 340-360
Nyckelord [en]
service composition, web service, semantic web, linear logic theorem proving
Identifikatorer
URN: urn:nbn:se:kth:diva-15553DOI: 10.1016/j.is.2005.02.005ISI: 000236334200007Scopus ID: 2-s2.0-33344466914OAI: oai:DiVA.org:kth-15553DiVA, id: diva2:333594
Anmärkning
QC 20100525Tillgänglig från: 2010-08-05 Skapad: 2010-08-05 Senast uppdaterad: 2017-12-12Bibliografiskt granskad

Open Access i DiVA

Fulltext saknas i DiVA

Övriga länkar

Förlagets fulltextScopus

Personposter BETA

Matskin, Mihhail

Sök vidare i DiVA

Av författaren/redaktören
Kungas, PeepMatskin, Mihhail
Av organisationen
Programvaru- och datorsystem, SCS
I samma tidskrift
Information Systems

Sök vidare utanför DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetricpoäng

doi
urn-nbn
Totalt: 32 träffar
RefereraExporteraLänk till posten
Permanent länk

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