Reasoning on Interval and Point-based Disjunctive Metric Constraints in Temporal Contexts

Journal of Artificial Intelligence Research

Volumn 12, Issue , 2000, Pages 35-

  Barber, Federico ^a  

^a UNIVERSITAT POLITÈCNICA DE VALÈNCIA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 14344279688     PISSN: 10769757     EISSN: None     Source Type: Journal    
DOI: 10.1613/jair.693     Document Type: Article

References (40)

1. Allen, J. (1983). Maintaining knowledge about temporal intervals. Comm of the ACM, 26, 11, 832-843.
2. 0 Int. Workshop on Temporal Representation and Reasoning (TIME'96).
3. Barber, F. (1993). A metric time-point and duration-based temporal model. ACM Sigart Bulletin, 4 (3), 30-40.
4. Barber, F., Botti, V., Onaindia, E., & Crespo, A. (1994). Temporal reasoning in Reakt: An environment for real-time knowledge-based systems. AICommunications, 7 (3), 175-202.
5. Brusoni, V., Console, L., & Terenziani, P. (1997). Later: Managing temporal information efficiently, IEEE Expert, 12 (4), 56-64.
6. Cohen, D., Jeavons, P., & Koubarakis, M. (1996). Tractable disjunctive constraints. In Proceedings. of the 3rd Int. Conf. on Principles and Practice of Constraint Programming (CP'96). Freuder, E.C. (Ed.). Lecture Notes in Computer Science, 1118, 297-307.
7. Cooper, M.C. (1990). An optimal k-consistency algorithm. Artificial Intelligence, 41, 89-95.
8. Dean, T.L., & McDermott, D.V. (1987). Temporal data base management. Artificial Intelligence, 38, 1-55.
9. Dechter, R., Meiri, I., & Pearl, J. (1991). Temporal constraint networks. Artificial Intelligence, 49, 61-95.
10. Dechter, R. (1992). From local to global consistency. Artificial Intelligence, 55, 87-107.
11. Dousson, C., Gaborit, P., & Ghallab M. (1993). Situation Recognition: Representation and Algorithms. In Proceedings of 13th International Joint Conference on Artificial Intelligence (IJCAI'93).
12. Drakengren, T., & Jonsson, P. (1997). Eight maximal tractable subclasses of Allen's algebra with metric time. Journal of A.I. Research, 7, 25-45.
13. Freuder, E. C. (1978). Synthesizing constraint expressions. Comm. of the ACM, 21 (11), 958-965.
14. Freuder, E. C. (1982). A sufficient condition for backtrack-free search. Journal of the ACM, 29 (1), 24-32.
15. Garcia, F., & Laborie, P. (1996). Hierarchisation of the Seach Space in Temporal Planning. New Directions in AI Planning, 217-232, IOS Press.
16. Garrido, A., Marzal, E., Sebastiá, L., & Barber F. (1999). A model for planning and scheduling integration. In Proceedings of the 8 th. Conference of Spanish Association of A.I. (CAEPIA'99).
17. Gerevini, A., & Schubert, L. (1995). Efficient algorithms for qualitative reasoning about time. Artificial Intelligence, 74, 207-248.
18. Jeavons, P., Cohen, D., & Cooper M. (1998). Constraints, consistency and closure. Artificial Intelligence, 101, 251-268.
19. Jeavons, P., Cohen, D., Gyssens, M. (1999). How to determine the expressive power of constraints. Constraints: An Int. Journal, 4, 113-131.
20. Jonsson, P., & Bäckström, C. (1996). A linear-programming approach to temporal reasoning. In Proceedings of the 13 th. National Conference on Artificial Intelligence (AAAI'96).AAAI Press.
21. Jonsson, P., & Bäckström, C. (1998). A unifying approach to temporal constraint reasoning. Artificial Intelligence, 102, 143-155.
22. Jonsson, P., Drakengren, T., & Bäckström, C. (1999). Computational complexity of relating time points and intervals. Artificial Intelligence, 109, 273-295.
23. Kautz, H., & Ladkin, P. (1991). Integrating metric and qualitative temporal reasoning. In Proceedings of the 9th. National Conference on Artificial Intelligence (AAAI'91).AAAI Press.
24. Mackworth, A. K. (1977). Consistency in networks of relations, Artificial Intelligence, 8, 121-118,.
25. Meiri, I. (1996). Combining qualitative and quantitative constraints in temporal reasoning. Artificial Intelligence, 87, 343-385.
26. Montanari, U. (1974). Networks of constraints: fundamental properties and applications to picture processing. Information Science, 7, 95-132.
27. Navarrete, I., & Marin, R. (1997). Qualitative temporal reasoning with points and durations. In Proceedings of the 15th. International Joint Conference on Artificial Intelligence (IJCAI-97).
28. Nebel, B., & Burckert, H.J. (1995). Reasoning about temporal relations: a maximal tractable subclass of Allen's interval algebra. Journal of the ACM, 42 (1), 43-66.
29. Pujari, A., & Sattar, A. (1999). A new framework for reasoning about Points,. Intervals and Durations. In Proceedings on the Int. Joint Conference on Artificial Intelligence (IJCAI'99).
30. Schwalb, E., & Dechter, R. (1997). Processing disjunctions in temporal constraints networks. Artificial Intelligence, 93, 29-61.
31. Staab, S., & Hahn, U. (1998). Distance constraint arrays: A model for reasoning on intervals with qualitative and quantitative distances. In Proceedings of the 12th Biennial Conference of the Canadian Society for Computational Studies of Intelligence on Advances in Artificial Intelligence (AI-98), Lecture Notes in Artificial Intelligence, 1418, 334-348.
32. Srivastava, B., & Kambhampati, S. (1999). Efficient planning through separate resource scheduling. In Proceedings of the AAAI Spring Symp. on search strategy under uncertainty and incomplete information. AAAI Press.
33. Stergiou, K., & Koubarakis, M. (1996). Tractable disjunctions of Linear Constraints. In Proceedings of the 2nd Int. Conf. on Principles and Practice of Constraints Programming (CP'96). Freuder, E.C. (Ed.). Lecture Notes in Computer Science, 1118, 297-307.
34. Stergiou, K., & Koubarakis, M. (1998). Bactracking algorithms for disjunctions of temporal constraints. In Proceedings of the 15 th. National Conference on Artificial Intelligence (AAAI-98). AAAI Press.
35. Van Beek, P. (1991).Temporal query processing with indefinite information. Artificial Intelligence in Medicine, 3 (6), 325-339.
36. Van Beek, P., & Detcher R. (1995). On the minimality and global consistency of row convex networks. Journal of the ACM, 42 (3), 543-561.
37. Van Beek, P., & Dechter, R. (1997). Constraint tightness and looseness versus local and global consistency. Journal of the ACM, 44 (4), 549-566.
38. Vilain, M., Kautz, H., & Van Beek P. (1986). Constraint propagation algorithm for temporal reasoning. In Proceedings of the 5Th. National Conference on Artificial Intelligence (AAAI-86).AAAI Press.
39. Wetprasit, R., Sattar A. (1998). Temporal representation with qualitative and quantitative information about points and durations. In Proceedings of the 15 th. National Conference on Artificial Intelligence (AAAI'98). AAAI Press.
40. Yampratoom, E., & Allen, J. (1993). Performance of temporal reasoning systems, ACM Sigart Bulletin, 4, (3), 26-29.