Solving multi-granularity temporal constraint networks

Many problems in scheduling, planning, and natural language understanding have been formulated in terms of temporal constraint satisfaction problems (TCSP). These problems have been extensively investigated in the AI literature providing effective solutions for some fragments of the general model. Independently, there has been an effort in the data and knowledge management research community for the formalization of the concept of time granularity and for its applications. This paper considers a framework for integrating the notion of time granularity into TCSP, and investigates the problems of consistency and network solution, which, in this context, involve complex manipulation of the periodic sets representing time granularities. A sound and complete algorithm for consistency checking and for deriving a solution is presented. The paper also investigates the algorithm's computational complexity and several optimization techniques specific to the multigranularity context. An application to e-commerce workflows illustrates the benefits of the framework and the need for specific reasoning tools.

[1]  X. S. Wang,et al.  Discovering Temporal Relationships with Multiple Granularities in Time Sequences Technical Report: ISSE-TR-96-06 , 1998 .

[2]  Eugene C. Freuder,et al.  The Complexity of Some Polynomial Network Consistency Algorithms for Constraint Satisfaction Problems , 1985, Artif. Intell..

[3]  Pierre Wolper,et al.  Handling Infinite Temporal Data , 1995, J. Comput. Syst. Sci..

[4]  Angelo Montanari,et al.  Decidability Results for Metric and Layered Temporal Logics , 1996, Notre Dame J. Formal Log..

[5]  Peter Jeavons,et al.  Building tractable disjunctive constraints , 2000, J. ACM.

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

[7]  Sushil Jajodia,et al.  Temporal Reasoning in Workflow Systems , 2002, Distributed and Parallel Databases.

[8]  Curtis E. Dyreson,et al.  A Glossary of Time Granularity Concepts , 1997, Temporal Databases, Dagstuhl.

[9]  Ron Shamir,et al.  Complexity and algorithms for reasoning about time: a graph-theoretic approach , 1993, JACM.

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

[11]  Peter van Beek,et al.  On the minimality and global consistency of row-convex constraint networks , 1995, JACM.

[12]  Christer Bäckström,et al.  A Unifying Approach to Temporal Constraint Reasoning , 1998, Artif. Intell..

[13]  Sushil Jajodia,et al.  A general framework for time granularity and its application to temporal reasoning , 1998, Annals of Mathematics and Artificial Intelligence.

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

[15]  Bernhard Nebel,et al.  Reasoning about temporal relations: a maximal tractable subclass of Allen's interval algebra , 1994, JACM.

[16]  Sushil Jajodia,et al.  Logical design for temporal databases with multiple granularities , 1997, TODS.

[17]  Barbara Pernici,et al.  Qualitative and Quantitative Temporal Constraints and Relational Databases: Theory, Architecture, and Applications , 1999, IEEE Trans. Knowl. Data Eng..

[18]  Massimo Poesio,et al.  Metric Constraints for Maintaining Appointments: Dates and Repeated Activities , 1991, AAAI.

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

[20]  Pierre Wolper,et al.  Handling infinite temporal data , 1990, PODS.

[21]  X.S. Wang,et al.  Discovering Frequent Event Patterns with Multiple Granularities in Time Sequences , 1998, IEEE Trans. Knowl. Data Eng..

[22]  Alan K. Mackworth Consistency in Networks of Relations , 1977, Artif. Intell..

[23]  William S. Havens,et al.  Hierarchical arc consistency: exploiting structured domains in constraint satisfaction problems , 1985 .

[24]  Thomas A. Henzinger,et al.  Real-Time Logics: Complexity and Expressiveness , 1993, Inf. Comput..

[25]  Rina Dechter,et al.  Processing Disjunctions in Temporal Constraint Networks , 1997, Artif. Intell..

[26]  Christian Bessiere,et al.  Arc-Consistency and Arc-Consistency Again , 1993, Artif. Intell..

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

[28]  Thomas C. Henderson,et al.  Arc and Path Consistency Revisited , 1986, Artif. Intell..

[29]  Peter van Beek,et al.  Exact and approximate reasoning about temporal relations 1 , 1990, Comput. Intell..

[30]  Michael R. Fellows,et al.  Parameterized Complexity , 1998 .

[31]  Spiros Skiadopoulos,et al.  Querying temporal and spatial constraint networks in PTIME , 2000, Artif. Intell..

[32]  Sushil Jajodia,et al.  Satisfiability of Quantitative Temporal Constraints with Multiple Granularities , 1997, CP.

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

[34]  Lina Khatib,et al.  Path Consistency in a Network of Non-Convex Intervals , 1993, IJCAI.

[35]  Angelo Montanari,et al.  Metric and Layered Temporal Logic for Time Granularity , 1996, ILLC dissertation series.

[36]  Peter B. Ladkin,et al.  The Completeness of a Natural System for Reasoning with Time Intervals , 1987, IJCAI.