A note on a dichotomy for the classes W[P](C). - Björn Lellmann (ICCSW, 2011)

Cut Elimination for Shallow Modal Logics. - Björn Lellmann; Dirk Pattinson (TABLEAUX, 2011)

Sequent Systems for Lewis' Conditional Logics. - Björn Lellmann; Dirk Pattinson (JELIA, 2012)

Constructing Cut Free Sequent Systems with Context Restrictions Based on Classical or Intuitionistic Logic. - Björn Lellmann; Dirk Pattinson (ICLA, 2013)

Correspondence between Modal Hilbert Axioms and Sequent Rules with an Application to S5. - Björn Lellmann; Dirk Pattinson (TABLEAUX, 2013)

Discrete and Continuous Models for Partitioning Problems. - Jan Lellmann; Björn Lellmann; Florian Widmann; Christoph Schnörr (Int. J. Comput. Vis., 2013)

Sequent calculi with context restrictions and applications to conditional logic. - Björn Lellmann (2013)

Axioms vs Hypersequent Rules with Context Restrictions: Theory and Applications. - Björn Lellmann (IJCAR, 2014)

Proof Search in Nested Sequent Calculi. - Björn Lellmann; Elaine Pimentel (LPAR, 2015)

Mīmāṃsā Deontic Logic: Proof Theory and Applications. - Agata Ciabattoni; Elisa Freschi; Francesco A. Genco; Björn Lellmann (TABLEAUX, 2015)

Linear Nested Sequents, 2-Sequents and Hypersequents. - Björn Lellmann (TABLEAUX, 2015)

Standard Sequent Calculi for Lewis' Logics of Counterfactuals. - Marianna Girlando; Björn Lellmann; Nicola Olivetti; Gian Luca Pozzato (JELIA, 2016)

From Cut-free Calculi to Automated Deduction: The Case of Bounded Contraction. - Agata Ciabattoni; Björn Lellmann; Carlos Olarte; Elaine Pimentel (LSFA, 2016)

Grafting hypersequents onto nested sequents. - Roman Kuznets; Björn Lellmann (Log. J. IGPL, 2016)

Hypersequent rules with restricted contexts for propositional modal logics. - Björn Lellmann (Theor. Comput. Sci., 2016)

A uniform framework for substructural logics with modalities. - Björn Lellmann; Carlos Olarte; Elaine Pimentel (LPAR, 2017)

Hypersequent Calculi for Lewis' Conditional Logics with Uniformity and Reflexivity. - Marianna Girlando; Björn Lellmann; Nicola Olivetti; Gian Luca Pozzato (TABLEAUX, 2017)

VINTE: An Implementation of Internal Calculi for Lewis' Logics of Counterfactual Reasoning. - Marianna Girlando; Björn Lellmann; Nicola Olivetti; Gian Luca Pozzato; Quentin Vitalis (TABLEAUX, 2017)

Mīmā d{m}sā deontic logic: proof theory and applications. - Agata Ciabattoni; Elisa Freschi; Francesco A. Genco; Björn Lellmann (CoRR, 2017)

Interpolation for Intermediate Logics via Hyper- and Linear Nested Sequents. - Roman Kuznets; Björn Lellmann (Advances in Modal Logic, 2018)

Resolving Conflicting Obligations in M={I}M={A}S={A}: a Sequent-based Approach. - Agata Ciabattoni; Francesca Gulisano; Björn Lellmann (DEON, 2018)

Deontic reasoning: from ancient texts to artificial intelligence.: workshop report. - Agata Ciabattoni; Björn Lellmann; Kees van Berkel 002 (ACM SIGLOG News, 2018)

Nested Sequents for the Logic of Conditional Belief. - Marianna Girlando; Björn Lellmann; Nicola Olivetti (JELIA, 2019)

Syntactic Cut-Elimination and Backward Proof-Search for Tense Logic via Linear Nested Sequents. - Rajeev Goré; Björn Lellmann (TABLEAUX, 2019)

Combining Monotone and Normal Modal Logic in Nested Sequents - with Countermodels. - Björn Lellmann (TABLEAUX, 2019)

Sequentialising Nested Systems. - Elaine Pimentel; Revantha Ramanayake; Björn Lellmann (TABLEAUX, 2019)

Syntactic cut-elimination and backward proof-search for tense logic via linear nested sequents (Extended version). - Rajeev Goré; Björn Lellmann (CoRR, 2019)

Modularisation of Sequent Calculi for Normal and Non-normal Modalities. - Björn Lellmann; Elaine Pimentel (ACM Trans. Comput. Log., 2019)

Theorem Proving for Lewis Logics of Counterfactual Reasoning. - Marianna Girlando; Björn Lellmann; Nicola Olivetti; Stefano Pesce; Gian Luca Pozzato (CILC, 2020)

Countermodel Construction via Optimal Hypersequent Calculi for Non-normal Modal Logics. - Tiziano Dalmonte; Björn Lellmann; Nicola Olivetti; Elaine Pimentel (LFCS, 2020)

Sequent Rules for Reasoning and Conflict Resolution in Conditional Norms. - Agata Ciabattoni; Björn Lellmann (DEON, 2021)

Explainable Rule Extraction via Semantic Graphs. - Gábor Recski; Björn Lellmann; Ádám Kovács; Allan Hanbury (ASAIL/LegalAIIA@ICAIL, 2021)

From Input/Output Logics to Conditional Logics via Sequents - with Provers. - Björn Lellmann (TABLEAUX, 2021)

Mīmāṃsā deontic reasoning using specificity: a proof theoretic approach. - Björn Lellmann; Francesca Gulisano; Agata Ciabattoni (Artif. Intell. Law, 2021)

Hypersequent calculi for non-normal modal and deontic logics: countermodels and optimal complexity. - Tiziano Dalmonte; Björn Lellmann; Nicola Olivetti; Elaine Pimentel (J. Log. Comput., 2021)

Interpolation for intermediate logics via injective nested sequents. - Roman Kuznets; Björn Lellmann (J. Log. Comput., 2021)

Calculi, countermodel generation and theorem prover for strong logics of counterfactual reasoning. - Marianna Girlando; Björn Lellmann; Nicola Olivetti; Stefano Pesce; Gian Luca Pozzato (J. Log. Comput., 2022)

Grants4Companies: The Common Lisp PoC. - Philipp Marek; Björn Lellmann; Markus Triska (ELS, 2024)

Grants4Companies: Applying Declarative Methods for Recommending and Reasoning About Business Grants in the Austrian Public Administration (System Description). - Björn Lellmann; Philipp Marek; Markus Triska (FLOPS, 2024)

BRISE-plandok: a German legal corpus of building regulations. - Gábor Recski; Eszter Iklódi; Björn Lellmann; Ádám Kovács; Allan Hanbury (Lang. Resour. Evaluation, 2025)