International audienceWe 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
AbstractWe give an elementary proof of the completeness of the Segerberg axions for Propositional Dy...
Invited speaker Session 5: Invited Talk and Complexity I (Chair: Dimiter Vakarelov)International aud...
AbstractRecently visibly pushdown automata have been extended to so-called k-phase multi-stack visib...
We present a new logic called Ockhamist Propositional Dynamic Logic, OPDL, which provides a natural ...
Ockhamist Propositional Dynamic Logic (OPDL) is a logic unifying the family of dynamic logics and th...
International audienceWe study a version of Propositional Dynamic Logic (PDL) that we call Dynamic L...
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...
Propositional dynamic logic (PDL) is complete but not compact. As a consequence, strong completeness...
Over the last forty years, computer scientists have invented or borrowed numerous logics for reasoni...
International audienceWe extend the propositional dynamic logic PDL of Fischer and Ladner with a res...
AbstractIn this paper some propositional modal logics of programs are considered, based on the syste...
PRSPDL is a propositional dynamic logic with an operator for parallel compositions of programs. We f...
AbstractWe give an elementary proof of the completeness of the Segerberg axions for Propositional Dy...
Invited speaker Session 5: Invited Talk and Complexity I (Chair: Dimiter Vakarelov)International aud...
AbstractRecently visibly pushdown automata have been extended to so-called k-phase multi-stack visib...
We present a new logic called Ockhamist Propositional Dynamic Logic, OPDL, which provides a natural ...
Ockhamist Propositional Dynamic Logic (OPDL) is a logic unifying the family of dynamic logics and th...
International audienceWe study a version of Propositional Dynamic Logic (PDL) that we call Dynamic L...
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...
Propositional dynamic logic (PDL) is complete but not compact. As a consequence, strong completeness...
Over the last forty years, computer scientists have invented or borrowed numerous logics for reasoni...
International audienceWe extend the propositional dynamic logic PDL of Fischer and Ladner with a res...
AbstractIn this paper some propositional modal logics of programs are considered, based on the syste...
PRSPDL is a propositional dynamic logic with an operator for parallel compositions of programs. We f...
AbstractWe give an elementary proof of the completeness of the Segerberg axions for Propositional Dy...
Invited speaker Session 5: Invited Talk and Complexity I (Chair: Dimiter Vakarelov)International aud...
AbstractRecently visibly pushdown automata have been extended to so-called k-phase multi-stack visib...