TY  - CONF
A1  - Cabalar, Pedro
T1  - Existential quantifiers in the rule body
N2  - In this paper we consider a simple syntactic extension of Answer Set Programming (ASP) for dealing with (nested) existential quantifiers and double negation in the rule bodies, in a close way to the recent proposal RASPL-1. The semantics for this extension just resorts to Equilibrium Logic (or, equivalently, to the General Theory of Stable Models), which provides a logic-programming interpretation for any arbitrary theory in the syntax of Predicate Calculus. We present a translation of this syntactic class into standard logic programs with variables (either disjunctive or normal, depending on the input rule heads), as those allowed by current ASP solvers. The translation relies on the introduction of auxiliary predicates and the main result shows that it preserves strong equivalence modulo the original signature.
Y1  - 2010
UR  - https://publishup.uni-potsdam.de/frontdoor/index/index/docId/3963
UR  - https://nbn-resolving.org/urn:nbn:de:kobv:517-opus-41476
ER  -