Abstrakt
The declarative language Picat has recently entered the scene of constraint logic programming, in particular thanks to the eciency of its planning library that exploits a clever implementation of tabling, inherithed in part from B-Prolog. Planning benchmarks, used in compe- titions, are dened in the language PDDL and this implied that Picat users were forced to reimplement those models within the language.
In this paper we present an automatic compiler from PDDL to Picat plan- ning models. The compiler is written in Picat and tested on standard PDDL benchmarks.