Using Tabled Logic Programming to Solve the Petrobras Planning Problem
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F14%3A10283632" target="_blank" >RIV/00216208:11320/14:10283632 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1017/S1471068414000295" target="_blank" >http://dx.doi.org/10.1017/S1471068414000295</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1017/S1471068414000295" target="_blank" >10.1017/S1471068414000295</a>
Alternative languages
Result language
angličtina
Original language name
Using Tabled Logic Programming to Solve the Petrobras Planning Problem
Original language description
Tabling has been used for some time to improve efficiency of Prolog programs by memorizing answered queries. The same idea can be naturally used to memorize visited states during search for planning. In this paper we present a planner developed in the Picat language to solve the Petrobras planning problem. Picat is a novel Prolog-like language that provides pattern matching, deterministic and non-deterministic rules, and tabling as its core modelling and solving features. We demonstrate these capabilities using the Petrobras problem, where the goal is to plan transport of cargo items from ports to platforms using vessels with limited capacity. Monte Carlo Tree Search has been so far the best technique to tackle this problem and we will show that by using tabling we can achieve much better runtime efficiency and better plan quality.
Czech name
—
Czech description
—
Classification
Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
IN - Informatics
OECD FORD branch
—
Result continuities
Project
<a href="/en/project/GAP103%2F10%2F1287" target="_blank" >GAP103/10/1287: PlanEx: Bridging Planning and Execution</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
Others
Publication year
2014
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
Theory and Practice of Logic Programming
ISSN
1471-0684
e-ISSN
—
Volume of the periodical
14
Issue of the periodical within the volume
4-5
Country of publishing house
US - UNITED STATES
Number of pages
14
Pages from-to
697-710
UT code for WoS article
000343203200020
EID of the result in the Scopus database
—