On the consistency problem for INDU calculus

Philippe Balbiani (1) , Jean-François Condotta (2) , Gérard Ligozat (2)

1 IRIT-LILaC - Logique, Interaction, Langue et Calcul
2 LIMSI - Laboratoire d'Informatique pour la Mécanique et les Sciences de l'Ingénieur

In this paper, we further investigate the consistency problem for the qualitative temporal calculus INDU introduced by A. K. Pujari et al. (1999). We prove the intractability of the consistency problem for the subset of preconvex relations. On the other hand, we show the tractability of strongly preconvex relations. Furthermore, we also define another interesting set of relations for which the consistency problem can be decided by a method similar to the usual path-consistency method.

Mots clés: temporal reasoning; computational complexity; process algebra; temporal logic; natural languages; logic functions

Domaines: Intelligence artificielle [cs.AI]

Philippe Balbiani, Jean-François Condotta, Gérard Ligozat. On the consistency problem for INDU calculus. 10th International Symposium on Temporal Representation and Reasoning (TIME 2003), Jul 2003, Cairns, QLD, Australia. pp.203-211, ⟨10.1109/TIME.2003.1214897⟩. ⟨hal-03300310⟩