Solving multi-granularity temporal constraint networks
From MaRDI portal
Publication:1614864
DOI10.1016/S0004-3702(02)00223-0zbMath0999.68204MaRDI QIDQ1614864
Sushil Jajodia, Xiaoyang Sean Wang, Claudio Bettini
Publication date: 9 September 2002
Published in: Artificial Intelligence (Search for Journal in Brave)
CSPtemporal reasoningtemporal constraintsarc consistencytime granularityconstraint reasoningworkflow timing constraints
Knowledge representation (68T30) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items (3)
A mathematical framework for the semantics of symbolic languages representing periodic time ⋮ Compact and tractable automaton-based representations of time granularities ⋮ An intensional approach to qualitative and quantitative periodicity-dependent temporal constraints
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Maintaining knowledge about temporal intervals
- Real-time logics: Complexity and expressiveness
- Temporal constraint networks
- Consistency in networks of relations
- A unifying approach to temporal constraint reasoning
- A general framework for time granularity and its application to temporal reasoning.
- Processing disjunctions in temporal constraint networks
- Querying temporal and spatial constraint networks in PTIME
- Networks of constraints: Fundamental properties and applications to picture processing
- Handling infinite temporal data
- Combining qualitative and quantitative constraints in temporal reasoning
- Building tractable disjunctive constraints
- Complexity and algorithms for reasoning about time
- Reasoning about temporal relations
- On the minimality and global consistency of row-convex constraint networks
This page was built for publication: Solving multi-granularity temporal constraint networks
