The following pages link to Relation algebras of intervals (Q2171260):
Displaying 9 items.
- Algebraic foundations for qualitative calculi and networks (Q1733063) (← links)
- Constants and finite unary relations in qualitative constraint reasoning (Q1749385) (← links)
- So, what exactly is a qualitative calculus? (Q2046028) (← links)
- Using model theory to find decidable and tractable description logics with concrete domains (Q2090131) (← links)
- Description logics with concrete domains and general concept inclusions revisited (Q2096462) (← links)
- Acyclic orders, partition schemes and CSPs: unified hardness proofs and improved algorithms (Q2238592) (← links)
- Hardness of Network Satisfaction for Relation Algebras with Normal Representations (Q5098711) (← links)
- Computational Short Cuts in Infinite Domain Constraint Satisfaction (Q5870497) (← links)
- Solving infinite-domain CSPs using the patchwork property (Q6157211) (← links)
