Efficient algorithms for qualitative reasoning about time
From MaRDI portal
Publication:1855212
DOI10.1016/0004-3702(94)00016-TzbMath1013.68553MaRDI QIDQ1855212
Lenhart Schubert, Alfonso E. Gerevini
Publication date: 4 February 2003
Published in: Artificial Intelligence (Search for Journal in Brave)
Related Items
Updating \(\leqslant, <\)-chains, On point-based temporal disjointness, Reasoning about causality between distributed nonatomic events, Efficient Computation of Minimal Point Algebra Constraints by Metagraph Closure, Incremental qualitative temporal reasoning: Algorithms for the point algebra and the ORD-Horn class, Planning temporal events using point-interval logic, Computing the minimal relations in point-based qualitative temporal reasoning through metagraph closure, Constraint propagation for ordering, abstraction, and aggregation relations, Complexity studies of a temporal constraint propagation algorithm: a statistical analysis, Backtracking algorithms for disjunctions of temporal constraints, Querying temporal and spatial constraint networks in PTIME, Combining topological and size information for spatial reasoning, A comparison of point-based approaches to qualitative temporal reasoning
Cites Work
- Maintaining knowledge about temporal intervals
- Towards a general theory of action and time
- Temporal constraint networks
- Temporally distributed symptoms in technical diagnosis
- Reasoning about qualitative temporal information
- On point-based temporal disjointness
- Automated deduction by theory resolution
- Using temporal hierarchies to efficiently maintain large temporal databases
- Unit Refutations and Horn Sets
- On binary constraint problems
- Reasoning about temporal relations
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
