The temporal logic of reactive and concurrent systems
The temporal logic of reactive and concurrent systems
Proceedings of the eleventh international conference on Logic programming
Logic programs with stable model semantics as a constraint programming paradigm
Annals of Mathematics and Artificial Intelligence
A New Logical Characterisation of Stable Models and Answer Sets
NMELP '96 Selected papers from the Non-Monotonic Extensions of Logic Programming
ASSAT: computing answer sets of a logic program by SAT solvers
Eighteenth national conference on Artificial intelligence
A generalization of the Lin-Zhao theorem
Annals of Mathematics and Artificial Intelligence
Annals of Mathematics and Artificial Intelligence
Strongly Equivalent Temporal Logic Programs
JELIA '08 Proceedings of the 11th European conference on Logics in Artificial Intelligence
Temporal equilibrium logic: a first approach
EUROCAST'07 Proceedings of the 11th international conference on Computer aided systems theory
A normal form for linear temporal equilibrium logic
JELIA'10 Proceedings of the 12th European conference on Logics in artificial intelligence
STeLP: a tool for temporal answer set programming
LPNMR'11 Proceedings of the 11th international conference on Logic programming and nonmonotonic reasoning
Answer sets for propositional theories
LPNMR'05 Proceedings of the 8th international conference on Logic Programming and Nonmonotonic Reasoning
STeLP: a tool for temporal answer set programming
LPNMR'11 Proceedings of the 11th international conference on Logic programming and nonmonotonic reasoning
Automata-Based computation of temporal equilibrium models
LOPSTR'11 Proceedings of the 21st international conference on Logic-Based Program Synthesis and Transformation
Simulating production rules using ACTHEX
Correct Reasoning
Logical foundations for more expressive declarative temporal logic programming languages
ACM Transactions on Computational Logic (TOCL)
| Hi-index | 0.00 |
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.