Research map / Large language models / Retrieval and knowledge
Stream Reasoning in Temporal Datalog
Alessandro Ronca, Mark Kaminski, Bernardo Cuenca Grau, Boris Motik, Ian Horrocks
Read the paperCheck your idea against 137,217 papers
AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| Restrict DTP queries to nonrecursive connected queries | Temporal Datalog DTP · DTP | data complexity: PSpace-complete -> P | Improved |
| Restrict Forget queries to nonrecursive connected queries whose rules contain no time points | Temporal Datalog Forget · Forget | data complexity and decidability: undecidable -> P | Improved |
| Restrict Delay queries to nonrecursive connected constant-free queries | Temporal Datalog Delay · Delay | decidability and complexity: undecidable -> co-NExp-complete | Improved |
| Restrict Window queries to nonrecursive connected constant-free queries | Temporal Datalog Window · Window | decidability and complexity: undecidable -> co-NExp-complete | Improved |
Closest papers by meaning
- Optimised Storage for Datalog Reasoning (AAAI 2024 · similarity 0.88)
- Goal-Driven Reasoning in DatalogMTL with Magic Sets (AAAI 2025 · similarity 0.87)
- Temporal Conjunctive Query Answering via Rewriting (AAAI 2025 · similarity 0.85)
- StreamingThinker: Large Language Models Can Think While Reading (ICLR 2026 · similarity 0.84)
- LogicCat: A Chain-of-Thought Text-to-SQL Benchmark for Complex Reasoning (AAAI 2026 · similarity 0.83)
- Computing the Why-Provenance for Datalog Queries via SAT Solvers (AAAI 2024 · similarity 0.82)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.
