Reasoning about temporal relations: a maximal tractable subclass of Allen's interval algebra
AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
An acceptor for Allen's ORD-Horn subclass
AIMSA '94 Proceedings of the sixth international conference on Artificial intelligence : methodology, systems, applications: methodology, systems, applications
Spatial Reasoning About Points in a Multidimensional Setting
Applied Intelligence
Temporal Constraints: A Survey
Constraints
’’Corner‘‘ Relations in Allen‘s algebra
Constraints
A Tractable Subclass of the Block Algebra: Constraint Propagation and Preconvex Relations
EPIA '99 Proceedings of the 9th Portuguese Conference on Artificial Intelligence: Progress in Artificial Intelligence
Learning Patterns in Multidimensional Space Using Interval Algebra
AIMSA '02 Proceedings of the 10th International Conference on Artificial Intelligence: Methodology, Systems, and Applications
INDU: An Interval and Duration Network
AI '99 Proceedings of the 12th Australian Joint Conference on Artificial Intelligence: Advanced Topics in Artificial Intelligence
Combining Topological and Qualitative Size Constraints for Spatial Reasoning
CP '98 Proceedings of the 4th International Conference on Principles and Practice of Constraint Programming
Reasoning about temporal relations: The tractable subalgebras of Allen's interval algebra
Journal of the ACM (JACM)
Incrementally scheduling with qualitative temporal information
IEA/AIE'2005 Proceedings of the 18th international conference on Innovations in Applied Artificial Intelligence
The algebra IAfuz: a framework for qualitative fuzzy temporal reasoning
Artificial Intelligence
On finding a solution in temporal constraint satisfaction problems
IJCAI'97 Proceedings of the Fifteenth international joint conference on Artifical intelligence - Volume 2
A new tractable subclass of the rectangle algebra
IJCAI'99 Proceedings of the 16th international joint conference on Artifical intelligence - Volume 1
Maximal tractable fragments of the region connection calculus: a complete analysis
IJCAI'99 Proceedings of the 16th international joint conference on Artifical intelligence - Volume 1
The algebra IAfuz: a framework for qualitative fuzzy temporal reasoning
Artificial Intelligence
Eligible and frozen constraints for solving temporal qualitative constraint networks
CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
Reasoning about cyclic space: axiomatic and computational aspects
Spatial cognition III
SC'04 Proceedings of the 4th international conference on Spatial Cognition: reasoning, Action, Interaction
A method for characterizing tractable subsets of qualitative fuzzy temporal algebrae
WILF'05 Proceedings of the 6th international conference on Fuzzy Logic and Applications
From path-consistency to global consistency in temporal qualitative constraint networks
AIMSA'12 Proceedings of the 15th international conference on Artificial Intelligence: methodology, systems, and applications
| Hi-index | 0.00 |
This paper gives an elementary proof of the tractability of a sub-class of temporal relations in Allen's algebra and related temporal calculi, the class of preconvex relations. In Allen's case, this subclass coincides with the class of ORD-Horn relations. Nebel and Bürckert defined ORD-Horn relations and proved that path-consistency is a sufficient condition for consistency of a network for this sub-class. We prove a stronger result: for each path-consistent network in the sub-class, we give an effective method for constructing a feasible scenario without backtrack.