Satisfiability of quantitative temporal constraints with multiple granularities
Most work on temporal constraints has ignored the subtleties involved in dealing with multiple time granularities. This paper considers a constraint satisfaction problem (CSP) where binary quantitative constraints in terms of different time granularities can be specified on a set of variables, and unary constraints are allowed to limit the domain of variables. Such a CSP cannot be trivially reduced to one of the known CSP problems. The main result of the paper is a complete algorithm for checking consistency and finding a solution. The complexity of the algorithm is studied in the paper under different assumptions about the granularities involved in the CSP, and a second algorithm is proposed to improve the efficiency of the backtracking process needed to obtain all the solutions of the CSP.
Unable to display preview. Download preview PDF.
- [All83]James F. Allen. Maintaining knowledge about temporal intervals. Communications of the ACM, 26(11):832–843, November 1983.Google Scholar
- [BWJ]C. Bettini, X. Wang, and S. Jajodia. A General Framework for Time Granularity and its Application to Temporal Reasoning. Annals of Mathematics and Artificial Intelligence, to appear. A preliminary version of this paper appeared in Proc. of TIME-96, IEEE Computer Society Press.Google Scholar
- [DMP91]R. Dechter, I. Meiri, and J. Pearl. Temporal constraint networks. Artificial Intelligence, 49:61–95, 1991.Google Scholar
- [LaA86]P. Ladkin. Time representation: a taxonomy of interval relations. In Proc. of the American National Conference on Artificial Intelligence, Morgan Kaufmann, Los Altos, CA, pp. 360–366, 1986.Google Scholar
- [Lad87]P. Ladkin. The completeness of a natural system for reasoning with time intervals. In Proc. of the Intern. Joint Conference on Artificial Intelligence, Morgan Kaufmann, Los Altos, CA, pp. 462–467, 1987.Google Scholar
- [Mac77]A. K. Mackworth. Consistency in networks of relations. Artificial Intelligence, 8:99–118, 1977.Google Scholar
- [MFE85]A. K. Mackworth and E. C. Freuder. The complexity of some polynomial network consistency algorithms for constraint satisfaction problems. Artificial Intelligence, 25:65–74, 1985.Google Scholar
- [Mei96]I. Meiri. Combining qualitative and quantitative constraints in temporal reasoning. Artificial Intelligence, 87:343–385, 1996.Google Scholar
- [Mon74]U. Montanani. Networks of constraints: Fundamental properties and applications to picture processing. Information Science, 7(3):95–132, 1974.Google Scholar
- [MR93]L. Khatib, R.A. Morris, W.D. Shoaff. Path consistency in a network of nonconvex intervals. In Proc. of the Intern. Joint Conference on Artificial Intelligence, Morgan Kaufmann, San Mateo, CA, pp. 655–661, 1993.Google Scholar
- [PB91]M. Poesio and R. J. Brachman. Metric constraints for maintaining appointments: Dates and repeated activities. In Proc. of the American National Conference on Artificial Intelligence, AAAI Press/MIT Press, Menlo Park, CA, pp. 253–259, 1991.Google Scholar
- [SD]E. Schwalb and R. Dechter. Processing disjunctions in temporal constraint networks. Artificial Intelligence. To appear.Google Scholar
- [vBC90]P. van Beek and R. Cohen. Exact and approximate reasoning about temporal relations. Computational Intelligence, 6:132–144, 1990.Google Scholar