AAAI Publications, Twenty-Seventh AAAI Conference on Artificial Intelligence

Font Size: 
Liberal Safety for Answer Set Programs with External Sources
Thomas Eiter, Michael Fink, Thomas Krennwallner, Christoph Redl

Last modified: 2013-06-30


Answer set programs with external source access may introduce new constants that are not present in the program, which is known as value invention. As naive value invention leads to programs with infinite grounding and answer sets, syntactic safety criteria are imposed on programs. However, traditional criteria are in many cases unnecessarily strong and limit expressiveness. We present liberal domain-expansion (de-) safe programs, a novel generic class of answer set programs with external source access that has a finite grounding and allows for value invention. De-safe programs use so-called term bounding functions as a parameter for modular instantiation with concrete—e.g., syntactic or semantic or both—safety criteria. This ensures extensibility of the approach in the future. We provide concrete instances of the framework and develop an operator that can be used for computing a finite grounding. Finally, we discuss related notions of safety from the literature, and show that our approach is strictly more expressive.


Knowledge Representation, Logic Programming, Nonmonotonic Reasoning, Answer Set Programming, Value Invention, Grounding

Full Text: PDF