Home » Publication » 23036

Dettaglio pubblicazione

2020, Proceedings of the 17th International Conference on Principles of Knowledge Representation and Reasoning (KR 2020), Pages 152-161

High-level Programming via Generalized Planning and LTL Synthesis (04b Atto di convegno in volume)

Bonet Blai, De Giacomo Giuseppe, Geffner Hector, Patrizi Fabio, Rubin Sasha

We look at program synthesis where the aim is to automatically synthesize a controller that operates on data structures and from which a concrete program can be easily derived. We do not aim at a fully-automatic process or tool that produces a program meeting a given specification of the program’s behaviour. Rather, we aim at the design of a clear and well- founded approach for supporting programmers at the design and implementation phases. Concretely, we first show that a program synthesis task can be modeled as a generalized planning problem. This is done at an abstraction level where the involved data structures are seen as black-boxes that can be interfaced with actions and observations, the first corresponding to the operations and the second to the queries provided by the data structure. The abstraction level is high enough to capture intuitive and common assumptions as well as general and simple strategies used by programmers, and yet it contains sufficient structure to support the automated generation of concrete solutions (in the form of controllers). From such controllers and the use of standard data structures, an actual program in a general language like C++ or Python can be easily obtained. Then, we discuss how the resulting generalized planning problem can be reduced to an LTL synthesis problem, thus making available any LTL synthesis engine for obtaining the controllers. We illustrate the effectiveness of the approach on a series of examples.
ISBN: 978-0-9992411-7-2
© Università degli Studi di Roma "La Sapienza" - Piazzale Aldo Moro 5, 00185 Roma