Modelling Mixed Discrete-Continuous Domains for Planning

In this paper we present pddl+, a planning domain description language for modelling mixed discrete-continuous planning domains. We describe the syntax and modelling style of pddl+, showing that the language makes convenient the modelling of complex time-dependent effects. We provide a formal semantics for pddl+ by mapping planning instances into constructs of hybrid automata. Using the syntax of HAs as our semantic model we construct a semantic mapping to labelled transition systems to complete the formal interpretation of pddl+ planning instances. An advantage of building a mapping from pddl+ to HA theory is that it forms a bridge between the Planning and Real Time Systems research communities. One consequence is that we can expect to make use of some of the theoretical properties of HAs. For example, for a restricted class of HAs the Reachability problem (which is equivalent to Plan Existence) is decidable. pddl+ provides an alternative to the continuous durative action model of pddl2.1, adding a more flexible and robust model of time-dependent behaviour

Action, Time and Space in Description Logics

Description Logics (DLs) are a family of logic-based knowledge representation (KR) formalisms designed to represent and reason about static conceptual knowledge in a semantically well-understood way. On the other hand, standard action formalisms are KR formalisms based on classical logic designed to model and reason about dynamic systems. The largest part of the present work is dedicated to integrating DLs with action formalisms, with the main goal of obtaining decidable action formalisms with an expressiveness significantly beyond propositional. To this end, we offer DL-tailored solutions to the frame and ramification problem. One of the main technical results is that standard reasoning problems about actions (executability and projection), as well as the plan existence problem are decidable if one restricts the logic for describing action pre- and post-conditions and the state of the world to decidable Description Logics. A smaller part of the work is related to decidable extensions of Description Logics with concrete datatypes, most importantly with those allowing to refer to the notions of space and time

Vers une plateforme dédiée à la composition automatique et l'exécution de services : Applications E-Tourisme

Recently, distributed computing systems based on context awareness have been proposing in several domains such as healthcare, logistics and tourism. The study described in this thesis is a part of a broader project of E-Tourism system that provides nomad user, context-aware personalized services. The work of this thesis focuses on the issues raised by web service composition and execution. Web service composition brings benefits of reusing existing services to synthesize the new resulting service that meets users needs. The way to create web service composition normally happens at design time, but this limits choices of services. This thesis presents a novel approach of automated web service composition and execution framework. Our approach aims to compose service operations that fulfill mobile users' requirements expressed in propositional logic and execute the resulting service based on aggregating multi service components. In the proposed framework, we have introduced our planning algorithm based on abstract goal states to search and connect to service operations, by mean of service operation annotations, for an abstract plan. The abstract plan is expected for workflow model of sequencing, paralleling and conditioning among service operations. However, the generated workflow is not in an executable form, this is why we perform the transformation of the workflow into an executable business process. To achieve the business process execution, we defined context based BPMN model for mapping the abstract plan to BPMN semantics. We also propose a new validation algorithm and exploited planning-as-model-checking approach to validate the semantic BPMN model whether it is Well-formed and Well-defined BPMN process. Finally, we implemented the automated service composition and execution framework system in Java platform as a proof of concept. We developed the logical composition and, transformation and validation BPMN algorithms written in Prolog. We have integrated these algorithms into the whole system. From the perspective, we plan to extend our current work and take into account more complex user's scenarios that explicitly and implicitly express other pattern controls and we will also consider the scenarios required for stateful web servicesLes systèmes de services contextualisés ont connu un grand essor ces dernières années dans des domaines variés tels que la santé, la logistique ou bien le tourisme. Cette thèse s'intègre dans un projet plus global, nommé E-Tourism, qui vise à réaliser une plateforme de fourniture de services sensibles au contexte à des utilisateurs en situation de mobilité. Le travail de cette thèse se focalise sur la problématique de composition de services web et de leur exécution. La composition de services web permet la réutilisation de services existants afin d'en faire une synthèse répondant au besoin de l'utilisateur. Cette composition se fait en général au niveau de la phase conceptuelle ce qui limite le choix de services potentiels. Cette thèse présente une nouvelle approche de la composition de services Web automatisé et une plateforme d'exécution. Notre approche vise à composer les opérations de services qui répondent aux besoins des utilisateurs mobiles exprimées dans une logique propositionnelle et exécuter le service composé en agrégeant plusieurs services composants. Nous avons proposé une plateforme d'exécution de services et nous avons introduit un nouvel algorithme de planification intégré à cette plateforme. Nous avons défini un contexte basé sur le modèle BPMN. Afin de valider notre modèle sémantique nous avons utilisé une approche de type « model-checking » . Enfin, nous avons réalisé un prototype sous forme d'une plateforme de composition de services et d'exécution automatique en Java. Nous avons implémenté les règles d'inférence et les modèles BPMN en prolog. Enfin, nous avons intégré ces algorithmes dans l'ensemble du système. En perspectives, nous prévoyons d'étendre notre travail actuel et prendre en compte des scénarios plus complexes nécessitant des services web dynamiques