On interval-based temporal planning: An IQ strategy

  • B. Richards
  • Y. Jiang
  • H. Choi
Communications Knowledge Representation
Part of the Lecture Notes in Computer Science book series (LNCS, volume 542)


Allen & Koomen's interval planner and Dean & McDermott's time map manager (TMM) offer different approaches to temporal database management in planning. In this paper we present a temporal planning system that integrates ideas from both methods, and at the same time develops several new ideas. In particular, we treat time points and intervals within a common structure, and adopt an alternative method for handling temporal constraints based on constraint logic programming. To provide a proper characterization of actions within an interval environment, we invoke the notion of noninterference conditions to handle action interaction and the qualification problem. To deal with the persistence problem, we adopt a spectrum of methods based on TMM's stretching and clipping rules. We show that our approach allows a temporally minimum specification for preconditions, which not only improves the clarity of the specification of an action, but perhaps also reduces the computational cost of constraint satisfaction. The formal aspects of our temporal approach are encapsulated in an interval temporal logic called IQ which is functionally more expressive than first order logic. The specification of our temporal reasoning is modelled in IQ-Prolg — a computation-oriented subsidiary language of IQ.


Intervals Points Planning Actions Frame Problem Qualification Problem Maximal Interval Principle Temporal Logics Constraint Satisfaction Collapsing and Stretching/Clipping 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. J Allen (1983) Maintaining knowledge about temporal intervals, CACM 26 Vol 11.Google Scholar
  2. J Allen & J Koomen (1983) Planning using a temporal world model, IJCAI 83.Google Scholar
  3. T Dean & D McDermott (1987) Temporal database management, Artificial Intelligence 32.Google Scholar
  4. R Dechter, I Meiri & J Pearl (1989) Temporal constraint networks KR 89.Google Scholar
  5. Y Jiang (1990) An epistemic model of logic programming. New Generation Computing 11.Google Scholar
  6. Y Jiang & B Richards (1991a) A logic of time and change for AI: IQ-Prolog extended, invited paper at the German AI Workshop on Logic and Change, October 1991.Google Scholar
  7. Y Jiang & B Richards (1991b) Noninterference conditions as a control to planning, in preparation.Google Scholar
  8. Y Jiang, B Richards & H Choi (1991a) Actions and noninterference conditions in planning, invited paper at 1st World Congress on Fundamentals of Artificial Intelligence, Paris, July.Google Scholar
  9. Y Jiang, B Richards & A El-Kholy (1991b) Temporal Reasoning and Constraint Satisfaction, to appear.Google Scholar
  10. J Koomen (1989) Localizing temporal constraint propagation, KR 89.Google Scholar
  11. R Kowalski & M Sergot (1986) A logic-based calculus of events, New Generation Computing 4.Google Scholar
  12. V Lifschitz & A Rabinov (1989) Miracles in formal theories of action, Artificial Intelligence 38.Google Scholar
  13. J McCarthy & P Hayes (1969) Some philosophical problems from the standpoint of artificial intelligence, Machine Intelligence 4.Google Scholar
  14. R Pelavin (1988) A formal approach to planning with concurrent actions and external events, PhD Univ. of Rochester, NY.Google Scholar
  15. B Richards, I Bethke, J van der Does & J Oberlander (1989) Temporal representation and inference, Academic Press.Google Scholar
  16. Y Shoham (1987) Temporal logics in AI: Semantical and ontological considerations, Artificial Intelligence 33 Google Scholar
  17. A Tate & K Curry (1989) Open Planning Architecture, UK Expert Systems Conference.Google Scholar
  18. S Vere (1983) Planning in time: windows and durations for activities and goals, IEEE Transactions on PAMI 5.Google Scholar
  19. M Villain & H Kautz (1986) Constraint propagation algorithm for temporal reasoning, AAAI 86.Google Scholar
  20. P Van Hentenryck (1989) Constraint saitsfaction in logic programming, M.I.T Press.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1991

Authors and Affiliations

  • B. Richards
    • 1
  • Y. Jiang
    • 1
  • H. Choi
    • 1
  1. 1.Planning Group, Department of ComputingImperial CollegeLondon

Personalised recommendations