From local to global consistency in temporal constraint networks
From MaRDI portal
Publication:1391930
DOI10.1016/S0304-3975(96)00192-2zbMath0902.68016OpenAlexW1554962133MaRDI QIDQ1391930
Publication date: 23 July 1998
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0304-3975(96)00192-2
Related Items (6)
On point-duration networks for temporal reasoning ⋮ Hyper temporal networks. A tractable generalization of simple temporal networks and its relation to mean payoff games ⋮ The algebra \(\text{IA}^{\text{fuz}}\): a framework for qualitative fuzzy temporal reasoning ⋮ Tractable disjunctions of linear constraints: Basic results and applications to temporal reasoning ⋮ Backtracking algorithms for disjunctions of temporal constraints ⋮ Querying temporal and spatial constraint networks in PTIME
Cites Work
- Network-based heuristics for constraint-satisfaction problems
- An optimal k-consistency algorithm
- Temporal constraint networks
- A canonical form for generalized linear constraints
- From local to global consistency
- Reasoning about qualitative temporal information
- Principles and practice of constraint programming. 2nd international workshop, PPCP '94, Rosario, Orcas Island, Washington, DC, USA, May 2-4, 1994. Proceedings
- Networks of constraints: Fundamental properties and applications to picture processing
- A Sufficient Condition for Backtrack-Free Search
- Synthesizing constraint expressions
- Tractable disjunctions of linear constraints: Basic results and applications to temporal reasoning
- Unnamed Item
- Unnamed Item
This page was built for publication: From local to global consistency in temporal constraint networks
