Web Services Discovery Based on the Fixed-point Semantics
Authors
Lixin Quan
Corresponding Author
Lixin Quan
Available Online August 2012.
- DOI
- 10.2991/iccasm.2012.360How to use a DOI?
- Keywords
- Semantic Web, Least fixed point, Web Services discovery, Strongly-call rule
- Abstract
Based on the relavant theories of fixed-point, our approach uses data mining and statistical studies the semantics of behavioral constraint and probability statistics of Web Services. Aiming at the insufficient of traditional qualitative description of the invoking, this paper presents an approach for quantitative description of the invoking, we defines the fixed-point function of Web services allocation and its calculating way. At last, the experiment proves the feasibility and effectiveness of the way we adopted.
- Copyright
- © 2012, the Authors. Published by Atlantis Press.
- Open Access
- This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).
Cite this article
TY - CONF AU - Lixin Quan PY - 2012/08 DA - 2012/08 TI - Web Services Discovery Based on the Fixed-point Semantics BT - Proceedings of the 2012 International Conference on Computer Application and System Modeling (ICCASM 2012) PB - Atlantis Press SP - 1408 EP - 1410 SN - 1951-6851 UR - https://doi.org/10.2991/iccasm.2012.360 DO - 10.2991/iccasm.2012.360 ID - Quan2012/08 ER -