ASP Solving for Expanding Universes

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.
Complete list of metadatas

https://hal.inria.fr/hal-01187005
Contributor : René Quiniou <>
Submitted on : Tuesday, August 25, 2015 - 6:26:00 PM
Last modification on : Monday, February 11, 2019 - 4:22:53 PM

Identifiers

  • HAL Id : hal-01187005, version 1

Citation

Martin Gebser, Toni Janhunen, Holger Jost, Roland Kaminski, Torsten Schaub. ASP Solving for Expanding Universes. Proceedings of the Thirteenth International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR'15), 2015, Lexington, United States. ⟨hal-01187005⟩

Share

Metrics

Record views

480