Constraint propagation algorithms for temporal reasoning: a revised report
Readings in qualitative reasoning about physical systems
Reasoning about temporal relations: a maximal tractable subclass of Allen's interval algebra
Journal of the ACM (JACM)
Temporal reasoning made simpler
IEA/AIE '94 Proceedings of the 7th international conference on Industrial and engineering applications of artificial intelligence and expert systems
Maintaining knowledge about temporal intervals
Communications of the ACM
A new proof of tractability for 0RD-horn relations
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
INDU: An Interval and Duration Network
AI '99 Proceedings of the 12th Australian Joint Conference on Artificial Intelligence: Advanced Topics in Artificial Intelligence
Reasoning about temporal relations: The tractable subalgebras of Allen's interval algebra
Journal of the ACM (JACM)
Spatial and temporal reasoning: beyond Allen's calculus
AI Communications - Special issue on: Spatial and temporal reasoning
The algebra IAfuz: a framework for qualitative fuzzy temporal reasoning
Artificial Intelligence
Complexity classification in qualitative temporal constraint reasoning
Artificial Intelligence
Spatial and temporal reasoning: beyond Allen's calculus
AI Communications - Spatial and Temporal Reasoning
A new framework for reasoning about points, intervals and durations
IJCAI'99 Proceedings of the 16th international joint conference on Artificial intelligence - Volume 2
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
The algebra IAfuz: a framework for qualitative fuzzy temporal reasoning
Artificial Intelligence
Complexity classification in qualitative temporal constraint reasoning
Artificial Intelligence
Reasoning about cyclic space: axiomatic and computational aspects
Spatial cognition III
Floor plan design using block algebra and constraint satisfaction
Advanced Engineering Informatics
Spatial reasoning with rectangular cardinal relations
Annals of Mathematics and Artificial Intelligence
Hi-index | 0.00 |
This paper proves a key result in the maximality proofof ORD-Horn relations, namely, the fact that any subclass ofAllen‘s algebra which contains all atomic relations, is closedunder conversion, intersection and composition, and containsa relation which is not ORD-Horn will contain one (in fact, twoat least) of four specific relations, the ’’corner‘‘ relations. Our proof uses the structural properties of ORD-Horn relations,where the original proof was by machine enumeration.