Advanced Search
MyIDEAS: Login to save this paper or follow this series

A Method For Semantic Web Service Composition Based On Pattern Matching

Contents:

Author Info

  • Andrei-Horia MOGOS

    ()
    (University Politehnica of Bucharest, Faculty of Automatic Control and Computers)

  • Adina Magda FLOREA

    ()
    (University Politehnica of Bucharest, Faculty of Automatic Control and Computers)

Registered author(s):

    Abstract

    The composition of semantic web services is a very important and actual problem in the semantic web services research area. There are several semi-automatic approaches for this problem, but most of the results are related to automatic approaches. In this paper we present an automatic approach for the composition of semantic web services based on pattern matching. We consider a special type of semantic description, represented as a list of semantic descriptions corresponding to several semantic web services. The semantic description related to the semantic web service that we want to obtain is decomposed until all the parts of the semantic description correspond to semantic web services from a library. In the end, all the necessary semantic web services found in the library are composed in order to obtain the semantic web service that we wanted to construct.

    Download Info

    If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
    File URL: http://ccasp.ase.ro/KM2010/29.pdf
    Download Restriction: no

    Bibliographic Info

    Paper provided by Faculty of Economic Cybernetics, Statistics and Informatics, Academy of Economic Studies and National Defence University "Carol I", Department for Management of the Defence Resources and Education in its series Proceedings of the 5th International Conference on Knowledge Management: Projects, Systems and Technologies,Bucharest, November 12-13 2010 with number 29.

    as in new window
    Length: 6 pages
    Date of creation: Aug 2010
    Date of revision:
    Handle: RePEc:rom:km2010:29

    Contact details of provider:
    Postal: 15-17 Dorobanti Road , Bucharest ,71131
    Phone: 004 021 2112650
    Fax: 004 021 3112066
    Email:
    Web page: http://www.csie.ase.ro/
    More information through EDIRC

    Related research

    Keywords: semantic web service composition; semantic description decomposition; pattern matching;

    Find related papers by JEL classification:

    This paper has been announced in the following NEP Reports:

    References

    No references listed on IDEAS
    You can help add them by filling out this form.

    Citations

    Lists

    This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.

    Statistics

    Access and download statistics

    Corrections

    When requesting a correction, please mention this item's handle: RePEc:rom:km2010:29. See general information about how to correct material in RePEc.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Mogos Radu).

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If references are entirely missing, you can add them using this form.

    If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.