Encoding of Planning Problems and their Optimizations in Linear Logic

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F09%3A10084072" target="_blank" >RIV/00216208:11320/09:10084072 - isvavai.cz</a>

Result on the web

—

DOI - Digital Object Identifier

—

Result language

angličtina

Original language name

Encoding of Planning Problems and their Optimizations in Linear Logic

Original language description

Girard's Linear Logic is a useful formalism which can be used to manage a lot of problems with consumable resources. Its expressiveness is quite good for easily understandable encoding of many problems. We concentrated on expressing planning problems bylinear logic in this paper. We observed a rich usage of a construct of consumable resource in planning problem formulation. This fact motivates us to develop encoding of planning problems in linear logic. This paper shows how planning problems can be encoded in Linear Logic and how to encode some optimizations of these planning problems which can be used to improve the efficiency of finding solutions (plans).T

Czech name

—

Czech description

—

Type

J_x - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)

CEP classification

JD - Use of computers, robotics and its application

OECD FORD branch

—

Project

Result was created during the realization of more than one project. More information in the Projects tab.

Continuities

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>Z - Vyzkumny zamer (s odkazem do CEZ)

Publication year

2009

Confidentiality

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Name of the periodical

Lecture Notes in Computer Science

ISSN

0302-9743

e-ISSN

—

Volume of the periodical

2010

Issue of the periodical within the volume

5437

Country of publishing house

DE - GERMANY

Number of pages

15

Pages from-to

—

UT code for WoS article

—

EID of the result in the Scopus database

—