A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf
.
Generalized Answer Set Planning with Incomplete Information
2017
International Conference on Logic Programming and Non-Monotonic Reasoning
Answer Set Planning was one of the first challenging applications of Answer Set Programming (ASP). However, when putting plans into practice, their execution and monitoring lead to an increased complexity. Foremost, this is due to the inherent incompleteness of information faced in real-world scenarios. This fundamental problem has already been addressed in various ways, as in conformant, assertional, and assumption-based planning, and often combined with additional sensing actions. Our
dblp:conf/lpnmr/0003SS17
fatcat:jhnr3oencjby5gityiluhertcm