STeLP -- A tool for temporal answer set programming. In this paper we present STeLP, a solver for Answer Set Programming with temporal operators. Taking as an input a particular kind of logic program with modal operators (called Splitable Temporal Logic Program), STeLP obtains its set of temporal equilibrium models (a generalisation of stable models for this extended syntax). The obtained set of models is represented in terms of a deterministic B”uchi automaton capturing the complete program behaviour. In small examples, this automaton can be graphically displayed in a direct and readable way. The input language provides a set of constructs which allow a simple definition of temporal logic programs, including a special syntax for action domains that can be exploited to simplify the graphical output. STeLP combines the use of a standard ASP solver with a linear temporal logic model checker in order to find all models of the input theory.
References in zbMATH (referenced in 4 articles )
Showing results 1 to 4 of 4.
- Cabalar, Pedro; Demri, Stéphane: Automata-based computation of temporal equilibrium models (2012)
- Denecker, Marc; Lierler, Yuliya; Truszczynski, Miroslaw; Vennekens, Joost: A Tarskian informal semantics for answer set programming (2012)
- Aguado, Felicidad; Cabalar, Pedro; Pérez, Gilberto; Vidal, Concepción: Loop formulas for splitable temporal logic programs (2011)
- Cabalar, Pedro; Diéguez, Martín: STeLP -- a tool for temporal answer set programming (2011)