We present an overview on Temporal Logic Programming under the perspective of its application for Knowledge Representation and declarative problem solving. Such programs are the result of combining usual rules with temporal modal operators, as in Linear-time Temporal Logic (LTL). We focus on recent results of the non-monotonic formalism called Temporal Equilibrium Logic (TEL) that is defined for the full syntax of LTL, but performs a model selection criterion based on Equilibrium Logic, a well known logical characterization of Answer Set Programming (ASP). We obtain a proper extension of the stable models semantics for the general case of arbitrary temporal formulas. We recall the basic definitions for TEL and its monotonic basis, the temporal logic of Here-and-There (THT), and study the differences between infinite and finite traces. We also provide other useful results, such as the translation into other formalisms like Quantified Equilibrium Logic or Second-order LTL, and some techniques for computing temporal stable models based on automata. In a second part, we focus on practical aspects, defining a syntactic fragment called temporal logic programs closer to ASP, and explain how this has been exploited in the construction of the solver TELINGO.

中文翻译：

---

临时答案集编程

我们从时序逻辑编程在知识表示和声明式问题解决中的应用角度对时序逻辑编程进行了概述。此类程序是将常用规则与时间模态运算符相结合的结果，如线性时间时间逻辑 (LTL)。我们专注于称为时间均衡逻辑 (TEL) 的非单调形式主义的最新结果，它是为 LTL 的完整语法定义的，但执行基于均衡逻辑的模型选择标准，这是众所周知的答案集编程 (ASP) 逻辑特征）。对于任意时间公式的一般情况，我们获得了稳定模型语义的适当扩展。我们回顾了 TEL 的基本定义及其单调基础、Here-and-There (THT) 的时间逻辑，并研究了无限轨迹和有限轨迹之间的差异。我们还提供了其他有用的结果，例如转换为其他形式主义，如量化均衡逻辑或二阶 LTL，以及一些基于自动机计算时间稳定模型的技术。在第二部分，我们专注于实践方面，定义一个更接近 ASP 的称为时态逻辑程序的句法片段，并解释如何在求解器 TELINGO 的构建中利用它。