Bartosz Bednarczyk

According to our database, Bartosz Bednarczyk authored at least 41 papers between 2017 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2024

Database-Inspired Reasoning Problems in Description Logics With Path Expressions.

Bartosz Bednarczyk

PhD thesis, 2024

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

Bartosz Bednarczyk

Log. Methods Comput. Sci., 2024

The Adjacent Fragment and Quine's Limits of Decision.

Bartosz Bednarczyk, Daumantas Kojelis, Ian Pratt-Hartmann

CoRR, 2024

Data Complexity in Expressive Description Logics with Path Expressions.

Bartosz Bednarczyk

Proceedings of the Thirty-Third International Joint Conference on Artificial Intelligence, 2024

On the Limits of Decision: the Adjacent Fragment of First-Order Logic (Extended Abstract).

Bartosz Bednarczyk, Daumantas Kojelis, Ian Pratt-Hartmann

Proceedings of the 37th International Workshop on Description Logics (DL 2024), 2024

Data Complexity in Expressive Description Logics With Path Expressions (Extended Abstract).

Bartosz Bednarczyk

Proceedings of the 37th International Workshop on Description Logics (DL 2024), 2024

2023

On Composing Finite Forests with Modal Logics.

Bartosz Bednarczyk, Stéphane Demri, Raul Fervari, Alessio Mansutti

ACM Trans. Comput. Log., April, 2023

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

Bartosz Bednarczyk, Sebastian Rudolph

J. Artif. Intell. Res., 2023

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

Bartosz Bednarczyk, Julien Grange

CoRR, 2023

Beyond <i>ALC</i>_reg: Exploring Non-Regular Extensions of PDL with Description Logics Features.

Bartosz Bednarczyk

Proceedings of the Logics in Artificial Intelligence - 18th European Conference, 2023

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

Bartosz Bednarczyk, Daumantas Kojelis, Ian Pratt-Hartmann

Proceedings of the 50th International Colloquium on Automata, Languages, and Programming, 2023

2022

Why Does Propositional Quantification Make Modal and Temporal Logics on Trees Robustly Hard?

Bartosz Bednarczyk, Stéphane Demri

Log. Methods Comput. Sci., 2022

Order-Invariance of Two-Variable Logic is coNExpTime-complete.

Bartosz Bednarczyk

CoRR, 2022

Towards a Model Theory of Ordered Logics: Expressivity and Interpolation (Extended version).

Bartosz Bednarczyk, Reijo Jaakkola

CoRR, 2022

Presburger Büchi Tree Automata with Applications to Logics with Expressive Counting.

Bartosz Bednarczyk, Oskar Fiuk

Proceedings of the Logic, Language, Information, and Computation, 2022

Towards a Model Theory of Ordered Logics: Expressivity and Interpolation.

Bartosz Bednarczyk, Reijo Jaakkola

Proceedings of the 47th International Symposium on Mathematical Foundations of Computer Science, 2022

Comonadic Semantics for Description Logics Games.

Bartosz Bednarczyk, Mateusz Urbanczyk

Proceedings of the 35th International Workshop on Description Logics (DL 2022) co-located with Federated Logic Conference (FLoC 2022), 2022

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

Bartosz Bednarczyk, Sebastian Rudolph

Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022

Finite Entailment of Local Queries in the Z Family of Description Logics.

Bartosz Bednarczyk, Emanuel Kieronski

Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022

2021

Completing the Picture: Complexity of Graded Modal Logics with Converse.

Bartosz Bednarczyk, Emanuel Kieronski, Piotr Witkowski

Theory Pract. Log. Program., 2021

Statistical EL is ExpTime-complete.

Bartosz Bednarczyk

Inf. Process. Lett., 2021

Lutz's Spoiler Technique Revisited: A Unified Approach to Worst-Case Optimal Entailment of Unions of Conjunctive Queries in Locally-Forward Description Logics.

Bartosz Bednarczyk

CoRR, 2021

Why Propositional Quantification Makes Modal and Temporal Logics on Trees Robustly Hard?

Bartosz Bednarczyk, Stéphane Demri

CoRR, 2021

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

Bartosz Bednarczyk

Proceedings of the Logics in Artificial Intelligence - 17th European Conference, 2021

On Classical Decidable Logics Extended with Percentage Quantifiers and Arithmetics.

Bartosz Bednarczyk, Maja Orlowska, Anna Pacanowska, Tony Tan

Proceedings of the 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2021

"Most of" leads to undecidability: Failure of adding frequencies to LTL.

Bartosz Bednarczyk, Jakub Michaliszyn

Proceedings of the Foundations of Software Science and Computation Structures, 2021

The Price of Selfishness: Conjunctive Query Entailment for ALCSelf is 2ExpTime-hard (Extended Abstract).

Bartosz Bednarczyk, Sebastian Rudolph

Proceedings of the 34th International Workshop on Description Logics (DL 2021) part of Bratislava Knowledge September (BAKS 2021), 2021

Finite-Controllability of Conjunctive Queries in the Z family of Description Logics (Extended Abstract).

Bartosz Bednarczyk, Emanuel Kieronski

Proceedings of the 34th International Workshop on Description Logics (DL 2021) part of Bratislava Knowledge September (BAKS 2021), 2021

2020

One-variable logic meets Presburger arithmetic.

Bartosz Bednarczyk

Theor. Comput. Sci., 2020

Modal Logics with Composition on Finite Forests: Expressivity and Complexity (Extra Material).

Bartosz Bednarczyk, Stéphane Demri, Raul Fervari, Alessio Mansutti

CoRR, 2020

A Note on C² Interpreted over Finite Data-Words.

Bartosz Bednarczyk, Piotr Witkowski

Proceedings of the 27th International Symposium on Temporal Representation and Reasoning, 2020

Modal Logics with Composition on Finite Forests: Expressivity and Complexity.

Bartosz Bednarczyk, Stéphane Demri, Raul Fervari, Alessio Mansutti

Proceedings of the LICS '20: 35th Annual ACM/IEEE Symposium on Logic in Computer Science, 2020

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

Bartosz Bednarczyk, Robert Ferens, Piotr Ostropolski-Nalewaja

Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, 2020

A Framework for Reasoning about Dynamic Axioms in Description Logics.

Bartosz Bednarczyk, Stéphane Demri, Alessio Mansutti

Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, 2020

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

Franz Baader, Bartosz Bednarczyk, Sebastian Rudolph

Proceedings of the ECAI 2020 - 24th European Conference on Artificial Intelligence, 29 August-8 September 2020, Santiago de Compostela, Spain, August 29 - September 8, 2020, 2020

2019

Why Propositional Quantification Makes Modal Logics on Trees Robustly Hard?

Bartosz Bednarczyk, Stéphane Demri

Proceedings of the 34th Annual ACM/IEEE Symposium on Logic in Computer Science, 2019

On the Complexity of Graded Modal Logics with Converse.

Bartosz Bednarczyk, Emanuel Kieronski, Piotr Witkowski

Proceedings of the Logics in Artificial Intelligence - 16th European Conference, 2019

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

Bartosz Bednarczyk, Sebastian Rudolph

Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, 2019

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

Franz Baader, Bartosz Bednarczyk, Sebastian Rudolph

Proceedings of the 32nd International Workshop on Description Logics, 2019

2017

Modulo Counting on Words and Trees.

Bartosz Bednarczyk, Witold Charatonik

Proceedings of the 37th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2017

Extending Two-Variable Logic on Trees.

Bartosz Bednarczyk, Witold Charatonik, Emanuel Kieronski

Proceedings of the 26th EACSL Annual Conference on Computer Science Logic, 2017