2 papers
cs.LO2019
From Hybrid Modal Logic to Matching Logic and Back
Ioana Leuştean, Natalia Moangă, Traian Florin Şerbănuţă
Building on our previous work on hybrid polyadic modal logic we identify modal logic equivalents for Matching Logic, a logic for program specification and verification. This provid…
cs.LO2018
A many-sorted polyadic modal logic
Ioana Leustean, Natalia Moanga, Traian Florin Serbanuta
This paper presents a many-sorted polyadic modal logic that generalizes some of the existing approaches. The algebraic semantics has led us to a many-sorted generalization of boole…