The following pages link to (Q5693201):
Displaying 26 items.
- The problem of coincidence in a theory of temporal multiple recurrence (Q266873) (← links)
- Agent deliberation in an executable temporal framework (Q456706) (← links)
- Computing the minimal relations in point-based qualitative temporal reasoning through metagraph closure (Q543614) (← links)
- Combining interval-based temporal reasoning with general TBoxes (Q814545) (← links)
- Compact and tractable automaton-based representations of time granularities (Q875518) (← links)
- Approximability of clausal constraints (Q970111) (← links)
- Universal solutions for temporal data exchange (Q2051817) (← links)
- The token reification approach to temporal reasoning (Q2171256) (← links)
- First-order rewritability of ontology-mediated queries in linear temporal logic (Q2238711) (← links)
- Computing possible and certain answers over order-incomplete data (Q2334598) (← links)
- Incremental qualitative temporal reasoning: Algorithms for the point algebra and the ORD-Horn class (Q2457656) (← links)
- Definability and decidability of binary predicates for time granularity (Q2495389) (← links)
- Metric temporal answer set programming over timed traces (Q2694559) (← links)
- Temporal Contextual Logic Programming (Q2873801) (← links)
- Back from the future (Q2901197) (← links)
- Ontology-Mediated Query Answering with Data-Tractable Description Logics (Q2970310) (← links)
- A History of Until (Q3185767) (← links)
- Efficient Computation of Minimal Point Algebra Constraints by Metagraph Closure (Q3523065) (← links)
- A Correspondence between Temporal Description Logics (Q3643271) (← links)
- Системы временной логики I: моменты, истории, деревья (Q5059703) (← links)
- A two‐dimensional metric temporal logic (Q5112385) (← links)
- First-Order Rewritability and Complexity of Two-Dimensional Temporal Ontology-Mediated Queries (Q5870513) (← links)
- (Q6060097) (← links)
- Temporal Minimal-World Query Answering over Sparse ABoxes (Q6063880) (← links)
- Tense logic based on finite orthomodular posets (Q6103758) (← links)
- A faster algorithm for converting simple temporal networks with uncertainty into dispatchable form (Q6116194) (← links)
