A Method of E-Service Workflow Composition Based on Linear Logic Inference Rules

Article Preview

Abstract:

The paper proposes a method for semantic message matching in automatic service composition. It develops a framework in which the exported message description and behavior description of a service, and represents the behavior of a service with a finite state machine. Since the service interface definition can be represented by ontology concepts, the internal representation language enables us to define some issues required by service composition formally, qualitative and quantitative constraints plus reasoning on concepts, and the service behavior can be represented using linear logic formulas, so the inference rules of linear logic can check the match-ability and satisfy-ability of service message.

You might also be interested in these eBooks

Info:

Periodical:

Advanced Materials Research (Volumes 756-759)

Pages:

2120-2124

Citation:

Online since:

September 2013

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2013 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] S. McIlraith, T. C. Son, and H. Zeng, Semantic Web services, IEEE Intelligent Systems 16(2) (2001) 46-53.

DOI: 10.1109/5254.920599

Google Scholar

[2] S. Thakkar, C. Knoblock, and J. L. Ambite, A view integration approach to dynamic composition of Web services, in: Proceedings of ICAPS'03 Workshop on Planning for Web Services (Trento, Italy, 2003) 228-235.

Google Scholar

[3] J. S. Hodas and D. Miller, Logic programming in a fragment of intuitionistic Linear Logic, Information and Computation 110(2) (1994) 327-365.

DOI: 10.1006/inco.1994.1036

Google Scholar

[4] T. J. Norman, A. Preece, S. Chalmers, N. R. Jennings, M. M. Luck, V. D. Dang, T. D. Nguyen, V. Deora, J. Shao, W. A. Gray, and N. J. Fiddian, Agent-based formation of virtual organizations, Knowledge-Based Systems 17(2-4) (2004) 103-111.

DOI: 10.1016/j.knosys.2004.03.005

Google Scholar

[5] Z. G. Hai, The future interconnection environment, IEEE Computer 38(4) (2005) 27-33.

Google Scholar

[6] P. Küngas and M. Matskin, Symbolic negotiation with Linear Logic, Lecture Notes in Computer Science 3259 (Springer-Verlag, Berlin, 2004) 71-88.

DOI: 10.1007/978-3-540-30200-1_5

Google Scholar

[7] M. Winikoff and J. Harland, Implementing the Linear Logic programming language Lygon, in: Proceedings of the International Logic Programming Symposium (Portland, USA, 1995) 66-80.

DOI: 10.7551/mitpress/4301.003.0013

Google Scholar