License: 
Creative Commons Attribution-NoDerivs 3.0 Unported license (CC BY-ND 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.ICLP.2012.61
URN: urn:nbn:de:0030-drops-36105
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2012/3610/
Lee, Joohyung ;
Meng, Yunsong
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.
BibTeX - Entry
@InProceedings{lee_et_al:LIPIcs:2012:3610,
author = {Joohyung Lee and Yunsong Meng},
title = {{Stable Models of Formulas with Generalized Quantifiers (Preliminary Report)}},
booktitle = {Technical Communications of the 28th International Conference on Logic Programming (ICLP'12)},
pages = {61--71},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-43-9},
ISSN = {1868-8969},
year = {2012},
volume = {17},
editor = {Agostino Dovier and V{\'i}tor Santos Costa},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2012/3610},
URN = {urn:nbn:de:0030-drops-36105},
doi = {10.4230/LIPIcs.ICLP.2012.61},
annote = {Keywords: answer set programming, stable model semantics, generalized quantifiers}
}
|
Keywords: |
|
answer set programming, stable model semantics, generalized quantifiers |
|
Collection: |
|
Technical Communications of the 28th International Conference on Logic Programming (ICLP'12) |
|
Issue Date: |
|
2012 |
|
Date of publication: |
|
05.09.2012 |
