Chrpa, Lukáš, Surynek, Pavel and Vyskočil, Jiří (2009) Encoding of Planning Problems and Their Optimizations in Linear Logic. In: Lecture Notes in Computer Science. Springer, London, pp. 54-68. ISBN 978-3-642-00674-6
|PDF - Accepted Version |
Download (208kB) | Preview
Girard’s Linear Logic is a formalism which can be used to manage a lot of problems with consumable resources. Its expressiveness is quite good for an easily understandable encoding of many problems. We concentrated on expressing planning problems by linear logic in this paper. We observed a rich usage of a construct of consumable resources in planning problem formulations. This fact motivates us to provide a possible encoding of planning problems in linear logic. This paper shows how planning problems can be encoded in Linear Logic and how some optimizations of planning problems can be encoded. These optimizations can help planners to improve the efficiency of finding solutions (plans).
|Item Type:||Book Chapter|
|Additional Information:||Applications of Declarative Programming and Knowledge Management 17th International Conference, INAP 2007, and 21st Workshop on Logic Programming, WLP 2007, Würzburg, Germany, October 4-6, 2007, Revised Selected Papers|
|Subjects:||Q Science > QA Mathematics > QA75 Electronic computers. Computer science|
|Schools:||School of Computing and Engineering|
|Depositing User:||Lukas Chrpa|
|Date Deposited:||01 Oct 2012 15:51|
|Last Modified:||01 Oct 2012 15:51|
Downloader CountriesMore statistics for this item...
Repository Staff Only: item control page