International Center for Computational Logic - Benutzerbeiträge [de]

Article3109

2025-07-11T06:30:12Z

Bartosz Bednarczyk: Die Seite wurde neu angelegt: „{{Publikation Erster Autor |ErsterAutorVorname=Bartosz |ErsterAutorNachname=Bednarczyk |FurtherAuthors=Daumantas Kojelis; Ian Pratt-Hartmann }} {{Article |Referiert=0 |Title=The Adjacent Fragment and Quine’s Limits of Decision |To appear=1 |Year=2025 |Journal=Journal of Logic and Computation }} {{Publikation Details |Abstract=We introduce the adjacent fragment AF of first-order logic, obtained by restricting the sequences of variables occurring as argum…“

{{Publikation Erster Autor
|ErsterAutorVorname=Bartosz
|ErsterAutorNachname=Bednarczyk
|FurtherAuthors=Daumantas Kojelis; Ian Pratt-Hartmann
}}
{{Article
|Referiert=0
|Title=The Adjacent Fragment and Quine’s Limits of Decision
|To appear=1
|Year=2025
|Journal=Journal of Logic and Computation
}}
{{Publikation Details
|Abstract=We introduce the adjacent fragment AF of first-order logic, obtained by restricting the sequences of variables occurring as arguments in atomic formulas. The adjacent fragment generalizes (after a routine renaming) the two-variable fragment of first-order logic as well as the so-called fluted fragment. We show that the adjacent fragment has the finite model property, and that the satisfiability problem for its k-variable sub-fragment is in (k−1)-NExpTime. Using known results on the fluted fragment, it follows that the satisfiability problem for the whole adjacent fragment is Tower-complete. We additionally consider the effect of the adjacency requirement on the well-known guarded fragment of first-order logic, whose satisfiability problem is 2ExpTime-complete. We show that the satisfiability problem for the intersection of the adjacent and guarded adjacent fragments remains 2ExpTime-hard. Finally, we show that any relaxation of the adjacency condition on the allowed order of variables in argument sequences yields a logic whose satisfiability and finite satisfiability problems are undecidable.
|Download=Adjacent-fragment.pdf
|Projekt=DeciGUT
|Forschungsgruppe=Computational Logic
}}

Datei:Adjacent-fragment.pdf

2025-07-11T06:29:37Z

Bartosz Bednarczyk:

Article3104/en

2025-03-31T07:49:57Z

Bartosz Bednarczyk: Page created automatically by parser function on page Article3104

#REDIRECT [[Article3104]]

Article3104

2025-03-31T07:49:57Z

Bartosz Bednarczyk: Die Seite wurde neu angelegt: „{{Publikation Erster Autor |ErsterAutorVorname=Bartosz |ErsterAutorNachname=Bednarczyk |FurtherAuthors=Julien Grange }} {{Article |Referiert=0 |Title=About the Expressive Power and Complexity of Order-Invariance with Two Variables |To appear=0 |Year=2025 |Month=März |Journal=Logical Methods in Computer Science |Volume=21 |Number=1 |Pages=30:1--30:28 }} {{Publikation Details |Download=Lmcs-bbe-grange.pdf |Projekt=DeciGUT |Forschungsgruppe=Computational Lo…“

{{Publikation Erster Autor
|ErsterAutorVorname=Bartosz
|ErsterAutorNachname=Bednarczyk
|FurtherAuthors=Julien Grange
}}
{{Article
|Referiert=0
|Title=About the Expressive Power and Complexity of Order-Invariance with Two Variables
|To appear=0
|Year=2025
|Month=März
|Journal=Logical Methods in Computer Science
|Volume=21
|Number=1
|Pages=30:1--30:28
}}
{{Publikation Details
|Download=Lmcs-bbe-grange.pdf
|Projekt=DeciGUT
|Forschungsgruppe=Computational Logic
}}

Datei:Lmcs-bbe-grange.pdf

2025-03-31T07:49:42Z

Bartosz Bednarczyk:

Inproceedings3378

2024-10-22T05:16:58Z

Bartosz Bednarczyk:

{{Publikation Erster Autor
|ErsterAutorVorname=Bartosz
|ErsterAutorNachname=Bednarczyk
}}
{{Inproceedings
|Referiert=1
|Title=Data Complexity in Expressive Description Logics With Path Expressions
|To appear=0
|Year=2024
|Month=August
|Booktitle=Proceedings of the 33rd International Joint Conference on Artificial Intelligence, IJCAI 2024
|Pages=3241--3249
|Publisher=ijcai.org
}}
{{Publikation Details
|Abstract=We investigate the data complexity of the satisfiability problem for the very expressive description logic ZOIQ (a.k.a. ALCHb^self_regOIQ) over quasi-forests and establish its NP-completeness.
This completes the data complexity landscape for decidable fragments of ZOIQ, and reproves known results on decidable fragments of OWL2 (SR family).
Using the same technique, we establish coNExpTime-completeness (w.r.t. the combined complexity) of the entailment problem of rooted queries in ZIQ.
|Download=BBE-IJCAI-2024.pdf
|Link=https://www.ijcai.org/proceedings/2024/359
|Projekt=DeciGUT
|Forschungsgruppe=Computational Logic
}}

Bartosz Bednarczyk

2024-09-30T20:14:08Z

Bartosz Bednarczyk:

{{Mitarbeiter
|Vorname=Bartosz
|Nachname=Bednarczyk
|Forschungsgruppe=Computational Logic
|Stellung=Wissenschaftlicher Mitarbeiter
|Ehemaliger=1
|Telefon=+49 351 463 42665
|Email=bartosz.bednarczyk@tu-dresden.de
|Raum=APB 2031
|Bild=bart-personal-2.jpg
|Info=== About Me ==
I was a PHD student and a researcher at TU Dresden and at University of Wrocław, supervised jointly by Sebastian Rudolph (Dresden) and Emanuel Kieroński (Wrocław). Before joining TU Dresden I studied "Parisian Master of Research in Computer Science" at ENS Paris-Saclay, under the supervision of Stéphane Demri.

My works 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. More broadly, I'm interested in finite model theory. Since April 2019 I am employed in the ERC grant DeciGUT. Moreover, from September 2018 until September 2022 I was a principal investigator in my own Polish Ministry of Science and Higher Education grant titled "Logics with generalized counting quantifiers for data-aware processes and database systems".

One of my biggest passions is teaching. I actively contribute to an introductory logic course at the University of Wrocław (as a problem setter, organiser of exercise sessions, and supplementary lecturer). From time to time I also organise classes related to finite model theory (both in Wrocław and Dresden), so feel free to contact me if you are interested in doing some research projects (BSc/MSc/PHD) in related areas! At the beginning of 2022, I kick-started a teaching company and started teaching some classes in the XIV highschool in Wrocław.
|Info EN=== About Me ==
I was a PHD student and a researcher at TU Dresden and at University of Wrocław, supervised jointly by Sebastian Rudolph (Dresden) and Emanuel Kieroński (Wrocław). Before joining TU Dresden I studied "Parisian Master of Research in Computer Science" at ENS Paris-Saclay, under the supervision of Stéphane Demri.

My works 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. More broadly, I'm interested in finite model theory. Since April 2019 I am employed in the ERC grant DeciGUT. Moreover, from September 2018 until September 2022 I was a principal investigator in my own Polish Ministry of Science and Higher Education grant titled "Logics with generalized counting quantifiers for data-aware processes and database systems".

One of my biggest passions is teaching. I actively contribute to an introductory logic course at the University of Wrocław (as a problem setter, organiser of exercise sessions, and supplementary lecturer). From time to time I also organise classes related to finite model theory (both in Wrocław and Dresden), so feel free to contact me if you are interested in doing some research projects (BSc/MSc/PHD) in related areas! At the beginning of 2022, I kick-started a teaching company and started teaching some classes in the XIV highschool in Wrocław.
|DBLP=https://dblp.org/pers/hd/b/Bednarczyk:Bartosz
|Google Scholar=https://scholar.google.pl/citations?user=j7plXYcAAAAJ&hl=pl
|Alternative URI=https://bartoszjanbednarczyk.github.io/
|Publikationen anzeigen=1
|Abschlussarbeiten anzeigen=1
}}
{{Forschungsgebiet Auswahl
|Forschungsgebiet=Datenbanktheorie
}}
{{Forschungsgebiet Auswahl
|Forschungsgebiet=Modal- und Temporallogiken
}}
{{Forschungsgebiet Auswahl
|Forschungsgebiet=Existenzielle Regeln
}}
{{Forschungsgebiet Auswahl
|Forschungsgebiet=Wissensrepräsentation und logisches Schließen
}}
{{Forschungsgebiet Auswahl
|Forschungsgebiet=Beschreibungslogiken
}}

Piotr Ostropolski-Nalewaja

2024-08-14T09:22:44Z

Bartosz Bednarczyk:

{{Mitarbeiter
|Vorname=Piotr
|Nachname=Ostropolski-Nalewaja
|Akademischer Titel=Dr.
|Forschungsgruppe=Computational Logic
|Stellung=Wissenschaftlicher Mitarbeiter
|Ehemaliger=0
|Telefon=+48 504609291
|Email=piotr.ostropolski-nalewaja@tu-dresden.de
|Raum=APB 2031
|Bild=Piotr.png
|Info=I am a PhD student at the University of Wrocław and a researcher in the Computational Logic group at Technische Universität Dresden. I currently work within the ERC project DeciGUT, and my research interests concern topics within the fields of Logic, Database Theory, Knowledge Representation, and AI.
|Info EN=I am a PhD student at the University of Wrocław and a researcher in the Computational Logic group at Technische Universität Dresden. I currently work within the ERC project DeciGUT, and my research interests concern topics within the fields of Logic, Database Theory, Knowledge Representation, and AI.
|DBLP=https://dblp.org/pid/195/6032.html
|Publikationen anzeigen=1
|Abschlussarbeiten anzeigen=1
}}

Piotr Ostropolski-Nalewaja

2024-08-13T13:45:56Z

Bartosz Bednarczyk:

{{Mitarbeiter
|Vorname=Piotr
|Nachname=Ostropolski-Nalewaja
|Akademischer Titel=Dr
|Forschungsgruppe=Computational Logic
|Stellung=Wissenschaftlicher Mitarbeiter
|Ehemaliger=0
|Telefon=+48 504609291
|Email=piotr.ostropolski-nalewaja@tu-dresden.de
|Raum=APB 2031
|Bild=Piotr.png
|Info=I am a PhD student at the University of Wrocław and a researcher in the Computational Logic group at Technische Universität Dresden. I currently work within the ERC project DeciGUT, and my research interests concern topics within the fields of Logic, Database Theory, Knowledge Representation, and AI.
|Info EN=I am a PhD student at the University of Wrocław and a researcher in the Computational Logic group at Technische Universität Dresden. I currently work within the ERC project DeciGUT, and my research interests concern topics within the fields of Logic, Database Theory, Knowledge Representation, and AI.
|DBLP=https://dblp.org/pid/195/6032.html
|Publikationen anzeigen=1
|Abschlussarbeiten anzeigen=1
}}

Bartosz Bednarczyk

2024-08-09T03:12:48Z

Bartosz Bednarczyk:

{{Mitarbeiter
|Vorname=Bartosz
|Nachname=Bednarczyk
|Forschungsgruppe=Computational Logic
|Stellung=Wissenschaftlicher Mitarbeiter
|Ehemaliger=0
|Telefon=+49 351 463 42665
|Email=bartosz.bednarczyk@tu-dresden.de
|Raum=APB 2031
|Bild=bart-personal-2.jpg
|Info=== About Me ==
I was a PHD student and a researcher at TU Dresden and at University of Wrocław, supervised jointly by Sebastian Rudolph (Dresden) and Emanuel Kieroński (Wrocław). Before joining TU Dresden I studied "Parisian Master of Research in Computer Science" at ENS Paris-Saclay, under the supervision of Stéphane Demri.

My works 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. More broadly, I'm interested in finite model theory. Since April 2019 I am employed in the ERC grant DeciGUT. Moreover, from September 2018 until September 2022 I was a principal investigator in my own Polish Ministry of Science and Higher Education grant titled "Logics with generalized counting quantifiers for data-aware processes and database systems".

One of my biggest passions is teaching. I actively contribute to an introductory logic course at the University of Wrocław (as a problem setter, organiser of exercise sessions, and supplementary lecturer). From time to time I also organise classes related to finite model theory (both in Wrocław and Dresden), so feel free to contact me if you are interested in doing some research projects (BSc/MSc/PHD) in related areas! At the beginning of 2022, I kick-started a teaching company and started teaching some classes in the XIV highschool in Wrocław.
|Info EN=== About Me ==
I was a PHD student and a researcher at TU Dresden and at University of Wrocław, supervised jointly by Sebastian Rudolph (Dresden) and Emanuel Kieroński (Wrocław). Before joining TU Dresden I studied "Parisian Master of Research in Computer Science" at ENS Paris-Saclay, under the supervision of Stéphane Demri.

My works 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. More broadly, I'm interested in finite model theory. Since April 2019 I am employed in the ERC grant DeciGUT. Moreover, from September 2018 until September 2022 I was a principal investigator in my own Polish Ministry of Science and Higher Education grant titled "Logics with generalized counting quantifiers for data-aware processes and database systems".

One of my biggest passions is teaching. I actively contribute to an introductory logic course at the University of Wrocław (as a problem setter, organiser of exercise sessions, and supplementary lecturer). From time to time I also organise classes related to finite model theory (both in Wrocław and Dresden), so feel free to contact me if you are interested in doing some research projects (BSc/MSc/PHD) in related areas! At the beginning of 2022, I kick-started a teaching company and started teaching some classes in the XIV highschool in Wrocław.
|DBLP=https://dblp.org/pers/hd/b/Bednarczyk:Bartosz
|Google Scholar=https://scholar.google.pl/citations?user=j7plXYcAAAAJ&hl=pl
|Alternative URI=https://bartoszjanbednarczyk.github.io/
|Publikationen anzeigen=1
|Abschlussarbeiten anzeigen=1
}}
{{Forschungsgebiet Auswahl
|Forschungsgebiet=Datenbanktheorie
}}
{{Forschungsgebiet Auswahl
|Forschungsgebiet=Modal- und Temporallogiken
}}
{{Forschungsgebiet Auswahl
|Forschungsgebiet=Existenzielle Regeln
}}
{{Forschungsgebiet Auswahl
|Forschungsgebiet=Wissensrepräsentation und logisches Schließen
}}
{{Forschungsgebiet Auswahl
|Forschungsgebiet=Beschreibungslogiken
}}

Bartosz Bednarczyk

2024-08-09T03:10:43Z

Bartosz Bednarczyk:

{{Mitarbeiter
|Vorname=Bartosz
|Nachname=Bednarczyk
|Forschungsgruppe=Computational Logic
|Stellung=Wissenschaftlicher Mitarbeiter
|Ehemaliger=0
|Telefon=+49 351 463 42665
|Email=bartosz.bednarczyk@tu-dresden.de
|Raum=APB 2031
|Bild=bart-personal-2.jpg
|Info=== About Me ==
I am a PHD student and a researcher at TU Dresden and at University of Wrocław, supervised jointly by Sebastian Rudolph (Dresden) and Emanuel Kieroński (Wrocław). Before joining TU Dresden I studied "Parisian Master of Research in Computer Science" at ENS Paris-Saclay, under the supervision of Stéphane Demri.

My works 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. More broadly, I'm interested in finite model theory. Since April 2019 I am employed in the ERC grant DeciGUT. Moreover, from September 2018 until September 2022 I was a principal investigator in my own Polish Ministry of Science and Higher Education grant titled "Logics with generalized counting quantifiers for data-aware processes and database systems".

One of my biggest passions is teaching. I actively contribute to an introductory logic course at the University of Wrocław (as a problem setter, organiser of exercise sessions, and supplementary lecturer). From time to time I also organise classes related to finite model theory (both in Wrocław and Dresden), so feel free to contact me if you are interested in doing some research projects (BSc/MSc/PHD) in related areas! At the beginning of 2022, I kick-started a teaching company and started teaching some classes in the XIV highschool in Wrocław.
|Info EN=== About Me ==
I am a PHD student and a researcher at TU Dresden and at University of Wrocław, supervised jointly by Sebastian Rudolph (Dresden) and Emanuel Kieroński (Wrocław). Before joining TU Dresden I studied "Parisian Master of Research in Computer Science" at ENS Paris-Saclay, under the supervision of Stéphane Demri.

My works 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. More broadly, I'm interested in finite model theory. Since April 2019 I am employed in the ERC grant DeciGUT. Moreover, from September 2018 until September 2022 I was a principal investigator in my own Polish Ministry of Science and Higher Education grant titled "Logics with generalized counting quantifiers for data-aware processes and database systems".

One of my biggest passions is teaching. I actively contribute to an introductory logic course at the University of Wrocław (as a problem setter, organiser of exercise sessions, and supplementary lecturer). From time to time I also organise classes related to finite model theory (both in Wrocław and Dresden), so feel free to contact me if you are interested in doing some research projects (BSc/MSc/PHD) in related areas! At the beginning of 2022, I kick-started a teaching company and started teaching some classes in the XIV highschool in Wrocław.
|DBLP=https://dblp.org/pers/hd/b/Bednarczyk:Bartosz
|Google Scholar=https://scholar.google.pl/citations?user=j7plXYcAAAAJ&hl=pl
|Alternative URI=https://bartoszjanbednarczyk.github.io/
|Publikationen anzeigen=1
|Abschlussarbeiten anzeigen=1
}}
{{Forschungsgebiet Auswahl
|Forschungsgebiet=Datenbanktheorie
}}
{{Forschungsgebiet Auswahl
|Forschungsgebiet=Modal- und Temporallogiken
}}
{{Forschungsgebiet Auswahl
|Forschungsgebiet=Existenzielle Regeln
}}
{{Forschungsgebiet Auswahl
|Forschungsgebiet=Wissensrepräsentation und logisches Schließen
}}
{{Forschungsgebiet Auswahl
|Forschungsgebiet=Beschreibungslogiken
}}

Bartosz Bednarczyk

2024-08-09T03:09:43Z

Bartosz Bednarczyk:

{{Mitarbeiter
|Vorname=Bartosz
|Nachname=Bednarczyk
|Forschungsgruppe=Computational Logic
|Stellung=Wissenschaftlicher Mitarbeiter
|Ehemaliger=0
|Telefon=+49 351 463 42665
|Email=bartosz.bednarczyk@tu-dresden.de
|Raum=APB 2031
|Bild=bart-resized.png bart-personal-2.jpg
|Info=== About Me ==
I am a PHD student and a researcher at TU Dresden and at University of Wrocław, supervised jointly by Sebastian Rudolph (Dresden) and Emanuel Kieroński (Wrocław). Before joining TU Dresden I studied "Parisian Master of Research in Computer Science" at ENS Paris-Saclay, under the supervision of Stéphane Demri.

My works 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. More broadly, I'm interested in finite model theory. Since April 2019 I am employed in the ERC grant DeciGUT. Moreover, from September 2018 until September 2022 I was a principal investigator in my own Polish Ministry of Science and Higher Education grant titled "Logics with generalized counting quantifiers for data-aware processes and database systems".

One of my biggest passions is teaching. I actively contribute to an introductory logic course at the University of Wrocław (as a problem setter, organiser of exercise sessions, and supplementary lecturer). From time to time I also organise classes related to finite model theory (both in Wrocław and Dresden), so feel free to contact me if you are interested in doing some research projects (BSc/MSc/PHD) in related areas! At the beginning of 2022, I kick-started a teaching company and started teaching some classes in the XIV highschool in Wrocław.
|Info EN=== About Me ==
I am a PHD student and a researcher at TU Dresden and at University of Wrocław, supervised jointly by Sebastian Rudolph (Dresden) and Emanuel Kieroński (Wrocław). Before joining TU Dresden I studied "Parisian Master of Research in Computer Science" at ENS Paris-Saclay, under the supervision of Stéphane Demri.

My works 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. More broadly, I'm interested in finite model theory. Since April 2019 I am employed in the ERC grant DeciGUT. Moreover, from September 2018 until September 2022 I was a principal investigator in my own Polish Ministry of Science and Higher Education grant titled "Logics with generalized counting quantifiers for data-aware processes and database systems".

One of my biggest passions is teaching. I actively contribute to an introductory logic course at the University of Wrocław (as a problem setter, organiser of exercise sessions, and supplementary lecturer). From time to time I also organise classes related to finite model theory (both in Wrocław and Dresden), so feel free to contact me if you are interested in doing some research projects (BSc/MSc/PHD) in related areas! At the beginning of 2022, I kick-started a teaching company and started teaching some classes in the XIV highschool in Wrocław.
|DBLP=https://dblp.org/pers/hd/b/Bednarczyk:Bartosz
|Google Scholar=https://scholar.google.pl/citations?user=j7plXYcAAAAJ&hl=pl
|Alternative URI=https://bartoszjanbednarczyk.github.io/
|Publikationen anzeigen=1
|Abschlussarbeiten anzeigen=1
}}
{{Forschungsgebiet Auswahl
|Forschungsgebiet=Datenbanktheorie
}}
{{Forschungsgebiet Auswahl
|Forschungsgebiet=Modal- und Temporallogiken
}}
{{Forschungsgebiet Auswahl
|Forschungsgebiet=Existenzielle Regeln
}}
{{Forschungsgebiet Auswahl
|Forschungsgebiet=Wissensrepräsentation und logisches Schließen
}}
{{Forschungsgebiet Auswahl
|Forschungsgebiet=Beschreibungslogiken
}}

Datei:Bart-personal-2.jpg

2024-08-09T03:09:39Z

Bartosz Bednarczyk:

Phdthesis3021

2024-07-19T18:13:28Z

Bartosz Bednarczyk:

{{Publikation Erster Autor
|ErsterAutorVorname=Bartosz
|ErsterAutorNachname=Bednarczyk
}}
{{Phdthesis
|Title=Database-Inspired Reasoning Problems in Description Logics With Path Expressions
|Date=2024/06/25
|School=Technischen Universitat Dresden
}}
{{Publikation Details
|Download=BBE-thesis-final.pdf
|Slides=Bednarczyk-PhD-Defense-Slides.pdf
|Link=https://nbn-resolving.org/urn:nbn:de:bsz:14-qucosa2-925378
|Projekt=DeciGUT
|Forschungsgruppe=Computational Logic
}}

Phdthesis3021

2024-06-27T13:08:02Z

Bartosz Bednarczyk:

{{Publikation Erster Autor
|ErsterAutorVorname=Bartosz
|ErsterAutorNachname=Bednarczyk
}}
{{Phdthesis
|Title=Database-Inspired Reasoning Problems in Description Logics With Path Expressions
|Date=2024/06/25
|School=Technischen Universitat Dresden
}}
{{Publikation Details
|Download=BBE-thesis-final.pdf
|Slides=Bednarczyk-PhD-Defense-Slides.pdf
|Projekt=DeciGUT
|Forschungsgruppe=Computational Logic
}}

Datei:BBE-thesis-final.pdf

2024-06-27T13:07:24Z

Bartosz Bednarczyk:

Phdthesis3021

2024-06-25T06:18:33Z

Bartosz Bednarczyk:

{{Publikation Erster Autor
|ErsterAutorVorname=Bartosz
|ErsterAutorNachname=Bednarczyk
}}
{{Phdthesis
|Title=Database-Inspired Reasoning Problems in Description Logics With Path Expressions
|Date=2024/06/25
|School=Technischen Universitat Dresden
}}
{{Publikation Details
|Download=thesis-BBE-v1.pdf
|Slides=Bednarczyk-PhD-Defense-Slides.pdf
|Projekt=DeciGUT
|Forschungsgruppe=Computational Logic
}}

Datei:Bednarczyk-PhD-Defense-Slides.pdf

2024-06-25T06:18:30Z

Bartosz Bednarczyk:

PhD Defense of Bartosz Bednarczyk

2024-06-25T03:28:07Z

Bartosz Bednarczyk:

{{Veranstaltung
|Titel EN=PhD Defense of Bartosz Bednarczyk
|Beschreibung EN=The public defence of the doctoral dissertation titled "Database-Inspired Reasoning Problems in Description Logics With Path Expressions" by Bartosz Bednarczyk (supervised by prof. Sebastian Rudolph and prof. Emanuel Kieroński) will take place on the 25th of June at 01:30 p.m. (APB 1004).

The draft of the thesis is available here: https://iccl.inf.tu-dresden.de/web/Phdthesis3021/en

The defence starts at 13:30 in APB 1004. It will also be streamed via Zoom.
https://tu-dresden.zoom-x.de/j/65979593638?pwd=LVdbGbkGy2aQnFijO28tqYkfshU23d.1
|Veranstaltungsart=Vortrag
|Start=2024/06/25 13:30:00
|Ende=2024/06/25 15:00:00
|Raum=APB 1004
|Vortragender=Bartosz Bednarczyk
|PDF=thesis-BBE-v1.pdf
|Forschungsgruppe=Computational Logic
|In News anzeigen=1
}}

PhD Defense of Bartosz Bednarczyk/en

2024-06-18T11:41:14Z

Bartosz Bednarczyk: Page created automatically by parser function on page PhD Defense of Bartosz Bednarczyk

PhD Defense of Bartosz Bednarczyk

2024-06-18T11:41:14Z

Bartosz Bednarczyk: Die Seite wurde neu angelegt: „{{Veranstaltung |Titel EN=PhD Defense of Bartosz Bednarczyk |Beschreibung EN=The public defence of the doctoral dissertation titled "Database-Inspired Reasoning Problems in Description Logics With Path Expressions" by Bartosz Bednarczyk (supervised by prof. Sebastian Rudolph and prof. Emanuel Kieroński) will take place on the 25th of June at 01:30 p.m. (APB 1004). The draft of the thesis is available here: https://iccl.inf.tu-dresden.de/web/Phdthesi…“

{{Veranstaltung
|Titel EN=PhD Defense of Bartosz Bednarczyk
|Beschreibung EN=The public defence of the doctoral dissertation titled "Database-Inspired Reasoning Problems in Description Logics With Path Expressions" by Bartosz Bednarczyk (supervised by prof. Sebastian Rudolph and prof. Emanuel Kieroński) will take place on the 25th of June at 01:30 p.m. (APB 1004).

The draft of the thesis is available here: https://iccl.inf.tu-dresden.de/web/Phdthesis3021/en

The defence starts at 13:30 in APB 1004. It will also be streamed via Zoom.
[ZOOM LINK WILL APPEAR HERE SHORTLY BEFORE THE DEFENCE]
|Veranstaltungsart=Vortrag
|Start=2024/06/25 13:30:00
|Ende=2024/06/25 15:00:00
|Raum=APB 1004
|Vortragender=Bartosz Bednarczyk
|PDF=thesis-BBE-v1.pdf
|Forschungsgruppe=Computational Logic
|In News anzeigen=1
}}

Phdthesis3021/en

2024-06-18T10:17:36Z

Bartosz Bednarczyk: Page created automatically by parser function on page Phdthesis3021

#REDIRECT [[Phdthesis3021]]

Phdthesis3021

2024-06-18T10:17:36Z

Bartosz Bednarczyk: Die Seite wurde neu angelegt: „{{Publikation Erster Autor |ErsterAutorVorname=Bartosz |ErsterAutorNachname=Bednarczyk }} {{Phdthesis |Title=Database-Inspired Reasoning Problems in Description Logics With Path Expressions |Date=2024/06/25 |School=Technischen Universitat Dresden }} {{Publikation Details |Download=thesis-BBE-v1.pdf |Projekt=DeciGUT |Forschungsgruppe=Computational Logic }}“

{{Publikation Erster Autor
|ErsterAutorVorname=Bartosz
|ErsterAutorNachname=Bednarczyk
}}
{{Phdthesis
|Title=Database-Inspired Reasoning Problems in Description Logics With Path Expressions
|Date=2024/06/25
|School=Technischen Universitat Dresden
}}
{{Publikation Details
|Download=thesis-BBE-v1.pdf
|Projekt=DeciGUT
|Forschungsgruppe=Computational Logic
}}

Datei:Thesis-BBE-v1.pdf

2024-06-18T10:15:56Z

Bartosz Bednarczyk:

Data Complexity in Expressive Description Logics With Path Expressions

2024-06-13T08:53:09Z

Bartosz Bednarczyk:

{{Veranstaltung
|Titel EN=Data Complexity in Expressive Description Logics With Path Expressions
|Beschreibung EN=In my recent IJCAI paper I established NP-completeness of the satisfiability problem (w.r.t. the data complexity) of the maximal known decidable fragments ZIQ, ZOQ, and ZOI of the very description logic ZOIQ (a.k.a. ALCHb^self_regOIQ).
The proof uniformly deals with these three logics, by considering the DL ZOIQ but over forest-like structures dubbed quasi-forests.
During the talk, I will give a high-level overview of the proof, and discuss its main ingredients and challenges.

https://bbb.tu-dresden.de/rooms/n5w-ghp-qoq-kts/join
|Veranstaltungsart=Vortrag
|Start=2024/06/13 11:00:00
|Ende=2024/06/13 12:00:00
|Raum=APB 3027
|Vortragender=Bartosz Bednarczyk
|Forschungsgruppe=Computational Logic
|Event series=Research Seminar Logic and AI
|In News anzeigen=1
}}

Inproceedings3378

2024-05-19T12:40:17Z

Bartosz Bednarczyk:

{{Publikation Erster Autor
|ErsterAutorVorname=Bartosz
|ErsterAutorNachname=Bednarczyk
}}
{{Inproceedings
|Referiert=1
|Title=Data Complexity in Expressive Description Logics With Path Expressions
|To appear=1
|Year=2024
|Month=August
|Booktitle=Proceedings of the 33rd International Joint Conference on Artificial Intelligence, IJCAI 2024
|Publisher=ijcai.org
}}
{{Publikation Details
|Abstract=We investigate the data complexity of the satisfiability problem for the very expressive description logic ZOIQ (a.k.a. ALCHb^self_regOIQ) over quasi-forests and establish its NP-completeness.
This completes the data complexity landscape for decidable fragments of ZOIQ, and reproves known results on decidable fragments of OWL2 (SR family).
Using the same technique, we establish coNExpTime-completeness (w.r.t. the combined complexity) of the entailment problem of rooted queries in ZIQ.
|Download=BBE-IJCAI-2024.pdf
|Projekt=DeciGUT
|Forschungsgruppe=Computational Logic
}}

Datei:BBE-IJCAI-2024.pdf

2024-05-19T12:40:09Z

Bartosz Bednarczyk:

Article3097

2024-05-14T17:10:05Z

Bartosz Bednarczyk:

{{Publikation Erster Autor
|ErsterAutorVorname=Bartosz
|ErsterAutorNachname=Bednarczyk
}}
{{Article
|Referiert=0
|Title=Exploring Non-Regular Extensions of Propositional Dynamic Logic with Description-Logics Features.
|To appear=0
|Year=2024
|Month=Mai
|Journal=Logical Methods in Computer Science
|Volume=20
|Number=2
|Pages=7:1–7:31
}}
{{Publikation Details
|Abstract=We investigate the impact of non-regular path expressions on the decidability of satisfiability checking and querying in description logics extending ALC. Our primary objects of interest are ALCreg and ALCvpl, the extensions of with path expressions employing, respectively, regular and visibly-pushdown languages. The first one, ALCreg, is a notational variant of the well-known Propositional Dynamic Logic of Fischer and Ladner. The second one, ALCvpl, was introduced and investigated by Loding and Serre in 2007. The logic ALCvpl generalises many known decidable non-regular extensions of ALCreg.
We provide a series of undecidability results. First, we show that decidability of the concept satisfiability problem for ALCvpl is lost upon adding the seemingly innocent Self operator. Second, we establish undecidability for the concept satisfiability problem for ALCvpl extended with nominals. Interestingly, our undecidability proof relies only on one single non-regular (visibly-pushdown) language, namely on [[r#s# := { r^n s^n | n in N }]] for fixed role names r and s. Finally, in contrast to the classical database setting, we establish undecidability of query entailment for queries involving non-regular atoms from r#s#, already in the case of ALC-TBoxes.
|Download=2307.09913.pdf
|Link=https://lmcs.episciences.org/13581
|Projekt=DeciGUT
|Forschungsgruppe=Computational Logic
}}

Datei:2307.09913.pdf

2024-05-14T17:09:52Z

Bartosz Bednarczyk:

Article3097/en

2024-04-17T08:53:30Z

Bartosz Bednarczyk: Page created automatically by parser function on page Article3097

#REDIRECT [[Article3097]]

Article3097

2024-04-17T08:53:30Z

Bartosz Bednarczyk: Die Seite wurde neu angelegt: „{{Publikation Erster Autor |ErsterAutorVorname=Bartosz |ErsterAutorNachname=Bednarczyk }} {{Article |Referiert=0 |Title=Exploring Non-Regular Extensions of Propositional Dynamic Logic with Description-Logics Features. |To appear=1 |Year=2024 |Month=Mai |Journal=Logical Methods in Computer Science }} {{Publikation Details |Abstract=We investigate the impact of non-regular path expressions on the decidability of satisfiability checking and querying in descr…“

{{Publikation Erster Autor
|ErsterAutorVorname=Bartosz
|ErsterAutorNachname=Bednarczyk
}}
{{Article
|Referiert=0
|Title=Exploring Non-Regular Extensions of Propositional Dynamic Logic with Description-Logics Features.
|To appear=1
|Year=2024
|Month=Mai
|Journal=Logical Methods in Computer Science
}}
{{Publikation Details
|Abstract=We investigate the impact of non-regular path expressions on the decidability of satisfiability checking and querying in description logics extending ALC. Our primary objects of interest are ALCreg and ALCvpl, the extensions of with path expressions employing, respectively, regular and visibly-pushdown languages. The first one, ALCreg, is a notational variant of the well-known Propositional Dynamic Logic of Fischer and Ladner. The second one, ALCvpl, was introduced and investigated by Loding and Serre in 2007. The logic ALCvpl generalises many known decidable non-regular extensions of ALCreg.
We provide a series of undecidability results. First, we show that decidability of the concept satisfiability problem for ALCvpl is lost upon adding the seemingly innocent Self operator. Second, we establish undecidability for the concept satisfiability problem for ALCvpl extended with nominals. Interestingly, our undecidability proof relies only on one single non-regular (visibly-pushdown) language, namely on [[r#s# := { r^n s^n | n in N }]] for fixed role names r and s. Finally, in contrast to the classical database setting, we establish undecidability of query entailment for queries involving non-regular atoms from r#s#, already in the case of ALC-TBoxes.
|Projekt=DeciGUT
|Forschungsgruppe=Computational Logic
}}

Inproceedings3378/en

2024-04-17T08:49:15Z

Bartosz Bednarczyk: Page created automatically by parser function on page Inproceedings3378

#REDIRECT [[Inproceedings3378]]

Inproceedings3378

2024-04-17T08:49:14Z

Bartosz Bednarczyk: Die Seite wurde neu angelegt: „{{Publikation Erster Autor |ErsterAutorVorname=Bartosz |ErsterAutorNachname=Bednarczyk }} {{Inproceedings |Referiert=1 |Title=Data Complexity in Expressive Description Logics With Path Expressions |To appear=1 |Year=2024 |Month=August |Booktitle=Proceedings of the 33rd International Joint Conference on Artificial Intelligence, IJCAI 2024 |Publisher=ijcai.org }} {{Publikation Details |Abstract=We investigate the data complexity of the satisfiability proble…“

{{Publikation Erster Autor
|ErsterAutorVorname=Bartosz
|ErsterAutorNachname=Bednarczyk
}}
{{Inproceedings
|Referiert=1
|Title=Data Complexity in Expressive Description Logics With Path Expressions
|To appear=1
|Year=2024
|Month=August
|Booktitle=Proceedings of the 33rd International Joint Conference on Artificial Intelligence, IJCAI 2024
|Publisher=ijcai.org
}}
{{Publikation Details
|Abstract=We investigate the data complexity of the satisfiability problem for the very expressive description logic ZOIQ (a.k.a. ALCHb^self_regOIQ) over quasi-forests and establish its NP-completeness.
This completes the data complexity landscape for decidable fragments of ZOIQ, and reproves known results on decidable fragments of OWL2 (SR family).
Using the same technique, we establish coNExpTime-completeness (w.r.t. the combined complexity) of the entailment problem of rooted queries in ZIQ.
|Projekt=DeciGUT
|Forschungsgruppe=Computational Logic
}}

Article3095

2023-11-16T08:44:56Z

Bartosz Bednarczyk:

{{Publikation Erster Autor
|ErsterAutorVorname=Bartosz
|ErsterAutorNachname=Bednarczyk
|FurtherAuthors=Sebastian Rudolph
}}
{{Article
|Referiert=0
|Title=How to Tell Easy from Hard: Complexities of Conjunctive Query Entailment in Extensions of ALC
|To appear=0
|Year=2023
|Month=November
|Journal=Journal of Artificial Intelligence Research
|Volume=78
|Pages=85--458
}}
{{Publikation Details
|Bild=JAIR-cover.png
|Abstract=It is commonly known that the conjunctive query entailment problem for certain ex- tensions of (the well-known ontology language) ALC is computationally harder than their knowledge base satisfiability problem while for others the complexities coincide, both under the standard and the finite-model semantics. We expose a uniform principle behind this divide by identifying a wide class of (finitely) locally-forward description logics, for which we prove that (finite) query entailment problem can be solved by a reduction to exponentially many calls of the (finite) knowledge base satisfiability problem. Consequently, our algorithm yields tight ExpTime upper bounds for locally-forward logics with ExpTime-complete knowledge base satisfiability problem, including logics between ALC and μALCHbregQ (and more), as well as ALCSCC with global cardinality constraints, for which the complexity of querying remained open. Moreover, to make our technique applicable in future research, we provide easy-to-check sufficient conditions for a logic to be locally-forward based on several novel versions of the model-theoretic notion of unravellings.
Together with existing results, this provides a nearly complete classification of the “benign” vs. “malign” primitive modelling features extending ALC, missing out only the Self operator. We then show a rather surprising result, namely that the conjunctive entailment problem for ALCSelf is exponentially harder than for ALC. This places the seemingly innocuous Self operator among the “malign” modelling features, like inverses, transitivity or nominals.
|Download=BBESRU2023JAIR-final.pdf
|Link=https://jair.org/index.php/jair/article/view/14482
|DOI Name=https://doi.org/10.1613/jair.1.14482
|Projekt=DeciGUT
|Forschungsgruppe=Computational Logic
}}
{{Forschungsgebiet Auswahl
|Forschungsgebiet=Datenbanktheorie
}}
{{Forschungsgebiet Auswahl
|Forschungsgebiet=Beweistheorie
}}
{{Forschungsgebiet Auswahl
|Forschungsgebiet=Beschreibungslogiken
}}

Datei:BBESRU2023JAIR-final.pdf

2023-11-16T08:44:51Z

Bartosz Bednarczyk:

Inproceedings3359

2023-09-29T06:36:39Z

Bartosz Bednarczyk:

{{Publikation Erster Autor
|ErsterAutorVorname=Bartosz
|ErsterAutorNachname=Bednarczyk
}}
{{Inproceedings
|Referiert=1
|Title=Beyond ALCreg: Exploring Non-Regular Extensions of PDL with Description Logics Features
|To appear=1
|Year=2023
|Month=September
|Booktitle=Proceedings of the 18th Edition of the European Conference on Logics in Artificial Intelligence (JELIA 2023)
|Pages=289--305
|Publisher=Springer International Publishing
|Editor=Sarah Alice Gaggl, Maria Vanina Martinez, Magdalena Ortiz
|Series=Logics in Artificial Intelligence
}}
{{Publikation Details
|Abstract=We investigate the impact of non-regular path expressions on the decidability of satisfiability checking and querying in description logics. Our primary object of interest is ALCvpl, an extension of ALC with path expressions using visibly-pushdown languages, which was shown to be decidable by Löding et al. in 2007. The paper present a series of undecidability results. We prove undecidability of ALCvpl with the seemingly innocent Self operator. Then, We also consider the simplest non-regular (visibly-pushdown) language r#s# := {r^n s^n : n \in N}. We establish undecidability of the concept satisfiability problem for ALCreg extended with nominals and r#s#, as well as of the query entailment problem for ALC-TBoxes, where such non-regular atoms are present in queries.
|ISBN=978-3-031-43619-2
|Download=BBE-JELIA23-FINAL.pdf
|Link=https://link.springer.com/chapter/10.1007/978-3-031-43619-2_21
|DOI Name=10.1007/978-3-031-43619-2_21
|Projekt=DeciGUT
|Forschungsgruppe=Computational Logic
}}

Article3095

2023-09-24T18:20:42Z

Bartosz Bednarczyk:

{{Publikation Erster Autor
|ErsterAutorVorname=Bartosz
|ErsterAutorNachname=Bednarczyk
|FurtherAuthors=Sebastian Rudolph
}}
{{Article
|Referiert=0
|Title=How to Tell Easy from Hard: Complexity of Conjunctive Query Entailment in Extensions of ALC
|To appear=1
|Year=2023
|Journal=Journal of Artificial Intelligence Research
}}
{{Publikation Details
|Bild=JAIR-cover.png
|Abstract=It is commonly known that the conjunctive query entailment problem for certain ex- tensions of (the well-known ontology language) ALC is computationally harder than their knowledge base satisfiability problem while for others the complexities coincide, both under the standard and the finite-model semantics. We expose a uniform principle behind this divide by identifying a wide class of (finitely) locally-forward description logics, for which we prove that (finite) query entailment problem can be solved by a reduction to exponentially many calls of the (finite) knowledge base satisfiability problem. Consequently, our algorithm yields tight ExpTime upper bounds for locally-forward logics with ExpTime-complete knowledge base satisfiability problem, including logics between ALC and μALCHbregQ (and more), as well as ALCSCC with global cardinality constraints, for which the complexity of querying remained open. Moreover, to make our technique applicable in future research, we provide easy-to-check sufficient conditions for a logic to be locally-forward based on several novel versions of the model-theoretic notion of unravellings.
Together with existing results, this provides a nearly complete classification of the “benign” vs. “malign” primitive modelling features extending ALC, missing out only the Self operator. We then show a rather surprising result, namely that the conjunctive entailment problem for ALCSelf is exponentially harder than for ALC. This places the seemingly innocuous Self operator among the “malign” modelling features, like inverses, transitivity or nominals.
|Download=BBE-SR-JAIR2023.pdf
|Projekt=DeciGUT
|Forschungsgruppe=Computational Logic
}}
{{Forschungsgebiet Auswahl
|Forschungsgebiet=Datenbanktheorie
}}
{{Forschungsgebiet Auswahl
|Forschungsgebiet=Beweistheorie
}}
{{Forschungsgebiet Auswahl
|Forschungsgebiet=Beschreibungslogiken
}}

Datei:BBE-SR-JAIR2023.pdf

2023-09-24T18:20:17Z

Bartosz Bednarczyk:

Article3095/en

2023-09-23T21:35:06Z

Bartosz Bednarczyk: Page created automatically by parser function on page Article3095

#REDIRECT [[Article3095]]

Article3095

2023-09-23T21:35:05Z

Bartosz Bednarczyk: Die Seite wurde neu angelegt: „{{Publikation Erster Autor |ErsterAutorVorname=Bartosz |ErsterAutorNachname=Bednarczyk |FurtherAuthors=Sebastian Rudolph }} {{Article |Referiert=0 |Title=How t…“

{{Publikation Erster Autor
|ErsterAutorVorname=Bartosz
|ErsterAutorNachname=Bednarczyk
|FurtherAuthors=Sebastian Rudolph
}}
{{Article
|Referiert=0
|Title=How to Tell Easy from Hard: Complexity of Conjunctive Query Entailment in Extensions of ALC
|To appear=1
|Year=2023
|Journal=Journal of Artificial Intelligence Research
}}
{{Publikation Details
|Bild=JAIR-cover.png
|Abstract=It is commonly known that the conjunctive query entailment problem for certain ex- tensions of (the well-known ontology language) ALC is computationally harder than their knowledge base satisfiability problem while for others the complexities coincide, both under the standard and the finite-model semantics. We expose a uniform principle behind this divide by identifying a wide class of (finitely) locally-forward description logics, for which we prove that (finite) query entailment problem can be solved by a reduction to exponentially many calls of the (finite) knowledge base satisfiability problem. Consequently, our algorithm yields tight ExpTime upper bounds for locally-forward logics with ExpTime-complete knowledge base satisfiability problem, including logics between ALC and μALCHbregQ (and more), as well as ALCSCC with global cardinality constraints, for which the complexity of querying remained open. Moreover, to make our technique applicable in future research, we provide easy-to-check sufficient conditions for a logic to be locally-forward based on several novel versions of the model-theoretic notion of unravellings.
Together with existing results, this provides a nearly complete classification of the “benign” vs. “malign” primitive modelling features extending ALC, missing out only the Self operator. We then show a rather surprising result, namely that the conjunctive entailment problem for ALCSelf is exponentially harder than for ALC. This places the seemingly innocuous Self operator among the “malign” modelling features, like inverses, transitivity or nominals.
|Projekt=DeciGUT
|Forschungsgruppe=Computational Logic
}}
{{Forschungsgebiet Auswahl
|Forschungsgebiet=Datenbanktheorie
}}
{{Forschungsgebiet Auswahl
|Forschungsgebiet=Beweistheorie
}}
{{Forschungsgebiet Auswahl
|Forschungsgebiet=Beschreibungslogiken
}}

News88

2023-07-21T09:08:58Z

Bartosz Bednarczyk:

{{Neuigkeit
|Titel DE=ICCL feiert großen Erfolg mit sieben angenommenen Beiträgen bei KR und JELIA 2023
|Titel EN=ICCL Researchers Achieve Outstanding Success with Seven Accepted Papers at Renowned KR and JELIA Conferences in 2023
|Beschreibung DE=<p>Jedes Jahr konkurrieren Tausende Forscher:innen weltweit um die Möglichkeit, ihre neusten Arbeiten auf einer renommierten Konferenz vorstellen zu dürfen. Bei hoch angesehenen Konferenzen ist der Auswahlprozess dabei in der Regel besonders streng. Damit die eigene Arbeit akzeptiert wird, müssen Forschungsbeiträge nicht nur innovativ sein und eine hohe Qualität aufweisen, sondern auch in den jeweiligen Communities Anklang finden und einen bedeutenden Beitrag leisten.</p>

<p>Zu den führenden Konferenzen in den Bereichen Künstliche Intelligenz und Informatik im Allgemeinen zählen hierbei die [https://kr.org/KR2023/ International Conference on Principles of Knowledge Representation and Reasoning (KR)] sowie die [https://jelia2023.inf.tu-dresden.de/ European Conference on Logics in Artificial Intelligence (JELIA)]. Wissenschaftler:innen des [https://iccl.inf.tu-dresden.de/ International Center For Computational Logic (ICCL)] ist es gelungen drei ihrer Beiträge bei der [https://kr.org/KR2023/ KR 2023] und vier bei der [https://jelia2023.inf.tu-dresden.de/ JELIA 2023] akzeptiert zu bekommen. Darüber hinaus sind Forscher:innen des ICCL auch in zahlreichen anderen Konferenzen und Workshops vertreten.</p>

<p>Wir gratulieren unseren Kollegen zu ihrer bedeutenden Leistung und freuen uns darauf, auch in Zukunft noch weitere ihrerer hervorragenden Arbeiten lesen zu können.</p>

Die [https://kr.org/KR2023/ KR'23] hat folgende Beiträge des ICCL akzeptiert:
<div>
[[Lukas Gerlach]] and [https://www-sop.inria.fr/members/David.Carral/ David Carral].
[https://iccl.inf.tu-dresden.de/web/Inproceedings3353 Do Repeat Yourself: Understanding Sufficient Conditions for Restricted Chase Non-Termination]
</div>
<div>
[https://www.inf.unibz.it/~gigante/ Nicola Gigante], [[Lucía Gómez Álvarez]] and [https://iccl.inf.tu-dresden.de/web/Tim_Lyon/ Tim S. Lyon].
[https://arxiv.org/abs/2304.14243 Standpoint Linear Temporal Logic]
</div>
<div>
[https://iccl.inf.tu-dresden.de/web/Tim_Lyon/ Tim S. Lyon] and [[Piotr Ostropolski-Nalewaja]].
[https://arxiv.org/abs/2306.02521 Connecting Proof Theory and Knowledge Representation: Sequent Calculi and the Chase with Existential Rules]
</div>

Die für [https://jelia2023.inf.tu-dresden.de/ JELIA'23] angenommenen Arbeiten sind:
<div>
[[Bartosz Bednarczyk]].
Beyond ALCreg: Exploring Non-Regular Extensions of PDL with Description Logics Features"
</div>
<div>
[https://igorcsc.github.io/ Igor de Camargo E Souza Câmara] and [[Anni-Yasmin Turhan]].
Deciding Subsumption in Defeasible ELI⊥ with Typicality Models
</div>
<div>
[https://iccl.inf.tu-dresden.de/web/Tim_Lyon/ Tim S. Lyon] and [[Sebastian Rudolph]].
Derivation-Graph-Based Characterizations of Decidable Existential Rule Sets
</div>
<div>
[[Sergei Obiedkov]] and [https://www.informatik.fb2.frankfurt-university.de/~sertkaya/ Barış Sertkaya].
Computing Stable Extensions of Argumentation Frameworks using Formal Concept Analysis
</div>

Andere Beiträge:
<div>
Kees van Berkel, [https://iccl.inf.tu-dresden.de/web/Tim_Lyon/ Tim S. Lyon] and [https://philosophy.ceu.edu/people/matteo-pascucci-0 Matteo Pascucci].
[https://arxiv.org/abs/2209.02287 A Logical Analysis of Instrumentality Judgements: Means-End Relations in the Context of Experience and Expectations]
</div>
<div>
[[Alex Ivliev]], [[Stefan Ellmauthaler]], [[Lukas Gerlach]], [[Maximilian Marx]], [[Matthias Meißner]], [[Simon Meusel]] and [[Markus Krötzsch]].
[https://iccl.inf.tu-dresden.de/web/Inproceedings3354 Nemo: First Glimpse of a New Rule Engine]
</div>
<div>
[[Jonas Karge]].
[https://iccl.inf.tu-dresden.de/web/Article3091 Second-order Confidence in Supervaluationism]
</div>
<div>
[[Jonas Karge]].
Voting for Bins: Integrating Imprecise Probabilistic Beliefs into the Condorcet Jury Theorem
</div>
<div>
[https://iccl.inf.tu-dresden.de/web/Tim_Lyon Tim S. Lyon].
[https://arxiv.org/abs/2306.07550 Nested Sequents for Intermediate Logics: The Case of Gödel-Dummett Logics]
</div>
|Beschreibung EN=<p>Each year, thousands of researchers worldwide submit their work to prominent conferences within their specific fields, competing for the recognition that comes from having their papers accepted. Highly esteemed conferences generally maintain a low acceptance rate, reflecting a stringent selection process. To secure a place, research papers must not only be innovative and of superior quality, but they also need to resonate with and contribute significantly to their respective communities.</p>

<p>Among these leading gatherings in the realms of artificial intelligence and computer science are the [https://kr.org/KR2023/ International Conference on Principles of Knowledge Representation and Reasoning (KR)] and the [https://jelia2023.inf.tu-dresden.de/European Conference on Logics in Artificial Intelligence (JELIA)]. In a remarkable success, researchers from the International Center for Computational Logic (ICCL) have had three of their papers accepted at [https://kr.org/KR2023/ KR 2023] and four at [https://jelia2023.inf.tu-dresden.de/ JELIA 2023]. Moreover, ICCL researchers have made valuable contributions to numerous other conferences and workshops.</p>

<p>We offer our congratulations to our colleagues for their significant achievement. We look forward to seeing more of their research contributions in the future.</p>

[https://kr.org/KR2023/ KR'23] accepted contributions are:
<div>
[[Lukas Gerlach]] and [https://www-sop.inria.fr/members/David.Carral/ David Carral].
[https://iccl.inf.tu-dresden.de/web/Inproceedings3353 Do Repeat Yourself: Understanding Sufficient Conditions for Restricted Chase Non-Termination]
</div>
<div>
[https://www.inf.unibz.it/~gigante/ Nicola Gigante], [[Lucía Gómez Álvarez]] and [https://iccl.inf.tu-dresden.de/web/Tim_Lyon/ Tim S. Lyon].
[https://arxiv.org/abs/2304.14243 Standpoint Linear Temporal Logic]
</div>
<div>
[https://iccl.inf.tu-dresden.de/web/Tim_Lyon/ Tim S. Lyon] and [[Piotr Ostropolski-Nalewaja]].
[https://arxiv.org/abs/2306.02521 Connecting Proof Theory and Knowledge Representation: Sequent Calculi and the Chase with Existential Rules]
</div>

[https://jelia2023.inf.tu-dresden.de/ JELIA'23] accepted contributions are:
<div>
[[Bartosz Bednarczyk]].
Beyond ALCreg: Exploring Non-Regular Extensions of PDL with Description Logics Features"
</div>
<div>
[https://igorcsc.github.io/ Igor de Camargo E Souza Câmara] and [[Anni-Yasmin Turhan]].
Deciding Subsumption in Defeasible ELI⊥ with Typicality Models
</div>
<div>
[https://iccl.inf.tu-dresden.de/web/Tim_Lyon/ Tim S. Lyon] and [[Sebastian Rudolph]].
Derivation-Graph-Based Characterizations of Decidable Existential Rule Sets
</div>
<div>
[[Sergei Obiedkov]] and [https://www.informatik.fb2.frankfurt-university.de/~sertkaya/ Barış Sertkaya].
Computing Stable Extensions of Argumentation Frameworks using Formal Concept Analysis
</div>

Other contributions:
<div>
Kees van Berkel, [https://iccl.inf.tu-dresden.de/web/Tim_Lyon/ Tim S. Lyon] and [https://philosophy.ceu.edu/people/matteo-pascucci-0 Matteo Pascucci].
[https://arxiv.org/abs/2209.02287 A Logical Analysis of Instrumentality Judgements: Means-End Relations in the Context of Experience and Expectations]
</div>
<div>
[[Alex Ivliev]], [[Stefan Ellmauthaler]], [[Lukas Gerlach]], [[Maximilian Marx]], [[Matthias Meißner]], [[Simon Meusel]] and [[Markus Krötzsch]].
[https://iccl.inf.tu-dresden.de/web/Inproceedings3354 Nemo: First Glimpse of a New Rule Engine]
</div>
<div>
[[Jonas Karge]].
[https://iccl.inf.tu-dresden.de/web/Article3091 Second-order Confidence in Supervaluationism]
</div>
<div>
[[Jonas Karge]].
Voting for Bins: Integrating Imprecise Probabilistic Beliefs into the Condorcet Jury Theorem
</div>
<div>
[https://iccl.inf.tu-dresden.de/web/Tim_Lyon Tim S. Lyon].
[https://arxiv.org/abs/2306.07550 Nested Sequents for Intermediate Logics: The Case of Gödel-Dummett Logics]
</div>
|Datum=2023/07/21
}}

Inproceedings3359

2023-07-19T10:36:29Z

Bartosz Bednarczyk:

{{Publikation Erster Autor
|ErsterAutorVorname=Bartosz
|ErsterAutorNachname=Bednarczyk
}}
{{Inproceedings
|Referiert=1
|Title=Beyond ALCreg: Exploring Non-Regular Extensions of PDL with Description Logics Features
|To appear=1
|Year=2023
|Month=September
|Booktitle=Proceedings of the 18th Edition of the European Conference on Logics in Artificial Intelligence (JELIA 2023)
|Publisher=Springer International Publishing
|Editor=Sarah Alice Gaggl, Maria Vanina Martinez, Magdalena Ortiz
|Series=Lecture Notes in Computer Science
}}
{{Publikation Details
|Abstract=We investigate the impact of non-regular path expressions on the decidability of satisfiability checking and querying in description logics. Our primary object of interest is ALCvpl, an extension of ALC with path expressions using visibly-pushdown languages, which was shown to be decidable by Löding et al. in 2007. The paper present a series of undecidability results. We prove undecidability of ALCvpl with the seemingly innocent Self operator. Then, We also consider the simplest non-regular (visibly-pushdown) language r#s# := {r^n s^n : n \in N}. We establish undecidability of the concept satisfiability problem for ALCreg extended with nominals and r#s#, as well as of the query entailment problem for ALC-TBoxes, where such non-regular atoms are present in queries.
|Download=BBE-JELIA23-FINAL.pdf
|Projekt=DeciGUT
|Forschungsgruppe=Computational Logic
}}

Datei:BBE-JELIA23-FINAL.pdf

2023-07-19T10:36:26Z

Bartosz Bednarczyk:

Inproceedings3359

2023-07-13T15:16:46Z

Bartosz Bednarczyk:

{{Publikation Erster Autor
|ErsterAutorVorname=Bartosz
|ErsterAutorNachname=Bednarczyk
}}
{{Inproceedings
|Referiert=1
|Title=Beyond ALCreg: Exploring Non-Regular Extensions of PDL with Description Logics Features
|To appear=1
|Year=2023
|Month=September
|Booktitle=Proceedings of the 18th Edition of the European Conference on Logics in Artificial Intelligence (JELIA 2023)
|Publisher=Springer International Publishing
|Editor=Sarah Alice Gaggl, Maria Vanina Martinez, Magdalena Ortiz
|Series=Lecture Notes in Computer Science
}}
{{Publikation Details
|Abstract=We investigate the impact of non-regular path expressions on the decidability of satisfiability checking and querying in description logics. Our primary object of interest is ALCvpl, an extension of ALC with path expressions using visibly-pushdown languages, which was shown to be decidable by Löding et al. in 2007. We prove that decidability of ALCvpl is preserved when enriching the logic with functionality, but decidability is lost upon adding the seemingly innocent Self operator. We also consider the simplest non-regular (visibly-pushdown) language r#s# := {r^n s^n : n \in N}. We establish undecidability of the concept satisfiability problem for ALCreg extended with nominals and r#s#, as well as of the query entailment problem for ALC-TBoxes, where such non-regular atoms are present in queries.
|Download=Jelia2023-v2.pdf
|Projekt=DeciGUT
|Forschungsgruppe=Computational Logic
}}

Datei:Jelia2023-v2.pdf

2023-07-13T15:16:42Z

Bartosz Bednarczyk:

Inproceedings3359

2023-07-12T10:11:35Z

Bartosz Bednarczyk:

{{Publikation Erster Autor
|ErsterAutorVorname=Bartosz
|ErsterAutorNachname=Bednarczyk
}}
{{Inproceedings
|Referiert=1
|Title=Beyond ALCreg: Exploring Non-Regular Extensions of PDL with Description Logics Features
|To appear=1
|Year=2023
|Month=September
|Booktitle=Proceedings of the 18th Edition of the European Conference on Logics in Artificial Intelligence (JELIA 2023)
|Publisher=Springer International Publishing
|Editor=Sarah Alice Gaggl, Maria Vanina Martinez, Magdalena Ortiz
|Series=Lecture Notes in Computer Science
}}
{{Publikation Details
|Abstract=We investigate the impact of non-regular path expressions on the decidability of satisfiability checking and querying in description logics. Our primary object of interest is ALCvpl, an extension of ALC with path expressions using visibly-pushdown languages, which was shown to be decidable by Löding et al. in 2007. We prove that decidability of ALCvpl is preserved when enriching the logic with functionality, but decidability is lost upon adding the seemingly innocent Self operator. We also consider the simplest non-regular (visibly-pushdown) language r#s# := {r^n s^n : n \in N}. We establish undecidability of the concept satisfiability problem for ALCreg extended with nominals and r#s#, as well as of the query entailment problem for ALC-TBoxes, where such non-regular atoms are present in queries.
|Download=BBE-JELIA2023-v1.pdf
|Projekt=DeciGUT
|Forschungsgruppe=Computational Logic
}}

Datei:BBE-JELIA2023-v1.pdf

2023-07-12T10:11:32Z

Bartosz Bednarczyk:

Inproceedings3359

2023-07-10T20:33:10Z

Bartosz Bednarczyk:

{{Publikation Erster Autor
|ErsterAutorVorname=Bartosz
|ErsterAutorNachname=Bednarczyk
}}
{{Inproceedings
|Referiert=1
|Title=Beyond ALCreg: Exploring Non-Regular Extensions of PDL with Description Logics Features
|To appear=1
|Year=2023
|Month=September
|Booktitle=Proceedings of the 18th Edition of the European Conference on Logics in Artificial Intelligence (JELIA 2023)
|Publisher=Springer International Publishing
|Editor=Sarah Alice Gaggl, Maria Vanina Martinez, Magdalena Ortiz
|Series=Lecture Notes in Computer Science
}}
{{Publikation Details
|Abstract=We investigate the impact of non-regular path expressions on the decidability of satisfiability checking and querying in description logics. Our primary object of interest is ALCvpl, an extension of ALC with path expressions using visibly-pushdown languages, which was shown to be decidable by Löding et al. in 2007. We prove that decidability of ALCvpl is preserved when enriching the logic with functionality, but decidability is lost upon adding the seemingly innocent Self operator. We also consider the simplest non-regular (visibly-pushdown) language r#s# := {r^n s^n : n \in N}. We establish undecidability of the concept satisfiability problem for ALCreg extended with nominals and r#s#, as well as of the query entailment problem for ALC-TBoxes, where such non-regular atoms are present in queries.
|Download=BBE-JELIA2023.pdf
|Projekt=DeciGUT
|Forschungsgruppe=Computational Logic
}}

Inproceedings3359/en

2023-07-10T20:32:26Z

Bartosz Bednarczyk: Page created automatically by parser function on page Inproceedings3359

#REDIRECT [[Inproceedings3359]]

Inproceedings3359

2023-07-10T20:32:25Z

{{Publikation Erster Autor
|ErsterAutorVorname=Bartosz
|ErsterAutorNachname=Bednarczyk
}}
{{Inproceedings
|Referiert=1
|Title=Beyond ALCreg: Exploring Non-Regular Exten- sions of PDL with Description Logics Features
|To appear=1
|Year=2023
|Month=September
|Booktitle=Proceedings of the 18th Edition of the European Conference on Logics in Artificial Intelligence (JELIA 2023)
|Publisher=Springer International Publishing
|Editor=Sarah Alice Gaggl, Maria Vanina Martinez, Magdalena Ortiz
|Series=Lecture Notes in Computer Science
}}
{{Publikation Details
|Abstract=We investigate the impact of non-regular path expressions on the decidability of satisfiability checking and querying in description logics. Our primary object of interest is ALCvpl, an extension of ALC with path expressions using visibly-pushdown languages, which was shown to be decidable by Löding et al. in 2007. We prove that decidability of ALCvpl is preserved when enriching the logic with functionality, but decidability is lost upon adding the seemingly innocent Self operator. We also consider the simplest non-regular (visibly-pushdown) language r#s# := {r^n s^n : n \in N}. We establish undecidability of the concept satisfiability problem for ALCreg extended with nominals and r#s#, as well as of the query entailment problem for ALC-TBoxes, where such non-regular atoms are present in queries.
|Download=BBE-JELIA2023.pdf
|Projekt=DeciGUT
|Forschungsgruppe=Computational Logic
}}