Content: Publications

Ricochet Robots: A transverse ASP benchmark.

In Proc. Twelfth International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR'13)

Authors:Martin Gebser, Holger Jost, Roland Kaminski, Philipp Obermeier, Orkunt Sabuncu, Torsten Schaub, Marius Schneider
Type:Article in Conference Proceedings
Publication Date:September 2013
Conference:Twelfth International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR'13)

Abstract: A distinguishing feature of Answer Set Programming is its versatility. In addition to satisfiability testing, it offers various forms of model enumeration, intersection or unioning, as well as optimization. Moreover, there is an increasing interest in incremental and reactive solving due to their applicability to dynamic domains. However, so far no comparative studies have been conducted, contrasting the respective modeling capacities and their computational impact. To assess the variety of different forms of ASP solving, we propose Alex Randolph’s board game Ricochet Robots as a transverse benchmark problem that allows us to compare various approaches in a uniform setting. To begin with, we consider alternative ways of encoding ASP planning problems and discuss the underlying modeling techniques. In turn, we conduct an empirical analysis contrasting traditional solving, optimization, incremental, and reactive approaches. In addition, we study the impact of some boosting techniques in the realm of our case study.

BibTeX
@InProceedings{gejokaobsascsc13a-2013,
  title =	{{Ricochet Robots: A transverse ASP benchmark.}},
  author =	{Martin Gebser and Holger Jost and Roland Kaminski and Philipp Obermeier and Orkunt Sabuncu and Torsten Schaub and Marius Schneider},
  booktitle =	{Proc. of Twelfth International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR'13)},
  year =	{2013},
}