Supportedly Stable Answer Sets for Logic Programs with Generalized Atoms

Conference paper

DOI: 10.1007/978-3-319-22002-4_4

Volume 9209 of the book series Lecture Notes in Computer Science (LNCS)
Cite this paper as:
Alviano M., Faber W. (2015) Supportedly Stable Answer Sets for Logic Programs with Generalized Atoms. In: ten Cate B., Mileo A. (eds) Web Reasoning and Rule Systems. RR 2015. Lecture Notes in Computer Science, vol 9209. Springer, Cham


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 dl-atoms, 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 answer sets is on the second level of the polynomial hierarchy, similar to previous proposals and to answer sets of disjunctive logic programs.

Copyright information

© Springer International Publishing Switzerland 2015

Authors and Affiliations

  1. 1.University of CalabriaRendeItaly
  2. 2.University of HuddersfieldHuddersfieldUK