Abstract
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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Allen, J.F.: Maintaining knowledge about temporal intervals. Communications of the ACM 26, 832–843 (1983)
Badaloni, S., Falda, M., Giacomin, M.: Integrating quantitative and qualitative constraints in fuzzy temporal networks. AI Communications 17, 183–272 (2004)
Badaloni, S., Giacomin, M.: Flexible temporal constraints. In: Proc. of IPMU 2000, Madrid, Spain, pp. 1262–1269 (2000)
Dubois, D., Fargier, H., Prade, H.: Possibility theory in constraint satisfaction problems: Handling priority, preference and uncertainty. Applied Intelligence 6, 287–309 (1996)
Giacomin, M.: From crisp to fuzzy constraint networks. In: Proc. of CP 2001 Workshop Modelling and Solving Problems with Soft Constraints, Paphos, Cyprus (2001)
Jonsson, P., Drakengren, T., Backström, C.: Computational complexity of relating time points with intervals. Artificial Intelligence 109, 273–295 (1999)
Krokhin, A., Jonsson, P.: Extending the point algebra into the qualitative algebra. In: 9th International Symposium on Temporal Representation and Reasoning (TIME-2002), pp. 28–35. Springer, Heidelberg (2002)
Ligozat, G.: A new proof of tractability for ORD-Horn relations. In: Actes AAAI:1996 workshop on Spatial and Temporal Reasoning, Portland, Oregon, pp. 395–401 (1996)
Meiri, I.: Combining qualitative and quantitative constraints in temporal reasoning. Artificial Intelligence 87, 343–385 (1996)
Nebel, B., Bürckert, H.J.: Reasoning about temporal relations: a maximal tractable subclass of Allen’s interval algebra. Journal of the ACM 42, 43–66 (1995)
Vilain, M., Kautz, H., van Beek, P.: Constraint propagation algorithms for temporal reasoning: a revised report. In: Weld, D.S., de Kleer, J. (eds.) Readings in Qualitative Reasoning about Physical Systems, San Mateo, CA, pp. 373–381. Morgan Kaufmann, San Francisco (1989)
van Beek, P., Cohen, R.: Exact and approximate reasoning about temporal relations. Computational Intelligence 6, 132–144 (1990)
van Beek, P., Manchak, D.W.: The design and experimental analysis of algorithms for temporal reasoning. Journal of Artificial Intelligence Research 4, 1–18 (1996)
Zadeh, L.A.: Fuzzy sets. Information and Control 8, 338–353 (1965)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Falda, M. (2006). A Method for Characterizing Tractable Subsets of Qualitative Fuzzy Temporal Algebrae. In: Bloch, I., Petrosino, A., Tettamanzi, A.G.B. (eds) Fuzzy Logic and Applications. WILF 2005. Lecture Notes in Computer Science(), vol 3849. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11676935_9
Download citation
DOI: https://doi.org/10.1007/11676935_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-32529-1
Online ISBN: 978-3-540-32530-7
eBook Packages: Computer ScienceComputer Science (R0)