Automatic Composition of Semantic Web Services – A Theorem Proof Approach
作者： Li Ye , Junliang Chen
DOI: 10.1007/11836025_46
关键词:
摘要: This paper proposes a method to automatically generate composite services The function of service is specified by its Inputs, Output, Preconditions, and Result (IOPR) These functional descriptions are translated into first-order logic (FOL) formula An Automatic Theorem Prover (ATP) used proof from known (as axioms) the an object formula) Based on deductive program synthesis theory, implementation extracted “proof program” here guarantees completeness correctness result brief introduction prototype system given.
springer.com
springerlink.com参考文章(12)
Automated deduction : a basis for applications Springer Netherlands. ,(1998) , 10.1007/978-94-017-0435-9
Jinghai Rao, Semantic Web Service Composition via Logic-based Program Synthesis 166. ,(2004)
Frank van van Harmelen, Grigoris Antoniou, Rinke Hoekstra, Paul Groth, A semantic Web primer ,(2004)
Alan Bundy, Frank Harmelen, Christian Horn, Alan Smaill, The Oyster-Clam system conference on automated deduction. pp. 647- 648 ,(1990) , 10.1007/3-540-52885-7_123
Sheila A. McIlraith, Tran Cao Son, Adapting Golog for Composition of Semantic Web Services principles of knowledge representation and reasoning. pp. 482- 496 ,(2002)
Maurice Nivat, Fiftieth volume of theoretical computer science Theoretical Computer Science. ,vol. 50, pp. 1- 3 ,(1988) , 10.1016/0304-3975(88)90001-1
Z. Manna, R. Waldinger, Fundamentals of deductive program synthesis IEEE Transactions on Software Engineering. ,vol. 18, pp. 674- 704 ,(1992) , 10.1109/32.153379
Robin Milner, Joachim Parrow, David Walker, A calculus of mobile processes, II Information & Computation. ,vol. 100, pp. 41- 77 ,(1992) , 10.1016/0890-5401(92)90008-4
D. Box, Simple Object Access Protocol (SOAP) 1.1, W3C Note ,(2000)