activity
20192026
most citedOn the Correspondence between Nested Calculi and Semantic Systems for Intuitionistic Logics

12 citations · 68 across the 25 of their papers we have counts for

collaborators
Showing 2023Show all

7 papers · 1 filter

cs.LO2023★ 1 cited

Derivation-Graph-Based Characterizations of Decidable Existential Rule Sets

Tim S. Lyon, Sebastian Rudolph

This paper establishes alternative characterizations of very expressive classes of existential rule sets with decidable query entailment. We consider the notable class of greedy bo…

math.LO2023

Nested Sequents for Quantified Modal Logics

Tim S. Lyon, Eugenio Orlandelli

This paper studies nested sequents for quantified modal logics. In particular, it considers extensions of the propositional modal logics definable by the axioms D, T, B, 4, and 5 w…

cs.LO2023★ 1 cited

Connecting Proof Theory and Knowledge Representation: Sequent Calculi and the Chase with Existential Rules

Tim S. Lyon, Piotr Ostropolski-Nalewaja

Chase algorithms are indispensable in the domain of knowledge base querying, which enable the extraction of implicit knowledge from a given database via applications of rules from…

cs.LO2023

Nested Sequents for Intermediate Logics: The Case of Gödel-Dummett Logics

Tim S. Lyon

We present nested sequent systems for propositional Gödel-Dummett logic and its first-order extensions with non-constant and constant domains, built atop nested calculi for intuiti…

cs.AI2023

Standpoint Linear Temporal Logic

Nicola Gigante, Lucia {Gomez Alvarez}, Tim S. Lyon

Many complex scenarios require the coordination of agents possessing unique points of view and distinct semantic commitments. In response, standpoint logic (SL) was introduced in t…

cs.LO2023

Decidability of Querying First-Order Theories via Countermodels of Finite Width

Thomas Feller, Tim S. Lyon, Piotr Ostropolski-Nalewaja +1

We propose a generic framework for establishing the decidability of a wide range of logical entailment problems (briefly called querying), based on the existence of countermodels t…

cs.LO2023★ 1 cited

Foundations for an Abstract Proof Theory in the Context of Horn Rules

Tim S. Lyon, Piotr Ostropolski-Nalewaja

We introduce a novel, logic-independent framework for the study of sequent-style proof systems, which covers a number of proof-theoretic formalisms and concrete proof systems that…