Lazy Compilation in Classical Planning (Extended Abstract)
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21240%2F22%3A00360955" target="_blank" >RIV/68407700:21240/22:00360955 - isvavai.cz</a>
Result on the web
<a href="https://doi.org/10.1609/socs.v15i1.21782" target="_blank" >https://doi.org/10.1609/socs.v15i1.21782</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1609/socs.v15i1.21782" target="_blank" >10.1609/socs.v15i1.21782</a>
Alternative languages
Result language
angličtina
Original language name
Lazy Compilation in Classical Planning (Extended Abstract)
Original language description
Classical planning is a task of finding a sequence of actions that achieve a given goal. One of many approaches to classical planning is compilation into propositional satisfiability (SAT). In this work, we propose a new method that uses lazy compilation into SAT. Different from the standard compilation method, lazy compilation constructs the target propositional formula step by step while the SAT solver is consulted at each step and refinements of the formula are suggested according to SAT solver's answers. The performed experiments pointed out that lazy compilation has the potential to improve the performance of the planners.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
—
OECD FORD branch
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
Result continuities
Project
<a href="/en/project/GA22-31346S" target="_blank" >GA22-31346S: logicMOVE: Logic Reasoning in Motion Planning for Multiple Robotic Agents</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
Others
Publication year
2022
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
Article name in the collection
Proceedings of the Fifteenth International Symposium on Combinatorial Search
ISBN
978-1-57735-873-2
ISSN
—
e-ISSN
—
Number of pages
3
Pages from-to
270-272
Publisher name
Association for the Advancement of Artificial Intelligence (AAAI)
Place of publication
Palo Alto, California
Event location
Vídeň
Event date
Jul 21, 2022
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—