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, Stéphane Demri, Alessio Mansutti
A Framework for Reasoning about Dynamic Axioms in Description Logics
Proceedings of the 29th International Joint Conference on Artificial Intelligence and the 17th Pacific Rim International Conference on Artificial Intelligence (IJCAI 2020), to appear. International Joint Conferences on Artificial Intelligence
Details
Bartosz Bednarczyk, Piotr Ostropolski-Nalewaja, Robert Ferens
All-Instances Oblivious Chase Termination is Undecidable for Single-Head Binary TGDs
Proceedings of the 29th International Joint Conference on Artificial Intelligence and the 17th Pacific Rim International Conference on Artificial Intelligence (IJCAI 2020), to appear. International Joint Conferences on Artificial Intelligence
Details
Bartosz Bednarczyk, Stéphane Demri, Raul Fervari, Alessio Mansutti
Modal Logics with Composition on Finite Forests: Expressivity and Complexity
Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS 2020), to appear
Details
Bartosz Bednarczyk, Franz Baader, Sebastian Rudolph
Satisfiability and Query Answering in Description Logics with Global and Local Cardinality Constraints
Proceedings of the 24th European Conference on Artificial Intelligence (ECAI 2020), to appear
Details
Bartosz Bednarczyk
One-Variable Logic Meets Presburger Arithmetic
Theoretical Computer Science, 802(141-146), January 2020
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., Proceedings of the 32nd International Workshop on Description Logics, volume 2373 of CEUR Workshop Proceedings, June 2019. CEUR-WS.org
Details
Bartosz Bednarczyk, Franz Baader, Sebastian Rudolph
Satisfiability Checking and Conjunctive Query Answering in Description Logics with Global and Local Cardinality Constraints
Technical Report, Computational Logic Group, 2019
Details Download
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, 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
DeciGUT
A Grand Unified Theory of Decidability in Logic-Based Knowledge Representation
