Bartosz Bednarczyk

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