plasp: A Prototype for PDDL-Based Planning in ASP [chapter]

Martin Gebser, Roland Kaminski, Murat Knecht, Torsten Schaub
2011 Lecture Notes in Computer Science  
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
more » ... ns. 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.
doi:10.1007/978-3-642-20895-9_41 fatcat:4rs6mfwq6ndmjl47vmwys25hgm