Efficient algorithms for qualitative reasoning about time
From MaRDI portal
Recommendations
- Reasoning about qualitative temporal information
- Temporal constraint networks
- A comparison of point-based approaches to qualitative temporal reasoning
- Trends in Temporal Reasoning: Constraints, Graphs and Posets
- Incremental qualitative temporal reasoning: Algorithms for the point algebra and the ORD-Horn class
Cites work
- Automated deduction by theory resolution
- scientific article; zbMATH DE number 5542185 (Why is no real title available?)
- scientific article; zbMATH DE number 46975 (Why is no real title available?)
- scientific article; zbMATH DE number 52880 (Why is no real title available?)
- scientific article; zbMATH DE number 140366 (Why is no real title available?)
- scientific article; zbMATH DE number 4185070 (Why is no real title available?)
- Maintaining knowledge about temporal intervals
- On binary constraint problems
- On point-based temporal disjointness
- Reasoning about qualitative temporal information
- Reasoning about temporal relations
- Temporal constraint networks
- Temporally distributed symptoms in technical diagnosis
- Towards a general theory of action and time
- Unit Refutations and Horn Sets
- Using temporal hierarchies to efficiently maintain large temporal databases
Cited in
(23)- Reasoning about qualitative temporal information
- On point-based temporal disjointness
- Reasoning about causality between distributed nonatomic events
- 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
- A generalized time quantifier approach to approximate reasoning
- Incremental qualitative temporal reasoning: Algorithms for the point algebra and the ORD-Horn class
- Planning temporal events using point-interval logic
- An efficient algorithm for the maximum distance problem
- Updating \(\leqslant, <\)-chains
- A tool for reasoning about qualitative temporal information: the theory of S-languages with a Lisp implementation
- Efficient Computation of Minimal Point Algebra Constraints by Metagraph Closure
- Efficient Temporal Satisfiability
- Constraint propagation for ordering, abstraction, and aggregation relations
- Complexity studies of a temporal constraint propagation algorithm: a statistical analysis
- An interval-based temporal algebra based on binary encoding of point relations
- An efficient representation of general qualitative spatial information using bintrees
- scientific article; zbMATH DE number 6806035 (Why is no real title available?)
- Learning qualitative constraint networks
- Computing the minimal relations in point-based qualitative temporal reasoning through metagraph closure
- From binary temporal relations to non-binary ones and back
This page was built for publication: Efficient algorithms for qualitative reasoning about time
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1855212)
