On the basis of the relavant theories of fixed-point, using data mining and statistical studies, this paper researches and analyzes the semantics of behavioral constraint and probability statistics of Web services. Aiming at the insufficient of traditional qualitative description of the invoking, this paper also presents an approach for it, and defines the fixed-point function of Web services allocation and its calculating way. The experiment proves the approach aiming at Web services discovery is effectiveness.
全立新. 基于不动点语义的Web服务发现[J]. 现代图书情报技术, 2007, 2(6): 29-32.
Quan Lixin. Web Services Discovery Based on the Fixed-point Semantics. New Technology of Library and Information Service, 2007, 2(6): 29-32.
1岳昆, 王晓玲, 周傲英. Web服务核心支撑技术——研究综述. 软件学报, 2004,15 (3): 428-442
2Agarwal S, Handschuh S, Staab S. Annotation, Composition and Invocation of Semantic Web Service.Journal on Web Semantics,2005, 2 (1): 1-24
3Berardi D, Calvanese D, Giacomo G D, et al. Automatic Composition of E-services that Export Their Behavior. In: Proc. of 1st Int'l. Conf. on Service Oriented Computing, Trento, Italy, 2003
4仲梅,宋顺林.一种语义Web服务的多层次匹配方法.计算机应用,2007,27(1):199-201,204
5张正,左春.基于语义扩展的Web服务发现方法.通讯学报,2007,28(1):57-63
6胡冰,刘淮松.本体的Web服务自动化技术研究.微电子学与计算机,2006,23(11):133-136
7Rougemount M D. Fixed-point Semantics and the Representation of Algorithms on Large Data. VLDB, 1988: 264-272
8佘玉梅,白鸿.一种基于不动点的关联规则挖掘方法.中央民族大学学报(自然科学版),2004，13(1)：23-26
9Agrawal R, Imielinski T, Swami A. Mining Association Rules Between Sets of Items in Large Databases. Proceedings of the ACM SIGMOD Conference on Management of Data,1993:207-216
