In this talk, I will make an introduction to the paradigm of Answer Set Programming (ASP) and its extension for temporal reasoning. In the first part of the talk, we will see the basic propositional semantics under a logical perspective (using Equilibrium Logic) and explain how this logical encoding relates to the most usual logic programming definition of answer sets. We will then review the most frequent features of the ASP language used in practice, presenting several examples that illustrate the use of variables and some frequent constructs like choice rules, aggregates or minimization. I will also briefly comment about the typical implementation of ASP solvers, separating the process of variable removal (grounding) from the purely propositional solving (which is closer to SAT solvers). In the last part of the talk, we will focus on an extension of Equilibrium Logic and ASP to deal with temporal reasoning, incorporating temporal operators from Linear-time Temporal Logic.