Pages that link to "Item:Q1285670"

The following pages link to On the complexity of qualitative spatial reasoning: A maximal tractable fragment of the Region Connection Calculus (Q1285670):

Displaying 49 items.

• Querying incomplete information in RDF with SPARQL (Q286403) (← links)
• A condensed semantics for qualitative spatial reasoning about oriented straight line segments (Q420800) (← links)
• Reasoning about cardinal directions between extended objects: the NP-hardness result (Q420805) (← links)
• Reasoning about visibility (Q420853) (← links)
• On standard models of fuzzy region connection calculus (Q433513) (← links)
• A semi-dynamical approach for solving qualitative spatial constraint satisfaction problems (Q441879) (← links)
• Spatial reasoning with \(\mathcal{RCC} 8\) and connectedness constraints in Euclidean spaces (Q464617) (← links)
• Qualitative constraint satisfaction problems: an extended framework with landmarks (Q490417) (← links)
• Point algebras for temporal reasoning: Algorithms and complexity (Q814509) (← links)
• Composing cardinal direction relations (Q814537) (← links)
• The complexity of constraint satisfaction problems for small relation algebras (Q814599) (← links)
• Generalized region connection calculus (Q814636) (← links)
• Spatial reasoning in a fuzzy region connection calculus (Q835806) (← links)
• On topological consistency and realization (Q850454) (← links)
• A tableau algorithm for description logics with concrete domains and general TBoxes (Q877890) (← links)
• On redundant topological constraints (Q891795) (← links)
• Reasoning about cardinal directions between extended objects (Q991028) (← links)
• Maximal infinite-valued constraint languages (Q1014639) (← links)
• A new approach to cyclic ordering of 2D orientations using ternary relation algebras (Q1583517) (← links)
• Querying temporal and spatial constraint networks in PTIME (Q1589478) (← links)
• EXPtime tableaux for ALC (Q1589576) (← links)
• Combining topological and size information for spatial reasoning (Q1605277) (← links)
• Disjunctions, independence, refinements (Q1614865) (← links)
• Constants and finite unary relations in qualitative constraint reasoning (Q1749385) (← links)
• Relation algebras and their application in temporal and spatial reasoning (Q1781107) (← links)
• Acyclic orders, partition schemes and CSPs: unified hardness proofs and improved algorithms (Q2238592) (← links)
• Relational representation theorems for extended contact algebras (Q2243545) (← links)
• Line-based affine reasoning in Euclidean plane (Q2372194) (← links)
• Fuzzy region connection calculus: An interpretation based on closeness (Q2379309) (← links)
• RCC8 binary constraint network can be consistently extended (Q2457645) (← links)
• Incremental qualitative temporal reasoning: Algorithms for the point algebra and the ORD-Horn class (Q2457656) (← links)
• On the consistency of cardinal direction constraints (Q2457686) (← links)
• GNet: a generalized network model and its applications in qualitative spatial reasoning (Q2482430) (← links)
• Realizing RCC8 networks using convex regions (Q2512988) (← links)
• Drawing interactive Euler diagrams from region connection calculus specifications (Q2629218) (← links)
• General lower bounds and improved algorithms for infinite-domain CSPs (Q2700386) (← links)
• REASONING WITH TOPOLOGICAL AND DIRECTIONAL SPATIAL INFORMATION (Q2857285) (← links)
• Drawing Euler Diagrams from Region Connection Calculus Specifications with Local Search (Q2938524) (← links)
• Generalized Qualitative Spatio-Temporal Reasoning: Complexity and Tableau Method (Q3455761) (← links)
• A Topological Constraint Language with Component Counting (Q3647303) (← links)
• A Canonical Model of the Region Connection Calculus (Q3647304) (← links)
• Design and comparison of lattices of topological relations for spatial representation and reasoning (Q4474978) (← links)
• (Q5005145) (← links)
• Hardness of Network Satisfaction for Relation Algebras with Normal Representations (Q5098711) (← links)
• Constraint Satisfaction Problems with Infinite Templates (Q5504704) (← links)
• A logic for metric and topology (Q5718689) (← links)
• Computational Short Cuts in Infinite Domain Constraint Satisfaction (Q5870497) (← links)
• The Complexity of Network Satisfaction Problems for Symmetric Relation Algebras with a Flexible Atom (Q5870532) (← links)
• Solving infinite-domain CSPs using the patchwork property (Q6157211) (← links)