14 research outputs found
Automated web services composition with the event calculus
As the web services proliferate and complicate it is becoming an overwhelming job to manually prepare the web service compositions which describe the communication and integration between web services. This paper analyzes the usage of the Event Calculus, which is one of the logical action-effect definition languages, for the automated preparation and execution of web service compositions. In this context, abductive planning capabilities of the Event Calculus are utilized. It is shown that composite process definitions in OWL-S can be translated into Event Calculus axioms so that planning with generic process definitions is possible within this framework. © 2008 Springer-Verlag Berlin Heidelberg
Synthesis of underspecified composite e
In this paper we study automatic composition synthesis of e-Services, based on automated reasoning. We represent the behavior of an e-Service in terms of a deterministic transition syst (or a finite state machine), in which for each action the role of the e-Service, either as initiator or as servant, is highlighted. In this setting we present an algorithm based on satisfiability in a variant of Propositional Dynamic Logic that solves the automatic composition probl. Specifically, given (i) a possibly incomplete specification of the sequences of actions that a client would like to realize, and (ii) a set of available e-Services, our technique synthesizes a composite e-Service that (i) uses only the available e-Services and (ii) interacts with the client "in accordance" to the given specification. We also study the computational complexity of the proposed algorithm
HTN planning: Overview, comparison, and beyond
Hierarchies are one of the most common structures used to understand and conceptualise the world. Within the field of Artificial Intelligence (AI) planning, which deals with the automation of world-relevant problems, Hierarchical Task Network (HTN) planning is the branch that represents and handles hierarchies. In particular, the requirement for rich domain knowledge to characterise the world enables HTN planning to be very useful, and also to perform well. However, the history of almost 40 years obfuscates the current understanding of HTN planning in terms of accomplishments, planning models, similarities and differences among hierarchical planners, and its current and objective image. On top of these issues, the ability of hierarchical planning to truly cope with the requirements of real-world applications has been often questioned. As a remedy, we propose a framework-based approach where we first provide a basis for defining different formal models of hierarchical planning, and define two models that comprise a large portion of HTN planners. Second, we provide a set of concepts that helps in interpreting HTN planners from the aspect of their search space. Then, we analyse and compare the planners based on a variety of properties organised in five segments, namely domain authoring, expressiveness, competence, computation and applicability. Furthermore, we select Web service composition as a real-world and current application, and classify and compare the approaches that employ HTN planning to solve the problem of service composition. Finally, we conclude with our findings and present directions for future work. In summary, we provide a novel and comprehensive viewpoint on a core AI planning technique.<br/
Recommended from our members
An intelligent framework for dynamic web services composition in the semantic web
As Web services are being increasingly adopted as the distributed computing technology of choice to securely publish application services beyond the firewall, the importance of composing them to create new, value-added service, is increasing. Thus far, the most successful practical approach to Web services composition, largely endorsed by the industry falls under the static composition category where the service selection and flow management are done a priori and manually. The second approach to web-services composition aspires to achieve more dynamic composition by semantically describing the process model of Web services and thus making it comprehensible to reasoning engines or software agents. The practical implementation of the dynamic composition approach is still in its infancy and many complex problems need to be resolved before it can be adopted outside the research communities.
The investigation of automatic discovery and composition of Web services in this thesis resulted in the development of the eXtended Semantic Case Based Reasoner (XSCBR), which utilizes semantic web and AI methodology of Case Based Reasoning (CBR). Our framework uses OWL semantic descriptions extensively for implementing both the matchmaking profiles of the Web services and the components of the CBR engine.
In this research, we have introduced the concept of runtime behaviour of services and consideration of that in Web services selection. The runtime behaviour of a service is a result of service execution and how the service will behave under different circumstances, which is difficult to presume prior to service execution. Moreover, we demonstrate that the accuracy of automatic matchmaking of Web services can be further improved by taking into account the adequacy of past matchmaking experiences for the requested task. Our XSCBR framework allows annotating such runtime experiences in terms of storing execution values of non-functional Web services parameters such as availability and response time into a case library. The XSCBR algorithm for matchmaking and discovery considers such stored Web services execution experiences to determine the adequacy of services for a particular task.
We further extended our fundamental discovery and matchmaking algorithm to cater for web services composition. An intensive knowledge-based substitution approach was proposed to adapt the candidate service experiences to the requested solution before suggesting more complex and computationally taxing AI-based planning-based transformations. The inconsistency problem that occurs while adapting existing service composition solutions is addressed with a novel methodology based on Constraint Satisfaction Problem (CSP).
From the outset, we adopted a pragmatic approach that focused on delivering an automated Web services discovery and composition solution with the minimum possible involvement of all composition participants: the service provider, the requestor and the service composer. The qualitative evaluation of the framework and the composition tools, together with the performance study of the XSCBR framework has verified that we were successful in achieving our goal
Dienstekomposition in intelligenten Umgebungen basierend auf KI-Planung
In intelligenten Umgebungen wird das Zusammenspiel mehrerer Dienste benötigt, welches durch eine Dienstekomposition erzielt werden kann. KIPlanung ist eine Methode, dies umzusetzen. Im Rahmen der vorliegenden Arbeit wurde experimentell das Laufzeitverhalten von verschiedenen Planern untersucht. Daneben wurden die Möglichkeiten der Modellierung von Problemen der Dienstekomposition evaluiert, was zu einer Richtline für die verteilte Modellierung von Dienstbeschreibungen führte. Basierend auf den Erfahrungen wurde ein Composer entworfen und umgesetzt, der verschiedene Planer nutzen kann
Coordinating services embedded everywhere via hierarchical planning
The spaces we live in are provided with different devices and technologies, such as sensors for recognising our presence. The aim of such spaces is to improve our comfort, productivity, and even reduce our energy bills. The problem with fulfilling the aim is that devices alone cannot do much to achieve such difficult goals. People would also have problems in manually searching for the best situation accomplishing their needs. A way to deal with this problem is to coordinate devices automatically. For example, our home can autonomously figure out that some lamps can be turned off because the living room has enough natural light and the activity we are currently doing requires a low light level. The benefits are improved comfort and a reasonable amount of energy saved. We therefore explore the possibilities of using a system based on automated planning. This planning produces a set of device services, such as turn off a lamp, that achieves a given goal. We use a method, called hierarchical planning, which enables us to organise the knowledge we have about spaces and devices in hierarchical forms. We show that planning is suitable for this kind of problems by using hierarchical planning to save energy in the Bernoulliborg building at the University of Groningen. The results show energy and money savings, and that people are satisfied with our system. We also improve the system and show that even more money can be saved without sacrificing the well-being of people if we can buy energy from several energy providers