Pages that link to "Item:Q1402726"

The following pages link to Twenty-one large tractable subclasses of Allen's algebra (Q1402726):

Displaying 9 items.

• Computing the minimal relations in point-based qualitative temporal reasoning through metagraph closure (Q543614) (← links)
• The complexity of constraint satisfaction problems for small relation algebras (Q814599) (← links)
• Complexity classification in qualitative temporal constraint reasoning (Q814637) (← links)
• A unifying approach to temporal constraint reasoning (Q1274294) (← links)
• A complete classification of tractability in Allen's algebra relative to subsets of basic relations (Q1277697) (← links)
• Backtracking algorithms for disjunctions of temporal constraints (Q1575430) (← links)
• Branching interval algebra: an almost complete picture (Q2051838) (← links)
• Temporal reasoning about fuzzy intervals (Q2389652) (← links)
• Incremental qualitative temporal reasoning: Algorithms for the point algebra and the ORD-Horn class (Q2457656) (← links)