Reactive answer set programming

N/ACitations
Citations of this article
25Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We introduce the first approach to Reactive Answer Set Programming, aiming at reasoning about real-time dynamic systems running online in changing environments. We start by laying the theoretical foundations by appeal to module theory. With this, we elaborate upon the composition of the various offline and online programs in order to pave the way for stream-driven grounding and solving. Finally, we describe the implementation of a reactive ASP solver, oclingo. © 2011 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Gebser, M., Grote, T., Kaminski, R., & Schaub, T. (2011). Reactive answer set programming. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6645 LNAI, pp. 54–66). https://doi.org/10.1007/978-3-642-20895-9_7

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free