Pages that link to "Item:Q1855212"
From MaRDI portal
The following pages link to Efficient algorithms for qualitative reasoning about time (Q1855212):
Displayed 13 items.
- Updating \(\leqslant, <\)-chains (Q294886) (← links)
- Computing the minimal relations in point-based qualitative temporal reasoning through metagraph closure (Q543614) (← links)
- On point-based temporal disjointness (Q1342229) (← links)
- Reasoning about causality between distributed nonatomic events (Q1402743) (← links)
- Backtracking algorithms for disjunctions of temporal constraints (Q1575430) (← links)
- Querying temporal and spatial constraint networks in PTIME (Q1589478) (← links)
- Combining topological and size information for spatial reasoning (Q1605277) (← links)
- A comparison of point-based approaches to qualitative temporal reasoning (Q1606329) (← links)
- Incremental qualitative temporal reasoning: Algorithms for the point algebra and the ORD-Horn class (Q2457656) (← links)
- Planning temporal events using point-interval logic (Q2473196) (← links)
- Efficient Computation of Minimal Point Algebra Constraints by Metagraph Closure (Q3523065) (← links)
- Constraint propagation for ordering, abstraction, and aggregation relations (Q4420773) (← links)
- Complexity studies of a temporal constraint propagation algorithm: a statistical analysis (Q4421240) (← links)