activity
20102026
most citedMulti-type Display Calculus for Dynamic Epistemic Logic

43 citations · 426 across the 50 of their papers we have counts for

collaborators

62 papers

cs.LO2026

A proof-theoretic approach to abstract interpretation

Vijay D'Silva, Alessandra Palmigiano, Apostolos Tzimoulis +1

This paper develops a proof-theoretic framework for abstract interpretation by systematically associating logical systems with finite abstractions. Building on earlier work on the…

cs.LO2025

Questions as cognitive filters

Willem Conradie, Krishna Manoorkar, Alessandra Palmigiano +2

In this paper, we develop a logico-algebraic framework for modeling decision-making through deliberation in multi-agent settings. The central concept in this framework is that of i…

math.LO2025

Normative implications

Andrea De Domenico, Ali Farjami, Krishna Manoorkar +4

We continue to develop a research line initiated in \cite{wollic22}, studying I/O logic from an algebraic approach based on subordination algebras. We introduce the classes of slan…

cs.LO2024

Correspondence and Inverse Correspondence for Input/Output Logic and Region-Based Theories of Space

Andrea De Domenico, Ali Farjami, Krishna Manoorkar +3

We further develop the algebraic approach to input/output logic initiated in \cite{wollic22}, where subordination algebras and a family of their generalizations were proposed as a…

cs.AI2024

Flexible categorization using formal concept analysis and Dempster-Shafer theory

Marcel Boersma, Krishna Manoorkar, Alessandra Palmigiano +3

The framework developed in the present paper provides a formal ground to generate and study explainable categorizations of sets of entities, based on the epistemic attitudes of ind…

math.LO2024

Unified inverse correspondence for LE-logics

Alessandra Palmigiano, Mattia Panettiere

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 (…

math.LO2024

Modal reduction principles: a parametric shift to graphs

Willem Conradie, Krishna Manoorkar, Alessandra Palmigiano +1

Graph-based frames have been introduced as a logical framework which internalizes an inherent boundary to knowability. They also support the interpretation of lattice-based (modal)…

math.LO2024

Obligations and permissions, algebraically

Andrea De Domenico, Ali Farjami, Krishna Manoorkar +3

We further develop the algebraic approach to input/output logic initiated in \cite{wollic22}, where subordination algebras and a family of their generalizations were proposed as a…

math.LO2024

Obligations and permissions on selfextensional logics

Andrea De Domenico, Ali Farjami, Krishna Manoorkar +3

We further develop the abstract algebraic logic approach to input/output logic initiated in \cite{wollic22}, where the family of selfextensional logics was proposed as a general ba…

math.LO2024

Labelled calculi for the logics of rough concepts

Ineke van der Berg, Andrea De Domenico, Giuseppe Greco +3

We introduce sound and complete labelled sequent calculi for the basic normal non-distributive modal logic L and some of its axiomatic extensions, where the labels are atomic formu…

math.LO2024

Labelled calculi for lattice-based modal logics

Ineke van der Berg, Andrea De Domenico, Giuseppe Greco +3

We introduce labelled sequent calculi for the basic normal non-distributive modal logic L and 31 of its axiomatic extensions, where the labels are atomic formulas of a first order…

math.LO2024★ 1 cited

Generating proof systems for three-valued propositional logics

Vitor Greati, Giuseppe Greco, Sérgio Marcelino +2

In general, providing an axiomatization for an arbitrary logic is a task that may require some ingenuity. In the case of logics defined by a finite logical matrix (three-valued log…

cs.AI2023★ 1 cited

Outlier detection using flexible categorisation and interrogative agendas

Marcel Boersma, Krishna Manoorkar, Alessandra Palmigiano +3

Categorization is one of the basic tasks in machine learning and data analysis. Building on formal concept analysis (FCA), the starting point of the present work is that different…

math.LO2023★ 1 cited

Non-distributive description logic

Ineke van der Berg, Andrea De Domenico, Giuseppe Greco +3

We define LE-ALC, a generalization of the description logic ALC based on the propositional logic of general (i.e. not necessarily distributive) lattices, and semantically interpret…

cs.AI2022★ 2 cited

Flexible categorization for auditing using formal concept analysis and Dempster-Shafer theory

Marcel Boersma, Krishna Manoorkar, Alessandra Palmigiano +3

Categorization of business processes is an important part of auditing. Large amounts of transnational data in auditing can be represented as transactions between financial accounts…

math.LO2022

Subordination Algebras as Semantic Environment of Input/Output Logic

Andrea De Domenico, Ali Farjami, Krishna Manoorkar +3

We establish a novel connection between two research areas in non-classical logics which have been developed independently of each other so far: on the one hand, input/output logic…

math.LO2022

Unified inverse correspondence for DLE-Logics

Willem Conradie, Andrea De Domenico, Giuseppe Greco +3

By exploiting the algebraic and order theoretic mechanisms behind Sahlqvist correspondence, the theory of unified correspondence provides powerful tools for correspondence and cano…

cs.LO2022

Modal reduction principles across relational semantics

Willem Conradie, Andrea De Domenico, Krishna Manoorkar +4

The present paper establishes systematic connections among the first-order correspondents of Sahlqvist modal reduction principles in various relational semantic settings which incl…

math.LO2021

First order logic properly displayed

Samuel Balco, Giuseppe Greco, Alexander Kurz +3

We introduce a proper display calculus for first-order logic, of which we prove soundness, completeness, conservativity, subformula property and cut elimination via a Belnap-style…

cs.LO2021★ 2 cited

Syntactic completeness of proper display calculi

Jinsheng Chen, Giuseppe Greco, Alessandra Palmigiano +1

A recent strand of research in structural proof theory aims at exploring the notion of analytic calculi (i.e. those calculi that support general and modular proof-strategies for cu…

math.LO2020

Non-normal logics: semantic analysis and proof theory (extended version)

Jinsheng Chen, Giuseppe Greco, Alessandra Palmigiano +1

We introduce proper display calculi for basic monotonic modal logic, the conditional logic CK and a number of their axiomatic extensions. These calculi are sound, complete, conserv…

math.LO2020

Slanted canonicity of analytic inductive inequalities

Laurent De Rudder, Alessandra Palmigiano

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 ma…

math.LO2020★ 6 cited

Non-distributive logics: from semantics to meaning

Willem Conradie, Alessandra Palmigiano, Claudette Robinson +1

We discuss an ongoing line of research in the relational (non topological) semantics of non-distributive logics. The developments we consider are technically rooted in dual charact…

math.LO2019★ 9 cited

Modelling socio-political competition

Willem Conradie, Alessandra Palmigiano, Claudette Robinson +2

This paper continues the investigation of the logic of competing theories, be they scientific, social, political etc. We introduce a many-valued, multi-type modal language which we…