plasp 3: Towards Effective ASP Planning
Not on the map. Why?
Abstract (arXiv)
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.
Key facts. Cited by 6 papers in the map (data through 13 Oct 2026). First posted on arXiv 11 Dec 2018.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 1; 2022: 1; 2023: 2; 2024: 1; 2025: 0; 2026: 1.
6 papers.
- 2022Answer Set Planning: A Surveycited by 12
- 2023Logic programming for deliberative robotic task planningcited by 8
- 2021Determining ActionReversibility in STRIPS Using Answer Set and Epistemic Logic Programmingcited by 1
- 2023Planning as Theorem Proving with Heuristicscited by 1
- 2024On the generalization of learned constraints for ASP solving in temporal domainscited by 1
- 2026Parametric Modular Answer Set Programs Made Declarativecited by 0
- 2026Parametric Modular Answer Set Programs Made Declarative21 May 2026
- 2024On the generalization of learned constraints for ASP solving in temporal domains29 Jan 2024
- 2023Planning as Theorem Proving with Heuristics23 Mar 2023
- 2023Logic programming for deliberative robotic task planning18 Jan 2023
- 2022Answer Set Planning: A Survey11 Feb 2022
- 2021Determining ActionReversibility in STRIPS Using Answer Set and Epistemic Logic Programming11 Aug 2021