Björn Lellmann

Orcid: 0000-0002-5335-1838

Affiliations:
  • Austrian Federal Ministry of Finance, Austria
  • TU Wien, Vienna, Autria
  • Imperial College London, UK


According to our database1, Björn Lellmann authored at least 38 papers between 2011 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Grants4Companies: Applying Declarative Methods for Recommending and Reasoning About Business Grants in the Austrian Public Administration (System Description).
Proceedings of the Functional and Logic Programming - 17th International Symposium, 2024

2022
Calculi, countermodel generation and theorem prover for strong logics of counterfactual reasoning.
J. Log. Comput., 2022

2021
Interpolation for intermediate logics via injective nested sequents.
J. Log. Comput., 2021

Hypersequent calculi for non-normal modal and deontic logics: countermodels and optimal complexity.
J. Log. Comput., 2021

Mīmāṃsā deontic reasoning using specificity: a proof theoretic approach.
Artif. Intell. Law, 2021

From Input/Output Logics to Conditional Logics via Sequents - with Provers.
Proceedings of the Automated Reasoning with Analytic Tableaux and Related Methods, 2021

Explainable Rule Extraction via Semantic Graphs.
Proceedings of the Joint Proceedings of the Workshops on Automated Semantic Analysis of Information in Legal Text (ASAIL 2021) & AI and Intelligent Assistance for Legal Professionals in the Digital Workplace (LegalAIIA 2021) held online in conjunction with 18th International Conference on Artificial Intelligence and Law (ICAIL 2021), 2021

Sequent Rules for Reasoning and Conflict Resolution in Conditional Norms.
Proceedings of the Deontic Logic and Normative Systems - 15th International Conference, 2021

2020
Countermodel Construction via Optimal Hypersequent Calculi for Non-normal Modal Logics.
Proceedings of the Logical Foundations of Computer Science - International Symposium, 2020

Theorem Proving for Lewis Logics of Counterfactual Reasoning.
Proceedings of the 35th Italian Conference on Computational Logic, 2020

2019
Modularisation of Sequent Calculi for Normal and Non-normal Modalities.
ACM Trans. Comput. Log., 2019

Syntactic cut-elimination and backward proof-search for tense logic via linear nested sequents (Extended version).
CoRR, 2019

Sequentialising Nested Systems.
Proceedings of the Automated Reasoning with Analytic Tableaux and Related Methods, 2019

Combining Monotone and Normal Modal Logic in Nested Sequents - with Countermodels.
Proceedings of the Automated Reasoning with Analytic Tableaux and Related Methods, 2019

Syntactic Cut-Elimination and Backward Proof-Search for Tense Logic via Linear Nested Sequents.
Proceedings of the Automated Reasoning with Analytic Tableaux and Related Methods, 2019

Nested Sequents for the Logic of Conditional Belief.
Proceedings of the Logics in Artificial Intelligence - 16th European Conference, 2019

2018
<i>Deontic reasoning: from ancient texts to artificial intelligence.</i>: workshop report.
ACM SIGLOG News, 2018

Resolving Conflicting Obligations in M={I}M={A}S={A}: a Sequent-based Approach.
Proceedings of the Deontic Logic and Normative Systems - 14th International Conference, 2018

Interpolation for Intermediate Logics via Hyper- and Linear Nested Sequents.
Proceedings of the Advances in Modal Logic 12, 2018

2017
Mīmā\d{m}sā deontic logic: proof theory and applications.
CoRR, 2017

VINTE: An Implementation of Internal Calculi for Lewis' Logics of Counterfactual Reasoning.
Proceedings of the Automated Reasoning with Analytic Tableaux and Related Methods, 2017

Hypersequent Calculi for Lewis' Conditional Logics with Uniformity and Reflexivity.
Proceedings of the Automated Reasoning with Analytic Tableaux and Related Methods, 2017

A uniform framework for substructural logics with modalities.
Proceedings of the LPAR-21, 2017

2016
Hypersequent rules with restricted contexts for propositional modal logics.
Theor. Comput. Sci., 2016

Grafting hypersequents onto nested sequents.
Log. J. IGPL, 2016

From Cut-free Calculi to Automated Deduction: The Case of Bounded Contraction.
Proceedings of the 11th Workshop on Logical and Semantic Frameworks with Applications, 2016

Standard Sequent Calculi for Lewis' Logics of Counterfactuals.
Proceedings of the Logics in Artificial Intelligence - 15th European Conference, 2016

2015
Linear Nested Sequents, 2-Sequents and Hypersequents.
Proceedings of the Automated Reasoning with Analytic Tableaux and Related Methods, 2015

Mīmāṃsā Deontic Logic: Proof Theory and Applications.
Proceedings of the Automated Reasoning with Analytic Tableaux and Related Methods, 2015

Proof Search in Nested Sequent Calculi.
Proceedings of the Logic for Programming, Artificial Intelligence, and Reasoning, 2015

2014
Axioms vs Hypersequent Rules with Context Restrictions: Theory and Applications.
Proceedings of the Automated Reasoning - 7th International Joint Conference, 2014

2013
Sequent calculi with context restrictions and applications to conditional logic.
PhD thesis, 2013

Discrete and Continuous Models for Partitioning Problems.
Int. J. Comput. Vis., 2013

Correspondence between Modal Hilbert Axioms and Sequent Rules with an Application to S5.
Proceedings of the Automated Reasoning with Analytic Tableaux and Related Methods, 2013

Constructing Cut Free Sequent Systems with Context Restrictions Based on Classical or Intuitionistic Logic.
Proceedings of the Logic and Its Applications, 5th Indian Conference, 2013

2012
Sequent Systems for Lewis' Conditional Logics.
Proceedings of the Logics in Artificial Intelligence - 13th European Conference, 2012

2011
Cut Elimination for Shallow Modal Logics.
Proceedings of the Automated Reasoning with Analytic Tableaux and Related Methods, 2011

A note on a dichotomy for the classes W[P](C).
Proceedings of the 2011 Imperial College Computing Student Workshop, 2011


  Loading...