plasp 3: Towards Effective ASP Planning

Yannis Dimopoulus, Martin Gebser, Patrick Lühne, Javier Romero, Torsten Schaub

Research output: Contribution to journalArticlepeer-review


We describe the new version of the Planning Domain Definition Language (PDDL)-to-Answer Set Programming (ASP) translator plasp. First, it widens the range of accepted PDDL features. Second, it contains novel planning encodings, some inspired by Satisfiability Testing (SAT) planning and others exploiting ASP features such as well-foundedness. All of them are designed for handling multivalued fluents in order to capture both PDDL as well as SAS planning formats. Third, enabled by multishot ASP solving, it offers advanced planning algorithms also borrowed from SAT planning. As a result, plasp provides us with an ASP-based framework for studying a variety of planning techniques in a uniform setting. Finally, we demonstrate in an empirical analysis that these techniques have a significant impact on the performance of ASP planning.
Original languageEnglish
Pages (from-to)477-504
Number of pages28
JournalTheory and Practice of Logic Programming
Issue number3
Publication statusPublished - 18 May 2019

Cite this