International audienceWe devote this paper to the axiomatization and the computability of PDLΔ0—a variant of iteration-free PDL with fork
AbstractIt is proved that validity problems for two variants of propositional dynamic logic (PDL) co...
For a class L of languages let PDL[L] be an extension of Propositional Dynamic Logic which allows pr...
AbstractThe aim of propositional algorithmic logic (PAL) is to investigate the properties of simple ...
International audienceWe devote this paper to the axiomatization and the computability of a variant ...
We devote this paper to the axiomatization and the computability of PDLΔ0—a variant of iteration-fre...
International audienceWe devote this paper to the axiomatization/completeness of PRSPDL0 - a variant...
AbstractIn this paper some propositional modal logics of programs are considered, based on the syste...
AbstractWe show that Test-free Propositional Dynamic Logic (PDL0) is less expressive than Propositio...
AbstractThe borderline between decidable and undecidable propositional dynamic Logic (PDL) is sought...
AbstractIt is shown that the validity problem for propositional dynamic logic (PDL), which is decida...
Invited speaker Session 5: Invited Talk and Complexity I (Chair: Dimiter Vakarelov)International aud...
: We continue research on enriching propositional dynamic logic (PDL) with nonregular programs. Prev...
Following a suggestion of Pratt, we consider propositional dynamic logic in which programs are nonde...
AbstractWe consider an extension QPDL of Segerberg-Pratt's Propositional Dynamic Logic PDL, with pro...
AbstractIt is proved that validity problems for two variants of propositional dynamic logic (PDL) co...
For a class L of languages let PDL[L] be an extension of Propositional Dynamic Logic which allows pr...
AbstractThe aim of propositional algorithmic logic (PAL) is to investigate the properties of simple ...
International audienceWe devote this paper to the axiomatization and the computability of a variant ...
We devote this paper to the axiomatization and the computability of PDLΔ0—a variant of iteration-fre...
International audienceWe devote this paper to the axiomatization/completeness of PRSPDL0 - a variant...
AbstractIn this paper some propositional modal logics of programs are considered, based on the syste...
AbstractWe show that Test-free Propositional Dynamic Logic (PDL0) is less expressive than Propositio...
AbstractThe borderline between decidable and undecidable propositional dynamic Logic (PDL) is sought...
AbstractIt is shown that the validity problem for propositional dynamic logic (PDL), which is decida...
Invited speaker Session 5: Invited Talk and Complexity I (Chair: Dimiter Vakarelov)International aud...
: We continue research on enriching propositional dynamic logic (PDL) with nonregular programs. Prev...
Following a suggestion of Pratt, we consider propositional dynamic logic in which programs are nonde...
AbstractWe consider an extension QPDL of Segerberg-Pratt's Propositional Dynamic Logic PDL, with pro...
AbstractIt is proved that validity problems for two variants of propositional dynamic logic (PDL) co...
For a class L of languages let PDL[L] be an extension of Propositional Dynamic Logic which allows pr...
AbstractThe aim of propositional algorithmic logic (PAL) is to investigate the properties of simple ...
DOI
Add to ORKG