Temporal Answer Set Programming on Finite Traces

作     者：Cabalar, Pedro Kaminski, Roland Schaub, Torsten Schuhmann, Anna 

作者机构：Univ A Coruna La Coruna Spain Univ Potsdam Potsdam Germany 

出 版 物：《THEORY AND PRACTICE OF LOGIC PROGRAMMING》 (逻辑程序设计理论与实践)

年 卷 期：2018年第18卷第3-4期

页      面：406-420页

核心收录：

学科分类：08[工学] 0835[工学-软件工程] 0701[理学-数学] 0812[工学-计算机科学与技术（可授工学、理学学位）] 

基　　金：MINECO, Spain [TIC2017-84453-P] Xunta de Galicia, Spain [GPC ED431B 2016/035, 2016-2019 ED431G/01] DFG [SCHA 550/9] 

摘      要：In this paper, we introduce an alternative approach to Temporal Answer Set Programming that relies on a variation of Temporal Equilibrium Logic (TEL) for finite traces. This approach allows us to even out the expressiveness of TEL over infinite traces with the computational capacity of (incremental) Answer Set Programming (ASP). Also, we argue that finite traces are more natural when reasoning about action and change. As a result, our approach is readily implementable via multi-shot ASP systems and benefits from an extension of ASP s full-fledged input language with temporal operators. This includes future as well as past operators whose combination offers a rich temporal modeling language. For computation, we identify the class of temporal logic programs and prove that it constitutes a normal form for our approach. Finally, we outline two implementations, a generic one and an extension of the ASP system clingo. Under consideration for publication in Theory and Practice of Logic Programming (TPLP)