×

plasp

swMATH ID: 7080
Software Authors: Gebser, Martin; Kaminski, Roland; Knecht, Murat; Schaub, Torsten
Description: plasp: A prototype for PDDL-based planning in ASP. We present a prototypical system, plasp, implementing Planning by compilation to Answer Set Programming (ASP). Our approach is inspired by Planning as Satisfiability, yet it aims at keeping the actual compilation simple in favor of modeling planning techniques by meta-programming in ASP. This has several advantages. First, ASP modelings are easily modifiable and can be studied in a transparent setting. Second, we can take advantage of available ASP grounders to obtain propositional representations. Third, we can harness ASP solvers providing incremental solving mechanisms. Finally, the ASP community gains access to a wide range of planning problems, and the planning community benefits from the knowledge representation and reasoning capacities of ASP.
Homepage: http://rd.springer.com/chapter/10.1007%2F978-3-642-20895-9_41
Keywords: Answer Set Programming; ASP
Related Software: PDDL; Clingo; ROSoClingo; Clingcon; WASP; GDL; Graphplan; Moviola; oClingo; MiniSat; ezcsp; GitHub; CCalc; GNU parallel; ActHEX; asprin; D-FLAT; Potassco; z3; DLV-EX
Cited in: 9 Publications

Standard Articles

2 Publications describing the Software, including 1 Publication in zbMATH Year
plasp 3: towards effective ASP planning. Zbl 1491.68190
Dimopoulos, Yannis; Gebser, Martin; Lühne, Patrick; Romero, Javier; Schaub, Torsten
2017
plasp: a prototype for PDDL-based planning in ASP
Gebser, Martin; Kaminski, Roland; Knecht, Murat; Schaub, Torsten
2011

Citations by Year