Logic programming with temporal constraints
In this work we combine logic programming and temporal constraint processing techniques. We propose TCLP, which augments logic programs in Temporal Constraint Networks are applied. We identify a decidable fragment called, Simple TCLP, which can be viewed as extending Datalog with limited functions to accomodate intervals of occurrence and temporal constraints between them. Some of the restrictions introduced by Simple TCLP are overcome by a syntactic structure which provides with the benefits of reification. The latter allows quantification on temporal occurrences and relation symbols.