zbMATH — the first resource for mathematics

Loop formulas for splitable temporal logic programs. (English) Zbl 1327.68058
Delgrande, James P. (ed.) et al., Logic programming and nonmonotonic reasoning. 11th international conference, LPNMR 2011, Vancouver, Canada, May 16–19, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-20894-2/pbk). Lecture Notes in Computer Science 6645. Lecture Notes in Artificial Intelligence, 80-92 (2011).
Summary: In this paper, we study a method for computing temporal equilibrium models, a generalisation of stable models for logic programs with temporal operators, as in Linear Temporal Logic (LTL). To this aim, we focus on a syntactic subclass of these temporal logic programs called splitable and whose main property is satisfying a kind of “future projected” dependence present in most dynamic scenarios in Answer Set Programming (ASP). Informally speaking, this property can be expressed as “past does not depend on the future.” We show that for this syntactic class, temporal equilibrium models can be captured by an LTL formula, that results from the combination of two well-known techniques in ASP: splitting and loop formulas. As a result, an LTL model checker can be used to obtain the temporal equilibrium models of the program.
For the entire collection see [Zbl 1214.68009].

68N17 Logic programming
03B44 Temporal logic
PDF BibTeX Cite
Full Text: DOI