Abstract

There are presently many proposals to extend the notion of stable model to the domain of partial interpretations. This paper is concerned with the analysis of the expressive powers of such types of stable model under various versions of deterministic semantics for unbound (i.e., without ground terms) queries on DATALOG programs with negation. Various versions of non-deterministic semantics are also proposed and their expressive powers are fully characterized as well.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call