Bartosz Bednarczyk
Bartosz Bednarczyk
Wissenschaftlicher Mitarbeiter Computational Logic
- bartosz.bednarczyk@tu-dresden.de
- +49 351 463 42665
- APB 2031
About Me
I am a PHD student at TU Dresden and at University of Wrocław, supervised jointly by Sebastian Rudolph (Dresden) and Emanuel Kieroński (Wrocław). My work focus on different aspects of ontology mediated data access and applications of decidable fragments of first-order logic (like existential rules or guarded-fragments) to database-inspired reasoning problems.
Neueste Publikationen
Komplette Publikationsliste anzeigen
Bartosz Bednarczyk, Emanuel Kieroński, Piotr Witkowski
On the Complexity of Graded Modal Logics with Converse.
In Francesco Calimeri, Nicola Leone, Marco Manna, eds., JELIA 2019, Logics in Artificial Intelligence - 16th European Conference, volume 11468 of LNCS, May 2019. Springer
Details
Bartosz Bednarczyk
One-Variable Logic Meets Presburger Arithmetic
Theoretical Computer Science, to appear
Details
Bartosz Bednarczyk, Sebastian Rudolph
Worst-Case Optimal Querying of Very Expressive Description Logics with Path Expressions and Succinct Counting
In Mantas Simkus, Grant E. Weddell, eds., Proceedings of the 32nd International Workshop on Description Logics, volume 2373 of CEUR Workshop Proceedings, June 2019. CEUR-WS.org
Details
Bartosz Bednarczyk, Sebastian Rudolph
Worst-Case Optimal Querying of Very Expressive Description Logics with Path Expressions and Succinct Counting
Proceedings of the 28th International Joint Conference on Artificial Intelligence (IJCAI'19), August 2019. International Joint Conferences on Artificial Intelligence
Details
Bartosz Bednarczyk, Sebastian Rudolph, Franz Baader
Satisfiability Checking and Conjunctive Query Answering in Description Logics with Global and Local Cardinality Constraints
In Mantas Simkus, Grant E. Weddell, eds., Satisfiability Checking and Conjunctive Query Answering in Description Logics with Global and Local Cardinality Constraints, volume 2373 of CEUR Workshop Proceedings, June 2019. CEUR-WS.org
Details
Bartosz Bednarczyk, Stéphane Demri
Why propositional quantification makes modal logics on trees robustly hard ?
LICS 2019, 34th Annual ACM/IEEE Symposium on Logic in Computer Science, 1--13, June 2019. IEEE
Details
Bartosz Bednarczyk, Witold Charatonik
Modulo Counting on Words and Trees.
FSTTCS 2017, 37th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, December 2017
Details
Bartosz Bednarczyk, Emanuel Kieroński, Witold Charatonik
Extending Two-Variable Logic on Trees
CSL 2017, 26th EACSL Annual Conference on Computer Science Logic, August 2017
Details
DeciGUT
A Grand Unified Theory of Decidability in Logic-Based Knowledge Representation
