On-line algorithms for networks of temporal constraints
From MaRDI portal
Publication:1827276
DOI10.1016/S1570-8667(03)00031-5zbMath1100.68111OpenAlexW2095503477MaRDI QIDQ1827276
Fabio Iacobini, Fabrizio d'Amore
Publication date: 6 August 2004
Published in: Journal of Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s1570-8667(03)00031-5
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Graph algorithms (graph-theoretic aspects) (05C85)
Cites Work
- Unnamed Item
- Unnamed Item
- Maintaining knowledge about temporal intervals
- Comments on Mohr and Henderson's path consistency algorithm
- Temporal constraint networks
- Reasoning about qualitative temporal information
- Consistency in networks of relations
- Temporal constraints: A survey
- Processing disjunctions in temporal constraint networks
- Networks of constraints: Fundamental properties and applications to picture processing
- Amortized Computational Complexity
- A Sufficient Condition for Backtrack-Free Search
- Reasoning about temporal relations
- Scheduling Jobs with Temporal Distance Constraints
This page was built for publication: On-line algorithms for networks of temporal constraints