Allen’s interval temporal logic is quite actively used in the procedures of finding a solution in modern intelligent real-time systems, since it has an inference algorithm of polynomial complexity. However, this algorithm is not complete. The paper proposes logics that are Boolean and metric extensions of Allen’s logic. Sound and complete systems of inference rules for these logics (in the notation of analytical tables) are presented. It is shown how these logics can be applied to decision making using the example of the problem of logical specification of workflows. The research is conducted in terms of developing methods and models for representing temporal dependencies in intelligent decision support systems of real-time.