Planning as tabled logic programming

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F15%3A10319160" target="_blank" >RIV/00216208:11320/15:10319160 - isvavai.cz</a>

Výsledek na webu

<a href="http://dx.doi.org/10.1017/S1471068415000216" target="_blank" >http://dx.doi.org/10.1017/S1471068415000216</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1017/S1471068415000216" target="_blank" >10.1017/S1471068415000216</a>

Jazyk výsledku

angličtina

Název v původním jazyce

Planning as tabled logic programming

Popis výsledku v původním jazyce

This paper describes Picat's planner, its implementation, and planning models for several domains used in International Planning Competition (IPC) 2014. Picat's planner is implemented by use of tabling. During search, every state encountered is tabled, and tabled states are used to effectively perform resource-bounded search. In Picat, structured data can be used to avoid enumerating all possible permutations of objects, and term sharing is used to avoid duplication of common state data. This paper presents several modeling techniques through the example models, ranging from designing state representations to facilitate data sharing and symmetry breaking, encoding actions with operations for efficient precondition checking and state updating, to incorporating domain knowledge and heuristics. Broadly, this paper demonstrates the effectiveness of tabled logic programming for planning, and argues the importance of modeling despite recent significant progress in domain-independent PDDL pla

Název v anglickém jazyce

Planning as tabled logic programming

Popis výsledku anglicky

This paper describes Picat's planner, its implementation, and planning models for several domains used in International Planning Competition (IPC) 2014. Picat's planner is implemented by use of tabling. During search, every state encountered is tabled, and tabled states are used to effectively perform resource-bounded search. In Picat, structured data can be used to avoid enumerating all possible permutations of objects, and term sharing is used to avoid duplication of common state data. This paper presents several modeling techniques through the example models, ranging from designing state representations to facilitate data sharing and symmetry breaking, encoding actions with operations for efficient precondition checking and state updating, to incorporating domain knowledge and heuristics. Broadly, this paper demonstrates the effectiveness of tabled logic programming for planning, and argues the importance of modeling despite recent significant progress in domain-independent PDDL pla

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/GA15-19877S" target="_blank" >GA15-19877S: Automatické modelování znalostí a plánů pro autonomní roboty</a><br>

Návaznosti

I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Rok uplatnění

2015

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

15

Číslo periodika v rámci svazku

4-5

Stát vydavatele periodika

US - Spojené státy americké

Počet stran výsledku

16

Strana od-do

543-558

Kód UT WoS článku

000367692200010

EID výsledku v databázi Scopus

2-s2.0-84948393839