Björn Lellmann
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
Research Interests
Björn Lellmann has a total of 28 co-authors. Here are the top co-authors by number of shared publications:
- Agata Ciabattoni
TU Wien
5 shared publications Dirk Pattinson
Imperial College London
4 shared publications- Elaine Pimentel
Department of Computer Science, University College London, London, UK
4 shared publications - Nicola Olivetti
Aix-Marseille University CNRS LIS Marseille France
4 shared publications - Marianna Girlando
University of Amsterdam
3 shared publications - Francesco A. Genco
Vienna University of Technology
2 shared publications
Latest Publications
- 26 January 2022
- Published by Oxford University Press (OUP) in Journal of Logic and Computation
- Vol. 32 (2) , 233-280
Calculi, countermodel generation and theorem prover for strong logics of counterfactual reasoning
We present hypersequent calculi for the strongest logics in Lewis’ family of conditional systems, characterized by uniformity and total reflexivity. We first present a non-standard hypersequent calculus, which allows a syntactic proof of cut elimination. We then introduce standard hypersequent calculi, in which sequents are enriched by additional structures to encode plausibility formulas and diamond formulas. Proof search using these calculi is terminating, and the completeness proof shows how a countermodel can be constructed from a branch of a failed proof search. We then describe tuCLEVER, a theorem prover that implements the standard hypersequent calculi. The prover provides a decision procedure for the logics, and it produces a countermodel in case of proof search failure. The prover tuCLEVER is inspired by the methodology of leanTAP and it is implemented in Prolog. Preliminary experimental results show that the performances of tuCLEVER are promising.1
- 26 January 2022
- Published by Oxford University Press (OUP) in Journal of Logic and Computation
- Vol. 32 (2) , 233-280
Calculi, countermodel generation and theorem prover for strong logics of counterfactual reasoning
We present hypersequent calculi for the strongest logics in Lewis’ family of conditional systems, characterized by uniformity and total reflexivity. We first present a non-standard hypersequent calculus, which allows a syntactic proof of cut elimination. We then introduce standard hypersequent calculi, in which sequents are enriched by additional structures to encode plausibility formulas and diamond formulas. Proof search using these calculi is terminating, and the completeness proof shows how a countermodel can be constructed from a branch of a failed proof search. We then describe tuCLEVER, a theorem prover that implements the standard hypersequent calculi. The prover provides a decision procedure for the logics, and it produces a countermodel in case of proof search failure. The prover tuCLEVER is inspired by the methodology of leanTAP and it is implemented in Prolog. Preliminary experimental results show that the performances of tuCLEVER are promising.1
- 30 August 2021
- Published by Springer Nature
- p. 147-164
From Input/Output Logics to Conditional Logics via Sequents – with Provers
- 30 August 2021
- Published by Springer Nature
- p. 147-164
From Input/Output Logics to Conditional Logics via Sequents – with Provers
- 16 April 2021
- Published by Oxford University Press (OUP) in Journal of Logic and Computation
- Vol. 31 (3) , 797-831
Interpolation for intermediate logics via injective nested sequents
We introduce a novel, semantically inspired method of constructing nested sequent calculi for propositional intermediate logics. Applying recently developed methods for proving Craig interpolation to these nested sequent calculi, we obtain constructive proofs of the interpolation property for most non-trivial interpolable intermediate logics, as well as Lyndon interpolation for Gödel logic. Finally, we provide a prototype implementation combining proof search and countermodel construction.
- 16 April 2021
- Published by Oxford University Press (OUP) in Journal of Logic and Computation
- Vol. 31 (3) , 797-831
Interpolation for intermediate logics via injective nested sequents
We introduce a novel, semantically inspired method of constructing nested sequent calculi for propositional intermediate logics. Applying recently developed methods for proving Craig interpolation to these nested sequent calculi, we obtain constructive proofs of the interpolation property for most non-trivial interpolable intermediate logics, as well as Lyndon interpolation for Gödel logic. Finally, we provide a prototype implementation combining proof search and countermodel construction.
- Open Access
- 9 November 2020
- Published by Springer Nature in Artificial Intelligence and Law
- Vol. 29 (3) , 351-394
Mīmāṃsā deontic reasoning using specificity: a proof theoretic approach
Over the course of more than two millennia the philosophical school of Mīmāṃsā has thoroughly analyzed normative statements. In this paper we approach a formalization of the deontic system which is applied but never explicitly discussed in Mīmāṃsā to resolve conflicts between deontic statements by giving preference to the more specific ones. We first extend with prohibitions and recommendations the non-normal deontic logic extracted in Ciabattoni et al. (in: TABLEAUX 2015, volume 9323 of LNCS, Springer, 2015) from Mīmāṃsā texts, obtaining a multimodal dyadic version of the deontic logic $$\mathsf {MD}$$ . Sequent calculus is then used to close a set of prima-facie injunctions under a restricted form of monotonicity, using specificity to avoid conflicts. We establish decidability and complexity results, and investigate the potential use of the resulting system for Mīmāṃsā philosophy and, more generally, for the formal interpretation of normative statements.- 9 November 2020
- Published by Springer Nature in Artificial Intelligence and Law
- Vol. 29 (3) , 351-394
Open AccessMīmāṃsā deontic reasoning using specificity: a proof theoretic approach
Over the course of more than two millennia the philosophical school of Mīmāṃsā has thoroughly analyzed normative statements. In this paper we approach a formalization of the deontic system which is applied but never explicitly discussed in Mīmāṃsā to resolve conflicts between deontic statements by giving preference to the more specific ones. We first extend with prohibitions and recommendations the non-normal deontic logic extracted in Ciabattoni et al. (in: TABLEAUX 2015, volume 9323 of LNCS, Springer, 2015) from Mīmāṃsā texts, obtaining a multimodal dyadic version of the deontic logic $$\mathsf {MD}$$ . Sequent calculus is then used to close a set of prima-facie injunctions under a restricted form of monotonicity, using specificity to avoid conflicts. We establish decidability and complexity results, and investigate the potential use of the resulting system for Mīmāṃsā philosophy and, more generally, for the formal interpretation of normative statements. - 20 December 2019
- Published by Springer Nature
- p. 27-46
Countermodel Construction via Optimal Hypersequent Calculi for Non-normal Modal Logics
- 20 December 2019
- Published by Springer Nature
- p. 27-46
Countermodel Construction via Optimal Hypersequent Calculi for Non-normal Modal Logics
- 14 August 2019
- Published by Springer Nature
- p. 185-202
Syntactic Cut-Elimination and Backward Proof-Search for Tense Logic via Linear Nested Sequents
- 14 August 2019
- Published by Springer Nature
- p. 185-202
Syntactic Cut-Elimination and Backward Proof-Search for Tense Logic via Linear Nested Sequents
- 14 August 2019
- Published by Springer Nature
- p. 203-220
Combining Monotone and Normal Modal Logic in Nested Sequents – with Countermodels
- 14 August 2019
- Published by Springer Nature
- p. 203-220
Combining Monotone and Normal Modal Logic in Nested Sequents – with Countermodels