A metric time-point and duration-based temporal model

Constraint-based formalisms are a useful and common way to deal with temporal reasoning tasks. Assertions represent temporal constraints between temporal objects, time-points or intervals: Metric temporal constraints between time points permit us to express a minimum and maximum temporal distance between two time points and to define a valid temporal interval for each one. However, existing approaches have limited expressiveness for representing non-disjunctive qualitative constraints of point algebra and the empirical results do not seem very adequate for managing a great number of time points or when the time for management is limited.In this paper, an efficient and expressive time point and duration-based temporal representation model with metric constraints is presented. The main features of the model refer to the formal properties of the internal time model and the specific representation of temporal constraints, which integrates constraints on time-points and on durations and is more adequate for their computational management. Sound and complete management processes are specified on the basis of model properties. From this specification, two choices for management are proposed: (i) with neither propagation nor preprocessing techniques, complete management algorithms have an O(e*n) complexity, but a linear empirical cost is obtained; (ii) with complete propagation an O(n2) complexity is achieved.

[1]  Rina Dechter,et al.  Experimental Evaluation of Preprocessing Techniques in Constraint Satisfaction Problems , 1989, IJCAI.

[2]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[3]  Alfons Crespo,et al.  On-line Scheduling and Planning of Robots and Presses , 1991 .

[4]  Michel Minoux,et al.  Graphs and Algorithms , 1984 .

[5]  Hu Hengzhang Expert systems and robotics: NATO ASI Series F: Computer and System Sciences, Vol. 71, edited by T. JORDANIDES and B. TORBY. Springer, Berlin (1991). 744 pp., DM 228·00 (hardcover), ISBN 3-540-537317 , 1992 .

[6]  Brian Knight,et al.  A General Temporal Model Supporting Duration Reasoning , 1992, AI Commun..

[7]  Jitendra Malik,et al.  Reasoning in Time and Space , 1983, IJCAI.

[8]  Henry A. Kautz,et al.  Integrating Metric and Qualitative Temporal Reasoning , 1991, AAAI.

[9]  Robert E. Shostak,et al.  Deciding Linear Inequalities by Computing Loop Residues , 1981, JACM.

[10]  Malik Ghallab,et al.  Managing Efficiently Temporal Relations Through Indexed Spanning Trees , 1989, IJCAI.

[11]  Edward P. K. Tsang,et al.  Time Structures for AI , 1987, IJCAI.

[12]  Ugo Montanari,et al.  Networks of constraints: Fundamental properties and applications to picture processing , 1974, Inf. Sci..

[13]  Ernest Davis,et al.  Constraint Propagation with Interval Labels , 1987, Artif. Intell..

[14]  Itay Meiri,et al.  Combining Qualitative and Quantitative Constraints in Temporal Reasoning , 1991, Artif. Intell..

[15]  Ron Shamir,et al.  Algorithms and Complexity for Reasoning about Time , 1992, AAAI.

[16]  Bernhard Nebel,et al.  On the Computational Complexity of Temporal Projection and Plan Validation , 1992, AAAI.

[17]  Thomas Dean,et al.  Using temporal hierarchies to efficiently maintain large temporal databases , 1989, JACM.

[18]  P. Vanbeek Reasoning about qualitative temporal information , 1992 .

[19]  Raúl E. Valdés-Pérez,et al.  The Satisfiability of Temporal Constraint Networks , 1987, AAAI.

[20]  Peter van Beek,et al.  Approximation Algorithms for Temporal Reasoning , 1989, IJCAI.

[21]  ShostakRobert Deciding Linear Inequalities by Computing Loop Residues , 1981 .

[22]  James F. Allen Maintaining knowledge about temporal intervals , 1983, CACM.

[23]  Drew McDermott,et al.  Temporal Data Base Management , 1987, Artif. Intell..

[24]  Rina Dechter,et al.  Temporal Constraint Networks , 1989, Artif. Intell..

[25]  Henry A. Kautz,et al.  Constraint Propagation Algorithms for Temporal Reasoning , 1986, AAAI.