On the consistency problem for the INDU calculus

Proceedings of the International Workshop on Temporal Representation and Reasoning

Volumn 2003-January, Issue , 2003, Pages 203-211

  Balbiani, Philippe ^a   Condotta, Jean François ^b   Ligozat, Gérard ^b  

^a IRIT   (France)

^b CNRS   (France)

Author keywords

[No Author keywords available]

Indexed keywords

TEMPORAL LOGIC;

CONSISTENCY PROBLEMS; PATH CONSISTENCY;

CALCULATIONS;

EID: 77956760031     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/TIME.2003.1214897     Document Type: Conference Paper

References (11)

1. A. J. F. Allen. An interval-based representation of temporal knowledge. In Proceedings of the Seventh Int. Joint Conf. on Artificial Intelligence (IJCAI'81), pages 221-226, 1981.
2. P. Balbiani, J.-F. Condotta, and G. Ligozat. Reasoning about generalized intervals: Horn representability and tractability. In Proc. of the seventh int. workshop on Temporal Repres. and Reasoning (TIME'2000), Canada, pages 23-30, 2000.
3. T. Drakengren and P. Jonsson. Eight Maximal Tractable Subclasses of Allen's Algebra with Metric Time. Journal of Artificial Intelligence Research, 7:25-45, 1997.
4. M. Koubarakis. Tractable disjunctions of linear constraints. In Proceedings of the 2nd International Conference on Principles and Practice of Constraint Programming (CP'96), LNCS 1118, pages 297-307, Cambridge, MA, 1996.
5. G. V. Kumari and A. K. Pujari. Maximality of pre-convex class of indu. In International Conference on Knowledge Based Computer Systems, Mumbai, India, 2000.
6. G. V. Kumari and A. K. Pujari. Enforcing the local consistency in indu. In International Conference on Knowledge Based Computer Systems, India, 2002.
7. G. Ligozat. A New Proof of Tractability for ORD-Horn Relations. In Proc. of the Thirteenth National Conf. on Artificial Intel. (AAAI'96), volume 1, pages 395-401, 1996.
8. A. K. Mackworth and E. C. Freuder. The Complexity of Some Polynomial Network Consistency Algorithms for Constraint Satisfaction Problem. Artif. Intel., 25(1):65-74, 1985.
9. B. Nebel and H.-J. Bürckert. Reasoning About Temporal Relations: A Maximal Tractable Subclass of Allen's Interval Algebra. Jour. of the ACM, 42(1):43-66, 1995.
10. A. K. Pujari, G. V. Kumari, and A. Sattar. INDU: An Interval and Duration Network. In Australian Joint Conference on Artificial Intelligence, pages 291-303, 1999.
11. A. Tarski. On the Calculus of Relations. Journal of Symbolic Logic, 6(3):73-89, 1941.