Constraint propagation algorithms for temporal reasoning: a revised report
Readings in qualitative reasoning about physical systems
Exact and approximate reasoning about temporal relations
Computational Intelligence
Complexity and algorithms for reasoning about time: a graph-theoretic approach
Journal of the ACM (JACM)
Reasoning about temporal relations: a maximal tractable subclass of Allen's interval algebra
Journal of the ACM (JACM)
Combining qualitative and quantitative constraints in temporal reasoning
Artificial Intelligence
Twenty-one large tractable subclasses of Allen's algebra
Artificial Intelligence
A unifying approach to temporal constraint reasoning
Artificial Intelligence
Computational complexity of relating time points with interval
Artificial Intelligence
Maintaining knowledge about temporal intervals
Communications of the ACM
Tractable disjunctions of linear constraints: basic results and applications to temporal reasoning
Theoretical Computer Science
Temporal Constraints: A Survey
Constraints
’’Corner‘‘ Relations in Allen‘s algebra
Constraints
FroCoS '02 Proceedings of the 4th International Workshop on Frontiers of Combining Systems
Extending the Point Algebra into the Qualitative Algebra
TIME '02 Proceedings of the Ninth International Symposium on Temporal Representation and Reasoning (TIME'02)
Reasoning about temporal relations: The tractable subalgebras of Allen's interval algebra
Journal of the ACM (JACM)
Point algebras for temporal reasoning: algorithms and complexity
Artificial Intelligence
Constraint Satisfaction Problems on Intervals and Lengths
SIAM Journal on Discrete Mathematics
Reasoning on interval and point-based disjunctive metric constraints in temporal contexts
Journal of Artificial Intelligence Research
Eight maximal tractable subclasses of Allen's algebra with metric time
Journal of Artificial Intelligence Research
A new framework for reasoning about points, intervals and durations
IJCAI'99 Proceedings of the 16th international joint conference on Artificial intelligence - Volume 2
Hi-index | 0.00 |
We study the computational complexity of the qualitative algebra which is a temporal constraint formalism that combines the point algebra, the point-interval algebra and Allen's interval algebra. We identify all tractable fragments and show that every other fragment is NP-complete.