Existential quantifiers in the rule body
- 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.
Download full text files
SHA-1:e2a4125bf726b964ed30321b3ef6bed4dca05fb0
Additional Services
| Author details: | Pedro CabalarORCiDGND |
|---|---|
| URN: | urn:nbn:de:kobv:517-opus-41476 |
| Publication type: | Conference Proceeding |
| Language: | English |
| Publication year: | 2010 |
| Publishing institution: | Universität Potsdam |
| Contributing corporation: | Gesellschaft für Logische Programmierung e.V. |
| Release date: | 2010/03/04 |
| Source: | Proceedings of the 23rd Workshop on (Constraint) Logic Programming 2009 / Geske, Ulrich; Wolf, Armin (Hrsg.). - Potsdam : Universitätsverlag, 2010. - S. 59 - 74 |
| RVK - Regensburg classification: | ST 304 |
| Organizational units: | Extern / Extern |
| DDC classification: | 0 Informatik, Informationswissenschaft, allgemeine Werke / 00 Informatik, Wissen, Systeme / 004 Datenverarbeitung; Informatik |
| Collection(s): | Universität Potsdam / Tagungsbände/Proceedings (nicht fortlaufend) / Proceedings of the 23rd Workshop on (Constraint) Logic Programming 2009 / Answer Set Programming |
| License (German): |  Keine öffentliche Lizenz: Unter Urheberrechtsschutz |
