Pages that link to "Item:Q4344697"
From MaRDI portal
The following pages link to Expressive power and complexity in algebraic logic (Q4344697):
Displaying 19 items.
- An initial study of time complexity in infinite-domain constraint satisfaction (Q514144) (← links)
- Point algebras for temporal reasoning: Algorithms and complexity (Q814509) (← links)
- The complexity of constraint satisfaction problems for small relation algebras (Q814599) (← links)
- Complexity classification in qualitative temporal constraint reasoning (Q814637) (← links)
- Expressive power and incompleteness of propositional logics (Q965859) (← links)
- Determining the consistency of partial tree descriptions (Q1028903) (← links)
- Constants and finite unary relations in qualitative constraint reasoning (Q1749385) (← links)
- Comparing decision problems for various paradigms of algebraic logic. (Q1771926) (← links)
- Relation algebras and their application in temporal and spatial reasoning (Q1781107) (← links)
- Tractable approximations for temporal constraint handling (Q1978249) (← links)
- So, what exactly is a qualitative calculus? (Q2046028) (← links)
- Branching interval algebra: an almost complete picture (Q2051838) (← links)
- Deciding the consistency of branching time interval networks (Q5079779) (← links)
- Hardness of Network Satisfaction for Relation Algebras with Normal Representations (Q5098711) (← links)
- Constraint Satisfaction Problems with Infinite Templates (Q5504704) (← links)
- The Complexity of Network Satisfaction Problems for Symmetric Relation Algebras with a Flexible Atom (Q5870532) (← links)
- A relation-algebraic approach to the region connection calculus (Q5941063) (← links)
- Solving infinite-domain CSPs using the patchwork property (Q6157211) (← links)
- Complexity classification transfer for CSPs via algebraic products (Q6621744) (← links)
