The following pages link to (Q4518442):
Displaying 8 items.
- Temporal connectives versus explicit timestamps to query temporal databases (Q1305921) (← links)
- The complexity of query evaluation in indefinite temporal constraint databases (Q1369238) (← links)
- Decidable fragments of first-order temporal logics (Q1591203) (← links)
- A linear time algorithm for monadic querying of indefinite data over linearly ordered domains (Q1887153) (← links)
- Undecidable Propositional Bimodal Logics and One-Variable First-Order Linear Temporal Logics with Counting (Q2957765) (← links)
- Incorporating an implicit time dimension into the relational model and algebra (Q4717042) (← links)
- Undecidability of QLTL and QCTL with two variables and one monadic predicate letter (Q5059700) (← links)
- First-Order Rewritability and Complexity of Two-Dimensional Temporal Ontology-Mediated Queries (Q5870513) (← links)
