A Grand Unified Theory of Decidability in Logic-Based Knowledge Representation

Exploring Non-Regular Extensions of Propositional Dynamic Logic with Description-Logics Features

Autori: Bartosz Bednarczyk
Pubblicato in: Logical Methods in Computer Science, Numero Volume 20, Numero 2, 2024, ISSN 1860-5974
Editore: Technischen Universitat Braunschweig
DOI: 10.46298/lmcs-20(2:7)2024

SATPin: Axiom Pinpointing for Lightweight Description Logics Through Incremental SAT

Autori: Norbert Manthey, Rafael Peñaloza, Sebastian Rudolph
Pubblicato in: KI - Künstliche Intelligenz, Numero 34/3, 2020, Pagina/e 389-394, ISSN 0933-1875
Editore: Springer
DOI: 10.1007/s13218-020-00669-4

Nested sequents for intermediate logics: the case of Gödel-Dummett logics

Autori: Tim S. Lyon
Pubblicato in: Journal of Applied Non-Classical Logics, Numero 33, 2023, Pagina/e 121-164, ISSN 1166-3081
Editore: Taylor and Francis
DOI: 10.1080/11663081.2023.2233346

Taking Bi-Intuitionistic Logic First-Order: A Proof-Theoretic Investigation via Polytree Sequents

Autori: Lyon, Tim S.; Shillito, Ian; Tiu, Alwen
Pubblicato in: Leibniz International Proceedings in Informatics (LIPIcs), Numero 23, 2025, Pagina/e 41:1-41:23, ISSN 1868-8969
Editore: Schloss Dagstuhl -- Leibniz-Zentrum fuer Informatik
DOI: 10.48550/arxiv.2404.15855

About the Expressive Power and Complexity of Order-Invariance with Two Variables

Autori: Bartosz Bednarczyk, Julien Grange
Pubblicato in: Logical Methods in Computer Science, Numero Volume 21, Numero 1, 2025, ISSN 1860-5974
Editore: Technischen Universitat Braunschweig
DOI: 10.46298/lmcs-21(1:30)2025

On the Decomposition of Abstract Dialectical Frameworks and the Complexity of Naive-based Semantics

Autori: Sarah Alice Gaggl, Sebastian Rudolph, Hannes Straß
Pubblicato in: Journal of Artificial Intelligence Research, Numero 70, 2021, Pagina/e 1-64, ISSN 1076-9757
Editore: Morgan Kaufmann Publishers, Inc.
DOI: 10.1613/jair.1.11348

The classification of homomorphism homogeneous tournaments

Autori: Thomas Feller, Christian Pech, Maja Pech
Pubblicato in: European Journal of Combinatorics, Numero 89, 2020, Pagina/e 103142, ISSN 0195-6698
Editore: Academic Press
DOI: 10.1016/j.ejc.2020.103142

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

Autori: Thomas Feller, Tim S. Lyon, Piotr Ostropolski-Nalewaja, Sebastian Rudolph
Pubblicato in: Logical Methods in Computer Science, Numero Volume 21, Numero 2, 2025, ISSN 1860-5974
Editore: Technischen Universitat Braunschweig
DOI: 10.46298/lmcs-21(2:7)2025

How to Tell Easy from Hard: Complexities of Conjunctive Query Entailment in Extensions of ALC

Autori: Bartosz Bednarczyk, Sebastian Rudolph
Pubblicato in: Journal of Artificial Intelligence Research, Numero 78, 2023, ISSN 1076-9757
Editore: Morgan Kaufmann Publishers, Inc.
DOI: 10.1613/jair.1.14482

Unifying Sequent Systems for Gödel-Löb Provability Logic via Syntactic Transformations

Autori: Tim S. Lyon
Pubblicato in: Leibniz International Proceedings in Informatics (LIPIcs), Numero Volume 326, 2025, Pagina/e pp. 42:1-42:23, ISSN 1868-8969
Editore: Schloss Dagstuhl - Leibniz Center for Informatics
DOI: 10.4230/lipics.csl.2025.42

