Semirings, automata, languages
Semirings, automata, languages
A generalization of Dijkstra's calculus
ACM Transactions on Programming Languages and Systems (TOPLAS)
A completeness theorem for Kleene algebras and the algebra of regular events
Papers presented at the IEEE symposium on Logic in computer science
ACM Transactions on Programming Languages and Systems (TOPLAS)
A Discipline of Programming
Refinement Calculus: A Systematic Introduction
Refinement Calculus: A Systematic Introduction
Dynamic Logic
The logic of public announcements, common knowledge, and private suspicions
TARK '98 Proceedings of the 7th conference on Theoretical aspects of rationality and knowledge
Propositional Logics of Programs: New Directions
Proceedings of the 1983 International FCT-Conference on Fundamentals of Computation Theory
MPC '00 Proceedings of the 5th International Conference on Mathematics of Program Construction
Logic in Computer Science: Modelling and Reasoning about Systems
Logic in Computer Science: Modelling and Reasoning about Systems
Algebras of modal operators and partial correctness
Theoretical Computer Science - Algebraic methodology and software technology
ACM Transactions on Computational Logic (TOCL)
Refinement algebra with operators for enabledness and termination
MPC'06 Proceedings of the 8th international conference on Mathematics of Program Construction
AMAST'06 Proceedings of the 11th international conference on Algebraic Methodology and Software Technology
A sketch of a dynamic epistemic semiring
Information and Computation
Dynamic epistemic algebra with post-conditions to reason about robot navigation
WoLLIC'11 Proceedings of the 18th international conference on Logic, language, information and computation
| Hi-index | 0.00 |
Algebraic logic compacts many small steps of general logical derivation into large steps of equational reasoning. We illustrate this by representing epistemic logic and game logic in modal semirings and modal Kleene algebras. For epistemics we treat the classical wise men puzzle and show how to handle knowledge update and revision algebraically. For games, we generalise the well-known connection between game logic and dynamic logic to modal semirings and link it to predicate transformer semantics, in particular to demonic refinement algebra. The study provides evidence that modal semirings will be able to handle a wide variety of (multi-)modal logics in a uniform algebraic fashion well suited to machine assistance.