17 citations · 27 across the 5 of their papers we have counts for
6 papers · 1 filter
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
We describe the methods and technologies underlying the application Grants4Companies. The application uses a logic-based expert system to display a list of business grants suitable…
Hypersequent calculi for non-normal modal and deontic logics: Countermodels and optimal complexity
Tiziano Dalmonte, Björn Lellmann, Nicola Olivetti +1
We present some hypersequent calculi for all systems of the classical cube and their extensions with axioms , , , and, for every , rule . The calculi are…
Syntactic cut-elimination and backward proof-search for tense logic via linear nested sequents (Extended version)
Rajeev Goré, Björn Lellmann
We give a linear nested sequent calculus for the basic normal tense logic Kt. We show that the calculus enables backwards proof-search, counter-model construction and syntactic cut…
Mīmā\d{m}sā deontic logic: proof theory and applications
Agata Ciabattoni, Elisa Freschi, Francesco A. Genco +1
Starting with the deontic principles in M\=ımā\d{m}sā texts we introduce a new deontic logic. We use general proof-theoretic methods to obtain a cut-free sequent calculus for this…
Modularisation of Sequent Calculi for Normal and Non-normal Modalities
Björn Lellmann, Elaine Pimentel
In this work we explore the connections between (linear) nested sequent calculi and ordinary sequent calculi for normal and non-normal modal logics. By proposing local versions to…
Grafting Hypersequents onto Nested Sequents
Roman Kuznets, Björn Lellmann
We introduce a new Gentzen-style framework of grafted hypersequents that combines the formalism of nested sequents with that of hypersequents. To illustrate the potential of the fr…