We present a new logic called Ockhamist Propositional Dynamic Logic, OPDL, which provides a natural link between PDL and CTL*. We show that both PDL and CTL* can be polynomially embedded into OPDL in a rather simple and direct way. More generally, the semantics on which OPDL is based provides a unifying framework for making the dynamic logic family and the temporal logic family converge in a single logical framework. Decidability of the satisfiability problem for OPDL is studied in the paper
We extend the propositional dynamic logic PDL of Fischer and Ladner with a restricted kind of recurs...
AbstractRecently visibly pushdown automata have been extended to so-called k-phase multi-stack visib...
In this paper we show that it is possible to eliminate the "converse" operator from the propositiona...
International audienceWe present a new logic called Ockhamist Propositional Dynamic Logic, OPDL, whi...
Ockhamist Propositional Dynamic Logic (OPDL) is a logic unifying the family of dynamic logics and th...
We study a version of Propositional Dynamic Logic (PDL) that we call Dynamic Logic of Propositional ...
AbstractThis paper presents a model checking algorithm for Propositional Dynamic Logic (PDL) with lo...
Abstract Propositional dynamic logic (PDL) is complete but not compact.As a consequence, strong comp...
PPDL det extends propositional dynamic logic (PDL) with parallel composition of programs. This new c...
AbstractIt is proved that validity problems for two variants of propositional dynamic logic (PDL) co...
Abstract—We study a version of Propositional Dynamic Logic (PDL) that we call Dynamic Logic of Propo...
Propositional dynamic logic (PDL) is complete but not compact. As a consequence, strong completeness...
Propositional dynamic logic is a formal system for reasoning about the before—after behavior of regu...
Over the last forty years, computer scientists have invented or borrowed numerous logics for reasoni...
Following a suggestion of Pratt, we consider propositional dynamic logic in which programs are nonde...
We extend the propositional dynamic logic PDL of Fischer and Ladner with a restricted kind of recurs...
AbstractRecently visibly pushdown automata have been extended to so-called k-phase multi-stack visib...
In this paper we show that it is possible to eliminate the "converse" operator from the propositiona...
International audienceWe present a new logic called Ockhamist Propositional Dynamic Logic, OPDL, whi...
Ockhamist Propositional Dynamic Logic (OPDL) is a logic unifying the family of dynamic logics and th...
We study a version of Propositional Dynamic Logic (PDL) that we call Dynamic Logic of Propositional ...
AbstractThis paper presents a model checking algorithm for Propositional Dynamic Logic (PDL) with lo...
Abstract Propositional dynamic logic (PDL) is complete but not compact.As a consequence, strong comp...
PPDL det extends propositional dynamic logic (PDL) with parallel composition of programs. This new c...
AbstractIt is proved that validity problems for two variants of propositional dynamic logic (PDL) co...
Abstract—We study a version of Propositional Dynamic Logic (PDL) that we call Dynamic Logic of Propo...
Propositional dynamic logic (PDL) is complete but not compact. As a consequence, strong completeness...
Propositional dynamic logic is a formal system for reasoning about the before—after behavior of regu...
Over the last forty years, computer scientists have invented or borrowed numerous logics for reasoni...
Following a suggestion of Pratt, we consider propositional dynamic logic in which programs are nonde...
We extend the propositional dynamic logic PDL of Fischer and Ladner with a restricted kind of recurs...
AbstractRecently visibly pushdown automata have been extended to so-called k-phase multi-stack visib...
In this paper we show that it is possible to eliminate the "converse" operator from the propositiona...