Equivalent Stream Reasoning Programs
Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence. Pages 929-934.
Abstract
The emerging research field of stream reasoning faces the challenging trade-off between expressiveness of query programs and data throughput. For optimizing programs methods are needed to tell whether two programs are equivalent. Towards providing practical reasoning techniques on streams, we consider LARS programs, which is a powerful extension of Answer Set Programming (ASP) for stream reasoning that supports windows on streams for discarding information.We define different notions of equivalence between such programs and give semantic characterizations in terms of models. We show how a practically relevant fragment can be alternatively captured usingHere-and-There models, yielding an extension of equilibrium semantics of ASP to this class of programs. Finally, we characterize the computational complexity of deciding the considered equival encerelations.
@inproceedings{ijcai2016p136,
title = {Equivalent Stream Reasoning Programs},
author = {Beck, Harald and Dao-Tran, Minh and Eiter, Thomas},
booktitle = {Proceedings of the Twenty-Fifth International Joint Conference on
Artificial Intelligence, {IJCAI-16}},
publisher = {AAAI Press / International Joint Conferences on Artificial Intelligence},
editor = {Subbarao Kambhampati},
pages = {929--934},
year = {2016},
month = {7},
url = {https://ijcai.org/proceedings/2016/136},
}
TY - CPAPER TI - Equivalent Stream Reasoning Programs AU - Beck, Harald AU - Dao-Tran, Minh AU - Eiter, Thomas T2 - Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, IJCAI-16 PB - AAAI Press / International Joint Conferences on Artificial Intelligence PY - 2016 SP - 929 EP - 934 UR - https://ijcai.org/proceedings/2016/136 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
