Dynamic linear time temporal logic

Henriksen, Jesper G.; Thiagarajan, P. S.

doi:10.1016/s0168-0072(98)00039-6

Cited by 80 publications

(107 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…In this section we briefly define the syntax and semantics of DLTL as introduced in (Henriksen and Thiagarajan 1999). In such a linear time temporal logic the next state modality is indexed by actions.…”

Section: Dynamic Linear Time Temporal Logicmentioning

confidence: 99%

“…In this paper we combine Answer Set Programming (ASP) (Gelfond 2007) with Dynamic Linear Time Temporal Logic (DLTL) (Henriksen and Thiagarajan 1999) to define a temporal logic programming language for reasoning about complex actions and infinite computations. DLTL extends propositional temporal logic of linear time with regular programs of propositional dynamic logic, which are used for indexing temporal modalities.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Reasoning about actions with Temporal Answer Sets

Giordano

Martelli

Dupré

2012

Theory and Practice of Logic Programming

View full text Add to dashboard Cite

In this paper, we combine Answer Set Programming (ASP) with Dynamic Linear Time Temporal Logic (DLTL) to define a temporal logic programming language for reasoning about complex actions and infinite computations. DLTL extends propositional temporal logic of linear time with regular programs of propositional dynamic logic, which are used for indexing temporal modalities. The action language allows general DLTL formulas to be included in domain descriptions to constrain the space of possible extensions. We introduce a notion of Temporal Answer Set for domain descriptions, based on the usual notion of Answer Set. Also, we provide a translation of domain descriptions into standard ASP and we use Bounded Model Checking techniques for the verification of DLTL constraints.

show abstract

Section: Dynamic Linear Time Temporal Logicmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Reasoning about actions with Temporal Answer Sets

Giordano

Martelli

Dupré

2012

Theory and Practice of Logic Programming

View full text Add to dashboard Cite

show abstract

“…In this section we shortly define the syntax and semantics of DLTL as introduced in [13]. In such a linear time temporal logic the next state modality is indexed by actions.…”

Section: Dlt Lmentioning

confidence: 99%

“…Hence both LTL(Σ) and PDL are fragments of DLTL(Σ). As shown in [13], DLTL(Σ) is strictly more expressive than LTL(Σ).…”

Section: Dlt Lmentioning

confidence: 99%

“…More precisely, an action theory has been proposed based on the linear time temporal logic, DLTL (Dynamic Linear Time Temporal Logic [13]), which is, essentially, a dynamic logic equipped with a linear time semantics. It provides a simple way of constraining the (possibly infinite) evolutions of the system by making use of regular programs.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Reasoning about Actions in a Multiagent Domain

Giordano

Martelli

Schwind

2001

AI*IA 2001: Advances in Artificial Intelligence

View full text Add to dashboard Cite

Abstract. In this paper we present a theory for reasoning about actions which is based on the Product Version of Dynamic Linear Time Temporal Logic (denoted DLT L ⊗ ) and allows to describe the behaviour of a network of sequential agents which coordinate their activities by performing common actions together. DLT L ⊗ extends LTL, the propositional linear time temporal logic, by strengthening the until operator by indexing it with the regular programs of dynamic logic. Moreover, it allows the formulas of the logic to be decorated with the names of sequential agents, taken from a finite set. The action theory we propose is an extension of the theory presented in [8], which is based on the logic DLTL, and allows reasoning with incomplete initial states and dealing with postdiction, ramifications as well as with nondeterministic actions. Here we extend this theory to cope with multiple agents synchronizing on common actions.

show abstract

References

2011

An Introduction to Practical Formal Methods Using Temporal Logic

View full text Add to dashboard Cite

Dynamic linear time temporal logic

Cited by 80 publications

References 8 publications

Reasoning about actions with Temporal Answer Sets

Reasoning about actions with Temporal Answer Sets

Reasoning about Actions in a Multiagent Domain

References

Contact Info

Product

Resources

About