Most of AI research on temporal reasoning has been devoted to either exploring constraint-based temporal deduction techniques or investigating diverse logics extended with time. Nevertheless the formal study of deductive systems for such temporal extended logics has received little attention. This paper presents a general framework for temporal reasoning in knowledge-based systems resulting from embedding a temporal reasoner into a general calculus. From a representa-tional point of view it is based on the notions of temporal token and temporal constraint. The logic is formally deened as a particular many-sorted predicate calculus and provided with an complete and sound inference system composed of non-temporal and temporal inference rules. Moreover, a deductive procedure is presented and analyzed. It is a general forward chaining algorithm for which soundness and completeness are guaranteed.