Folgen
Bartosz Bednarczyk
Bartosz Bednarczyk
Bestätigte E-Mail-Adresse bei cs.uni.wroc.pl - Startseite
Titel
Zitiert von
Zitiert von
Jahr
Satisfiability and query answering in description logics with global and local cardinality constraints
F Baader, B Bednarczyk, S Rudolph
ECAI 2020 / DL 2019, 2020
19*2020
Why propositional quantification makes modal logics on trees robustly hard ?
B Bednarczyk, S Demri
LICS 2019, Preprint from LSV, 2019
122019
Worst-Case Optimal Querying of Very Expressive Description Logics with Path Expressions and Succinct Counting
B Bednarczyk, S Rudolph
DL 2019 & IJCAI 2019, 2019
112019
Exploiting Forwardness: Satisfiability and Query-Entailment in Forward Guarded Fragment
B Bednarczyk
Logics in Artificial Intelligence: 17th European Conference, JELIA 2021 …, 2021
102021
Modal Logics with Composition on Finite Forests: Expressivity and Complexity
B Bednarczyk, S Demri, R Fervari, A Mansutti
Lics 2020, Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in …, 2020
72020
Extending two-variable logic on trees
B Bednarczyk, W Charatonik, E Kieroński
CSL 2017, 2016
72016
Presburger Büchi Tree Automata with Applications to Logics with Expressive Counting
B Bednarczyk, O Fiuk
International Workshop on Logic, Language, Information, and Computation, 295-308, 2022
52022
All-Instances Oblivious Chase Termination is Undecidable for Single-Head Binary TGDs
B Bednarczyk, R Ferens, P Ostropolski-Nalewaja
52020
Finite entailment of local queries in the Z family of description logics
B Bednarczyk, E Kieroński
Proceedings of the AAAI Conference on Artificial Intelligence 36 (5), 5487-5494, 2022
42022
Comonadic semantics for description logics games
B Bednarczyk, M Urbańczyk
Proceedings of the 35th International Workshop on Description Logics (DL …, 2022
32022
Lutz's Spoiler Technique Revisited: A Unified Approach to Worst-Case Optimal Entailment of Unions of Conjunctive Queries in Locally-Forward Description Logics
B Bednarczyk
arXiv preprint arXiv:2108.05680, 2021
32021
On classical decidable logics extended with percentage quantifiers and arithmetics
B Bednarczyk, M Orłowska, A Pacanowska, T Tan
arXiv preprint arXiv:2106.15250, 2021
32021
On the Complexity of Graded Modal Logics with Converse
B Bednarczyk, E Kieroński, P Witkowski
JELIA 2019, 2018
32018
Towards a model theory of ordered logics: Expressivity and interpolation
B Bednarczyk, R Jaakkola
47th International Symposium on Mathematical Foundations of Computer Science …, 2022
22022
Completing the picture: Complexity of graded modal logics with converse
B Bednarczyk, E Kieroński, P Witkowski
Theory and Practice of Logic Programming 21 (4), 493-520, 2021
22021
A Note on C² Interpreted over Finite Data-Words
B Bednarczyk, P Witkowski
27th International Symposium on Temporal Representation and Reasoning (TIME …, 2020
22020
One-Variable Logic Meets Presburger Arithmetic
B Bednarczyk
Theoretical Computer Science, 2020
22020
Order-Invariance of Two-Variable Logic is coNExpTime-complete
B Bednarczyk
arXiv preprint arXiv:2208.07577, 2022
12022
Why Does Propositional Quantification Make Modal and Temporal Logics on Trees Robustly Hard?
B Bednarczyk, S Demri
Logical Methods in Computer Science 18, 2022
12022
The Price of Selfishness: Conjunctive Query Entailment for ALCSelf is 2ExpTime-hard
B Bednarczyk, S Rudolph
Proceedings of the AAAI Conference on Artificial Intelligence 36 (5), 5495-5502, 2022
12022
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20