Properties of Answer Set Programming with Convex Generalized Atoms

12/20/2013
by   Mario Alviano, et al.
0

In recent years, Answer Set Programming (ASP), logic programming under the stable model or answer set semantics, has seen several extensions by generalizing the notion of an atom in these programs: be it aggregate atoms, HEX atoms, generalized quantifiers, or abstract constraints, the idea is to have more complicated satisfaction patterns in the lattice of Herbrand interpretations than traditional, simple atoms. In this paper we refer to any of these constructs as generalized atoms. Several semantics with differing characteristics have been proposed for these extensions, rendering the big picture somewhat blurry. In this paper, we analyze the class of programs that have convex generalized atoms (originally proposed by Liu and Truszczynski in [10]) in rule bodies and show that for this class many of the proposed semantics coincide. This is an interesting result, since recently it has been shown that this class is the precise complexity boundary for the FLP semantics. We investigate whether similar results also hold for other semantics, and discuss the implications of our findings.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/06/2014

Semantics and Compilation of Answer Set Programming with Generalized Atoms

Answer Set Programming (ASP) is logic programming under the stable model...
research
07/07/2002

Abduction, ASP and Open Logic Programs

Open logic programs and open entailment have been recently proposed as a...
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
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...
research
05/05/2015

In Defense of the Direct Perception of Affordances

The field of functional recognition or affordance estimation from images...
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
03/08/2000

Smodels: A System for Answer Set Programming

The Smodels system implements the stable model semantics for normal logi...

Please sign up or login with your details

Forgot password? Click here to reset