1 citations · 2 across the 3 of their papers we have counts for
5 papers · 1 filter
On Explicit Solutions to Fixed-Point Equations in Propositional Dynamic Logic
Tim S. Lyon
Propositional dynamic logic (PDL) is an important modal logic used to specify and reason about the behavior of software. A challenging problem in the context of PDL is solving fixe…
Realizing the Maximal Analytic Display Fragment of Labeled Sequent Calculi for Tense Logics
Tim S. Lyon
We define and study translations between the maximal class of analytic display calculi for tense logics and labeled sequent calculi, thus solving an open problem about the translat…
Decidability of Quasi-Dense Modal Logics
Piotr Ostropolski-Nalewaja, Tim S. Lyon
The decidability of axiomatic extensions of the modal logic K with modal reduction principles, i.e. axioms of the form , has remained a l…
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…
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…