On the consistency problem for the INDU calculus

Abstract In this paper, we further investigate the consistency problem for the qualitative temporal calculus INDU introduced by Pujari et al. [A.K. Pujari, G.V. Kumari, A. Sattar, INDU: An interval and duration network, in: Australian Joint Conference on Artificial Intelligence, 1999, pp. 291–303]. We prove the intractability of the consistency problem for the subset of pre-convex relations, and the tractability of strongly pre-convex relations. Furthermore, we also define another interesting set of relations for which the consistency problem can be decided by the ⋄ - closure method , a method similar to the usual path-consistency method. Finally, we prove that the ⋄ - closure method is also complete for the set of atomic relations of INDU implying that the intervals have the same duration.

[1]  Jean-François Condotta,et al.  On the consistency problem for the INDU calculus , 2003, 10th International Symposium on Temporal Representation and Reasoning, 2003 and Fourth International Conference on Temporal Logic. Proceedings..

[2]  Alfred Tarski,et al.  Relational selves as self-affirmational resources , 2008 .

[3]  Manolis Koubarakis,et al.  Tractable Disjunctions of Linear Constraints , 1996, CP.

[4]  Gérard Ligozat,et al.  A New Proof of Tractability for ORD-Horn Relations , 1996, AAAI/IAAI, Vol. 1.

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

[6]  Jean-François Condotta,et al.  Reasoning about generalized intervals: Horn representability and tractability , 2000, Proceedings Seventh International Workshop on Temporal Representation and Reasoning. TIME 2000.

[7]  Abdul Sattar,et al.  INDU: An Interval and Duration Network , 1999, Australian Joint Conference on Artificial Intelligence.

[8]  Peter Jonsson,et al.  Eight Maximal Tractable Subclasses of Allen's Algebra with Metric Time , 1997, J. Artif. Intell. Res..

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

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

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