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 thesis analyzes the usage of 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, planning capabilities of Event Calculus are utilized. Translations from Planning Domain Description Language and DARPA Agent Markup Language to Event Calculus are provided to show that Web Services can be composed with the help of Event Calculus. Also comparisons between Event Calculus and other planning languages used for the same purposes are presented.

Les travaux autour de la conception, de la vérification et de la surveillance de compositions de services Web forment un domaine de recherche très actif actuellement. Cependant, peu de ces travaux s'intéressent à la prise en compte globale des problématiques de composition, vérification et surveillance grâce à un formalisme unifié. Dans la thèse, nous proposons l'approche DISC qui est une approche déclarative unifiée utilisant un formalisme à base d'événements, et qui permet grâce à un formalisme unique de concevoir, de vérifier et de surveiller des compositions de services, réduisant ainsi les transformations nécessaires pour passer d'un formalisme à un autre. De plus, le formalisme utilisé permet de prendre en compte des aspects non fonctionnels tels que les données, les aspects temporels, ou certains aspects liés à la sécurité. L'approche permet en outre d'instancier et de vérifier des compositions de services, et d'exécuter et surveiller ces compositions lors de l'exécution. Enfin, les effets de violations lors de l'exécution de la composition peuvent être calculés, et un ensemble d'actions de recouvrement sont proposées, permettant aux compositions d'être en partie autonomes vis-à-vis des problèmes pouvant survenir à l'exécution.

Workflow management promises a solution to an age-old problem: controlling,monitoring, optimizing and supporting business processes. What is new about workflow management is the explicit representation of the business process logic which allows for computerized support. In the light of this support, many researchers developed different approaches to model new systems with different capabilities to solve this age-old problem. One of the approaches is using logicbased methodology for the specification and execution of workflows. Here, the event calculus, a logic programming formalism for representing events and their effects especially in database applications, is used for this approach. It is shown that the control flow graph of a workflow specification can be expressed as a set of logical formulas and the event calculus can be used to specify the role of a workflow manager through a set of rules for the execution dependencies of activities. Constructed workflow formalization through Event Calculus is realized by using recent technologies, and the resulting product is named as EventFlow,including some administrative interfaces to manage system and workflow engine. The thesis describes the architecture and implementation details of EventFlow, an editor developed for graphical representation of control flow graph, and technologies used in the implementation. And an example application is built to show the usability and execution of the implemented system.

Traditional Inductive Logic Programming (ILP) focuses on the setting where the target theory is a generalisation of the observations. This is known as Observational Predicate Learning (OPL). In the Theory Completion setting the target theory is not in the same predicate as the observations (non-OPL). This thesis investigates two alternative simple extensions to traditional ILP to perform non-OPL or Theory Completion. Both techniques perform extraction-case abduction from an existing background theory and one seed observation. The first technique -- Logical Back-propagation -- modifies the existing background theory so that abductions can be achieved by a form of constructive negation using a standard SLD-resolution theorem prover. The second technique -- SOLD-resolution -- modifies the theorem prover, and leaves the existing background theory unchanged. It is shown that all abductions produced by Logical Back-propagation can also be generated by SOLD-resolution; but the reverse does not hold. The implementation using the SOLD-resolution technique -- the ALECTO system -- was applied to the problems of completing context free and context dependant grammars; and learning Event Calculus programs. It was successfully able to learn an Event Calculus program to control the navigation of a real-life robot. The Event Calculus is a formalism to represent common-sense knowledge. It follows that the discovery of some common-sense knowledge was produced with the assistance of a machine.

In today&#039 / s world, composite web services are widely used in service oriented computing, web mashups and B2B Applications etc. Most of these services are composed manually. However, the complexity of manually composing web services increase exponentially with the increase in the number of available web services, the need for dynamically created/updated/discovered services and the necessity for higher amount of data bindings and type mappings in longer compositions. Therefore, current highly manual web service composition techniques are far from being the answer to web service composition problem. Automatic web service composition methods are recent research efforts to tackle the issues with manual techniques. Broadly, these methods fall into two groups: (i) workflow based methods and (ii) methods using AI planning. This thesis investigates the application of AI planning techniques to the web service composition problem and in particular, it proposes the use of the abductive event calculus in this domain. Web service compositions are defined as templates using OWL-S (&quot / OWL for Services&quot / ). These generic composition definitions are converted to Prolog language as axioms for the abductive event calculus planner and solutions found by the planner constitute the specific result plans for the generic composition plan. In this thesis it is shown that abductive planning capabilities of the event calculus can be used to generate the web service composition plans that realize the generic procedure.

In recent years, web services have become an emerging technology for communication and integration between applications in many areas such as business to business (B2B) or business to commerce (B2C). In this growing technology, it is hard to compose web services manually because of the increasing number and compexity of web services. Therefore, automation of this composition process has gained a considerable amount of popularity. Automated web service composition can be achieved either by generating the composition plan dynamically using given inputs and outputs, or by locating the correct services if an abstract process model is given. This thesis investigates the former method which is dynamicly generating the composition by using the abductive lanning capabilities of the Event Calculus. Event calculus axioms in Prolog language, are generated using the available OWL-S web service descriptions in the service repository, values given to selected inputs from ontologies used by those semantic web services and desired output types selected again from the ontologies. Abductive Theorem Prover which is the AI planner used in this thesis, generates composition plans and execution results according to the generated event calculus axioms. In this thesis, it is shown that abductive event calculus can be used for generating web services composition plans automatically, and returning the results of the generated plans by executing the necessary web services.

In this thesis, a web service composition and execution framework is presented for semantically annotated web services. A monolithic approach to automated web service composition and execution problem is chosen, which provides some benefits by separating the composition and execution phases. An AI planning method using a logical formalism called Event Calculus is chosen for the composition phase. This formalism allows one to generate a narrative of actions and temporal orderings using abductive planning techniques given a goal. Functional properties of services, namely input/output/precondition/effects(IOPE) are taken into consideration in the composition phase and non-functional properties, namely quality of service (QoS) parameters are used in selecting the most appropriate solution to be executed. The repository of OWL-S semanticWeb services are translated to Event Calculus axioms and the resulting plans found by the Abductive Event Calculus Planner are converted to graphs. These graphs can be sorted according to a score calculated using the defined quality of service parameters of the atomic services in the composition to determine the optimal solution. The selected graph is converted to an OWL-S file which is executed consequently.

In the master's thesis we are concerned with the logical perspective on business process model-ing. The logical perspective on business process modeling has several advantages. First, being a formal logical system, first-order logic let us thoroughly understand the foundations of process modeling. Second, after we understand the logical foundations of business process modeling, we are free to build a BPM language based entirely on logic, or map an existing language onto logic, which may be useful for artificial reasoning. Third, if the business process model is mapped to logic (or another declarative language) it can be easily stored in a declarative knowledge base. Forth, logic based process models can be used in companies as a basis for knowledge manage-ment. And fifth, the science of logic offers a number of various semantic enhancements, which can be used in favor of better business process modeling expressiveness. The first objective of the thesis is to perform a thorough review of the literature of both our fields -- the business process modeling and temporal logic. The related second objective is to study the ability of logic to represent processes and the notion of time in general, and to offer techniques for logical process representation. Subsequently, the examples should be provided in order to present that the selected techniques are capable of performing what is sketched in the first paragraph. The third objective is to propose improvements of the current business process modeling approach and provide relevant examples. Eventually, means of extending the tech-niques presented can be proposed, too. The major contribution of the thesis is that it constitutes a reasonable basis for further research in the chosen field. For novices or even experienced in the subject it represents a good stepping stone.