scientific article; zbMATH DE number 5599076

MaRDI QIDQ3393869zbMATH OpenFDO

Authors Stefan Göller

Publication date 27 August 2009

Mathematics Subject Classification ID

Logic in computer science (03B70) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Analysis of algorithms and problem complexity (68Q25) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• Decision complexity of variants of propositional dynamic logic
• scientific article; zbMATH DE number 4179344
• Complexity and expressivity of propositional dynamic logics with finitely many variables
• scientific article; zbMATH DE number 3995647
• Propositional dynamic logic with quantification over regular computation sequences
• Complexity of computing with extended propositional logic programs
• Computational complexity and the expressive power of logics
• The computational complexity of propositional cirquent calculus
• scientific article; zbMATH DE number 4114609
• Complexity optimal decision procedure for a propositional dynamic logic with parallel composition

Cited in

(7)

• Model checking propositional dynamic logic with all extras
• Infinite State Model-Checking of Propositional Dynamic Logics
• PDL with intersection and converse: satisfiability and infinite-state model checking
• Complexity and expressivity of propositional dynamic logics with finitely many variables
• Beyond \(\mathcal{ALC}_{\textsf{reg}} \): exploring non-regular extensions of PDL with description logics features
• Exploring non-regular extensions of propositional dynamic logic with description-logics features
• Propositional dynamic logic formula synthesis and some applications

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3393869)