Computing and Library Services - delivering an inspiring information environment

The Complexity Boundary of Answer Set Programming with Generalized Atoms under the FLP Semantics

Alviano, Mario and Faber, Wolfgang (2013) The Complexity Boundary of Answer Set Programming with Generalized Atoms under the FLP Semantics. In: Logic Programming and Nonmonotonic Reasoning. Lecture Notes in Computer Science, 8148 (8148). Springer Verlag, pp. 67-72. ISBN 978-3-642-40563-1

[img] PDF - Accepted Version
Download (227kB)


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. It is known that programs with generalized atoms that have monotonic or antimonotonic satisfaction patterns do not increase complexity with respect to programs with simple atoms (if satisfaction of the generalized atoms can be decided in polynomial time) under most semantics. It is also known that generalized atoms that are nonmonotonic (being neither monotonic nor antimonotonic) can, but need not, increase the complexity by one level in the polynomial hierarchy if non-disjunctive programs under the FLP semantics are considered. In this paper we provide the precise boundary of this complexity gap: programs with convex generalized atom never increase complexity, while allowing a single non-convex generalized atom (under reasonable conditions) always does. We also discuss several implications of this result in practice.

Item Type: Book Chapter
Additional Information: The final publication is available at
Subjects: Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Schools: School of Computing and Engineering > High-Performance Intelligent Computing
Depositing User: Wolfgang Faber
Date Deposited: 08 Jul 2014 13:53
Last Modified: 12 Nov 2015 09:32


Downloads per month over past year

Repository Staff Only: item control page

View Item View Item

University of Huddersfield, Queensgate, Huddersfield, HD1 3DH Copyright and Disclaimer All rights reserved ©