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
Abstract

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).

Information
Library
Documents
[img]
ll_plan.pdf - Accepted Version

Download (213kB)
Statistics

Downloads

Downloads per month over past year

Add to AnyAdd to TwitterAdd to FacebookAdd to LinkedinAdd to PinterestAdd to Email