Processing disjunctions in temporal constraint networks

Artificial Intelligence

Volumn 93, Issue 1-2, 1997, Pages 29-61

  Schwalb, Eddie ^a   Dechter, Rina ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; CONSTRAINT THEORY; POLYNOMIALS; PROBLEM SOLVING;

LOOSE PATH CONSISTENCY (LPC); TEMPORAL CONSTRAINT SATISFACTION PROBLEMS (TCPS); UPPER LOWER TIGHTENING (ULT);

ARTIFICIAL INTELLIGENCE;

EID: 0031165371     PISSN: 00043702     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0004-3702(97)00009-x     Document Type: Article

References (33)

1. J.F. Allen, Maintaining knowledge about temporal intervals, Comm. ACM 26 (1983) 832-843.
2. J.F. Allen, Natural Language Understanding (Benjamin Cummings, Menlo Park, CA, 1987).
3. M. Boddy, J. Carciofini and B. Schrag, Disjunction for practical temporal reasoning, in: Proceedings Third International Conference on Principles of Knowledge Representation and Reasoning (KR-92), Cambridge, CA (1992).
4. P. Cheeseman, B. Kanefsky and W. Taylor, Where the really hard problems are, in: Proceedings IJCAI-91, Sydney, Australia (1991) 163-169.
5. P. Dagum, Numeric reasoning with relative orders of magnitude, in: Proceedings AAAI-93, Washington, DC (1993) 541-547.
6. T.L. Dean and D.V. McDermott, Temporal data base management, Artificial Intelligence 32 (1987) 1-55.
7. R. Dechter, From local to global consistency, Artificial Intelligence 55 (1992) 87-107.
8. R. Dechter, I. Meiri and J. Pearl, Temporal constraint satisfaction problems, Artificial Intelligence 49 (1991) 61-95.
9. R. Dechter and J. Pearl, Network-based heuristics for constraint satisfaction problems, Artificial Intelligence 34 (1988) 1-38.
10. A.E. Emerson, A.K. Mox, A.P. Sistla and J. Srinivasan, Quantitative temporal reasoning, in: E.M. Clarke, and R.P. Kurshan, eds., Computer-Aided Verification, Lecture Notes in Computer Science 531 (Springer, Berlin, 1990) 136-145.
11. C.M. Golumbic and R. Shamir, Complexity and algorithms for reasoning about time: graph theoretic approach, Rutcor Research Report 22-91 (1991).
12. S. Hanks and D.V. McDermott, Default reasoning, nonmonotonic logics, and the frame problem, in: Proceedings AAAI-86 (1986) 328-333.
13. K. Kahn and G.A. Gorry, Mechanizing temporal knowledge, Artificial Intelligence 9 (1977) 87-108.
14. H. Kautz and P. Ladkin, Integrating metric and qualitative temporal reasoning, in: Proceedings AAAI-91 (1991) 241-246,
15. M. Koubarakis, Foundations of temporal constraint databases, Ph.D. Thesis, National Technical University of Athens (1994).
16. W. Ho, D.Y.Y. Yun and Y.H. Hu, Planning strategies for switchbox routing, in: Proceedings International Conference on Computer Design (1985) 463-467.
17. PB. Ladkin and A. Reinefeld, Effective solution of qualitative interval constraint problems, Artificial Intelligence 57 (1992) 105-124.
18. J. Malik and T.O. Binford, Reasoning in time and space, in: Proceedings IJCAI-83, Karlsruhe, Germany (1983) 343-345.
19. D.V. McDermott, A temporal logic for reasoning about processes and plans, Cognitive Sci. 6 (1982) 101-155.
20. I. Meiri, Combining qualitative and quantitative constraints in temporal reasoning, Ph.D. Thesis, UCLA, Los Angeles, CA (1991).
21. D.S. Mitchell, B. Selman and H.J. Levesque, Hard and easy distributions of SAT problems, in: Proceedings AMI-92, San Jose, CA (1992).
22. R. Mohr and T.C. Henderson, Arc and path consistency revisited, Artificial Intelligence 28 (1986) 225-233.
23. B. Nebel and H.J. Burckert, Reasoning about temporal relations: a maximal tractable subclass of Allen's interval algebra, in: Proc AAAI-94, Seattle, WA (1994).
24. M. Poesio and R.J. Brachman, Metric constraints for maintaining appointments: dates and repeated activities, in: Proceedings AAAI-91, Anaheim, CA (1991) 253-259.
25. N. Sateh, Look-ahead techniques for micro-opportunistic job shop scheduling, Ph.D. Thesis, School of Computer Science, Carnegie Mellon University, Pittsburgh, PA (1991).
26. E. Schwalb and R. Dechter, Coping with disjunctions in temporal constraint satisfaction problems, in: Proceedings AAAI-93, Washington, DC (1993) 127-132.
27. E. Schwalb and R. Dechter, Temporal reasoning with constraints on fluents and events, in: Proceedings AAAI-94, Seattle, WA (1994).
28. Y. Shoham, Reasoning about change: time and causation from the stand point of artificial intelligence, Ph.D. Dissertation, Yale University, New Haven, CT (1986).
29. R.E. Valdéz-Pérez. Spatio-temporal reasoning with inequalities, AIM-875, Artificial Intelligence Laboratory, MIT, Cambridge, MA (1986).
30. P. van Beek, Reasoning about qualitative temporal information, Artificial Intelligence 58 (1992) 297-326.
31. P. van Beek, Exact and approximate reasoning about qualitative temporal relations, Ph.D. Dissertation, Tech. Rept. TR 90-29, University of Alberta, Edmonton, Alta. (1990).
32. M. Vilain, H. Kautz and P. van Beek, Constraint propagation algorithms for temporal reasoning: a revised report, in: J. de Kleer and D.S. Weld, eds., Headings in Qualitative Reasoning about Physical Systems, 1989.
33. C.P. Williams and T. Hogg, A typicality of phase transition search. Computational Intelligence 9 (1993) 211-238.