Satisfiability of quantitative temporal constraints with multiple granularities

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1330, Issue , 1997, Pages 435-449

  Bettini, Claudio ^a   Wang, X Sean ^b   Jajodia, Sushil ^b  

^a UNIVERSITY OF MILAN   (Italy)

^b George Mason University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTER PROGRAMMING; CONSTRAINT THEORY;

MULTIPLE TIME GRANULARITY; SATISFIABILITY; TEMPORAL CONSTRAINTS; TIME GRANULARITIES;

CONSTRAINT SATISFACTION PROBLEMS;

EID: 84948989269     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Conference Paper

References (13)

1. [A1183] James F. Allen. Maintaining knowledge about temporal intervals. Communications of the ACM, 26(ll):832-843, November 1983.
2. [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.
3. [DMP91] R. Dechter, I. Meiri, and J. Pearl. Temporal constraint networks. Artificial Intelligence, 49:61-95, 1991.
4. [Lad86] P. Ladkin. Time representation: a taxonomy of interval relations. In Proc. of the American National Conference on Artificial Intelligence, Morgan Kauf-mann, Los Altos, CA, pp. 360-366, 1986.
5. [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.
6. [Mac77] A. K. Mackworth. Consistency in networks of relations. Artificial Intelligence, 8:99-118, 1977.
7. [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.
8. [Mei96] I. Meiri. Combining qualitative and quantitative constraints in temporal reasoning. Artificial Intelligence, 87:343-385, 1996.
9. [Mon74] U. Montanari. Networks of constraints: Fundamental properties and applications to picture processing. Information Science, 7(3):95-132, 1974.
10. [MR93] L. Khatib, R.A. Morris, W.D. Shoaff. Path consistency in a network of non-convex intervals. In Proc. of the Intern. Joint Conference on Artificial Intelligence, Morgan Kaufmann, San Mateo, CA, pp. 655-661, 1993.
11. [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.
12. [SD] E. Schwalb and R. Dechter. Processing disjunctions in temporal constraint networks. Artificial Intelligence. To appear.
13. [vBC90] P. van Beek and R. Cohen. Exact and approximate reasoning about temporal relations. Computational Intelligence, 6:132-144, 1990.