Maps practical fragments of event languages to Temporal Datalog->- and proposes Streaming Trigger Graphs for efficient uniform composite event recognition over streams.
Valiant , title =
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2verdicts
UNVERDICTED 2representative citing papers
The paper proposes persistent caching of component data and adapted branching heuristics to amortize computation in incremental #SAT, showing performance gains on argumentation and soft core problems.
citing papers explorer
-
Efficient Temporal Datalog Materialisation for Composite Event Recognition
Maps practical fragments of event languages to Temporal Datalog->- and proposes Streaming Trigger Graphs for efficient uniform composite event recognition over streams.