The design and experimental analysis of algorithms for temporal reasoning

Journal of Artificial Intelligence Research

Volumn 4, Issue , 1996, Pages 1-18

  Van Beek, Peter ^a   Manchak, Dennis W ^a  

^a UNIVERSITY OF ALBERTA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; HEURISTIC METHODS; LEARNING SYSTEMS; OPTIMIZATION; PROBLEM SOLVING;

BACKTRACKING ALGORITHM; PATH CONSISTENCY ALGORITHM; TEMPORAL INFORMATION; TEMPORAL REASONING SYSTEM;

ARTIFICIAL INTELLIGENCE;

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

References (29)

1. Aho, A. V., Hopcroft, J. E., & Ullman, J. D. (1974). The Design and Analysis of Computer Algorithms. Addison-Wesley.
2. Allen, J. F. (1983). Maintaining knowledge about temporal intervals. Comm. ACM, 26, 832-843.
3. Allen, J. F., & Koomen, J. A. (1983). Planning using a temporal world model. In Proceedings of the Eighth International Joint Conference on Artificial Intelligence, pp. 741-747 Karlsruhe, West Germany.
4. Benzer, S. (1959). On the topology of the genetic fine structure. Proc. Nat. Acad. Sci. USA, 45, 1607-1620.
5. Bitner, J. R., & Reingold, E. M. (1975). Backtrack programming techniques. Comm. ACM, 18, 651-655.
6. Bruce, B. C. (1972). A model for temporal references and its application in a question answering program. Artificial Intelligence, 3, 1-25.
7. Dechter, R. (1992). From local to global consistency. Artificial Intelligence, 55, 87-107.
8. Dechter, R., & Pearl, J. (1988). Network-based heuristics for constraint satisfaction problems. Artificial Intelligence, 34, 1-38.
9. Freuder, E. C. (1982). A sufficient condition for backtrack-free search. J. ACM, 29, 24-32.
10. Ginsberg, M. L., Frank, M., Halpin, M. P., & Torrance, M. C. (1990). Search lessons learned from crossword puzzles. In Proceedings of the Eighth National Conference on Artificial Intelligence, pp. 210-215 Boston, Mass.
11. Golomb, S., & Baumert, L. (1965). Backtrack programming. J. ACM, 12, 516-524.
12. Golumbic, M. C., & Shamir, R. (1993). Complexity and algorithms for reasoning about time: A graph-theoretic approach. J. ACM, 40, 1108-1133.
13. Haralick, R. M., & Elliott, G. L. (1980). Increasing tree search efficiency for constraint satisfaction problems. Artificial Intelligence, 14, 263-313.
14. Hogge, J. C. (1987). TPLAN: A temporal interval-based planner with novel extensions. Department of computer science technical report UIUCDCS-R-87, University of Illinois.
15. Hooker, J. N. (1994). Needed: An empirical science of algorithms. Operations Research, 42, 201-212.
16. Ladkin, P., & Reinefeld, A. (1992). Effective solution of qualitative interval constraint problems. Artificial Intelligence, 57, 105-124.
17. Ladkin, P., & Reinefeld, A. (1993). A symbolic approach to interval constraint problems. In Calmet, J., & Campbell, J. (Eds.), Artificial Intelligence and Symbolic Mathematical Computing, Springer Lecture Notes in Computer Science 737. Springer-Verlag.
18. Ladkin, P. B., & Maddux, R. D. (1988). On binary constraint networks. Technical report, Kestrel Institute, Palo Alto, Calif.
19. Mackworth, A. K. (1977). Consistency in networks of relations. Artificial Intelligence, 8, 99-118.
20. Montanari, U. (1974). Networks of constraints: Fundamental properties and applications to picture processing. Inform. Sci., 7, 95-132.
21. Nadel, B. A. (1989). Constraint satisfaction algorithms. Computational Intelligence, 5, 188-224.
22. Nebel, B., & Bürckert, H.-J. (1995). Reasoning about temporal relations: A maximal tractable subclass of Allen's interval algebra. J. ACM, 42, 43-66.
23. Nudel, B. (1983). Consistent-labeling problems and their algorithms: Expected-complexities and theory-based heuristics. Artificial Intelligence, 21, 135-178.
24. Purdom, Jr., P. W. (1983). Search rearrangement backtracking and polynomial average time. Artificial Intelligence, 21, 117-133.
25. van Beek, P. (1992). Reasoning about qualitative temporal information. Artificial Intelligence, 58, 297-326.
26. van Beek, P., & Cohen, R. (1990). Exact and approximate reasoning about temporal relations. Computational Intelligence, 6, 132-144.
27. Vilain, M., & Kautz, H. (1986). Constraint propagation algorithms for temporal reasoning. In Proceedings of the Fifth National Conference on Artificial Intelligence, pp. 377-382 Philadelphia, Pa.
28. Vilain, M., Kautz, H., & van Beek, P. (1989). Constraint propagation algorithms for temporal reasoning: A revised report. In Weld, D. S., & de Kleer, J. (Eds.), Readings in Qualitative Reasoning about Physical Systems, pp. 373-381. Morgan Kaufmann.
29. Wallace, R. J., & Freuder, E. C. (1992). Ordering heuristics for arc consistency algorithms. In Proceedings of the Ninth Canadian Conference on Artificial Intelligence, pp. 163-169 Vancouver, B.C.