Proof Theory and Decision Procedures for Deontic STIT Logics

Autori: Tim S. Lyon, Kees Van Berkel
Pubblicato in: Journal of Artificial Intelligence Research, Numero 81, 2024, Pagina/e 837-876, ISSN 1076-9757
Editore: Morgan Kaufmann Publishers, Inc.
DOI: 10.1613/jair.1.15710

A Logical Analysis of Instrumentality Judgments: Means-End Relations in the Context of Experience and Expectations

Autori: Kees van Berkel, Tim S. Lyon, Matteo Pascucci
Pubblicato in: Journal of Philosophical Logic, Numero 52, 2023, Pagina/e 1475-1516, ISSN 0022-3611
Editore: Kluwer Academic Publishers
DOI: 10.1007/s10992-023-09714-7

Finite-Cliquewidth Sets of Existential Rules – Toward a General Criterion for Decidable yet Highly Expressive Querying

Autori: Thomas Feller, Tim Lyon, Piotr Ostropolski-Nalewaja, Sebastian Rudolph
Pubblicato in: Proceedings of the 26th International Conference on Database Theory (ICDT 2023), volume 255 of Leibniz International Proceedings in Informatics (LIPIcs), 2023, Pagina/e 8:1-18:18
Editore: Leibniz-Zentrum für Informatik GmbH
DOI: 10.4230/lipics.icdt.2023.18

Standpoint Linear Temporal Logic

Autori: Nicola Gigante, Lucía Gómez Álvarez, Tim S. Lyon
Pubblicato in: Proceedings of the Twentieth International Conference on Principles of Knowledge Representation and Reasoning, 2023, Pagina/e 311-321
Editore: International Joint Conferences on Artificial Intelligence Organization
DOI: 10.24963/kr.2023/31

Nested Sequents for First-Order Modal Logics via Reachability Rules

Autori: Lyon, Tim S.
Pubblicato in: Automated Reasoning with Analytic Tableaux and Related Methods, Numero 4, 2023
Editore: Springer
DOI: 10.48550/arxiv.2210.00789

Nested Sequents for Intuitionistic Modal Logics via Structural Refinement

Autori: Tim S. Lyon
Pubblicato in: International Conference on Automated Reasoning with Analytic Tableaux and Related Methods (TABLEAUX 2021), 2021, Pagina/e pp 409-427
Editore: SpringerLink
DOI: 10.1007/978-3-030-86059-2_24

Datalog-Expressibility for Monadic and Guarded Second-Order Logic

Autori: Manuel Bodirsky, Simon Knäuer, Sebastian Rudolph
Pubblicato in: LIPIcs–Leibniz International Proceedings in Informatics, 2021, Pagina/e 20:1–120:17
Editore: Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
DOI: 10.4230/lipics.icalp.2021.120

Sequentiality of Group-Weighted Tree Automata

Autori: Frederic Dörband, Thomas Feller, Kevin Stier
Pubblicato in: International Conference on Language and Automata Theory and Applications (LATA 2021), Numero 2021, 2021, Pagina/e pp 267–278
Editore: SpringerLink
DOI: 10.1007/978-3-030-68195-1_21

Data Complexity in Expressive Description Logics with Path Expressions

Autori: Bartosz Bednarczyk
Pubblicato in: Proceedings of the Thirty-ThirdInternational Joint Conference on Artificial Intelligence, 2024, Pagina/e 3241-3249
Editore: International Joint Conferences on Artificial Intelligence Organization
DOI: 10.24963/ijcai.2024/359

To Lead or to be Led: A Generalized Condorcet Jury Theorem under Dependence

