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
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
Computational complexity of relating time points with interval
Artificial Intelligence
Maintaining knowledge about temporal intervals
Communications of the ACM
Extending the Point Algebra into the Qualitative Algebra
TIME '02 Proceedings of the Ninth International Symposium on Temporal Representation and Reasoning (TIME'02)
Integrating quantitative and qualitative fuzzy temporal constraints
AI Communications - Special issue on: Spatial and temporal reasoning
The design and experimental analysis of algorithms for temporal reasoning
Journal of Artificial Intelligence Research
A new proof of tractability for 0RD-horn relations
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
| Hi-index | 0.00 |
Allen's interval algebra allows one to formulate problems that are, in the general case, intractable; for this reason several tractable sub-algebrae have been proposed. In this paper the attention is focused on the fuzzy counterparts of those sub-algebrae and a different method to identify their relations is shown: rules for identifying fuzzy tractable relations starting from the knowledge of the classic tractable relations. Enumeration is used to verify the rules and quantify expressiveness, and algebraic considerations adopted to bind the enumeration itself.