The present paper proposes a novel way to unify Rough Set Theory and Formal Concept Analysis. Our method stems from results and insights developed in the algebraic theory of …
The present paper establishes systematic connections among the first-order correspondents of Sahlqvist modal reduction principles in various relational semantic settings, including …
J Chen, G Greco, A Palmigiano… - ACM Transactions on …, 2022 - dl.acm.org
A recent strand of research in structural proof theory aims at exploring the notion of analytic calculi (ie, those calculi that support general and modular proof-strategies for cut …
L De Rudder, A Palmigiano - ACM Transactions on Computational Logic …, 2021 - dl.acm.org
We prove an algebraic canonicity theorem for normal LE-logics of arbitrary signature, in a generalized setting in which the non-lattice connectives are interpreted as operations …
We introduce a complete many-valued semantics for basic normal lattice-based modal logic. This relational semantics is grounded on many-valued formal contexts from Formal Concept …
This paper continues the investigation of the logic of competing theories (be they scientific, social, political etc.) initiated in [4]. We introduce a many-valued, multi-type modal language …
We introduce a complete many-valued semantics for two normal lattice-based modal logics. This semantics is based on reflexive many-valued graphs. We discuss an interpretation and …
Rough concepts have been introduced in in the context of a mathematical framework unifying Rough Set Theory (RST) and Formal Concept Analysis (FCA). Algebraically, the …
We generalize Kracht's theory of internal describability from classical modal logic to the family of all logics canonically associated with varieties of normal lattice expansions (LE …