Pages that link to "Item:Q3452504"

The following pages link to Reasoning about temporal relations (Q3452504):

Displaying 44 items.

• Tractability in constraint satisfaction problems: a survey (Q271997) (← links)
• Reasoning about cardinal directions between extended objects: the NP-hardness result (Q420805) (← links)
• Spatial reasoning with \(\mathcal{RCC} 8\) and connectedness constraints in Euclidean spaces (Q464617) (← links)
• Interval graph representation with given interval and intersection lengths (Q491160) (← links)
• An initial study of time complexity in infinite-domain constraint satisfaction (Q514144) (← links)
• Point algebras for temporal reasoning: Algorithms and complexity (Q814509) (← links)
• Complexity classification in qualitative temporal constraint reasoning (Q814637) (← links)
• Reasoning about cardinal directions between extended objects (Q991028) (← links)
• Maximal infinite-valued constraint languages (Q1014639) (← links)
• Determining the consistency of partial tree descriptions (Q1028903) (← links)
• Cluster forming interval sub-algebras (Q1273466) (← links)
• A complete classification of tractability in Allen's algebra relative to subsets of basic relations (Q1277697) (← links)
• Computational complexity of relating time points with intervals (Q1292318) (← links)
• Twenty-one large tractable subclasses of Allen's algebra (Q1402726) (← links)
• Allen-like theory of time for tree-like structures (Q1706167) (← links)
• Constants and finite unary relations in qualitative constraint reasoning (Q1749385) (← links)
• Implementation of the temporal reasoning mechanism in modern intelligent systems (Q1951947) (← links)
• Tractable approximations for temporal constraint handling (Q1978249) (← links)
• Range-consistent forbidden regions of Allen's relations (Q2011570) (← links)
• Branching interval algebra: an almost complete picture (Q2051838) (← links)
• Acyclic orders, partition schemes and CSPs: unified hardness proofs and improved algorithms (Q2238592) (← links)
• Temporal reasoning about fuzzy intervals (Q2389652) (← links)
• Modelling and solving temporal reasoning as propositional satisfiability (Q2389682) (← links)
• Extending partial representations of interval graphs (Q2408095) (← links)
• The algebra \(\text{IA}^{\text{fuz}}\): a framework for qualitative fuzzy temporal reasoning (Q2457614) (← links)
• Incremental qualitative temporal reasoning: Algorithms for the point algebra and the ORD-Horn class (Q2457656) (← links)
• Planning temporal events using point-interval logic (Q2473196) (← links)
• General lower bounds and improved algorithms for infinite-domain CSPs (Q2700386) (← links)
• Towards Algebraic Semantics of Circus Time (Q2814616) (← links)
• Satisfying constraint sets through convex envelopes (Q3429327) (← links)
• Quantifying the Discord: Order Discrepancies in Message Sequence Charts (Q3510808) (← links)
• QUANTIFYING THE DISCORD: ORDER DISCREPANCIES IN MESSAGE SEQUENCE CHARTS (Q3552521) (← links)
• Temporal Algebras, Pretemporal Algebras, and Modal Algebras: A Relation between Time and Necessity (Q4323829) (← links)
• Reasoning about temporal relations (Q4369856) (← links)
• An interval-based temporal algebra based on binary encoding of point relations (Q4506253) (← links)
• Parameterized Complexity of the Workflow Satisfiability Problem (Q4689628) (← links)
• (Q5005145) (← links)
• Deciding the consistency of branching time interval networks (Q5079779) (← links)
• Constraint Satisfaction Problems with Infinite Templates (Q5504704) (← links)
• Qualitative Temporal and Spatial Reasoning Revisited (Q5902567) (← links)
• (Q6060092) (← links)
• Fuzzy Halpern and Shoham's interval temporal logics (Q6083148) (← links)
• The time ontology of Allen's interval algebra (Q6487465) (← links)
• Complexity classification transfer for CSPs via algebraic products (Q6621744) (← links)