Autori: Jonas Karge, Juliette-Michelle Burkhardt, Sebastian Rudolph, Dominik Rusovac
Pubblicato in: AAMAS '24: Proceedings of the 23rd International Conference on Autonomous Agents and Multiagent System, 2024, Pagina/e 983-991
Editore: ACM Digital Library
DOI: 10.5555/3635637.3662953

Towards Model Theory of Ordered Logics: Expressivity and Interpolation

Autori: Bartosz Bednarczyk, Reijo Jaakkola
Pubblicato in: Proceedings of the 47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022), volume 241, 2022
Editore: Schloss Dagstuhl Leibniz-Zentrum für Informatik GmbH
DOI: 10.4230/lipics.mfcs.2022.15

Tractable Diversity: Scalable Multiperspective Ontology Management via Standpoint EL

Autori: Lucía Gómez Álvarez, Sebastian Rudolph, Hannes Strass
Pubblicato in: Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, 2023, Pagina/e 3258-3267
Editore: International Joint Conferences on Artificial Intelligence Organization
DOI: 10.24963/ijcai.2023/363

Pushing the Boundaries of Tractable Multiperspective Reasoning: A Deduction Calculus for Standpoint EL+

Autori: Lucía Gómez Álvarez, Sebastian Rudolph, Hannes Strass
Pubblicato in: Proceedings of the Twentieth International Conference on Principles of Knowledge Representation and Reasoning, 2023, Pagina/e 333-343
Editore: International Joint Conferences on Artificial Intelligence Organization
DOI: 10.24963/kr.2023/33

On the Limits of Decision: the Adjacent Fragment of First-Order Logic

Autori: Bednarczyk, Bartosz; Kojelis, Daumantas; Pratt-Hartmann, Ian
Pubblicato in: Bednarczyk , B , Kojelis , D & Pratt-Hartmann , I 2023 , On the Limits of Decision: the Adjacent Fragment of First-Order Logic . in 50th International Colloquium on Automata, Languages, and Programming : (ICALP 2023) . https://doi.org/10.4230/LIPIcs.ICALP.2023.111, Numero 1, 2023
Editore: Schloss Dagstuhl - Leibniz Center for Informatics
DOI: 10.4230/lipics.icalp.2023.111

The Sticky Path to Expressive Querying: Decidability of Navigational Queries under Existential Rules

Autori: Piotr Ostropolski-Nalewaja, Sebastian Rudolph
Pubblicato in: Proceedings of the TwentyFirst International Conference on Principles of Knowledge Representation and Reasoning, 2024, Pagina/e 574-584
Editore: International Joint Conferences on Artificial Intelligence Organization
DOI: 10.24963/kr.2024/54

Finite Model Theory of the Triguarded Fragment and Related Logics

Autori: Emanuel Kieronski, Sebastian Rudolph
Pubblicato in: 2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 2021, Pagina/e 1-13, ISBN 978-1-6654-4895-6
Editore: IEEE
DOI: 10.1109/lics52264.2021.9470734

Semantic Characterizations of AGM Revision for Tarskian Logics

Autori: Faiq Miftakhul Falakh, Sebastian Rudolph, Kai Sauerwald
Pubblicato in: Proceedings of the 6th International Joint Conference on Rules and Reasoning (RuleML+RR 2022), volume 13752 of LNCS, 2022
Editore: SpringerLink
DOI: 10.1007/978-3-031-21541-4_7

How to Agree to Disagree

Autori: Lucía Gómez Álvarez, Sebastian Rudolph, Hannes Straß
Pubblicato in: Proceedings of the 21st International Semantic Web Conference (ISWC 22), volume 13489 of Lecture Notes in Computer Science, 2022
Editore: SpringerLink
DOI: 10.1007/978-3-031-19433-7_8

A Journey to the Frontiers of Query Rewritability

