activity
20162026
most citedRough concepts

26 citations · 131 across the 26 of their papers we have counts for

collaborators

29 papers

math.CT2026

Canonical Extensions of Quantale-Enriched Categories

Alexander Kurz, Apostolos Tzimoulis

Drawing on well-known results from the theory of canonical extensions and the theory of categories enriched over a quantale, we define canonical extensions of quantale-enriched cat…

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…

math.LO2026

Modular constructive Lyndon interpolation for nondistributive logics

Andrea De Domenico, Giuseppe Greco, Alessandra Palmigiano +1

We establish the Lyndon interpolation property for basic lattice expansion logics (LE-logics) in arbitrary signatures using display calculi. Our approach is constructive, yielding…

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

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

Game semantics for lattice-based modal μ-calculus

Yiwen Ding, Krishna Manoorkar, Mattia Panettiere +2

In this paper, we generalize modal -calculus to the non-distributive (lattice-based) modal -calculus and formalize some scenarios regarding categorization using it. We also p…

cs.AI2023★ 4 cited

Causal Kripke Models

Yiwen Ding, Krishna Manoorkar, Apostolos Tzimoulis +2

This work extends Halpern and Pearl's causal models for actual causality to a possible world semantics environment. Using this framework we introduce a logic of actual causality wi…

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

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★ 2 cited

Neighbourhood semantics for graded modal logic

Jinsheng Chen, Hans van Ditmarsch, Giuseppe Greco +1

We introduce a class of neighbourhood frames for graded modal logic embedding Kripke frames into neighbourhood frames. This class of neighbourhood frames is shown to be first-order…

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★ 2 cited

Lambek-Grishin Calculus: Focusing, Display and Full Polarization

Giuseppe Greco, Valentin D. Richard, Michael Moortgat +1

\emph{Focused sequent calculi} are a refinement of sequent calculi, where additional side-conditions on the applicability of inference rules force the implementation of a proof sea…

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

math.LO2019★ 2 cited

The logic of vague categories

Willem Conradie, Alessandra Palmigiano, Claudette Robinson +2

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

cs.AI2019★ 25 cited

Toward a Dempster-Shafer theory of concepts

Sabine Frittella, Krishna Manoorkar, Alessandra Palmigiano +2

In this paper, we generalize the basic notions and results of Dempster-Shafer theory from predicates to formal concepts. Results include the representation of conceptual belief fun…

cs.LO2019★ 26 cited

Rough concepts

Willem Conradie, Sabine Frittella, Krishna Manoorkar +4

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

math.LO2019★ 12 cited

Non normal logics: semantic analysis and proof theory

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, conserva…

math.LO2018

Logics for Rough Concept Analysis

Giuseppe Greco, Peter Jipsen, Krishna Manoorkar +2

Taking an algebraic perspective on the basic structures of Rough Concept Analysis as the starting point, in this paper we introduce some varieties of lattices expanded with normal…

math.LO2018★ 9 cited

Goldblatt-Thomason for LE-logics

Willem Conradie, Alessandra Palmigiano, Apostolos Tzimoulis

We prove a uniform version of the Goldblatt-Thomason theorem for logics algebraically captured by normal lattice expansions (normal LE-logics).