A temporal logic programming approach to planning

2019 ◽  
Vol 38 (2) ◽  
pp. 402-420
Author(s):  
Kai Yang ◽  
Cong Tian ◽  
Nan Zhang ◽  
Zhenhua Duan ◽  
Hongwei Du
2008 ◽  
Vol 70 (1) ◽  
pp. 31-61 ◽  
Author(s):  
Zhenhua Duan ◽  
Xiaoxiao Yang ◽  
Maciej Koutny

1989 ◽  
Vol 8 (3) ◽  
pp. 277-295 ◽  
Author(s):  
Martín Abadi ◽  
Zohar Manna

2015 ◽  
Vol 15 (4-5) ◽  
pp. 666-680 ◽  
Author(s):  
PEDRO CABALAR ◽  
MARTÍN DIÉGUEZ ◽  
CONCEPCIÓN VIDAL

AbstractThis paper studies the relation between two recent extensions of propositional Equilibrium Logic, a well-known logical characterisation of Answer Set Programming. In particular, we show how Temporal Equilibrium Logic, which introduces modal operators as those typically handled in Linear-Time Temporal Logic (LTL), can be encoded into Infinitary Equilibrium Logic, a recent formalisation that allows the use of infinite conjunctions and disjunctions. We prove the correctness of this encoding and, as an application, we further use it to show that the semantics of the temporal logic programming formalism called TEMPLOG is subsumed by Temporal Equilibrium Logic.


Sign in / Sign up

Export Citation Format

Share Document