Autori: Piotr Ostropolski-Nalewaja, Jerzy Marcinkowski, David Carral, Sebastian Rudolph
Pubblicato in: Proceedings of the 41st Symposium on Principles of Database Systems (PODS'22), 2022, Pagina/e 359-367
Editore: ACM Digital Library
DOI: 10.1145/3517804.3524163

Reasoning in SHIQ with Axiom- and Concept-Level Standpoint Modalities

Autori: Lucía Gómez Álvarez, Sebastian Rudolph
Pubblicato in: Proceedings of the TwentyFirst International Conference on Principles of Knowledge Representation and Reasoning, 2024, Pagina/e 383-393, ISBN 978-1-956792-05-8
Editore: International Joint Conferences on Artificial Intelligence Organization
DOI: 10.24963/kr.2024/36

Satisfiability Checking and Conjunctive Query Answering in Description Logics with Global and Local Cardinality Constraints

Autori: Franz Baader, Bartosz Bednarczyk, Sebastian Rudolph
Pubblicato in: Proceedings of the 32nd International Workshop on Description Logics, Numero 2373, 2019, ISSN 1613-0073
Editore: CEUR.org

The Power of the Terminating Chase (Invited Talk)

Autori: Krötzsch, Markus ; Marx, Maximilian ; Rudolph, Sebastian
Pubblicato in: 22nd International Conference on Database Theory (ICDT 2019), Numero 127, 2019, ISBN 978-3-95977-101-6
Editore: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik
DOI: 10.4230/lipics.icdt.2019.3

Worst-Case Optimal Querying of Very Expressive Description Logics with Path Expressions and Succinct Counting

Autori: Bartosz Bednarczyk, Sebastian Rudolph
Pubblicato in: Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, 2019, Pagina/e 1530-1536, ISBN 978-0-9992411-4-1
Editore: International Joint Conferences on Artificial Intelligence Organization
DOI: 10.24963/ijcai.2019/212

The Triguarded Fragment of First-Order Logic

Autori: Sebastian Rudolph, Mantas Simkus
Pubblicato in: EPiC Series in Computing volume 57, Numero vol 57, 2018, Pagina/e 604-587, ISSN 2398-7340
Editore: EasyChair
DOI: 10.29007/m8ts

Worst-Case Optimal Querying of Very Expressive Description Logics with Path Expressions and Succinct Counting

Autori: Bartosz Bednarczyk, Sebastian Rudolph
Pubblicato in: Proceedings of the 32nd International Workshop on Description Logics, Numero 2373, 2019, ISSN 1613-0073
Editore: CEUR.org

Decidable (Ac)counting with Parikh and Muller: Adding Presburger Arithmetic to Monadic Second-Order Logic over Tree-Interpretable Structures

Autori: Herrmann, Luisa; Peth, Vincent; Rudolph, Sebastian
Pubblicato in: Decidable (Ac)counting with Parikh and Muller: Adding Presburger Arithmetic to Monadic Second-Order Logic over Tree-Interpretable Structures, Numero 11, 2024, ISSN 1868-8969
Editore: Schloss Dagstuhl - Leibniz Center for Informatics
DOI: 10.48550/arxiv.2305.01962

Approximated Determinisation of Weighted Tree Automata

Autori: Frederic Dörband, Thomas Feller, Kevin Stier
Pubblicato in: International Conference on Language and Automata Theory and Applications (LATA 2021), Numero LATA2021, 2021, Pagina/e pp 255–266
Editore: SpringerLink
DOI: 10.1007/978-3-030-68195-1_20

All-Instances Oblivious Chase Termination is Undecidable for Single-Head Binary TGDs

Autori: Bartosz Bednarczyk, Robert Ferens, Piotr Ostropolski-Nalewaja
Pubblicato in: Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, 2020, Pagina/e 1719-1725, ISBN 978-0-9992411-6-5
Editore: International Joint Conferences on Artificial Intelligence Organization
DOI: 10.24963/ijcai.2020/238

Constructive Interpolation and Concept-Based Beth Definability for Description Logics via Sequents

Autori: Timothy S. Lyon, Jonas Karge
Pubblicato in: Proceedings of the Thirty-ThirdInternational Joint Conference on Artificial Intelligence, 2024, Pagina/e 3484-3492
Editore: International Joint Conferences on Artificial Intelligence Organization
DOI: 10.24963/ijcai.2024/386

Decidability of Quasi-Dense Modal Logics

Autori: Tim Lyon, Piotr Ostropolski-Nalewaja
Pubblicato in: Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science, Numero 60, 2024, Pagina/e 1-8
Editore: ACM, LICS'24
DOI: 10.1145/3661814.3662111

The Price of Selfishness: Conjunctive Query Entailment for ALCSelf Is 2EXPTIME-Hard

Autori: Bednarczyk, Bartosz; Rudolph, Sebastian
Pubblicato in: Proceedings of the 36th AAAI Conference on Artificial Intelligence (AAAI 2022), 2022, Pagina/e 5495-5502
Editore: PKP Publishing Services Network
DOI: 10.1609/aaai.v36i5.20488

A Framework for Reasoning about Dynamic Axioms in Description Logics

Autori: Bartosz Bednarczyk, Stephane Demri, Alessio Mansutti
Pubblicato in: Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, 2020, Pagina/e 1681-1687, ISBN 978-0-9992411-6-5
Editore: International Joint Conferences on Artificial Intelligence Organization
DOI: 10.24963/ijcai.2020/233

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

Autori: Tim S. Lyon, Piotr Ostropolski-Nalewaja
Pubblicato in: Proceedings of the Twentieth International Conference on Principles of Knowledge Representation and Reasoning, 2023, Pagina/e 769-773
Editore: International Joint Conferences on Artificial Intelligence Organization
DOI: 10.24963/kr.2023/79

Bounded Treewidth and the Infinite Core Chase: Complications and Workarounds toward Decidable Querying

Autori: Jean-François Baget, Marie-Laure Mugnier, Sebastian Rudolph
Pubblicato in: Proceedings of the 42nd ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2024, Pagina/e 291-302
Editore: ACM
DOI: 10.1145/3584372.3588659

On Logics and Homomorphism Closure

Autori: Manuel Bodirsky, Thomas Feller, Simon Knauer, Sebastian Rudolph
Pubblicato in: 2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 2021, Pagina/e 1-13, ISBN 978-1-6654-4895-6
Editore: IEEE
DOI: 10.1109/lics52264.2021.9470511

Automating Reasoning with Standpoint Logic via Nested Sequents

Autori: Tim Lyon, Lucía Gómez Álvarez
Pubblicato in: In Proceedings of the 19th International Conference on Principles of Knowledge Representation and Reasoning — Main Track., 2022, Pagina/e 257-266
Editore: IJCAI Organization
DOI: 10.24963/kr.2022/26

Finite Entailment of Local Queries in the Z family of Description Logics

Autori: Bartosz Bednarczyk, Emanuel Kieroński
Pubblicato in: Proceedings of the 36th AAAI Conference on Artificial Intelligence (AAAI 2022), 2022, Pagina/e 5487--5494
Editore: PKP Publishing Services Network
DOI: 10.1609/aaai.v36i5.20487

Capturing Homomorphism-Closed Decidable Queries with Existential Rules

Autori: Camille Bourgaux, David Carral, Markus Krötzsch, Sebastian Rudolph, Michaël Thomazo
Pubblicato in: Proc. 18th International Conference on Principles of Knowledge Representation and Reasoning (KR'21), 2021, Pagina/e 141-150
Editore: International Joint Conferences on Artificial Intelligence (IJCAI)
DOI: 10.24963/ijcai.2022/733

Derivation-Graph-Based Characterizations of Decidable Existential Rule Sets

Autori: Tim S. Lyon, Sebastian Rudolph
Pubblicato in: Lecture Notes in Computer Science, Logics in Artificial Intelligence, 2023, Pagina/e 369-384
Editore: Springer Nature Switzerland
DOI: 10.1007/978-3-031-43619-2_26

Beyond $$\mathcal {ALC}_{\textsf {reg}}$$: Exploring Non-Regular Extensions of PDL with Description Logics Features

Autori: Bartosz Bednarczyk
Pubblicato in: Lecture Notes in Computer Science, Logics in Artificial Intelligence, 2023, Pagina/e 289-305
Editore: Springer Nature Switzerland
DOI: 10.1007/978-3-031-43619-2_21

A Framework for Intuitionistic Grammar Logics

Autori: Tim S. Lyon
Pubblicato in: Logic and Argumentation - 4th International Conference, CLAR 2021, Hangzhou, China, October 20–22, 2021, Proceedings, Numero 13040, 2021, Pagina/e 495-503, ISBN 978-3-030-89390-3
Editore: Springer International Publishing
DOI: 10.1007/978-3-030-89391-0_29

Exploiting Forwardness: Satisfiability and Query-Entailment in Forward Guarded Fragment

Autori: Bartosz Bednarczyk
Pubblicato in: Logics in Artificial Intelligence - 17th European Conference, JELIA 2021, Virtual Event, May 17–20, 2021, Proceedings, Numero 12678, 2021, Pagina/e 179-193, ISBN 978-3-030-75774-8
Editore: Springer International Publishing
DOI: 10.1007/978-3-030-75775-5_13

Temporally Attributed Description Logics

Autori: Ana Ozaki, Markus Krötzsch, Sebastian Rudolph
Pubblicato in: Description Logic, Theory Combination, and All That - Essays Dedicated to Franz Baader on the Occasion of His 60th Birthday, Numero 11560, 2019, Pagina/e 441-474, ISBN 978-3-030-22101-0
Editore: Springer International Publishing
DOI: 10.1007/978-3-030-22102-7_21

Explaining Data with Formal Concept Analysis

Autori: Bernhard Ganter, Sebastian Rudolph, Gerd Stumme
Pubblicato in: Reasoning Web. Explainable Artificial Intelligence - 15th International Summer School 2019, Bolzano, Italy, September 20–24, 2019, Tutorial Lectures, Numero 11810, 2019, Pagina/e 153-195, ISBN 978-3-030-31422-4
Editore: Springer International Publishing
DOI: 10.1007/978-3-030-31423-1_5

SPARQL Queries over Ontologies Under the Fixed-Domain Semantics

Autori: Sebastian Rudolph, Lukas Schweizer, Zhihao Yao
Pubblicato in: PRICAI 2019: Trends in Artificial Intelligence - 16th Pacific Rim International Conference on Artificial Intelligence, Cuvu, Yanuca Island, Fiji, August 26–30, 2019, Proceedings, Part I, Numero 11670, 2019, Pagina/e 486-499, ISBN 978-3-030-29907-1
Editore: Springer International Publishing
DOI: 10.1007/978-3-030-29908-8_39

Presburger Concept Cardinality Constraints in Very Expressive Description Logics - Allegro sexagenarioso ma non ritardando

Autori: “Johann” Sebastian Rudolph
Pubblicato in: Description Logic, Theory Combination, and All That - Essays Dedicated to Franz Baader on the Occasion of His 60th Birthday, Numero 11560, 2019, Pagina/e 542-561, ISBN 978-3-030-22101-0
Editore: Springer International Publishing
DOI: 10.1007/978-3-030-22102-7_25

On Explicit Solutions to Fixed-Point Equations in Propositional Dynamic Logic

Autori: Tim S. Lyon
Pubblicato in: Fundamentals of Software Engineering, 2025, Pagina/e 113–119
Editore: Springer

Pubblicazioni

Condividi questa pagina Condividi questa pagina sui social network

Scarica Scarica il contenuto della pagina