Skip to main content
SpringerLink
Log in

Reasoning about networks of temporal relations and its applications to problem solving

  • Published:
Applied Intelligence Aims and scope Submit manuscript

Abstract

An interval algebra (IA) has been proposed as a model for representing and reasoning about qualitative temporal relations between time intervals. Unfortunately, reasoning tasks with IA that involve deciding the satisfiability of the temporal constraints, or providing all the satisfying instances of the temporal constraints, areNP-complete. That is, solving these problems are computationally exponential in the “worst case.” However, several directions in improving their computational performance are still possible. This paper presents a new backtracking algorithm for finding a solution called consistent scenario. This algorithm has anO(n 3) best-case complexity, compared toO(n 4) of previous known backtrack algorithms, wheren denotes the number of intervals. By computational experiments, we tested the performance of different backtrack algorithms on a set of randomly generated networks with the results favoring our proposal. In this paper, we also present a new path consistency algorithm, which has been used for finding approximate solutions towards the minimal labeling networks. The worst-case complexity of the proposed algorithm is stillO(n 3); however, we are able to improve its performance by eliminating the unnecessary duplicate computation as presented in Allen's original algorithm, and by employing a most-constrained first principle, which ensures a faster convergence. The performance of the proposed scheme is evaluated through a large set of experimental data.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. J. F. Allen, “Maintaining knowledge about temporal intervals,”Commun. ACM vol. 26, no. 11, pp. 510–521, 1983.

    Google Scholar 

  2. J. F. Allen and J. A. Koomen, “Planning using a temporal world model,” inProc. Eighth Int. Joint Conf. Artif. Intell., 1983, pp. 741–747.

  3. J. F. Allen, “Planning as temporal reasoning,” inProc. Second Int. Conf. Principles of Knowledge Representation and Reasoning, 1991, pp. 3–14.

  4. J. C. Hogge, “Tplan: A temporal interval-based planner with novel extensions,” Technical Report UIUCDCS-R-87-1367, Department of Computer Science, University of Illinois, 1987.

  5. H. Kautz,A Formal Theory of Plan Recognition, Ph.D. thesis, University of Rochester, 1987.

  6. F. Song and R. Cohen, “Temporal reasoning during plan recognition,” inProc. Ninth Nat. Conf. Artif. Intell., 1991, pp. 247–252.

  7. J. F. Allen, “Towards a general theory of action and time,”Artif. Intell. vol. 26, no. 2, pp. 123–154, 1984.

    Google Scholar 

  8. F. Song and R. Cohen, “The interpretation of temporal relations in narrative,” inProc. Seventh Natl. Conf. Artif. Intell., 1988, pp. 745–750.

  9. D. S. Weld and J. de Kleer, “Introduction to chapter 4, history-based simulation and temporal reasoning,” inReadings in Qualitative Reasoning about Physical Objects, Morgan-Kaufman, 1990, pp. 351–352.

  10. J. C. Hogge, “Compiling plan operators from domains expressed in qualitative process theory,” inProc. Sixth Nat. Conf. Artif. Intell., 1987, pp. 229–233.

  11. A. C. Meng and B. A. Raja, “Logos-tcs: An expert system for operations management based on temporal constraint satisfaction,” inProc. Sixth Conf. Artif. Intell. Appl., 1990, pp. 215–221, 1990.

  12. K. Nökel, “Temporal matching: Recognizing dynamic situations from discrete measurements,” inPrc. Eleventh Int. Joint Conf. Artif. Intell., 1989, pp. 1255–1260.

  13. A. Mukerjee and G. Joe. “A qualitative model for space,” inProc. Eighth Nat. Conf. Artif. Intell., 1990, pp. 721–727.

  14. I. Meiri, “Combining qualitative and quantitative constraints in temporal reasoning,” inProc. Ninth Natl. Conf. Artif. Intell., 1991, pp. 260–267.

  15. H. Kautz and P. B. Ladkin, “Integrating metric and qualitative temporal reasoning,” inProc. Ninth Nat. Conf. Artif. Intell., 1991, pp. 241–246.

  16. S. Keretho and R. Loganantharaj, “Qualitative and quantitative time interval constraint networks,” inProc. Nineteenth Annu. Comput. Sci. Conf., ACM Press, 1991, pp. 239–246.

  17. M. Vilain and H. Kautz, “Constraint propagation algorithms for temporal reasoning,” inProc. Fifth Nat. Conf. Artif. Intell., 1986, pp. 377–382.

  18. P. van Beek,Exact and Approximate Reasoning about Qualitative Temporal Relations. Ph.D. thesis, University of Alberta, 1990.

  19. P. van Beek, “Approximation algorithms for temporal reasoning,” inProc. Eleventh Int. Joint Conf. Artif. Intell., 1989, pp. 1291–1296.

  20. U. Montanari, “Networks of constraints: Fundamental properties and applications to picture processing,”Information Sci. vol. 7, pp. 95–132, 1974.

    Google Scholar 

  21. A. K. Mackworth, “Consistency in networks of relations,”Artif. Intell. vol. 8, pp. 99–118, 1977.

    Google Scholar 

  22. P. B. Ladkin and R. Maddux, “On binary constraint networks,” Technical Report KES.U.88.8, Kestrel Institute, 1988.

  23. P. van Beek, “Reasoning about qualitative temporal information,” inProc. Eighth Natl. Conf. Artif. Intell., 1990, pp. 728–734, 1990.

  24. R. E. Valdés-Pérez, “The satisfiability of temporal constraint networks,” inProc. Sixth Natl. Conf. Artif. Intell., 1987, pp. 256–260.

  25. R. M. Stallman and G. J. Sussman, “Forward reasoning and dependency-directed backtracking in a system for computer-aided circuit analysis,”Artif. Intell. vol. 9, pp. 135–196, 1977.

    Google Scholar 

  26. J. Gasching, “Performance measurement and analysis of certain search algorithms,” Technical Report CMUCS-79-124, Carnegie-Mellon University, Pittsburgh, PA, 1979.

    Google Scholar 

  27. R. M. Haralick and G. L. Elliott, “Increasing tree search efficiency for constraint satisfaction problems,”Artif. Intell. vol. 14, pp. 263–313, 1980.

    Google Scholar 

  28. B. Nudel, “Consistent-labeling problems and their algorithms: Expected complexities and theory-based heuristics,”Artif. Intell vol. 21, pp. 135–178, 1983.

    Google Scholar 

  29. R. Dechter, “Enhancement schemes for constraint processing: Backjumping, learning, and custset decomposition,” Artif. Intell. vol. 41, pp. 237–312, 1989/90.

    Google Scholar 

  30. R. Dechter and I. Meiri, “Experimental evaluation of preprocessing techniques in constraint satisfaction problems,” inProc. Eleventh Int. Joint Conf. Artif. Intell. 1989, pp. 271–279.

  31. E. C. Freuder, “Synthesizing constraint expressions,”Commun. ACM, vol. 21, no. 958–966, 1978.

  32. A. K. Mackworth and E. C. Freuder, “The complexity of some polynomial network consistency algorithms for constraint satisfaction problems,”Artif. Intell. vol. 25, pp. 65–74, 1985.

    Google Scholar 

  33. R. Mohr and T. C. Henderson, “Arc and path consistency revisited,”Artif. Intell. vol. 28, pp. 225–233, 1986.

    Google Scholar 

  34. C. Han and C. Lee, “Comments on Mohr and Henderson's path consistency algorithms,”Artif. Intell. vol. 36, pp. 125–130, 1988.

    Google Scholar 

  35. M. Zhu, N. K. Loh, and P. Siy, “Towards the minimal set of primitive relations in temporal logic,”Information Processing Lett. vol. 26, pp. 121–126, 1987.

    Google Scholar 

  36. G. Ligozat and H. Bestougeff, “On relations between intervals,”Information Processing Lett. vol. 32, pp. 177–182, 1989.

    Google Scholar 

  37. S. Keretho, R. Loganantharaj, and V. N. Gudivada, “Time and space complexity of path consistency algorithms for constraint satisfaction problems,” inProc. Third Int. Conf. Tools Artif. Intell., 1991.

  38. R. Dechter and J. Pearl, “Network-based heuristics for constraint satisfaction problems,”Artif. Intell. vol. 34, pp. 1–38, 1987.

    Google Scholar 

  39. E. C. Freuder, “A sufficient condition of backtrack-free search,”JACM vol. 29, pp. 24–32, 1982.

    Google Scholar 

  40. P. W. Purdom, “Search rearrangement backtracking and polynomial average time,”Artif. Intell. vol. 21, pp. 117–133, 1983.

    Google Scholar 

  41. R. Zabih and D. McAllester, “A rearrangement search strategy for determining propositional satisfiability,” inProc. Seventh Natl. Conf. Artif. Intell., 1988, pp. 155–160.

  42. R. Loganantharaj and S. Keretho, “Efficient algorithms for temporal constraint propagation,” inProc. Fourth Int. Conf. Indust. Eng. Appl. AI Expert Syst., 1991, pp. 595–602.

Download references

Author information

Authors and Affiliations

  1. Dept. of Computer Engineering, Kasetsart University, 10900, Bangkok, Thailand

    S. Keretho

  2. Center for Advanced Computer Studies, University of Southwestern Louisiana, 70504, Lafayette, LA

    R. Loganantharaj

Authors
  1. S. Keretho
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. R. Loganantharaj
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Keretho, S., Loganantharaj, R. Reasoning about networks of temporal relations and its applications to problem solving. Appl Intell 3, 47–70 (1993). https://doi.org/10.1007/BF00871722

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF00871722

Key words

Search

Navigation