On the consistency problem for the INDU calculus

Journal of Applied Logic - Tập 4 - Trang 119-140 - 2006
Philippe Balbiani1, Jean-François Condotta2, Gérard Ligozat3
1IRIT-CNRS, 118, route de Narbonne, 31062 Toulouse, France
2CRIL-CNRS, Université d'Artois, Faculté des sciences Jean Perrin, rue Jean Souvraz, 62307 Lens, France
3LIMSI-CNRS, Université de Paris-Sud, 91403 Orsay, France

Tài liệu tham khảo

J.F. Allen, An interval-based representation of temporal knowledge, in: Proceedings of the Seventh Int. Joint Conf. on Artificial Intelligence (IJCAI'81), 1981, pp. 221–226 P. Balbiani, J.-F. Condotta, G. Ligozat, On the consistency problem for the INDU calculus, in: IEEE (Ed.), Proceeding of the Combined Tenth International Symposium on Temporal Representation and Reasoning and Fourth International Conference on Temporal Logic (TIME-ICTL 2003), Cairns, Queensland, Australia, 2003, pp. 203–211 P. Balbiani, J.-F. Condotta, G. Ligozat, Reasoning about generalized intervals: Horn representability and tractability, in: Proc. of the Seventh International Workshop on Temporal Representation and Reasoning (TIME'2000), Canada, 2000, pp. 23–30 Drakengren, 1997, Eight maximal tractable subclasses of Allen's algebra with metric time, J. Artificial Intelligence Res., 7, 25, 10.1613/jair.340 Garey, 1979 Koubarakis, 1996, Tractable disjunctions of linear constraints, vol. 1118, 297 G.V. Kumari, A.K. Pujari, Enforcing the local consistency in INDU, in: International Conference on Knowledge Based Computer Systems, India, 2002 G.V. Kumari, A.K. Pujari, Maximality of pre-convex class of INDU, in: International Conference on Knowledge Based Computer Systems, Mumbai, India, 2000 G. Ligozat, A new proof of tractability for ORD-Horn relations, in: Proc. of the Thirteenth National Conf. on Artificial Intel. (AAAI'96), vol. 1, 1996, pp. 395–401 Mackworth, 1985, The complexity of some polynomial network consistency algorithms for constraint satisfaction problems, Artificial Intelligence, 25, 65, 10.1016/0004-3702(85)90041-4 Nebel, 1995, Reasoning about temporal relations: A maximal tractable subclass of Allen's interval algebra, J. ACM, 42, 43, 10.1145/200836.200848 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 Tarski, 1941, On the calculus of relations, J. Symbolic Logic, 6, 73, 10.2307/2268577 Vilain, 1986, Constraint Propagation algorithms for temporal reasoning, 377