Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBartosz Bednarczyk
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j4]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)- [c22]Bartosz Bednarczyk, Emanuel Kieronski:
Finite Entailment of Local Queries in the Z Family of Description Logics. AAAI 2022: 5487-5494 - [c21]Bartosz Bednarczyk, Sebastian Rudolph:
The Price of Selfishness: Conjunctive Query Entailment for ALCSelf Is 2EXPTIME-Hard. AAAI 2022: 5495-5502 - [c20]Bartosz Bednarczyk, Mateusz Urbanczyk:
Comonadic Semantics for Description Logics Games. Description Logics 2022 - [c19]Bartosz Bednarczyk, Reijo Jaakkola:
Towards a Model Theory of Ordered Logics: Expressivity and Interpolation. MFCS 2022: 15:1-15:14 - [c18]Bartosz Bednarczyk, Oskar Fiuk:
Presburger Büchi Tree Automata with Applications to Logics with Expressive Counting. WoLLIC 2022: 295-308 - [i14]Bartosz Bednarczyk, Reijo Jaakkola:
Towards a Model Theory of Ordered Logics: Expressivity and Interpolation (Extended version). CoRR abs/2206.11751 (2022) - [i13]Bartosz Bednarczyk:
Order-Invariance of Two-Variable Logic is coNExpTime-complete. CoRR abs/2208.07577 (2022) - 2021
- [j3]Bartosz Bednarczyk:
Statistical EL is ExpTime-complete. Inf. Process. Lett. 169: 106113 (2021) - [j2]Bartosz Bednarczyk, Emanuel Kieronski, Piotr Witkowski:
Completing the Picture: Complexity of Graded Modal Logics with Converse. Theory Pract. Log. Program. 21(4): 493-520 (2021) - [c17]Bartosz Bednarczyk, Emanuel Kieronski:
Finite-Controllability of Conjunctive Queries in the Z family of Description Logics (Extended Abstract). Description Logics 2021 - [c16]Bartosz Bednarczyk, Sebastian Rudolph:
The Price of Selfishness: Conjunctive Query Entailment for ALCSelf is 2ExpTime-hard (Extended Abstract). Description Logics 2021 - [c15]Bartosz Bednarczyk, Jakub Michaliszyn:
"Most of" leads to undecidability: Failure of adding frequencies to LTL. FoSSaCS 2021: 82-101 - [c14]Bartosz Bednarczyk, Maja Orlowska, Anna Pacanowska, Tony Tan:
On Classical Decidable Logics Extended with Percentage Quantifiers and Arithmetics. FSTTCS 2021: 36:1-36:15 - [c13]Bartosz Bednarczyk:
Exploiting Forwardness: Satisfiability and Query-Entailment in Forward Guarded Fragment. JELIA 2021: 179-193 - [i12]Bartosz Bednarczyk, Stéphane Demri:
Why Propositional Quantification Makes Modal and Temporal Logics on Trees Robustly Hard? CoRR abs/2104.13122 (2021) - [i11]Bartosz Bednarczyk, Sebastian Rudolph:
The Price of Selfishness: Conjunctive Query Entailment for ALCSelf is 2ExpTime-hard. CoRR abs/2106.15150 (2021) - [i10]Bartosz Bednarczyk, Maja Orlowska, Anna Pacanowska, Tony Tan:
On Classical Decidable Logics extended with Percentage Quantifiers and Arithmetics. CoRR abs/2106.15250 (2021) - [i9]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 abs/2108.05680 (2021) - 2020
- [j1]Bartosz Bednarczyk:
One-variable logic meets Presburger arithmetic. Theor. Comput. Sci. 802: 141-146 (2020) - [c12]Franz Baader, Bartosz Bednarczyk, Sebastian Rudolph:
Satisfiability and Query Answering in Description Logics with Global and Local Cardinality Constraints. ECAI 2020: 616-623 - [c11]Bartosz Bednarczyk, Stéphane Demri, Alessio Mansutti:
A Framework for Reasoning about Dynamic Axioms in Description Logics. IJCAI 2020: 1681-1687 - [c10]Bartosz Bednarczyk, Robert Ferens, Piotr Ostropolski-Nalewaja:
All-Instances Oblivious Chase Termination is Undecidable for Single-Head Binary TGDs. IJCAI 2020: 1719-1725 - [c9]Bartosz Bednarczyk, Stéphane Demri, Raul Fervari, Alessio Mansutti:
Modal Logics with Composition on Finite Forests: Expressivity and Complexity. LICS 2020: 167-180 - [c8]Bartosz Bednarczyk, Piotr Witkowski:
A Note on C² Interpreted over Finite Data-Words. TIME 2020: 17:1-17:14 - [i8]Franz Baader, Bartosz Bednarczyk, Sebastian Rudolph:
Satisfiability and Query Answering in Description Logics with Global and Local Cardinality Constraints. CoRR abs/2002.06072 (2020) - [i7]Bartosz Bednarczyk, Jakub Michaliszyn:
"Most of" leads to undecidability: Failure of adding frequencies to LTL. CoRR abs/2007.01233 (2020) - [i6]Bartosz Bednarczyk, Stéphane Demri, Raul Fervari, Alessio Mansutti:
Modal Logics with Composition on Finite Forests: Expressivity and Complexity (Extra Material). CoRR abs/2007.08598 (2020)
2010 – 2019
- 2019
- [c7]Franz Baader, Bartosz Bednarczyk, Sebastian Rudolph:
Satisfiability Checking and Conjunctive Query Answering in Description Logics with Global and Local Cardinality Constraints. Description Logics 2019 - [c6]Bartosz Bednarczyk, Sebastian Rudolph:
Worst-Case Optimal Querying of Very Expressive Description Logics with Path Expressions and Succinct Counting. Description Logics 2019 - [c5]Bartosz Bednarczyk, Sebastian Rudolph:
Worst-Case Optimal Querying of Very Expressive Description Logics with Path Expressions and Succinct Counting. IJCAI 2019: 1530-1536 - [c4]Bartosz Bednarczyk, Emanuel Kieronski, Piotr Witkowski:
On the Complexity of Graded Modal Logics with Converse. JELIA 2019: 642-658 - [c3]Bartosz Bednarczyk, Stéphane Demri:
Why Propositional Quantification Makes Modal Logics on Trees Robustly Hard? LICS 2019: 1-13 - [i5]Bartosz Bednarczyk:
Statistical EL is ExpTime-complete. CoRR abs/1911.00696 (2019) - 2018
- [i4]Bartosz Bednarczyk:
The One-Variable Logic Meets Presburger Arithmetic. CoRR abs/1810.10899 (2018) - [i3]Bartosz Bednarczyk, Emanuel Kieronski, Piotr Witkowski:
On the Complexity of Graded Modal Logics with Converse. CoRR abs/1812.04413 (2018) - 2017
- [c2]Bartosz Bednarczyk, Witold Charatonik, Emanuel Kieronski:
Extending Two-Variable Logic on Trees. CSL 2017: 11:1-11:20 - [c1]Bartosz Bednarczyk, Witold Charatonik:
Modulo Counting on Words and Trees. FSTTCS 2017: 12:1-12:16 - [i2]Bartosz Bednarczyk, Witold Charatonik:
Modulo Counting on Words and Trees. CoRR abs/1710.05582 (2017) - 2016
- [i1]Bartosz Bednarczyk, Witold Charatonik, Emanuel Kieronski:
Extending Two-Variable Logic on Trees. CoRR abs/1611.02112 (2016)
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).
load content from web.archive.org
Privacy notice: By enabling the option above, your browser will contact the API of web.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.
Tweets on dblp homepage
Show tweets from 
on the dblp homepage.
Privacy notice: By enabling the option above, your browser will contact twitter.com and twimg.com to load tweets curated by our Twitter account. At the same time, Twitter will persistently store several cookies with your web browser. While we did signal Twitter to not track our users by setting the "dnt" flag, we do not have any control over how Twitter uses your data. So please proceed with care and consider checking the Twitter privacy policy.
last updated on 2023-01-25 21:23 CET 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:
