Using Tabled Logic Programming to Solve the Petrobras Planning Problem

Kód výsledku v 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>

Výsledek na webu

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

Jazyk výsledku

angličtina

Název v původním jazyce

Using Tabled Logic Programming to Solve the Petrobras Planning Problem

Popis výsledku v původním jazyce

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.

Název v anglickém jazyce

Using Tabled Logic Programming to Solve the Petrobras Planning Problem

Popis výsledku anglicky

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.

Druh

J_x - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)

CEP obor

IN - Informatika

OECD FORD obor

—

Projekt

<a href="/cs/project/GAP103%2F10%2F1287" target="_blank" >GAP103/10/1287: PlanEx: Propojení plánování a provádění plánů</a><br>

Návaznosti

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Rok uplatnění

2014

Kód důvěrnosti údajů

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

Název periodika

Theory and Practice of Logic Programming

ISSN

1471-0684

e-ISSN

—

Svazek periodika

14

Číslo periodika v rámci svazku

4-5

Stát vydavatele periodika

US - Spojené státy americké

Počet stran výsledku

14

Strana od-do

697-710

Kód UT WoS článku

000343203200020

EID výsledku v databázi Scopus

—