About: Using Tabled Logic Programming to Solve the Petrobras Planning Problem

Facets (new session)
Description
Metadata
Settings
- owl:sameAs
- Inference Rule:

About: Using Tabled Logic Programming to Solve the Petrobras Planning Problem Goto Sponge NotDistinct Permalink

An Entity of Type : http://linked.opendata.cz/ontology/domain/vavai/Vysledek, within Data Space : linked.opendata.cz associated with source document(s)

Attributes	Values
rdf:type	skos:Concept http://linked.opendata.cz/ontology/domain/vavai/Vysledek
rdfs:seeAlso	http://dx.doi.org/10.1017/S1471068414000295
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. 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. (en)
Title	Using Tabled Logic Programming to Solve the Petrobras Planning Problem Using Tabled Logic Programming to Solve the Petrobras Planning Problem (en)
skos:prefLabel	Using Tabled Logic Programming to Solve the Petrobras Planning Problem Using Tabled Logic Programming to Solve the Petrobras Planning Problem (en)
skos:notation	RIV/00216208:11320/14:10283632!RIV15-GA0-11320___
http://linked.open...avai/riv/aktivita	P
http://linked.open...avai/riv/aktivity	P(GAP103/10/1287)
http://linked.open...iv/cisloPeriodika	4-5
http://linked.open...vai/riv/dodaniDat	2015
http://linked.open...aciTvurceVysledku	Barták, Roman
http://linked.open.../riv/druhVysledku	J - Článek v odborném periodiku
http://linked.open...iv/duvernostUdaju	S - Úplné a pravdivé údaje nepodléhající ochraně podle zvláštních právních předpisů
http://linked.open...titaPredkladatele	Univerzita Karlova v Praze / Matematicko-fyzikální fakulta
http://linked.open...dnocenehoVysledku	52485
http://linked.open...ai/riv/idVysledku	RIV/00216208:11320/14:10283632
http://linked.open...riv/jazykVysledku	eng - angličtina
http://linked.open.../riv/klicovaSlova	logistics; planning; symmetry breaking; resource-bounded search; tabling (en)
http://linked.open.../riv/klicoveSlovo	planning symmetry breaking logistics resource-bounded search tabling
http://linked.open...odStatuVydavatele	US - Spojené státy americké
http://linked.open...ontrolniKodProRIV	[9D6D80054B95]
http://linked.open...i/riv/nazevZdroje	Theory and Practice of Logic Programming
http://linked.open...in/vavai/riv/obor	IN
http://linked.open...ichTvurcuVysledku	1 (xsd:int)
http://linked.open...cetTvurcuVysledku	2 (xsd:int)
http://linked.open...vavai/riv/projekt	PlanEx: Bridging Planning and Execution
http://linked.open...UplatneniVysledku	2014
http://linked.open...v/svazekPeriodika	14
http://linked.open...iv/tvurceVysledku	Barták, Roman Zhou, Neng-Fa
http://linked.open...ain/vavai/riv/wos	000343203200020
issn	1471-0684
number of pages	14 (xsd:int)
http://bibframe.org/vocab/doi	10.1017/S1471068414000295
http://localhost/t...ganizacniJednotka	11320

Faceted Search & Find service v1.16.118 as of Jun 21 2024

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 07.20.3240 as of Jun 21 2024, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (126 GB total memory, 48 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software