On the consistency problem for the INDU calculus

On the consistency problem for the INDU calculus

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 pre...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Balbiani, P., Condotta, J.-F., Ligozat, G.
Format: Tagungsbericht
Sprache:eng
Schlagworte:
Algebra
Artificial Intelligence
Calculus
Computer Science
Logic functions
Natural languages
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.
ISSN:1530-1311
2332-6468
DOI:10.1109/TIME.2003.1214897