LIPIcs - Leibniz International Proceedings in Informatics. Technical Communications of the 28th International Conference on Logic Programming (ICLP\u2712)
Doi
Abstract
Applications of answer set programming motivated various extensions of the stable model semantics, for instance, to allow aggregates or to facilitate interface with external ontology descriptions. We present a uniform, reductive view on these extensions by viewing them as special cases of formulas with generalized quantifiers. This is done by extending the first-order stable model semantics by Ferraris, Lee and Lifschitz to account for generalized quantifiers and then by reducing the individual extensions to this formalism