Automatic composition of semantic web services – a theorem proof approach

Authors:
Li Ye;Junliang Chen
Affiliations:
Beijing University of Posts and Telecommunications, Beijing, China;Beijing University of Posts and Telecommunications, Beijing, China
Venue:
ASWC'06 Proceedings of the First Asian conference on The Semantic Web
Year:
2006

Citing 6
Cited 0

Linear logic

Theoretical Computer Science
Fundamentals of Deductive Program Synthesis

IEEE Transactions on Software Engineering
Semantic Web Services

IEEE Intelligent Systems
The Oyster-Clam System

Proceedings of the 10th International Conference on Automated Deduction
The description logic handbook: theory, implementation, and applications

The description logic handbook: theory, implementation, and applications
A Semantic Web Primer

A Semantic Web Primer

Quantified Score

Hi-index	0.00

Visualization

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.