License: Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported license (CC BY-NC-ND 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.ICLP.2011.40
URN: urn:nbn:de:0030-drops-31790
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2011/3179/
Brik, Alex ;
Remmel, Jeffrey B.
Hybrid ASP
Abstract
This paper introduces an extension of Answer Set Programming (ASP) called Hybrid ASP which will allow the user to reason about dynamical systems that exhibit both discrete and continuous aspects. The unique feature of Hybrid ASP is that it allows the use of ASP type rules as controls for when to apply algorithms to advance the system to the next position. That is, if the prerequisites of a rule are satisfied and the constraints of the rule are not violated, then the algorithm associated with the rule is invoked.
BibTeX - Entry
@InProceedings{brik_et_al:LIPIcs:2011:3179,
author = {Alex Brik and Jeffrey B. Remmel},
title = {{Hybrid ASP}},
booktitle = {Technical Communications of the 27th International Conference on Logic Programming (ICLP'11) },
pages = {40--50},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-31-6},
ISSN = {1868-8969},
year = {2011},
volume = {11},
editor = {John P. Gallagher and Michael Gelfond},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2011/3179},
URN = {urn:nbn:de:0030-drops-31790},
doi = {10.4230/LIPIcs.ICLP.2011.40},
annote = {Keywords: answer set programming, hybrid systems, modeling and simulation}
}
Keywords: |
|
answer set programming, hybrid systems, modeling and simulation |
Collection: |
|
Technical Communications of the 27th International Conference on Logic Programming (ICLP'11) |
Issue Date: |
|
2011 |
Date of publication: |
|
27.06.2011 |