default search action
Björn Lellmann
Person information
- affiliation: Austrian Federal Ministry of Finance, Austria
- affiliation: TU Wien, Vienna, Autria
- affiliation: Imperial College London, UK
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c27]Philipp Marek, Björn Lellmann, Markus Triska:
Grants4Companies: The Common Lisp PoC. ELS 2024: 12-17 - [c26]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: 151-164 - [i6]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 abs/2406.15293 (2024) - 2022
- [j9]Marianna Girlando, Björn Lellmann
Calculi, countermodel generation and theorem prover for strong logics of counterfactual reasoning. J. Log. Comput. 32(2): 233-280 (2022) - 2021
- [j8]Björn Lellmann
Mīmāṃsā deontic reasoning using specificity: a proof theoretic approach. Artif. Intell. Law 29(3): 351-394 (2021) - [j7]Tiziano Dalmonte, Björn Lellmann
Hypersequent calculi for non-normal modal and deontic logics: countermodels and optimal complexity. J. Log. Comput. 31(1): 67-111 (2021) - [j6]Roman Kuznets
Interpolation for intermediate logics via injective nested sequents. J. Log. Comput. 31(3): 797-831 (2021) - [c25]Agata Ciabattoni, Björn Lellmann:
Sequent Rules for Reasoning and Conflict Resolution in Conditional Norms. DEON 2021: 94-113 - [c24]Gábor Recski
Explainable Rule Extraction via Semantic Graphs. ASAIL/LegalAIIA@ICAIL 2021: 24-35 - [c23]Björn Lellmann
From Input/Output Logics to Conditional Logics via Sequents - with Provers. TABLEAUX 2021: 147-164 - 2020
- [c22]Marianna Girlando, Björn Lellmann, Nicola Olivetti, Stefano Pesce, Gian Luca Pozzato:
Theorem Proving for Lewis Logics of Counterfactual Reasoning. CILC 2020: 199-213 - [c21]Tiziano Dalmonte
Countermodel Construction via Optimal Hypersequent Calculi for Non-normal Modal Logics. LFCS 2020: 27-46 - [i5]Tiziano Dalmonte, Björn Lellmann, Nicola Olivetti, Elaine Pimentel:
Hypersequent calculi for non-normal modal and deontic logics: Countermodels and optimal complexity. CoRR abs/2006.05436 (2020)
2010 – 2019
- 2019
- [j5]Björn Lellmann
Modularisation of Sequent Calculi for Normal and Non-normal Modalities. ACM Trans. Comput. Log. 20(2): 7:1-7:46 (2019) - [c20]Marianna Girlando
Nested Sequents for the Logic of Conditional Belief. JELIA 2019: 709-725 - [c19]Elaine Pimentel
Sequentialising Nested Systems. TABLEAUX 2019: 147-165 - [c18]Rajeev Goré, Björn Lellmann
Syntactic Cut-Elimination and Backward Proof-Search for Tense Logic via Linear Nested Sequents. TABLEAUX 2019: 185-202 - [c17]Björn Lellmann
Combining Monotone and Normal Modal Logic in Nested Sequents - with Countermodels. TABLEAUX 2019: 203-220 - [i4]Rajeev Goré, Björn Lellmann:
Syntactic cut-elimination and backward proof-search for tense logic via linear nested sequents (Extended version). CoRR abs/1907.01270 (2019) - 2018
- [j4]Agata Ciabattoni
Deontic reasoning: from ancient texts to artificial intelligence.: workshop report. ACM SIGLOG News 5(4): 48-51 (2018) - [c16]Roman Kuznets, Björn Lellmann:
Interpolation for Intermediate Logics via Hyper- and Linear Nested Sequents. Advances in Modal Logic 2018: 473-492 - [c15]Agata Ciabattoni, Francesca Gulisano, Björn Lellmann:
Resolving Conflicting Obligations in M={I}M={A}S={A}: a Sequent-based Approach. DEON 2018: 91-109 - 2017
- [c14]Björn Lellmann, Carlos Olarte, Elaine Pimentel:
A uniform framework for substructural logics with modalities. LPAR 2017: 435-455 - [c13]Marianna Girlando, Björn Lellmann
Hypersequent Calculi for Lewis' Conditional Logics with Uniformity and Reflexivity. TABLEAUX 2017: 131-148 - [c12]Marianna Girlando, Björn Lellmann
VINTE: An Implementation of Internal Calculi for Lewis' Logics of Counterfactual Reasoning. TABLEAUX 2017: 149-159 - [i3]Björn Lellmann, Elaine Pimentel:
Modularisation of Sequent Calculi for Normal and Non-normal Modalities. CoRR abs/1702.08193 (2017) - [i2]Agata Ciabattoni, Elisa Freschi, Francesco A. Genco, Björn Lellmann:
Mīmā\d{m}sā deontic logic: proof theory and applications. CoRR abs/1705.03211 (2017) - 2016
- [j3]Roman Kuznets
Grafting hypersequents onto nested sequents. Log. J. IGPL 24(3): 375-423 (2016) - [j2]Björn Lellmann
Hypersequent rules with restricted contexts for propositional modal logics. Theor. Comput. Sci. 656: 76-105 (2016) - [c11]Marianna Girlando, Björn Lellmann
Standard Sequent Calculi for Lewis' Logics of Counterfactuals. JELIA 2016: 272-287 - [c10]Agata Ciabattoni
From Cut-free Calculi to Automated Deduction: The Case of Bounded Contraction. LSFA 2016: 75-93 - 2015
- [c9]Björn Lellmann
Proof Search in Nested Sequent Calculi. LPAR 2015: 558-574 - [c8]Björn Lellmann
Linear Nested Sequents, 2-Sequents and Hypersequents. TABLEAUX 2015: 135-150 - [c7]Agata Ciabattoni
Mīmāṃsā Deontic Logic: Proof Theory and Applications. TABLEAUX 2015: 323-338 - [i1]Roman Kuznets
Grafting Hypersequents onto Nested Sequents. CoRR abs/1502.00814 (2015) - 2014
- [c6]Björn Lellmann
Axioms vs Hypersequent Rules with Context Restrictions: Theory and Applications. IJCAR 2014: 307-321 - 2013
- [b1]Björn Lellmann:
Sequent calculi with context restrictions and applications to conditional logic. Imperial College London, UK, 2013 - [j1]Jan Lellmann, Björn Lellmann, Florian Widmann, Christoph Schnörr:
Discrete and Continuous Models for Partitioning Problems. Int. J. Comput. Vis. 104(3): 241-269 (2013) - [c5]Björn Lellmann
Constructing Cut Free Sequent Systems with Context Restrictions Based on Classical or Intuitionistic Logic. ICLA 2013: 148-160 - [c4]Björn Lellmann
Correspondence between Modal Hilbert Axioms and Sequent Rules with an Application to S5. TABLEAUX 2013: 219-233 - 2012
- [c3]Björn Lellmann
Sequent Systems for Lewis' Conditional Logics. JELIA 2012: 320-332 - 2011
- [c2]Björn Lellmann:
A note on a dichotomy for the classes W[P](C). ICCSW 2011: 46-51 - [c1]Björn Lellmann
Cut Elimination for Shallow Modal Logics. TABLEAUX 2011: 211-225
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-26 00:58 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: