Combining Qualitative and Quantitative Constraints in Temporal Reasoning

Proceedings of the 9th National Conference on Artificial Intelligence, AAAI 1991

Volumn 1, Issue , 1991, Pages 260-267

  Meiri, Itay ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

POLYNOMIAL APPROXIMATION;

DISJUNCTIVE CONSTRAINTS; GENERAL MODEL; PATH CONSISTENCY; QUALITATIVE INFORMATION; QUANTITATIVE INFORMATION; REASONING TASKS; RELATIVE POSITIONS; TEMPORAL OBJECTS; TEMPORAL REASONING; TIME POINTS;

CONSTRAINT SATISFACTION PROBLEMS;

EID: 84985143039     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (14)

1. J. F. Allen. Maintaining knowledge about temporal intervals. CACM, 26(ll):832-843, 1983.
2. T. L. Dean and D. V. McDermott. Temporal data base management. Artificial Intelligence, 32:1-55, 1987.
3. R. Dechter and I. Meiri. Experimental evaluation of preprocessing techniques in constraint satisfaction problems. In Proceedings of IJCAI-89, pages 271-277, Detroit, MI, 1989.
4. R. Dechter, I. Meiri, and J. Pearl. Temporal constraint networks. Artificial Intelligence, 49, 1991.
5. Y. Deville and P. Van Hentenryck. An efficient arc consistency algorithm for a class of CSP problems. In Proceedings of IJCAI-91, Sydney, Australia, 1991.
6. H. Kautz and P. B. Ladkin. Integrating metric and qualitative temporal reasoning. In Proceedings of AAAI-91, Anaheim, CA, 1991.
7. P. B. Ladkin and R. D. Maddux. On binary constraint networks. Technical report, Kestrel Institute, Palo Alto, CA, 1989.
8. A. K. Mackworth. Consistency in networks of relations. Artificial Intelligence, 8(1):99-118, 1977.
9. A. K. Mackworth and E. C. Freuder. The complexity of some polynomial network consistency algorithms for constraint satisfaction problems. Artificial Intelligence, 25(l):65-74, 1985.
10. I. Meiri. Combining qualitative and quantitative constraints in temporal reasoning. Technical Report TR-160, UCLA Cognitive Systems Laboratory, Los Angeles, CA, 1991.
11. U. Montanari. Networks of constraints: Fundamental properties and applications to picture processing. Information Sciences, (7):95-132, 1974.
12. P. van Beek. Exact and Approximate Reasoning about Qualitative Temporal Relations. PhD thesis, University of Waterloo, Ontario, Canada, 1990.
13. P. van Beek. Reasoning about qualitative temporal information. In Proceedings of AAAI-90, pages 728-734, Boston, MA, 1990.
14. M. Vilain and H. Kautz. Constraint propagation algorithms for temporal reasoning. In Proceedings ofAAAI-86, pages 377-382, Philadelphia, PA, 1986.