Pages that link to "Item:Q814637"
From MaRDI portal
The following pages link to Complexity classification in qualitative temporal constraint reasoning (Q814637):
Displaying 11 items.
- Computational complexity of linear constraints over the integers (Q360099) (← links)
- Decomposition and tractability in qualitative spatial and temporal reasoning (Q360108) (← links)
- Solving hard qualitative temporal reasoning problems: Evaluating the efficiency of using the ORD-Horn class (Q679419) (← links)
- Point algebras for temporal reasoning: Algorithms and complexity (Q814509) (← links)
- Computational complexity of relating time points with intervals (Q1292318) (← links)
- Constants and finite unary relations in qualitative constraint reasoning (Q1749385) (← links)
- A Model-Theoretic View on Qualitative Constraint Reasoning (Q2974510) (← links)
- The complexity of temporal constraint satisfaction problems (Q3578192) (← links)
- Automated Technology for Verification and Analysis (Q5491870) (← links)
- Qualitative Temporal and Spatial Reasoning Revisited (Q5902567) (← links)
- Complexity of qualitative timeline-based planning (Q6060102) (← links)