Computer Science ›› 2011, Vol. 38 ›› Issue (12): 131-134.

Previous Articles     Next Articles

Answer Set Programming Based Verification of Semantic Web Service Composition

  

  • Online:2018-12-01 Published:2018-12-01

Abstract: Formal description and verification of semantic Web service composition arc the premise of the correctness of running composite services. The paper described a method to modeling OWL-S(Semantic Web service description language) based on answer set programming and analysed the advantages of this method, and the mapping of several kinds of basic control constructs in process model of OWL-S to Petri net which is the mid-mode was provided and an algorithm for generating the answer set programming was proposed. Meanwhile, introduced temporal constraints to the composite service verification to represent the property to be checked. Finally, a specific instance of the modeling and verification was applied into a case.

Key words: Answer set programming, Petri-net, OWL-S, Verification

No related articles found!
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!