Application of modal logic to programming
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3469999 (Why is no real title available?)
- scientific article; zbMATH DE number 3550144 (Why is no real title available?)
- scientific article; zbMATH DE number 3558938 (Why is no real title available?)
- scientific article; zbMATH DE number 3564287 (Why is no real title available?)
- scientific article; zbMATH DE number 3566135 (Why is no real title available?)
- scientific article; zbMATH DE number 3569792 (Why is no real title available?)
- scientific article; zbMATH DE number 3574936 (Why is no real title available?)
- scientific article; zbMATH DE number 3591393 (Why is no real title available?)
- scientific article; zbMATH DE number 3607998 (Why is no real title available?)
- scientific article; zbMATH DE number 3274715 (Why is no real title available?)
- scientific article; zbMATH DE number 3315203 (Why is no real title available?)
- scientific article; zbMATH DE number 3378527 (Why is no real title available?)
- A practical decision method for propositional dynamic logic (preliminary report)
- An axiomatic basis for computer programming
- Lucid, a nonprocedural language with iteration
- Semantical Analysis of Modal Logic I Normal Modal Propositional Calculi
- The Computational Complexity of Provability in Systems of Modal Propositional Logic
Cited in
(16)- Effective semantics for the modal logics K and KT via non-deterministic matrices
- Dual choice and iteration in an abstract algebra of action
- Modal operators on pseudo-BE algebras
- Kripke semantics for knowledge representation logics
- Multimodal Separation Logic for Reasoning About Operational Semantics
- Getting started: Beginnings in the logic of action
- On \(K\)-modal BL-logics
- Uniform and non uniform strategies for tableaux calculi for modal logics
- Tableaux for constructive concurrent dynamic logic
- Mathematical modal logic: A view of its evolution
- Dynamic algebras: Examples, constructions, applications
- On qualitative route descriptions. Representation, agent models, and computational complexity
- Constructive modal logics. I
- \(\mathrm{K}_{\mathrm S}\mathrm{P}\) a resolution-based theorem prover for \({\mathsf{K}}_n\): architecture, refinements, strategies and experiments
- Logics for actor networks: a two-stage constrained-hybridisation approach
- 3-SAT = SAT for a class of normal modal logics
This page was built for publication: Application of modal logic to programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1150592)
