No article text was recorded for this version.
computational complexity of temporal reasoning
Version 1 of 127 papers37 conceptsfrozen 2026-10-04
Papers in this version
- Blog: Temporalized
- Blog: Combining DL-Lite_{bool}^N with Branching Time: A gentle Marriage
- Blog: Metric Temporal Description Logics with Interval-Rigid Names (Extended Abstract)
- Blog: Temporal Logics Over Finite Traces with Uncertainty
- Blog: On the freeze quantifier in Constraint LTL: decidability and complexity
- Blog: Verification and Monitoring for First-Order LTL with Persistence-Preserving Quantification over Finite and Infinite Traces
- Blog: Temporalized EL Ontologies for Accessing Temporal Data: Complexity of Atomic Queries
- Blog: LTL over Description Logic Axioms
- Blog: Computational Complexity of a Core Fragment of Halpern-Shoham Logic
- Blog: Two-sorted metric temporal logics
- Blog: On Temporal ASP with Eager Unfoldable Operators
- Blog: MeTeoR: Practical Reasoning in Datalog with Metric Temporal Operators
- Blog: Querying Schemas With Access Restrictions
- Blog: Temporal Query Answering in EL
- Blog: Synthesis for Temporal Logic over the Reals
- Blog: Connection Based Strategies for Deciding Propositional Temporal Logic
- Blog: Practical Reasoning in DatalogMTL
- Blog: CTL with Finitely Bounded Semantics
- Blog: Verification of Agent-Based Artifact Systems
- Blog: Programming Resource-Bounded Deliberative Agents
- Blog: Description Logic Based Dynamic Systems: Modeling, Verification, and Synthesis
- Blog: Lightweight Temporal Description Logics with Rigid Roles and Restricted TBoxes
- Blog: Bounded Timed Propositional Temporal Logic with Past Captures Timeline-based Planning with Bounded Constraints
- Blog: Goal-Driven Reasoning in DatalogMTL with Magic Sets
- Blog: First-Order Automata
- Blog: Past and Future of DL-Lite
- Blog: Tractable Fragments of Datalog with Metric Temporal Operators
History & citation
Current · Permanent link
Cite this direction
Latest version (a living page):
@misc{lacuna_computational_complexity_of_temporal_rea_f9ee0fb3,
title = {computational complexity of temporal reasoning},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/computational-complexity-of-temporal-reasoning/rdr_f9ee0fb397534fa0b8bb902f35c86b27},
note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-20},
}This exact version (version 1, frozen text):
@misc{lacuna_computational_complexity_of_temporal_rea_f9ee0fb3_v1,
title = {computational complexity of temporal reasoning},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/computational-complexity-of-temporal-reasoning/rdr_f9ee0fb397534fa0b8bb902f35c86b27/v/1},
note = {Version 1, frozen 2026-10-04. Accessed 2026-11-20},
}