Stable models of formulas with generalized quantifiers (preliminary report)

Joohyung Lee, Yunsong Meng

Research output: Chapter in Book/Report/Conference proceedingConference contribution

4 Citations (Scopus)

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.

Original languageEnglish (US)
Title of host publicationLeibniz International Proceedings in Informatics, LIPIcs
Pages61-71
Number of pages11
Volume17
DOIs
StatePublished - 2012
Event28th International Conference on Logic Programming, ICLP 2012 - Budapest, Hungary
Duration: Sep 4 2012Sep 8 2012

Other

Other28th International Conference on Logic Programming, ICLP 2012
CountryHungary
CityBudapest
Period9/4/129/8/12

Fingerprint

Generalized Quantifiers
Stable Models
Semantics
Computer programming
Interfaces (computer)
Ontology
Answer Set Programming
First-order

Keywords

  • Answer set programming
  • Generalized quantifiers
  • Stable model semantics

ASJC Scopus subject areas

  • Software
  • Logic

Cite this

Lee, J., & Meng, Y. (2012). Stable models of formulas with generalized quantifiers (preliminary report). In Leibniz International Proceedings in Informatics, LIPIcs (Vol. 17, pp. 61-71) https://doi.org/10.4230/LIPIcs.ICLP.2012.61

Stable models of formulas with generalized quantifiers (preliminary report). / Lee, Joohyung; Meng, Yunsong.

Leibniz International Proceedings in Informatics, LIPIcs. Vol. 17 2012. p. 61-71.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Lee, J & Meng, Y 2012, Stable models of formulas with generalized quantifiers (preliminary report). in Leibniz International Proceedings in Informatics, LIPIcs. vol. 17, pp. 61-71, 28th International Conference on Logic Programming, ICLP 2012, Budapest, Hungary, 9/4/12. https://doi.org/10.4230/LIPIcs.ICLP.2012.61
Lee J, Meng Y. Stable models of formulas with generalized quantifiers (preliminary report). In Leibniz International Proceedings in Informatics, LIPIcs. Vol. 17. 2012. p. 61-71 https://doi.org/10.4230/LIPIcs.ICLP.2012.61
Lee, Joohyung ; Meng, Yunsong. / Stable models of formulas with generalized quantifiers (preliminary report). Leibniz International Proceedings in Informatics, LIPIcs. Vol. 17 2012. pp. 61-71
@inproceedings{50ffa80a5cd743c99a3352f09d871892,
title = "Stable models of formulas with generalized quantifiers (preliminary report)",
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.",
keywords = "Answer set programming, Generalized quantifiers, Stable model semantics",
author = "Joohyung Lee and Yunsong Meng",
year = "2012",
doi = "10.4230/LIPIcs.ICLP.2012.61",
language = "English (US)",
isbn = "9783939897439",
volume = "17",
pages = "61--71",
booktitle = "Leibniz International Proceedings in Informatics, LIPIcs",

}

TY - GEN

T1 - Stable models of formulas with generalized quantifiers (preliminary report)

AU - Lee, Joohyung

AU - Meng, Yunsong

PY - 2012

Y1 - 2012

N2 - 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.

AB - 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.

KW - Answer set programming

KW - Generalized quantifiers

KW - Stable model semantics

UR - http://www.scopus.com/inward/record.url?scp=84880198820&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84880198820&partnerID=8YFLogxK

U2 - 10.4230/LIPIcs.ICLP.2012.61

DO - 10.4230/LIPIcs.ICLP.2012.61

M3 - Conference contribution

AN - SCOPUS:84880198820

SN - 9783939897439

VL - 17

SP - 61

EP - 71

BT - Leibniz International Proceedings in Informatics, LIPIcs

ER -