
TL;DR
This paper introduces a new fixed point semantics for stream reasoning that overcomes the rigidity and circularity issues of previous formalisms like LARS, enabling more flexible and constructive reasoning over rapidly changing data streams.
Contribution
It provides a sound, constructive fixed point semantics for a flexible variant of LARS, addressing previous limitations in stream reasoning formalism.
Findings
Semantics is sound and free of circular justifications
Enables bottom-up derivation of answer sets
Handles rapidly changing data dependencies effectively
Abstract
Reasoning over streams of input data is an essential part of human intelligence. During the last decade {\em stream reasoning} has emerged as a research area within the AI-community with many potential applications. In fact, the increased availability of streaming data via services like Google and Facebook has raised the need for reasoning engines coping with data that changes at high rate. Recently, the rule-based formalism {\em LARS} for non-monotonic stream reasoning under the answer set semantics has been introduced. Syntactically, LARS programs are logic programs with negation incorporating operators for temporal reasoning, most notably {\em window operators} for selecting relevant time points. Unfortunately, by preselecting {\em fixed} intervals for the semantic evaluation of programs, the rigid semantics of LARS programs is not flexible enough to {\em constructively} cope with…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
