Propositional logics of programs: systems, models, and complexity

Authors:
Rohit Parikh
Affiliations:
Boston Univ. and Laboratory for Computer Science, MIT
Venue:
POPL '80 Proceedings of the 7th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Year:
1980

Citing 4
Cited 2

First-Order Dynamic Logic

First-Order Dynamic Logic
Propositional modal logic of programs

STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
A practical decision method for propositional dynamic logic (Preliminary Report)

STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
A completeness technique for d-axiomatizable semantics

STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing

Improved upper and lower bounds for modal logics of programs

STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Fusions of description logics and abstract description systems

Journal of Artificial Intelligence Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

We indicate below the various results in this paper and the sections where these results are fully described. δ1 is introductory).(δ2). The partial correctness assertion (PCA) A{α}B is expressed in PDL in the form A → [α]B. We shall consider the question of when a given finite set of PCAs implies another and give optimal complexity bounds. We also give other results of an algebraic nature.(δ3). DPDL is less well understood than PDL since the filtration technique of F-L that applies to the latter falls for the former. We point out a translation from PDL to DPDL which leads to a lower bound for the latter.(δ4). What do models of PDL look like? We show the existence of canonical and universal models and show how an infinite model can be related to its F-L factors.