Bartosz Bednarczyk

Publication Activity (10 Years)

Years Active: 2016-2024
Publications (10 Years): 51

Top Topics

Extended Abstract

Conjunctive Queries

Description Logics

Top Venues

Description Logics

Publications

Bartosz Bednarczyk
Data Complexity in Expressive Description Logics With Path Expressions (Extended Abstract). Description Logics (2024)
Bartosz Bednarczyk, Daumantas Kojelis, Ian Pratt-Hartmann
On the of Limits of Decision: the Adjacent Fragment of First-Order Logic (Extended Abstract). Description Logics (2024)
Bartosz Bednarczyk
Data Complexity in Expressive Description Logics With Path Expressions. CoRR (2024)
Bartosz Bednarczyk
Exploring Non-Regular Extensions of Propositional Dynamic Logic with Description-Logics Features. Log. Methods Comput. Sci. 20 (2) (2024)
Bartosz Bednarczyk, Stéphane Demri, Raul Fervari, Alessio Mansutti
On Composing Finite Forests with Modal Logics. ACM Trans. Comput. Log. 24 (2) (2023)
Bartosz Bednarczyk
Exploring Non-Regular Extensions of Propositional Dynamic Logic with Description-Logics Features. CoRR (2023)
Bartosz Bednarczyk
: Exploring Non-Regular Extensions of PDL with Description Logics Features. JELIA (2023)
Bartosz Bednarczyk, Daumantas Kojelis, Ian Pratt-Hartmann
On the of Limits of Decision: the Adjacent Fragment of First-Order Logic. CoRR (2023)
Bartosz Bednarczyk, Sebastian Rudolph
How to Tell Easy from Hard: Complexities of Conjunctive Query Entailment in Extensions of ALC. J. Artif. Intell. Res. 78 (2023)
Bartosz Bednarczyk, Daumantas Kojelis, Ian Pratt-Hartmann
On the Limits of Decision: the Adjacent Fragment of First-Order Logic. ICALP (2023)
Bartosz Bednarczyk, Julien Grange
About the Expressive Power and Complexity of Order-Invariance with Two Variables. CoRR (2023)
Bartosz Bednarczyk, Emanuel Kieronski
Finite Entailment of Local Queries in the Z Family of Description Logics. AAAI (2022)
Bartosz Bednarczyk, Oskar Fiuk
Presburger Büchi Tree Automata with Applications to Logics with Expressive Counting. WoLLIC (2022)
Bartosz Bednarczyk, Stéphane Demri
Why Does Propositional Quantification Make Modal and Temporal Logics on Trees Robustly Hard? Log. Methods Comput. Sci. 18 (3) (2022)
Bartosz Bednarczyk, Mateusz Urbanczyk
Comonadic Semantics for Description Logics Games. Description Logics (2022)
Bartosz Bednarczyk, Reijo Jaakkola
Towards a Model Theory of Ordered Logics: Expressivity and Interpolation. MFCS (2022)
Bartosz Bednarczyk, Reijo Jaakkola
Towards a Model Theory of Ordered Logics: Expressivity and Interpolation (Extended version). CoRR (2022)
Bartosz Bednarczyk
Order-Invariance of Two-Variable Logic is coNExpTime-complete. CoRR (2022)
Bartosz Bednarczyk, Sebastian Rudolph
The Price of Selfishness: Conjunctive Query Entailment for ALCSelf Is 2EXPTIME-Hard. AAAI (2022)
Bartosz Bednarczyk
Lutz's Spoiler Technique Revisited: A Unified Approach to Worst-Case Optimal Entailment of Unions of Conjunctive Queries in Locally-Forward Description Logics. CoRR (2021)
Bartosz Bednarczyk, Emanuel Kieronski, Piotr Witkowski
Completing the Picture: Complexity of Graded Modal Logics with Converse. Theory Pract. Log. Program. 21 (4) (2021)
Bartosz Bednarczyk, Maja Orlowska, Anna Pacanowska, Tony Tan
On Classical Decidable Logics Extended with Percentage Quantifiers and Arithmetics. FSTTCS (2021)
Bartosz Bednarczyk
Exploiting Forwardness: Satisfiability and Query-Entailment in Forward Guarded Fragment. JELIA (2021)
Bartosz Bednarczyk, Sebastian Rudolph
The Price of Selfishness: Conjunctive Query Entailment for ALCSelf is 2ExpTime-hard. CoRR (2021)
Bartosz Bednarczyk
Statistical EL is ExpTime-complete. Inf. Process. Lett. 169 (2021)
Bartosz Bednarczyk, Emanuel Kieronski
Finite-Controllability of Conjunctive Queries in the Z family of Description Logics (Extended Abstract). Description Logics (2021)
Bartosz Bednarczyk, Sebastian Rudolph
The Price of Selfishness: Conjunctive Query Entailment for ALCSelf is 2ExpTime-hard (Extended Abstract). Description Logics (2021)
Bartosz Bednarczyk, Stéphane Demri
Why Propositional Quantification Makes Modal and Temporal Logics on Trees Robustly Hard? CoRR (2021)
Bartosz Bednarczyk, Maja Orlowska, Anna Pacanowska, Tony Tan
On Classical Decidable Logics extended with Percentage Quantifiers and Arithmetics. CoRR (2021)
Bartosz Bednarczyk, Jakub Michaliszyn
"Most of" leads to undecidability: Failure of adding frequencies to LTL. FoSSaCS (2021)
Bartosz Bednarczyk, Robert Ferens, Piotr Ostropolski-Nalewaja
All-Instances Oblivious Chase Termination is Undecidable for Single-Head Binary TGDs. IJCAI (2020)
Bartosz Bednarczyk, Jakub Michaliszyn
"Most of" leads to undecidability: Failure of adding frequencies to LTL. CoRR (2020)
Bartosz Bednarczyk
One-variable logic meets Presburger arithmetic. Theor. Comput. Sci. 802 (2020)
Bartosz Bednarczyk, Stéphane Demri, Raul Fervari, Alessio Mansutti
Modal Logics with Composition on Finite Forests: Expressivity and Complexity (Extra Material). CoRR (2020)
Franz Baader, Bartosz Bednarczyk, Sebastian Rudolph
Satisfiability and Query Answering in Description Logics with Global and Local Cardinality Constraints. ECAI (2020)
Bartosz Bednarczyk, Piotr Witkowski
A Note on C² Interpreted over Finite Data-Words. TIME (2020)
Bartosz Bednarczyk, Stéphane Demri, Alessio Mansutti
A Framework for Reasoning about Dynamic Axioms in Description Logics. IJCAI (2020)
Bartosz Bednarczyk, Stéphane Demri, Raul Fervari, Alessio Mansutti
Modal Logics with Composition on Finite Forests: Expressivity and Complexity. LICS (2020)
Franz Baader, Bartosz Bednarczyk, Sebastian Rudolph
Satisfiability and Query Answering in Description Logics with Global and Local Cardinality Constraints. CoRR (2020)
Bartosz Bednarczyk, Stéphane Demri
Why Propositional Quantification Makes Modal Logics on Trees Robustly Hard? LICS (2019)
Franz Baader, Bartosz Bednarczyk, Sebastian Rudolph
Satisfiability Checking and Conjunctive Query Answering in Description Logics with Global and Local Cardinality Constraints. Description Logics (2019)
Bartosz Bednarczyk, Emanuel Kieronski, Piotr Witkowski
On the Complexity of Graded Modal Logics with Converse. JELIA (2019)
Bartosz Bednarczyk
Statistical EL is ExpTime-complete. CoRR (2019)
Bartosz Bednarczyk, Sebastian Rudolph
Worst-Case Optimal Querying of Very Expressive Description Logics with Path Expressions and Succinct Counting. IJCAI (2019)
Bartosz Bednarczyk, Sebastian Rudolph
Worst-Case Optimal Querying of Very Expressive Description Logics with Path Expressions and Succinct Counting. Description Logics (2019)
Bartosz Bednarczyk
The One-Variable Logic Meets Presburger Arithmetic. CoRR (2018)
Bartosz Bednarczyk, Emanuel Kieronski, Piotr Witkowski
On the Complexity of Graded Modal Logics with Converse. CoRR (2018)
Bartosz Bednarczyk, Witold Charatonik
Modulo Counting on Words and Trees. CoRR (2017)
Bartosz Bednarczyk, Witold Charatonik
Modulo Counting on Words and Trees. FSTTCS (2017)
Bartosz Bednarczyk, Witold Charatonik, Emanuel Kieronski
Extending Two-Variable Logic on Trees. CSL (2017)
Bartosz Bednarczyk, Witold Charatonik, Emanuel Kieronski
Extending Two-Variable Logic on Trees. CoRR (2016)