Bettina Kemme, Joaquín Borrego Díaz

Propositional temporal logics are mainly used for the verification of concurrent systems. They allow the formalization and deduction of temporal properties. Temporal formulae are interpreted over state sequences. A state sequence describes a discrete flow of time where each state represents a distinguishable event. Artificial intelligence is another area that uses the notion of temporal knowledge. Typical approaches apply the concept of time intervals and their temporal relationships. Our aim is to use the mathematical and technical framework of temporal logics to reason about those time intervals. We present how time intervals and their relations can be transformed into state sequences, and how properties of the intervals can be expressed by temporal formulae. We show how typical queries about incomplete temporal knowledge can be answered by decision procedures and model-checker algorithms.

Note: The paper is written in Spanish.

Click to get the PostScript , Gzipped PostScript