ASP solving for expanding universes.

*(English)*Zbl 06504245
Calimeri, Francesco (ed.) et al., Logic programming and nonmonotonic reasoning. 13th international conference, LPNMR 2015, Lexington, KY, USA, September 27–30, 2015. Proceedings. Cham: Springer (ISBN 978-3-319-23263-8/pbk; 978-3-319-23264-5/pbk). Lecture Notes in Computer Science 9345. Lecture Notes in Artificial Intelligence, 354-367 (2015).

Summary: 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 5th ASP Competition and evaluate traditional one-shot and incremental multi-shot solving approaches.

For the entire collection see [Zbl 1320.68014].

For the entire collection see [Zbl 1320.68014].