Stable models of multi-valued formulas: partial versus total functions
Michael Bartholomew, Joohyung Lee · Principles of Knowledge Representation and Reasoning · 2014
Recent extensions of the stable model semantics that allow intensional functions—functions that can be specified by logic programs using other functions and predicates—can be divided into two groups. One group defines a stable model in terms of minimality on the values of partial functions, and the other defines it in terms of uniqueness on the values of total functions. We show that, in the context of multi-valued formulas, these two different approaches can be reduced to each other, and further, each of them can be viewed in terms of propositional formulas under the stable model semantics. Based on these results, we present a prototype implementation of different versions of functional stable model semantics by using existing answer set solvers.