We de ne a preferential semantics based on stable generated models for a very general class of temporal deductive databases. We allow two kinds of temporal information to be represented and queried: timepoint and timestamp formulas, and show how each of them can be translated into the other. Because of their generality, our formalism and our semantics can serve as a basis for comparing and exte...