Björn Lellmann

ORCID

Publication Activity (10 Years)

Years Active: 2011-2024
Publications (10 Years): 34

Top Venues

Imperial College London, UK (PHD)

Education History

Imperial College London, UK

PHD

Publications

Björn Lellmann, Philipp Marek, Markus Triska
Grants4Companies: Applying Declarative Methods for Recommending and Reasoning About Business Grants in the Austrian Public Administration (System Description). CoRR (2024)
Björn Lellmann, Philipp Marek, Markus Triska
Grants4Companies: Applying Declarative Methods for Recommending and Reasoning About Business Grants in the Austrian Public Administration (System Description). FLOPS (2024)
Marianna Girlando, Björn Lellmann, Nicola Olivetti, Stefano Pesce, Gian Luca Pozzato
Calculi, countermodel generation and theorem prover for strong logics of counterfactual reasoning. J. Log. Comput. 32 (2) (2022)
Roman Kuznets, Björn Lellmann
Interpolation for intermediate logics via injective nested sequents. J. Log. Comput. 31 (3) (2021)
Gábor Recski, Björn Lellmann, Ádám Kovács, Allan Hanbury
Explainable Rule Extraction via Semantic Graphs. ASAIL/LegalAIIA@ICAIL (2021)
Björn Lellmann
From Input/Output Logics to Conditional Logics via Sequents - with Provers. TABLEAUX (2021)
Björn Lellmann, Francesca Gulisano, Agata Ciabattoni
Mīmāṃsā deontic reasoning using specificity: a proof theoretic approach. Artif. Intell. Law 29 (3) (2021)
Agata Ciabattoni, Björn Lellmann
Sequent Rules for Reasoning and Conflict Resolution in Conditional Norms. DEON (2021)
Tiziano Dalmonte, Björn Lellmann, Nicola Olivetti, Elaine Pimentel
Hypersequent calculi for non-normal modal and deontic logics: countermodels and optimal complexity. J. Log. Comput. 31 (1) (2021)
Tiziano Dalmonte, Björn Lellmann, Nicola Olivetti, Elaine Pimentel
Hypersequent calculi for non-normal modal and deontic logics: Countermodels and optimal complexity. CoRR (2020)
Tiziano Dalmonte, Björn Lellmann, Nicola Olivetti, Elaine Pimentel
Countermodel Construction via Optimal Hypersequent Calculi for Non-normal Modal Logics. LFCS (2020)
Marianna Girlando, Björn Lellmann, Nicola Olivetti, Stefano Pesce, Gian Luca Pozzato
Theorem Proving for Lewis Logics of Counterfactual Reasoning. CILC (2020)
Marianna Girlando, Björn Lellmann, Nicola Olivetti
Nested Sequents for the Logic of Conditional Belief. JELIA (2019)
Rajeev Goré, Björn Lellmann
Syntactic cut-elimination and backward proof-search for tense logic via linear nested sequents (Extended version). CoRR (2019)
Rajeev Goré, Björn Lellmann
Syntactic Cut-Elimination and Backward Proof-Search for Tense Logic via Linear Nested Sequents. TABLEAUX (2019)
Elaine Pimentel, Revantha Ramanayake, Björn Lellmann
Sequentialising Nested Systems. TABLEAUX (2019)
Björn Lellmann
Combining Monotone and Normal Modal Logic in Nested Sequents - with Countermodels. TABLEAUX (2019)
Björn Lellmann, Elaine Pimentel
Modularisation of Sequent Calculi for Normal and Non-normal Modalities. ACM Trans. Comput. Log. 20 (2) (2019)
Roman Kuznets, Björn Lellmann
Interpolation for Intermediate Logics via Hyper- and Linear Nested Sequents. Advances in Modal Logic (2018)
Agata Ciabattoni, Francesca Gulisano, Björn Lellmann
Resolving Conflicting Obligations in M={I}M={A}S={A}: a Sequent-based Approach. DEON (2018)
Agata Ciabattoni, Björn Lellmann, Kees van Berkel
: workshop report. ACM SIGLOG News 5 (4) (2018)
Björn Lellmann, Elaine Pimentel
Modularisation of Sequent Calculi for Normal and Non-normal Modalities. CoRR (2017)
Marianna Girlando, Björn Lellmann, Nicola Olivetti, Gian Luca Pozzato, Quentin Vitalis
VINTE: An Implementation of Internal Calculi for Lewis' Logics of Counterfactual Reasoning. TABLEAUX (2017)
Marianna Girlando, Björn Lellmann, Nicola Olivetti, Gian Luca Pozzato
Hypersequent Calculi for Lewis' Conditional Logics with Uniformity and Reflexivity. TABLEAUX (2017)
Agata Ciabattoni, Elisa Freschi, Francesco A. Genco, Björn Lellmann
Mīmā\d{m}sā deontic logic: proof theory and applications. CoRR (2017)
Björn Lellmann, Carlos Olarte, Elaine Pimentel
A uniform framework for substructural logics with modalities. LPAR (2017)
Björn Lellmann
Hypersequent rules with restricted contexts for propositional modal logics. Theor. Comput. Sci. 656 (2016)
Marianna Girlando, Björn Lellmann, Nicola Olivetti, Gian Luca Pozzato
Standard Sequent Calculi for Lewis' Logics of Counterfactuals. JELIA (2016)
Agata Ciabattoni, Björn Lellmann, Carlos Olarte, Elaine Pimentel
From Cut-free Calculi to Automated Deduction: The Case of Bounded Contraction. LSFA (2016)
Roman Kuznets, Björn Lellmann
Grafting hypersequents onto nested sequents. Log. J. IGPL 24 (3) (2016)
Agata Ciabattoni, Elisa Freschi, Francesco A. Genco, Björn Lellmann
Mīmāṃsā Deontic Logic: Proof Theory and Applications. TABLEAUX (2015)
Björn Lellmann, Elaine Pimentel
Proof Search in Nested Sequent Calculi. LPAR (2015)
Björn Lellmann
Linear Nested Sequents, 2-Sequents and Hypersequents. TABLEAUX (2015)
Roman Kuznets, Björn Lellmann
Grafting Hypersequents onto Nested Sequents. CoRR (2015)
Björn Lellmann
Axioms vs Hypersequent Rules with Context Restrictions: Theory and Applications. IJCAR (2014)
Björn Lellmann, Dirk Pattinson
Correspondence between Modal Hilbert Axioms and Sequent Rules with an Application to S5. TABLEAUX (2013)
Jan Lellmann, Björn Lellmann, Florian Widmann, Christoph Schnörr
Discrete and Continuous Models for Partitioning Problems. Int. J. Comput. Vis. 104 (3) (2013)
Björn Lellmann, Dirk Pattinson
Constructing Cut Free Sequent Systems with Context Restrictions Based on Classical or Intuitionistic Logic. ICLA (2013)
Björn Lellmann, Dirk Pattinson
Sequent Systems for Lewis' Conditional Logics. JELIA (2012)
Björn Lellmann, Dirk Pattinson
Cut Elimination for Shallow Modal Logics. TABLEAUX (2011)
Björn Lellmann
A note on a dichotomy for the classes W[P](C). ICCSW (2011)

Björn Lellmann.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Björn Lellmann