activity
20132026
most citedScalar extensions for algebraic structures of Lukasiewicz logic

8 citations · 37 across the 12 of their papers we have counts for

collaborators
Showing cs.LOShow all

6 papers · 1 filter

cs.LO2026

Formalizing a Many-Sorted Hybrid Polyadic Modal Logic in Lean

Andrei-Alexandru Oltean, Alexandru Oltean, Bogdan Macovei +1

We present a Lean formalization of a general hybrid modal logic with many-sorted signatures and polyadic modal operators. The system borrows ideas from both algebraic specification…

cs.LO2025★ 3 cited

Łukasiewicz Logic with Actions for Neural Networks training

Ioana Leuştean, Bogdan Macovei

Based on the already known connection between multilayer perceptrons and Lukasiewicz logic with rational coefficients, we take a step forward in analyzing its training process usin…

cs.LO2021

DELP: Dynamic Epistemic Logic for Security Protocols

Ioana Leustean, Bogdan Macovei

The formal analysis of security protocols is a challenging field, with various approaches being studied nowadays. The famous Burrows-Abadi-Needham Logic was the first logical syste…

cs.LO2019★ 1 cited

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.LO2019

Operational semantics and program verification using many-sorted hybrid modal logic

Ioana Leustean, Natalia Moanga, Traian Florin Serbanuta

We propose a general framework to allow: (a) specifying the operational semantics of a programming language; and (b) stating and proving properties about program correctness. Our f…

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…