Abstract
This paper proposes a method to automatically generate composite services. The function of a service is specified by its Inputs, Output, Preconditions, and Result (IOPR). These functional descriptions are translated into a first-order logic (FOL) formula. An Automatic Theorem Prover (ATP) is used to generate a proof from known services (as axioms) to the composite service (as an object formula). Based on the deductive program synthesis theory, the implementation of the composite service is extracted from the proof. The “proof to program” method used here guarantees the completeness and correctness of the result. An brief introduction of the prototype system is given.
This work was part of the project “Basic Research on Intelligent Mobile Service Platform”, sponsored by the National Natural Science Foundation of China (No. 60432010).
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Antoniou, G., Harmelen, F.v.: A Semantic Web Primer. The MIT Press, Cambridge (2004)
Lassila, O., Swick, R.R.: Resource Description Framework(RDF) model and syntax specification, W3C recommendation (February 1999), On-line: http://www.w3.org/TR/1999/REC_rdf-syntax-19990222/
Dean, M., et al.: OWL Web Ontology Language 1.0 reference, W3C recommendation (July 2002),On-line, http://www.w3.org/TR/owl-ref/
Box, D., et al.: Simple Object Access Protocol (SOAP) 1.1, W3C recommendation (2001),On-line, http://www.w3.org/TR/SOAP/
McIlraith, S.A., Son, T.C., Zeng, H.: Semantic Web Services. IEEE Intelligent Systems 16, 46–53 (2001)
Rao, J.: Semantic Web Service Composition via Logic-based Program Synthesis. PhD thesis, Norwegian University of Science and Technology (2004)
Girard, J.-Y.: Linear Logic. Theoretical Computer Science 50, 1–102 (1987)
Milner, R., Parrow, J., Walker, D.: A Calculus of Mobile Processes. Computer Science Department, University of Edinburgh (June 1989)
McIlraith, S., Son, T.C.: Adapting Golog for composition of Semantic Web services. In: Proceedings of the 8th International Conference on Knowledge Representation and Reasoning(KR 2002) (April 2002)
Manna, Z., Waldinger, R.: Fundamentals of deductive program synthesis. IEEE Transactions on Software Engineering 18, 674–704 (1992)
Otter: An Automated Deduction System. On-line, http://www-unix.mcs.anl.gov/AR/otter/
Baader, F., Calvanese, D., McGuinness, D., Nardi, D., Patel-Schneider, P. (eds.): The Description Logic Handbook: Theory, Implementation and Applications. Cambridge University Press, Cambridge (2002)
Bibel, W., Schmitt, P.: Automated Deduction: a Basis for Applications, vol. 810. Kluwer, Dordrecht
Bundy, A., Harmelen, F.V., Horn, C., Smaill, A.: The Oyster-Clam System. In: Stickel, M.E. (ed.) CADE 1990. LNCS (LNAI), vol. 449, pp. 647–648. Springer, Heidelberg (1990)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ye, L., Chen, J. (2006). Automatic Composition of Semantic Web Services – A Theorem Proof Approach. In: Mizoguchi, R., Shi, Z., Giunchiglia, F. (eds) The Semantic Web – ASWC 2006. ASWC 2006. Lecture Notes in Computer Science, vol 4185. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11836025_46
Download citation
DOI: https://doi.org/10.1007/11836025_46
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-38329-1
Online ISBN: 978-3-540-38331-4
eBook Packages: Computer ScienceComputer Science (R0)