English

plasp 3: Towards Effective ASP Planning

Logic in Computer Science 2020-02-19 v1

Abstract

We describe the new version of the PDDL-to-ASP translator plasp. First, it widens the range of accepted PDDL features. Second, it contains novel planning encodings, some inspired by 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.

Keywords

Cite

@article{arxiv.1812.04491,
  title  = {plasp 3: Towards Effective ASP Planning},
  author = {Yannis Dimopoulos and Martin Gebser and Patrick Lühne and Javier Romero and Torsten Schaub},
  journal= {arXiv preprint arXiv:1812.04491},
  year   = {2020}
}

Comments

27 pages, under consideration for publication in Theory and Practice of Logic Programming (TPLP)

R2 v1 2026-06-23T06:39:07.643Z