Stable Models of Formulas with Generalized Quantifiers (Preliminary Report)

Authors Joohyung Lee, Yunsong Meng

Thumbnail PDF


  • Filesize: 0.49 MB
  • 11 pages

Document Identifiers

Author Details

Joohyung Lee
Yunsong Meng

Cite AsGet BibTex

Joohyung Lee and Yunsong Meng. Stable Models of Formulas with Generalized Quantifiers (Preliminary Report). In Technical Communications of the 28th International Conference on Logic Programming (ICLP'12). Leibniz International Proceedings in Informatics (LIPIcs), Volume 17, pp. 61-71, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2012)


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.
  • answer set programming
  • stable model semantics
  • generalized quantifiers


  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    PDF Downloads