Content: Publications

ASP Solving for Expanding Universes

In Proc. Thirteenth International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR'15)

Authors:Martin Gebser, Tomi Janhunen, Holger Jost, Roland Kaminski, Torsten Schaub
Type:Article in Conference Proceedings
Publication Date:September 2015
Conference:Thirteenth International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR'15)

Abstract: Over the last years, Answer Set Programming has significantly extended its range of applicability, and moved beyond solving static problems to dynamic ones, even in online environments. However, its nonmonotonic nature as well as its upstream instantiation process impede a seamless integration of new objects into its reasoning process, which is crucial in dynamic domains such as logistics or robotics. We address this problem and introduce a simple approach to successively incorporating new information into ASP systems. Our approach rests upon a translation of logic programs and thus refrains from any dedicated algorithms. We prove its modularity as regards the addition of new information and show its soundness and completeness. We apply our methodology to two domains of the Fifth ASP Competition and evaluate traditional one-shot and incremental multi-shot solving approaches.

BibTeX
@InProceedings{gejajokasc15a-2015,
  title =	{{ASP Solving for Expanding Universes}},
  author =	{Martin Gebser and Tomi Janhunen and Holger Jost and Roland Kaminski and Torsten Schaub},
  booktitle =	{Proc. of Thirteenth International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR'15)},
  year =	{2015},
}