default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTim S. Lyon
Person information
- affiliation: TU Dresden, Institute of Artificial Intelligence, Dresden, Germany
- affiliation (PhD 2021): TU Wien, Vienna, Austria
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j6]Thomas Feller, Tim S. Lyon, Piotr Ostropolski-Nalewaja, Sebastian Rudolph:
Decidability of Querying First-Order Theories via Countermodels of Finite Width. Log. Methods Comput. Sci. 21(2) (2025)- [c23]Tim S. Lyon, Ian Shillito
, Alwen Tiu:
Taking Bi-Intuitionistic Logic First-Order: A Proof-Theoretic Investigation via Polytree Sequents. CSL 2025: 41:1-41:23 - [c22]Tim S. Lyon:
Unifying Sequent Systems for Gödel-Löb Provability Logic via Syntactic Transformations. CSL 2025: 42:1-42:23 - [c21]Tim S. Lyon:
On Explicit Solutions to Fixed-Point Equations in Propositional Dynamic Logic. FSEN 2025: 113-119 - 2024
- [j5]Tim S. Lyon, Kees van Berkel:
Proof Theory and Decision Procedures for Deontic STIT Logics. J. Artif. Intell. Res. 81: 837-876 (2024) - [c20]Tim S. Lyon, Jonas Karge:
Constructive Interpolation and Concept-Based Beth Definability for Description Logics via Sequents. IJCAI 2024: 3484-3492 - [c19]Tim S. Lyon, Piotr Ostropolski-Nalewaja:
Decidability of Quasi-Dense Modal Logics. LICS 2024: 60:1-60:8 - [i33]Tim S. Lyon, Kees van Berkel:
Proof Theory and Decision Procedures for Deontic STIT Logics. CoRR abs/2402.03148 (2024) - [i32]Tim S. Lyon, Jonas Karge:
Constructive Interpolation and Concept-Based Beth Definability for Description Logics via Sequents. CoRR abs/2404.15840 (2024) - [i31]Tim S. Lyon, Ian Shillito, Alwen Tiu:
Taking Bi-Intuitionistic Logic First-Order: A Proof-Theoretic Investigation via Polytree Sequents. CoRR abs/2404.15855 (2024) - [i30]Piotr Ostropolski-Nalewaja, Tim S. Lyon:
Decidability of Quasi-Dense Modal Logics. CoRR abs/2405.10094 (2024) - [i29]Tim S. Lyon:
Realizing the Maximal Analytic Display Fragment of Labeled Sequent Calculi for Tense Logics. CoRR abs/2406.19882 (2024) - [i28]Tim S. Lyon:
Unifying Sequent Systems for Gödel-Löb Provability Logic via Syntactic Transformations. CoRR abs/2410.24053 (2024) - [i27]Tim S. Lyon:
On Explicit Solutions to Fixed-Point Equations in Propositional Dynamic Logic. CoRR abs/2412.04012 (2024) - 2023
- [j4]Tim S. Lyon:
Nested sequents for intermediate logics: the case of Gödel-Dummett logics. J. Appl. Non Class. Logics 33(2): 121-164 (2023) - [j3]Kees van Berkel, Tim S. Lyon, Matteo Pascucci:
A Logical Analysis of Instrumentality Judgments: Means-End Relations in the Context of Experience and Expectations. J. Philos. Log. 52(5): 1475-1516 (2023) - [c18]Thomas Feller, Tim S. Lyon, Piotr Ostropolski-Nalewaja, Sebastian Rudolph:
Finite-Cliquewidth Sets of Existential Rules: Toward a General Criterion for Decidable yet Highly Expressive Querying. ICDT 2023: 18:1-18:18 - [c17]Tim S. Lyon, Sebastian Rudolph:
Derivation-Graph-Based Characterizations of Decidable Existential Rule Sets. JELIA 2023: 369-384 - [c16]Nicola Gigante, Lucía Gómez Álvarez, Tim S. Lyon:
Standpoint Linear Temporal Logic. KR 2023: 311-321 - [c15]Tim S. Lyon, Piotr Ostropolski-Nalewaja:
Connecting Proof Theory and Knowledge Representation: Sequent Calculi and the Chase with Existential Rules. KR 2023: 769-773 - [c14]Tim S. Lyon, Eugenio Orlandelli:
Nested Sequents for Quantified Modal Logics. TABLEAUX 2023: 449-467 - [i26]Tim S. Lyon, Piotr Ostropolski-Nalewaja:
Foundations for an Abstract Proof Theory in the Context of Horn Rules. CoRR abs/2304.05697 (2023) - [i25]Thomas Feller, Tim S. Lyon, Piotr Ostropolski-Nalewaja, Sebastian Rudolph:
Decidability of Querying First-Order Theories via Countermodels of Finite Width. CoRR abs/2304.06348 (2023) - [i24]Nicola Gigante, Lucía Gómez Álvarez, Tim S. Lyon:
Standpoint Linear Temporal Logic. CoRR abs/2304.14243 (2023) - [i23]Tim S. Lyon, Piotr Ostropolski-Nalewaja:
Connecting Proof Theory and Knowledge Representation: Sequent Calculi and the Chase with Existential Rules. CoRR abs/2306.02521 (2023) - [i22]Tim S. Lyon:
Nested Sequents for Intermediate Logics: The Case of Gödel-Dummett Logics. CoRR abs/2306.07550 (2023) - [i21]Tim S. Lyon, Eugenio Orlandelli:
Nested Sequents for Quantified Modal Logics. CoRR abs/2307.08032 (2023) - [i20]Tim S. Lyon, Sebastian Rudolph:
Derivation-Graph-Based Characterizations of Decidable Existential Rule Sets. CoRR abs/2307.08481 (2023) - [i19]Tim S. Lyon, Agata Ciabattoni, Didier Galmiche, Marianna Girlando, Dominique Larchey-Wendling, Daniel Méry, Nicola Olivetti, Revantha Ramanayake:
Internal and External Calculi: Ordering the Jungle without Being Lost in Translations. CoRR abs/2312.03426 (2023) - 2022
- [c13]Tim S. Lyon, Jonas Karge:
Uniform and Modular Sequent Systems for Description Logics. Description Logics 2022 - [c12]Tim S. Lyon, Lucía Gómez Álvarez:
Automating Reasoning with Standpoint Logic via Nested Sequents. KR 2022 - [i18]Tim S. Lyon, Lucía Gómez Álvarez:
Automating Reasoning with Standpoint Logic via Nested Sequents. CoRR abs/2205.02749 (2022) - [i17]Tim S. Lyon, Jonas Karge:
Uniform and Modular Sequent Systems for Description Logics. CoRR abs/2206.09020 (2022) - [i16]Kees van Berkel, Tim S. Lyon, Matteo Pascucci:
A logical analysis of instrumentality judgments: means-end relations in the context of experience and expectations. CoRR abs/2209.02287 (2022) - [i15]Thomas Feller, Tim S. Lyon, Piotr Ostropolski-Nalewaja, Sebastian Rudolph:
Finite-Cliquewidth Sets of Existential Rules: Toward a General Criterion for Decidable yet Highly Expressive Querying. CoRR abs/2209.02464 (2022) - [i14]Tim S. Lyon:
Nested Sequents for First-Order Modal Logics via Reachability Rules. CoRR abs/2210.00789 (2022) - [i13]Tim S. Lyon:
Nested Sequents for Intuitionistic Grammar Logics via Structural Refinement. CoRR abs/2210.17139 (2022) - 2021
- [j2]Tim S. Lyon:
On the correspondence between nested calculi and semantic systems for intuitionistic logics. J. Log. Comput. 31(1): 213-265 (2021) - [j1]Agata Ciabattoni, Tim S. Lyon, Revantha Ramanayake, Alwen Tiu:
Display to Labeled Proofs and Back Again for Tense Logics. ACM Trans. Comput. Log. 22(3): 20:1-20:31 (2021) - [c11]Tim S. Lyon:
A Framework for Intuitionistic Grammar Logics. CLAR 2021: 495-503 - [c10]Kees van Berkel, Tim S. Lyon:
The Varieties of Ought-Implies-Can and Deontic STIT Logic. DEON 2021: 56-76 - [c9]Tim S. Lyon:
Nested Sequents for Intuitionistic Modal Logics via Structural Refinement. TABLEAUX 2021: 409-427 - [i12]Tim S. Lyon:
On the Correspondence between Nested Calculi and Semantic Systems for Intuitionistic Logics. CoRR abs/2104.09215 (2021) - [i11]Tim S. Lyon:
Nested Sequents for Intuitionistic Modal Logics via Structural Refinement. CoRR abs/2107.01998 (2021) - [i10]Tim S. Lyon:
Refining Labelled Systems for Modal and Constructive Logics with Applications. CoRR abs/2107.14487 (2021) - [i9]Tim S. Lyon:
A Framework for Intuitionistic Grammar Logics. CoRR abs/2110.00798 (2021) - 2020
- [c8]Kees van Berkel, Tim S. Lyon, Francesco Olivieri:
A Decidable Multi-agent Logic for Reasoning About Actions, Instruments, and Norms. CLAR 2020: 219-241 - [c7]Tim S. Lyon, Alwen Tiu, Rajeev Goré, Ranald Clouston:
Syntactic Interpolation for Tense Logics and Bi-Intuitionistic Logic via Nested Sequents. CSL 2020: 28:1-28:16 - [c6]Tim S. Lyon:
Syntactic Cut-Elimination for Intuitionistic Fuzzy Logic via Linear Nested Sequents. LFCS 2020: 156-176 - [c5]Tim S. Lyon:
On Deriving Nested Calculi for Intuitionistic Logics from Semantic Systems. LFCS 2020: 177-194
2010 – 2019
- 2019
- [c4]Kees van Berkel, Tim S. Lyon:
Cut-Free Calculi and Relational Semantics for Temporal STIT Logics. JELIA 2019: 803-819 - [c3]Kees van Berkel, Tim S. Lyon:
A Neutral Temporal Deontic STIT Logic. LORI 2019: 340-354 - [c2]Tim S. Lyon, Kees van Berkel:
Automating Agential Reasoning: Proof-Calculi and Syntactic Decidability for STIT Logics. PRIMA 2019: 202-218 - [i8]Kees van Berkel, Tim S. Lyon:
Appendix for: Cut-free Calculi and Relational Semantics for Temporal STIT logics. CoRR abs/1902.06632 (2019) - [i7]Kees van Berkel, Tim S. Lyon:
Cut-free Calculi and Relational Semantics for Temporal STIT Logics. CoRR abs/1904.09899 (2019) - [i6]Kees van Berkel, Tim S. Lyon:
A Neutral Temporal Deontic STIT Logic. CoRR abs/1907.03265 (2019) - [i5]Tim S. Lyon, Kees van Berkel:
Automating Agential Reasoning: Proof-Calculi and Syntactic Decidability for STIT Logics. CoRR abs/1908.11360 (2019) - [i4]Tim S. Lyon, Alwen Tiu, Rajeev Goré, Ranald Clouston:
Syntactic Interpolation for Tense Logics and Bi-Intuitionistic Logic via Nested Sequents. CoRR abs/1910.05215 (2019) - [i3]Tim S. Lyon:
On Deriving Nested Calculi for Intuitionistic Logics from Semantic Systems. CoRR abs/1910.06576 (2019) - [i2]Tim S. Lyon:
Syntactic Cut-Elimination for Intuitionistic Fuzzy Logic via Linear Nested Sequents. CoRR abs/1910.06657 (2019) - [i1]Agata Ciabattoni, Tim S. Lyon, Revantha Ramanayake, Alwen Tiu:
Display to Labelled Proofs and Back Again for Tense Logics. CoRR abs/1911.02289 (2019) - 2018
- [c1]Agata Ciabattoni, Tim S. Lyon, Revantha Ramanayake:
From Display to Labelled Proofs for Tense Logics. LFCS 2018: 120-139
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 2025-07-18 01:44 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:
