2020IEEE Latin America TransactionsOpen access

Preference-based AI Planning for Web Service Composition

Sebastián Vallejos, Leonardo Da Rocha Araujo, Guillermo Rodríguez, Luis Berdún, Renzo Toscani

Open full text 3 citations

Abstract

A web service is a technology that allows data to be exchanged between applications using open protocols and standards. Web services generally offer basic functions that solve specific problems. The composition of services occurs when more complex problems need to be solved using successive invocations to other services. The automatic composition of web services is a current problem. Due to the continuous creation and updating of services, the manual composition of new services becomes impractical. Planning algorithms are an alternative to automate the process of web services composition. In particular, the planning algorithms with preferences allow users to guide the algorithm to find a solution in line with their requirements (e.g. prioritizing the use of services according to properties such as availability, cost, response time, etc.). This paper introduces a Planning approach with preferences to compose and run complex services from a set of web services given as input. To evaluate the approach, different preferences about the input services were used to obtain composition of services. As a result, we measured the feasibility of the proposed approach and the impact of the use of preferences on the composition result.

About this research paper

What this paper is about

A web service is a technology that allows data to be exchanged between applications using open protocols and standards. Web services generally offer basic functions that solve specific problems. The composition of services occurs when more complex problems need to be solved using successive invocations to other services. The automatic composition of web services is a current problem. Due to the continuous creation and updating of services, the manual composition of new services becomes impractical. Planning algorithms are an alternative to automate the process of web services composition. In particular, the planning algorithms with preferences allow users to guide the algorithm to find a solution in line with their requirements (e.g. prioritizing the use of services according to properties such as availability, cost, response time, etc.). This paper introduces a Planning approach with preferences to compose and run complex services from a set of web services given as input. To evaluate the approach, different preferences about the input services were used to obtain composition of services. As a result, we measured the feasibility of the proposed approach and the impact of the use of preferences on the composition result.

Why it matters

OpenAlex reports 3 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

A web service is a technology that allows data to be exchanged between applications using open protocols and standards. Web services generally offer basic functions that solve specific problems. The composition of services occurs when more complex problems need to be solved using successive invocations to other services. The automatic composition of web services is a current problem. Due to the continuous creation and updating of services, the manual composition of new services becomes impractical. Planning algorithms are an alternative to automate the process of web services composition. In particular, the planning algorithms with preferences allow users to guide the algorithm to find a solution in line with their requirements (e.g. prioritizing the use of services according to properties such as availability, cost, response time, etc.). This paper introduces a Planning approach with preferences to compose and run complex services from a set of web services given as input. To evaluate the approach, different preferences about the input services were used to obtain composition of services. As a result, we measured the feasibility of the proposed approach and the impact of the use of preferences on the composition result.

Key concepts: Web service, Services computing, WS-Policy, Computer science, WS-Addressing, WS-I Basic Profile, Automated planning and scheduling, Composition (language)

Related papers

Back to paper searchBrowse research topicsOriginal source
Preference-based AI Planning for Web Service Composition — Research Paper | ScholarLens