Alessandra Palmigiano
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Alessandra Palmigiano has a total of 70 co-authors. Here are the top co-authors by number of shared publications:
- Giuseppe Greco
School of Business and Economics Vrije Universiteit Amsterdam The Netherlands
25 shared publications - Willem Conradie
University of the Witwatersrand
20 shared publications - Mattia Panettiere
Vrije Universiteit Amsterdam
8 shared publications - Andrea De Domenico
Vrije Universiteit Amsterdam
7 shared publications - Apostolos Tzimoulis
University of Luxembourg
7 shared publications Sabine Frittella
7 shared publications
Latest Publications
- Open Access
- 22 August 2025
- Published by Springer Nature in Synthese
- Vol. 206 (3) , 1-31
Obligations and permissions on selfextensional logics
We further develop the abstract algebraic logic approach to input/output logic initiated in (De Domenico, International Workshop on Logic, Language, Information, and Computation 326–343, 2022), where the family of selfextensional logics was proposed as a general background environment for input/output logics. In this paper, we introduce and discuss the generalizations of several types of permission (negative, dual negative, static, dynamic), as well as their interactions with normative systems, to various families of selfextensional logics, thereby proposing a systematic approach to the definition of normative and permission systems on nonclassical propositional bases.
- 22 August 2025
- Published by Springer Nature in Synthese
- Vol. 206 (3) , 1-31
Open AccessObligations and permissions on selfextensional logics
We further develop the abstract algebraic logic approach to input/output logic initiated in (De Domenico, International Workshop on Logic, Language, Information, and Computation 326–343, 2022), where the family of selfextensional logics was proposed as a general background environment for input/output logics. In this paper, we introduce and discuss the generalizations of several types of permission (negative, dual negative, static, dynamic), as well as their interactions with normative systems, to various families of selfextensional logics, thereby proposing a systematic approach to the definition of normative and permission systems on nonclassical propositional bases.
- 25 July 2024
- Published by Springer Nature
- p. 67-89
Description Logic for Rough Concepts
- Open Access
- 16 April 2024
- Published by Taylor & Francis in Journal of Applied Non-Classical Logics
- Vol. 34 (2-3) , 174-222
Modal reduction principles: a parametric shift to graphs
- 16 April 2024
- Published by Taylor & Francis in Journal of Applied Non-Classical Logics
- Vol. 34 (2-3) , 174-222
Open AccessModal reduction principles: a parametric shift to graphs
- Open Access
Labelled calculi for the logics of rough concepts
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 formulas of the first order language of enriched formal contexts, i.e., relational structures based on formal contexts which provide complete semantics for these logics. We also extend these calculi to provide a proof system for the logic of rough formal contexts.
Open AccessLabelled calculi for the logics of rough concepts
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 formulas of the first order language of enriched formal contexts, i.e., relational structures based on formal contexts which provide complete semantics for these logics. We also extend these calculi to provide a proof system for the logic of rough formal contexts.
- Open Access
Labelled calculi for lattice-based modal logics
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 language which is interpreted on the canonical extensions of the algebras in the variety corresponding to the logic L. Modular proofs are presented that these calculi are all sound, complete and conservative w.r.t. L, and enjoy cut elimination and the subformula property. The introduction of these calculi showcases a general methodology for introducing labelled calculi for the class of LE-logics and their analytic axiomatic extensions in a principled and uniform way.
Open AccessLabelled calculi for lattice-based modal logics
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 language which is interpreted on the canonical extensions of the algebras in the variety corresponding to the logic L. Modular proofs are presented that these calculi are all sound, complete and conservative w.r.t. L, and enjoy cut elimination and the subformula property. The introduction of these calculi showcases a general methodology for introducing labelled calculi for the class of LE-logics and their analytic axiomatic extensions in a principled and uniform way.
- Open Access
- 17 January 2024
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Computational Logic
- Vol. 25 (1) , 1-37
Algebraic Proof Theory for LE-logics
In this article, we extend the research programme in algebraic proof theory from axiomatic extensions of the full Lambek calculus to logics algebraically captured by certain varieties of normal lattice expansions (normal LE-logics). Specifically, we generalize the residuated frames in Reference [ 34 ] to arbitrary signatures of normal lattice expansions (LE). Such a generalization provides a valuable tool for proving important properties of LE-logics in full uniformity. We prove semantic cut elimination for the display calculi \(\mathrm{D.LE}\) associated with the basic normal LE-logics and their axiomatic extensions with analytic inductive axioms. We also prove the finite model property (FMP) for each such calculus \(\mathrm{D.LE}\) , as well as for its extensions with analytic structural rules satisfying certain additional properties.- 17 January 2024
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Computational Logic
- Vol. 25 (1) , 1-37
Open AccessAlgebraic Proof Theory for LE-logics
In this article, we extend the research programme in algebraic proof theory from axiomatic extensions of the full Lambek calculus to logics algebraically captured by certain varieties of normal lattice expansions (normal LE-logics). Specifically, we generalize the residuated frames in Reference [ 34 ] to arbitrary signatures of normal lattice expansions (LE). Such a generalization provides a valuable tool for proving important properties of LE-logics in full uniformity. We prove semantic cut elimination for the display calculi \(\mathrm{D.LE}\) associated with the basic normal LE-logics and their axiomatic extensions with analytic inductive axioms. We also prove the finite model property (FMP) for each such calculus \(\mathrm{D.LE}\) , as well as for its extensions with analytic structural rules satisfying certain additional properties. - Open Access
- 14 September 2023
- Published by Springer Nature
- p. 49-69
Non-distributive Description Logic
We define LE- $$\mathcal {ALC}$$ , a generalization of the description logic $$\mathcal {ALC}$$ based on the propositional logic of general (i.e. not necessarily distributive) lattices, and semantically interpreted on relational structures based on formal contexts from Formal Concept Analysis (FCA). The description logic LE- $$\mathcal {ALC}$$ allows us to formally describe databases with objects, features, and formal concepts, represented according to FCA as Galois-stable sets of objects and features. We describe ABoxes and TBoxes in LE- $$\mathcal {ALC}$$ , provide a tableaux algorithm for checking the consistency of LE- $$\mathcal {ALC}$$ knowledge bases with acyclic TBoxes, and show its termination, soundness and completeness. Interestingly, consistency checking for LE- $$\mathcal {ALC}$$ with acyclic TBoxes is in PTIME, while the complexity of the consistency checking of classical $$\mathcal {ALC}$$ with acyclic TBoxes is PSPACE-complete.- 14 September 2023
- Published by Springer Nature
- p. 49-69
Open AccessNon-distributive Description Logic
We define LE- $$\mathcal {ALC}$$ , a generalization of the description logic $$\mathcal {ALC}$$ based on the propositional logic of general (i.e. not necessarily distributive) lattices, and semantically interpreted on relational structures based on formal contexts from Formal Concept Analysis (FCA). The description logic LE- $$\mathcal {ALC}$$ allows us to formally describe databases with objects, features, and formal concepts, represented according to FCA as Galois-stable sets of objects and features. We describe ABoxes and TBoxes in LE- $$\mathcal {ALC}$$ , provide a tableaux algorithm for checking the consistency of LE- $$\mathcal {ALC}$$ knowledge bases with acyclic TBoxes, and show its termination, soundness and completeness. Interestingly, consistency checking for LE- $$\mathcal {ALC}$$ with acyclic TBoxes is in PTIME, while the complexity of the consistency checking of classical $$\mathcal {ALC}$$ with acyclic TBoxes is PSPACE-complete. - Open Access
- 7 August 2023
- Published by Open Publishing Association in Electronic Proceedings in Theoretical Computer Science
- Vol. 381, 2-3
Multi-type Calculi and Structural Control
- 7 August 2023
- Published by Open Publishing Association in Electronic Proceedings in Theoretical Computer Science
- Vol. 381, 2-3
Open AccessMulti-type Calculi and Structural Control
- 22 February 2023
- Published by Springer Nature
- p. 172-188
Labelled Calculi for the Logics of Rough Concepts
- 22 February 2023
- Published by Springer Nature
- p. 172-188
Labelled Calculi for the Logics of Rough Concepts