ON INTERVAL-BASED TEMPORAL PLANNING - AN IQ-STRATEGY

Cited 1 time in webofscience Cited 0 time in scopus
  • Hit : 336
  • Download : 0
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-Prolog - a computation-oriented subsidiary language of IQ.
Publisher
SPRINGER VERLAG
Issue Date
1991
Language
English
Article Type
Article
Citation

LECTURE NOTES IN ARTIFICIAL INTELLIGENCE, v.542, pp.226 - 235

URI
http://hdl.handle.net/10203/67091
Appears in Collection
CS-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡ Click to see webofscience_button
⊙ Cited 1 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0