SMT-based Abstract Temporal Planning

DSpace/Manakin Repository

Show full item record

Title SMT-based Abstract Temporal Planning
Autor: Niewiadomski, Artur; Penczek, Wojciech
URI: http://hdl.handle.net/11331/324
Date: 2014
Źródło: Proceedings of the International Workshop on Petri Nets and Software Engineering PENSE'14 / editors: Daniel Moldt, Heiko Rölke - Hamburg : University of Hamburg. Department of Informatics, 2014, vol 1160, pp. 55-74
Abstract: An abstract planning is the first phase of the web service composition in the PlanICS framework. A user query specifies the initial and the expected state of a plan in request. The paper extends PlanICS with a module for temporal planning, by extending the user query with an LTL_k-X formula specifying temporal aspects of world transformations in a plan. Our solution comes together with an example, an implementation, and experimental results.
Description: These are the proceedings of the International Workshop on Petri Nets and Software Engineering (PNSE’14) in Tunis, Tunisia, June 23–24, 2014. It is a co-located event of Petri Nets 2014, the 35th international conference on Applications and Theory of Petri Nets and Concurrency and ACSD 2014, the 14th International Conference on Application of Concurrency to System Design.

Files in this item

This item appears in the following Collection(s)

Search DSpace


Advanced Search

Browse

My Account

Statistics