Semantics and Compilation of Answer Set Programming with Generalized Atoms

05/06/2014
by   Mario Alviano, et al.
0

Answer Set Programming (ASP) is logic programming under the stable model or answer set semantics. During the last decade, this paradigm has seen several extensions by generalizing the notion of atom used in these programs. Among these, there are aggregate atoms, HEX atoms, generalized quantifiers, and abstract constraints. In this paper we refer to these constructs collectively as generalized atoms. The idea common to all of these constructs is that their satisfaction depends on the truth values of a set of (non-generalized) atoms, rather than the truth value of a single (non-generalized) atom. Motivated by several examples, we argue that for some of the more intricate generalized atoms, the previously suggested semantics provide unintuitive results and provide an alternative semantics, which we call supportedly stable or SFLP answer sets. We show that it is equivalent to the major previously proposed semantics for programs with convex generalized atoms, and that it in general admits more intended models than other semantics in the presence of non-convex generalized atoms. We show that the complexity of supportedly stable models is on the second level of the polynomial hierarchy, similar to previous proposals and to stable models of disjunctive logic programs. Given these complexity results, we provide a compilation method that compactly transforms programs with generalized atoms in disjunctive normal form to programs without generalized atoms. Variants are given for the new supportedly stable and the existing FLP semantics, for which a similar compilation technique has not been known so far.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/20/2013

Properties of Answer Set Programming with Convex Generalized Atoms

In recent years, Answer Set Programming (ASP), logic programming under t...
research
07/07/2002

Abduction, ASP and Open Logic Programs

Open logic programs and open entailment have been recently proposed as a...
research
01/08/2013

Two New Definitions of Stable Models of Logic Programs with Generalized Quantifiers

We present alternative definitions of the first-order stable model seman...
research
12/20/2013

A Functional View of Strong Negation in Answer Set Programming

The distinction between strong negation and default negation has been us...
research
01/18/2014

Unfounded Sets and Well-Founded Semantics of Answer Set Programs with Aggregates

Logic programs with aggregates (LPA) are one of the major linguistic ext...
research
03/08/2000

Smodels: A System for Answer Set Programming

The Smodels system implements the stable model semantics for normal logi...
research
04/30/2021

Analyzing Semantics of Aggregate Answer Set Programming Using Approximation Fixpoint Theory

Aggregates provide a concise way to express complex knowledge. While the...

Please sign up or login with your details

Forgot password? Click here to reset