Dynamic logic

By Bernhard Beckert, Vladimir Klebanov, Steffen Schlager. SIGA, 2001

2,038 citations recorded by the source corpus.

Subfields: Artificial Intelligence, Management Science and Operations Research

View Paper: https://www.semanticscholar.org/paper/34e164e01e2693768dcec079001532ada9ddc9ad

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

In Management Science and Operations Research

Citations in the corpus

Visibly pushdown languages (2004, background): “It has been observed that propositional dynamic logic can be augmented with some restricted class of context-free languages, and simple-minded pushdown automata, which may be viewed as a restricted class of Vpas, have been proposed to explain the phenomenon [16].”
Dynamic logic of preference upgrade (2007, methodology): “This may be written as follows in the standard notation of dynamic logic ([HAR 00]):”
Conjunctive interpretation of disjunction (2010, background): “The mapping τ is extended to give interpretations to all action expressions by τ(α ; β) = τ(α) ; τ(β) and τ(α ∨ β) = τ(α) ∪ τ(β) .”
Dynamic Epistemic Logic (2007, methodology): “This is the appropriate analogue of the Fisher-Ladner closure from the PDL literature (see [16]).”
TriAL (2018, background): “Its navigational fragment, presented next, is essentially Propositional Dynamic Logic (PDL) [31] with negation on paths.”
Differential Dynamic Logic for Hybrid Systems (2008, methodology): “Deductive Verification Deductive approaches [7, 8, 20, 21, 34, 35, 38, 59] have been used for verifying systems by proofs instead of by state space exploration and, thus, do not require finite-state abstractions.”
Deductive Software Verification – The KeY Book (2016, background): “A deepened discussion of dynamic logic is contained in [Harel et al., 2000] and Chapter 3.”
A Short Introduction to Computational Social Choice (2007, background): “Rohit Parikh [74] has coined the term social software for this line of research and argued that (extensions of) dynamic logic [49] may be particularly suited for formalising such social procedures.”
An Overview of Tableau Algorithms for Description Logics (2001, result): “The fact that they are in EXPTIME follows from results for PDL and converse-PDL (Pratt, 1979; Harel, 1984).”
A Modal Logic for Coalitional Power in Games (2002, background): “This requires adding an iterated modality in the style of dynamic logic [5], and such an extension would allow for investigating the interplay between local and global coalitional principles.”