---
_id: '63860'
citation:
ama: Hogan A, Satoh K, Dag H, Turhan A-Y, Roman D, Soylu A, eds. Rules and Reasoning
- 9th International Joint Conference, RuleML+RR 2025, Istanbul, Turkey, September
22-24, 2025, Proceedings. Vol 16144. Springer; 2026. doi:10.1007/978-3-032-08887-1
apa: Hogan, A., Satoh, K., Dag, H., Turhan, A.-Y., Roman, D., & Soylu, A. (Eds.).
(2026). Rules and Reasoning - 9th International Joint Conference, RuleML+RR
2025, Istanbul, Turkey, September 22-24, 2025, Proceedings (Vol. 16144). Springer.
https://doi.org/10.1007/978-3-032-08887-1
bibtex: '@book{Hogan_Satoh_Dag_Turhan_Roman_Soylu_2026, series={Lecture Notes in
Computer Science}, title={Rules and Reasoning - 9th International Joint Conference,
RuleML+RR 2025, Istanbul, Turkey, September 22-24, 2025, Proceedings}, volume={16144},
DOI={10.1007/978-3-032-08887-1},
publisher={Springer}, year={2026}, collection={Lecture Notes in Computer Science}
}'
chicago: Hogan, Aidan, Ken Satoh, Hasan Dag, Anni-Yasmin Turhan, Dumitru Roman,
and Ahmet Soylu, eds. Rules and Reasoning - 9th International Joint Conference,
RuleML+RR 2025, Istanbul, Turkey, September 22-24, 2025, Proceedings. Vol.
16144. Lecture Notes in Computer Science. Springer, 2026. https://doi.org/10.1007/978-3-032-08887-1.
ieee: A. Hogan, K. Satoh, H. Dag, A.-Y. Turhan, D. Roman, and A. Soylu, Eds., Rules
and Reasoning - 9th International Joint Conference, RuleML+RR 2025, Istanbul,
Turkey, September 22-24, 2025, Proceedings, vol. 16144. Springer, 2026.
mla: Hogan, Aidan, et al., editors. Rules and Reasoning - 9th International Joint
Conference, RuleML+RR 2025, Istanbul, Turkey, September 22-24, 2025, Proceedings.
Springer, 2026, doi:10.1007/978-3-032-08887-1.
short: A. Hogan, K. Satoh, H. Dag, A.-Y. Turhan, D. Roman, A. Soylu, eds., Rules
and Reasoning - 9th International Joint Conference, RuleML+RR 2025, Istanbul,
Turkey, September 22-24, 2025, Proceedings, Springer, 2026.
date_created: 2026-02-04T07:12:48Z
date_updated: 2026-02-04T07:13:38Z
doi: 10.1007/978-3-032-08887-1
editor:
- first_name: Aidan
full_name: Hogan, Aidan
last_name: Hogan
- first_name: Ken
full_name: Satoh, Ken
last_name: Satoh
- first_name: Hasan
full_name: Dag, Hasan
last_name: Dag
- first_name: Anni-Yasmin
full_name: Turhan, Anni-Yasmin
id: '104470'
last_name: Turhan
- first_name: Dumitru
full_name: Roman, Dumitru
last_name: Roman
- first_name: Ahmet
full_name: Soylu, Ahmet
last_name: Soylu
intvolume: ' 16144'
language:
- iso: eng
publication_identifier:
isbn:
- 978-3-032-08886-4
publisher: Springer
series_title: Lecture Notes in Computer Science
status: public
title: Rules and Reasoning - 9th International Joint Conference, RuleML+RR 2025, Istanbul,
Turkey, September 22-24, 2025, Proceedings
type: conference_editor
user_id: '117185'
volume: 16144
year: '2026'
...
---
_id: '65178'
abstract:
- lang: eng
text: "Large intermediate results can cause join queries to run unexpectedly long.
This problem is particularly common for analytical queries, which aggregate data
over many tables to produce a comparatively small final output, and queries on
graph data, where intermediate results blow up quickly. Recent work inspired by
Yannakakis’ algorithm approaches this by modifying the query engine to avoid materializing
unnecessary tuples. However, this requires significant changes to the core of
the system, which is not feasible in many situations such as cloud environments
or proprietary systems.\r\nIn this work, we propose a flexible approach for optimizing
long-running join queries from the outside of the DBMS. Rewriting-based realizations
of Yannakakis’ algorithm suffer from inherent overhead due to the creation of
intermediate tables. Thus, we present an approach for detecting and targeting
queries which would benefit from a Yannakakis-style optimization. We introduce
a new benchmark combining 5 standard benchmarks and augmenting them with additional
instances, which provides a sufficient size and diversity for a machine learning
based solution. On PostgreSQL, DuckDB and SparkSQL, slowdowns on queries where
the rewriting is counterproductive are mostly avoided, as opposed to a naïve application
of the rewriting, and we observe significant improvements in end-to-end runtimes
over standard query execution and unconditional rewriting."
author:
- first_name: Daniela
full_name: Böhm, Daniela
last_name: Böhm
- first_name: Georg
full_name: Gottlob, Georg
last_name: Gottlob
- first_name: Matthias
full_name: Lanzinger, Matthias
last_name: Lanzinger
- first_name: Davide Mario
full_name: Longo, Davide Mario
last_name: Longo
- first_name: Cem
full_name: Okulmus, Cem
id: '114410'
last_name: Okulmus
orcid: 0000-0002-7742-0439
- first_name: Reinhard
full_name: Pichler, Reinhard
last_name: Pichler
- first_name: Alexander
full_name: Selzer, Alexander
last_name: Selzer
citation:
ama: 'Böhm D, Gottlob G, Lanzinger M, et al. Selective Use of Yannakakis’ Algorithm
for Consistent Performance Gains. In: Proceedings of the 28th International
Workshop on Design, Optimization, Languages and Analytical Processing of Big Data
(DOLAP 2026). ; 2026.'
apa: Böhm, D., Gottlob, G., Lanzinger, M., Longo, D. M., Okulmus, C., Pichler, R.,
& Selzer, A. (2026). Selective Use of Yannakakis’ Algorithm for Consistent
Performance Gains. Proceedings of the 28th International Workshop on Design,
Optimization, Languages and Analytical Processing of Big Data (DOLAP 2026).
bibtex: '@inproceedings{Böhm_Gottlob_Lanzinger_Longo_Okulmus_Pichler_Selzer_2026,
place={Tampere, Finland}, title={Selective Use of Yannakakis’ Algorithm for Consistent
Performance Gains}, booktitle={Proceedings of the 28th International Workshop
on Design, Optimization, Languages and Analytical Processing of Big Data (DOLAP
2026)}, author={Böhm, Daniela and Gottlob, Georg and Lanzinger, Matthias and Longo,
Davide Mario and Okulmus, Cem and Pichler, Reinhard and Selzer, Alexander}, year={2026}
}'
chicago: Böhm, Daniela, Georg Gottlob, Matthias Lanzinger, Davide Mario Longo, Cem
Okulmus, Reinhard Pichler, and Alexander Selzer. “Selective Use of Yannakakis’
Algorithm for Consistent Performance Gains.” In Proceedings of the 28th International
Workshop on Design, Optimization, Languages and Analytical Processing of Big Data
(DOLAP 2026). Tampere, Finland, 2026.
ieee: D. Böhm et al., “Selective Use of Yannakakis’ Algorithm for Consistent
Performance Gains,” 2026.
mla: Böhm, Daniela, et al. “Selective Use of Yannakakis’ Algorithm for Consistent
Performance Gains.” Proceedings of the 28th International Workshop on Design,
Optimization, Languages and Analytical Processing of Big Data (DOLAP 2026),
2026.
short: 'D. Böhm, G. Gottlob, M. Lanzinger, D.M. Longo, C. Okulmus, R. Pichler, A.
Selzer, in: Proceedings of the 28th International Workshop on Design, Optimization,
Languages and Analytical Processing of Big Data (DOLAP 2026), Tampere, Finland,
2026.'
date_created: 2026-03-27T15:20:54Z
date_updated: 2026-03-27T15:22:01Z
department:
- _id: '888'
keyword:
- Join Queries
- Acyclic Queries
- Query Processing
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://ceur-ws.org/Vol-4186/paper2.pdf
oa: '1'
place: Tampere, Finland
publication: Proceedings of the 28th International Workshop on Design, Optimization,
Languages and Analytical Processing of Big Data (DOLAP 2026)
status: public
title: Selective Use of Yannakakis’ Algorithm for Consistent Performance Gains
type: conference
user_id: '114410'
year: '2026'
...
---
_id: '65489'
author:
- first_name: Cem
full_name: Okulmus, Cem
id: '114410'
last_name: Okulmus
orcid: 0000-0002-7742-0439
- first_name: Shqiponja
full_name: Ahmetaj, Shqiponja
last_name: Ahmetaj
- first_name: 'Iovka '
full_name: 'Boneva, Iovka '
last_name: Boneva
- first_name: Jan
full_name: Hidders, Jan
last_name: Hidders
- first_name: 'Maxime '
full_name: 'Jakubowski, Maxime '
last_name: Jakubowski
- first_name: José Emilio
full_name: ' Labra Gayo, José Emilio'
last_name: ' Labra Gayo'
- first_name: Wim
full_name: Martens, Wim
last_name: Martens
- first_name: 'Fabio '
full_name: 'Mogavero, Fabio '
last_name: Mogavero
- first_name: 'Filip '
full_name: 'Murlak, Filip '
last_name: Murlak
- first_name: ' Ognjen '
full_name: 'Savković, Ognjen '
last_name: Savković
- first_name: 'Mantas '
full_name: 'Šimkus, Mantas '
last_name: Šimkus
- first_name: 'Dominik '
full_name: 'Tomaszuk, Dominik '
last_name: Tomaszuk
citation:
ama: 'Okulmus C, Ahmetaj S, Boneva I, et al. Common Foundations for Recursive Shape
Languages. In: Proceedings of the 23rd International Conference on Principles
of Knowledge Representation and Reasoning (KR 2026). ; 2026.'
apa: Okulmus, C., Ahmetaj, S., Boneva, I., Hidders, J., Jakubowski, M., Labra Gayo,
J. E., Martens, W., Mogavero, F., Murlak, F., Savković, Ognjen , Šimkus, M.,
& Tomaszuk, D. (2026). Common Foundations for Recursive Shape Languages. Proceedings
of the 23rd International Conference on Principles of Knowledge Representation
and Reasoning (KR 2026). 23rd International Conference on Principles of Knowledge
Representation and Reasoning (KR 2026), Lisbon, Portugal.
bibtex: '@inproceedings{Okulmus_Ahmetaj_Boneva_Hidders_Jakubowski_ Labra Gayo_Martens_Mogavero_Murlak_Savković_et
al._2026, title={Common Foundations for Recursive Shape Languages}, booktitle={Proceedings
of the 23rd International Conference on Principles of Knowledge Representation
and Reasoning (KR 2026)}, author={Okulmus, Cem and Ahmetaj, Shqiponja and Boneva,
Iovka and Hidders, Jan and Jakubowski, Maxime and Labra Gayo, José Emilio and
Martens, Wim and Mogavero, Fabio and Murlak, Filip and Savković, Ognjen and
et al.}, year={2026} }'
chicago: Okulmus, Cem, Shqiponja Ahmetaj, Iovka Boneva, Jan Hidders, Maxime Jakubowski,
José Emilio Labra Gayo, Wim Martens, et al. “Common Foundations for Recursive
Shape Languages.” In Proceedings of the 23rd International Conference on Principles
of Knowledge Representation and Reasoning (KR 2026), 2026.
ieee: C. Okulmus et al., “Common Foundations for Recursive Shape Languages,”
presented at the 23rd International Conference on Principles of Knowledge Representation
and Reasoning (KR 2026), Lisbon, Portugal, 2026.
mla: Okulmus, Cem, et al. “Common Foundations for Recursive Shape Languages.” Proceedings
of the 23rd International Conference on Principles of Knowledge Representation
and Reasoning (KR 2026), 2026.
short: 'C. Okulmus, S. Ahmetaj, I. Boneva, J. Hidders, M. Jakubowski, J.E. Labra
Gayo, W. Martens, F. Mogavero, F. Murlak, Ognjen Savković, M. Šimkus, D. Tomaszuk,
in: Proceedings of the 23rd International Conference on Principles of Knowledge
Representation and Reasoning (KR 2026), 2026.'
conference:
end_date: 2026-07-23
location: Lisbon, Portugal
name: 23rd International Conference on Principles of Knowledge Representation and
Reasoning (KR 2026)
start_date: 2026-07-20
date_created: 2026-04-22T14:16:58Z
date_updated: 2026-04-22T14:17:20Z
department:
- _id: '888'
language:
- iso: eng
publication: Proceedings of the 23rd International Conference on Principles of Knowledge
Representation and Reasoning (KR 2026)
status: public
title: Common Foundations for Recursive Shape Languages
type: conference
user_id: '114410'
year: '2026'
...
---
_id: '65605'
citation:
ama: Turhan A-Y, Virtema J, eds. Foundations of Information and Knowledge Systems
- 14th International Symposium, FoIKS 2026, Hanover, Germany, March 23-26, 2026,
Proceedings. Vol 16475. Springer; 2026. doi:10.1007/978-3-032-21540-6
apa: Turhan, A.-Y., & Virtema, J. (Eds.). (2026). Foundations of Information
and Knowledge Systems - 14th International Symposium, FoIKS 2026, Hanover, Germany,
March 23-26, 2026, Proceedings (Vol. 16475). Springer. https://doi.org/10.1007/978-3-032-21540-6
bibtex: '@book{Turhan_Virtema_2026, series={Lecture Notes in Computer Science},
title={Foundations of Information and Knowledge Systems - 14th International Symposium,
FoIKS 2026, Hanover, Germany, March 23-26, 2026, Proceedings}, volume={16475},
DOI={10.1007/978-3-032-21540-6},
publisher={Springer}, year={2026}, collection={Lecture Notes in Computer Science}
}'
chicago: Turhan, Anni-Yasmin, and Jonni Virtema, eds. Foundations of Information
and Knowledge Systems - 14th International Symposium, FoIKS 2026, Hanover, Germany,
March 23-26, 2026, Proceedings. Vol. 16475. Lecture Notes in Computer Science.
Springer, 2026. https://doi.org/10.1007/978-3-032-21540-6.
ieee: A.-Y. Turhan and J. Virtema, Eds., Foundations of Information and Knowledge
Systems - 14th International Symposium, FoIKS 2026, Hanover, Germany, March 23-26,
2026, Proceedings, vol. 16475. Springer, 2026.
mla: Turhan, Anni-Yasmin, and Jonni Virtema, editors. Foundations of Information
and Knowledge Systems - 14th International Symposium, FoIKS 2026, Hanover, Germany,
March 23-26, 2026, Proceedings. Springer, 2026, doi:10.1007/978-3-032-21540-6.
short: A.-Y. Turhan, J. Virtema, eds., Foundations of Information and Knowledge
Systems - 14th International Symposium, FoIKS 2026, Hanover, Germany, March 23-26,
2026, Proceedings, Springer, 2026.
date_created: 2026-05-11T08:46:09Z
date_updated: 2026-05-11T08:50:25Z
doi: 10.1007/978-3-032-21540-6
editor:
- first_name: Anni-Yasmin
full_name: Turhan, Anni-Yasmin
id: '104470'
last_name: Turhan
- first_name: Jonni
full_name: Virtema, Jonni
last_name: Virtema
intvolume: ' 16475'
language:
- iso: eng
publication_identifier:
isbn:
- 978-3-032-21539-0
publisher: Springer
series_title: Lecture Notes in Computer Science
status: public
title: Foundations of Information and Knowledge Systems - 14th International Symposium,
FoIKS 2026, Hanover, Germany, March 23-26, 2026, Proceedings
type: conference_editor
user_id: '117185'
volume: 16475
year: '2026'
...
---
_id: '65566'
author:
- first_name: Anselm
full_name: Haak, Anselm
id: '109969'
last_name: Haak
- first_name: Patrick
full_name: Koopmann, Patrick
last_name: Koopmann
- first_name: Yasir
full_name: Mahmood, Yasir
id: '99353'
last_name: Mahmood
- first_name: Anni-Yasmin
full_name: Turhan, Anni-Yasmin
id: '104470'
last_name: Turhan
citation:
ama: 'Haak A, Koopmann P, Mahmood Y, Turhan A-Y. ABox Abduction for Inconsistent
Knowledge Bases under Repair Semantics. In: ; 2026.'
apa: Haak, A., Koopmann, P., Mahmood, Y., & Turhan, A.-Y. (2026). ABox Abduction
for Inconsistent Knowledge Bases under Repair Semantics. 23rd International
Conference on Principles of Knowledge Representation and Reasoning, Lisbon.
bibtex: '@inproceedings{Haak_Koopmann_Mahmood_Turhan_2026, title={ABox Abduction
for Inconsistent Knowledge Bases under Repair Semantics}, author={Haak, Anselm
and Koopmann, Patrick and Mahmood, Yasir and Turhan, Anni-Yasmin}, year={2026}
}'
chicago: Haak, Anselm, Patrick Koopmann, Yasir Mahmood, and Anni-Yasmin Turhan.
“ABox Abduction for Inconsistent Knowledge Bases under Repair Semantics,” 2026.
ieee: A. Haak, P. Koopmann, Y. Mahmood, and A.-Y. Turhan, “ABox Abduction for Inconsistent
Knowledge Bases under Repair Semantics,” presented at the 23rd International Conference
on Principles of Knowledge Representation and Reasoning, Lisbon, 2026.
mla: Haak, Anselm, et al. ABox Abduction for Inconsistent Knowledge Bases under
Repair Semantics. 2026.
short: 'A. Haak, P. Koopmann, Y. Mahmood, A.-Y. Turhan, in: 2026.'
conference:
end_date: 2026-07-23
location: Lisbon
name: 23rd International Conference on Principles of Knowledge Representation and
Reasoning
start_date: 2026-07-20
date_created: 2026-05-05T14:29:38Z
date_updated: 2026-05-21T08:26:07Z
department:
- _id: '888'
- _id: '574'
language:
- iso: eng
status: public
title: ABox Abduction for Inconsistent Knowledge Bases under Repair Semantics
type: conference
user_id: '109969'
year: '2026'
...
---
_id: '66378'
author:
- first_name: Julien
full_name: Corman, Julien
last_name: Corman
- first_name: Roman
full_name: Kontchakov, Roman
last_name: Kontchakov
- first_name: Cem
full_name: Okulmus, Cem
id: '114410'
last_name: Okulmus
orcid: 0000-0002-7742-0439
citation:
ama: 'Corman J, Kontchakov R, Okulmus C. Querying Interval-Based Temporal Data with
SPARQL. In: Proceedings of the 33rd International Symposium on Temporal Representation
and Reasoning (TIME 2026). ; 2026.'
apa: Corman, J., Kontchakov, R., & Okulmus, C. (2026). Querying Interval-Based
Temporal Data with SPARQL. Proceedings of the 33rd International Symposium
on Temporal Representation and Reasoning (TIME 2026). 33rd International Symposium
on Temporal Representation and Reasoning (TIME 2026), Cork, Ireland.
bibtex: '@inproceedings{Corman_Kontchakov_Okulmus_2026, title={Querying Interval-Based
Temporal Data with SPARQL}, booktitle={Proceedings of the 33rd International Symposium
on Temporal Representation and Reasoning (TIME 2026)}, author={Corman, Julien
and Kontchakov, Roman and Okulmus, Cem}, year={2026} }'
chicago: Corman, Julien, Roman Kontchakov, and Cem Okulmus. “Querying Interval-Based
Temporal Data with SPARQL.” In Proceedings of the 33rd International Symposium
on Temporal Representation and Reasoning (TIME 2026), 2026.
ieee: J. Corman, R. Kontchakov, and C. Okulmus, “Querying Interval-Based Temporal
Data with SPARQL,” presented at the 33rd International Symposium on Temporal Representation
and Reasoning (TIME 2026), Cork, Ireland, 2026.
mla: Corman, Julien, et al. “Querying Interval-Based Temporal Data with SPARQL.”
Proceedings of the 33rd International Symposium on Temporal Representation
and Reasoning (TIME 2026), 2026.
short: 'J. Corman, R. Kontchakov, C. Okulmus, in: Proceedings of the 33rd International
Symposium on Temporal Representation and Reasoning (TIME 2026), 2026.'
conference:
end_date: 2026-09-03
location: Cork, Ireland
name: 33rd International Symposium on Temporal Representation and Reasoning (TIME
2026)
start_date: 2026-09-01
date_created: 2026-07-08T11:11:24Z
date_updated: 2026-07-08T11:13:04Z
department:
- _id: '888'
language:
- iso: eng
publication: Proceedings of the 33rd International Symposium on Temporal Representation
and Reasoning (TIME 2026)
status: public
title: Querying Interval-Based Temporal Data with SPARQL
type: conference
user_id: '114410'
year: '2026'
...
---
_id: '66379'
author:
- first_name: Bente
full_name: Gortworst, Bente
last_name: Gortworst
- first_name: Cem
full_name: Okulmus, Cem
id: '114410'
last_name: Okulmus
orcid: 0000-0002-7742-0439
- first_name: Magdalena
full_name: Ortiz, Magdalena
last_name: Ortiz
- first_name: Anni-Yasmin
full_name: Turhan, Anni-Yasmin
id: '104470'
last_name: Turhan
citation:
ama: 'Gortworst B, Okulmus C, Ortiz M, Turhan A-Y. Reaching for the Stars in EL
Concept Learning. In: Proceedings of the 39th International Workshop on Description
Logics (DL 2026). ; 2026.'
apa: Gortworst, B., Okulmus, C., Ortiz, M., & Turhan, A.-Y. (2026). Reaching
for the Stars in EL Concept Learning. Proceedings of the 39th International
Workshop on Description Logics (DL 2026).
bibtex: '@inproceedings{Gortworst_Okulmus_Ortiz_Turhan_2026, title={Reaching for
the Stars in EL Concept Learning}, booktitle={Proceedings of the 39th International
Workshop on Description Logics (DL 2026)}, author={Gortworst, Bente and Okulmus,
Cem and Ortiz, Magdalena and Turhan, Anni-Yasmin}, year={2026} }'
chicago: Gortworst, Bente, Cem Okulmus, Magdalena Ortiz, and Anni-Yasmin Turhan.
“Reaching for the Stars in EL Concept Learning.” In Proceedings of the 39th
International Workshop on Description Logics (DL 2026), 2026.
ieee: B. Gortworst, C. Okulmus, M. Ortiz, and A.-Y. Turhan, “Reaching for the Stars
in EL Concept Learning,” 2026.
mla: Gortworst, Bente, et al. “Reaching for the Stars in EL Concept Learning.” Proceedings
of the 39th International Workshop on Description Logics (DL 2026), 2026.
short: 'B. Gortworst, C. Okulmus, M. Ortiz, A.-Y. Turhan, in: Proceedings of the
39th International Workshop on Description Logics (DL 2026), 2026.'
date_created: 2026-07-08T11:23:20Z
date_updated: 2026-07-08T11:23:25Z
department:
- _id: '888'
language:
- iso: eng
publication: Proceedings of the 39th International Workshop on Description Logics
(DL 2026)
status: public
title: Reaching for the Stars in EL Concept Learning
type: conference
user_id: '114410'
year: '2026'
...
---
_id: '66631'
author:
- first_name: Bente
full_name: Gortworst, Bente
last_name: Gortworst
- first_name: Cem
full_name: Okulmus, Cem
id: '114410'
last_name: Okulmus
orcid: 0000-0002-7742-0439
- first_name: Magdalena
full_name: Ortiz, Magdalena
last_name: Ortiz
- first_name: Anni-Yasmin
full_name: Turhan, Anni-Yasmin
id: '104470'
last_name: Turhan
citation:
ama: 'Gortworst B, Okulmus C, Ortiz M, Turhan A-Y. Shapes from Examples: Foundations
of Shape Learning in Recursive SHACL. In: Proceedings of the 25th International
Semantic Web Conference (ISWC 2026). ; 2026.'
apa: 'Gortworst, B., Okulmus, C., Ortiz, M., & Turhan, A.-Y. (2026). Shapes
from Examples: Foundations of Shape Learning in Recursive SHACL. Proceedings
of the 25th International Semantic Web Conference (ISWC 2026).'
bibtex: '@inproceedings{Gortworst_Okulmus_Ortiz_Turhan_2026, title={Shapes from
Examples: Foundations of Shape Learning in Recursive SHACL}, booktitle={Proceedings
of the 25th International Semantic Web Conference (ISWC 2026)}, author={Gortworst,
Bente and Okulmus, Cem and Ortiz, Magdalena and Turhan, Anni-Yasmin}, year={2026}
}'
chicago: 'Gortworst, Bente, Cem Okulmus, Magdalena Ortiz, and Anni-Yasmin Turhan.
“Shapes from Examples: Foundations of Shape Learning in Recursive SHACL.” In Proceedings
of the 25th International Semantic Web Conference (ISWC 2026), 2026.'
ieee: 'B. Gortworst, C. Okulmus, M. Ortiz, and A.-Y. Turhan, “Shapes from Examples:
Foundations of Shape Learning in Recursive SHACL,” 2026.'
mla: 'Gortworst, Bente, et al. “Shapes from Examples: Foundations of Shape Learning
in Recursive SHACL.” Proceedings of the 25th International Semantic Web Conference
(ISWC 2026), 2026.'
short: 'B. Gortworst, C. Okulmus, M. Ortiz, A.-Y. Turhan, in: Proceedings of the
25th International Semantic Web Conference (ISWC 2026), 2026.'
date_created: 2026-08-02T18:50:17Z
date_updated: 2026-08-02T18:50:22Z
department:
- _id: '888'
language:
- iso: eng
publication: Proceedings of the 25th International Semantic Web Conference (ISWC 2026)
status: public
title: 'Shapes from Examples: Foundations of Shape Learning in Recursive SHACL'
type: conference
user_id: '114410'
year: '2026'
...
---
_id: '66710'
author:
- first_name: Bianca
full_name: Löhnert, Bianca
last_name: Löhnert
- first_name: Nikolaus
full_name: Augsten, Nikolaus
last_name: Augsten
- first_name: Cem
full_name: Okulmus, Cem
id: '114410'
last_name: Okulmus
orcid: 0000-0002-7742-0439
- first_name: Magdalena
full_name: Ortiz, Magdalena
last_name: Ortiz
citation:
ama: 'Löhnert B, Augsten N, Okulmus C, Ortiz M. Rewriting Ontology-Mediated Property
Graph Queries into GQL. In: Proceedings of the 35th International ACM Conference
on Knowledge and Information Management (CIKM 2026). ; 2026.'
apa: Löhnert, B., Augsten, N., Okulmus, C., & Ortiz, M. (2026). Rewriting Ontology-Mediated
Property Graph Queries into GQL. Proceedings of the 35th International ACM
Conference on Knowledge and Information Management (CIKM 2026).
bibtex: '@inproceedings{Löhnert_Augsten_Okulmus_Ortiz_2026, title={Rewriting Ontology-Mediated
Property Graph Queries into GQL}, booktitle={Proceedings of the 35th International
ACM Conference on Knowledge and Information Management (CIKM 2026)}, author={Löhnert,
Bianca and Augsten, Nikolaus and Okulmus, Cem and Ortiz, Magdalena}, year={2026}
}'
chicago: Löhnert, Bianca, Nikolaus Augsten, Cem Okulmus, and Magdalena Ortiz. “Rewriting
Ontology-Mediated Property Graph Queries into GQL.” In Proceedings of the 35th
International ACM Conference on Knowledge and Information Management (CIKM 2026),
2026.
ieee: B. Löhnert, N. Augsten, C. Okulmus, and M. Ortiz, “Rewriting Ontology-Mediated
Property Graph Queries into GQL,” 2026.
mla: Löhnert, Bianca, et al. “Rewriting Ontology-Mediated Property Graph Queries
into GQL.” Proceedings of the 35th International ACM Conference on Knowledge
and Information Management (CIKM 2026), 2026.
short: 'B. Löhnert, N. Augsten, C. Okulmus, M. Ortiz, in: Proceedings of the 35th
International ACM Conference on Knowledge and Information Management (CIKM 2026),
2026.'
date_created: 2026-08-13T13:50:38Z
date_updated: 2026-08-13T13:50:46Z
department:
- _id: '888'
language:
- iso: eng
publication: Proceedings of the 35th International ACM Conference on Knowledge and
Information Management (CIKM 2026)
status: public
title: Rewriting Ontology-Mediated Property Graph Queries into GQL
type: conference
user_id: '114410'
year: '2026'
...
---
_id: '59840'
abstract:
- lang: eng
text: "The Semantic Web and Graph Database communities have developed three distinct
schema languages for RDF and graph-structured data: SHACL, ShEx, and PG-Schema.
Each language has its unique approach to defining constraints and validating graph
data. In this work, we provide formal, concise definitions of the core components
of each of these schema languages. We employ a uniform framework to facilitate
a comprehensive comparison between the languages and identify a common set of
functionalities, shedding light on both overlapping and distinctive features of
the three languages.\r\n"
author:
- first_name: Shqiponja
full_name: Ahmetaj, Shqiponja
last_name: Ahmetaj
- first_name: Iovka
full_name: Boneva, Iovka
last_name: Boneva
- first_name: Jan
full_name: Hidders, Jan
last_name: Hidders
- first_name: Katja
full_name: Hose, Katja
last_name: Hose
- first_name: Maxime
full_name: Jakubowski, Maxime
last_name: Jakubowski
- first_name: Jose Emilio
full_name: Labra Gayo, Jose Emilio
last_name: Labra Gayo
- first_name: Wim
full_name: Martens, Wim
last_name: Martens
- first_name: Fabio
full_name: Mogavero, Fabio
last_name: Mogavero
- first_name: Filip
full_name: Murlak, Filip
last_name: Murlak
- first_name: Cem
full_name: Okulmus, Cem
id: '114410'
last_name: Okulmus
orcid: 0000-0002-7742-0439
- first_name: Axel
full_name: Polleres, Axel
last_name: Polleres
- first_name: Ognjen
full_name: Savković, Ognjen
last_name: Savković
- first_name: Mantas
full_name: Šimkus, Mantas
last_name: Šimkus
- first_name: Dominik
full_name: Tomaszuk, Dominik
last_name: Tomaszuk
citation:
ama: 'Ahmetaj S, Boneva I, Hidders J, et al. Common Foundations for SHACL, ShEx,
and PG-Schema. In: Proceedings of the ACM on Web Conference 2025. ACM;
2025:8-12. doi:10.1145/3696410.3714694'
apa: Ahmetaj, S., Boneva, I., Hidders, J., Hose, K., Jakubowski, M., Labra Gayo,
J. E., Martens, W., Mogavero, F., Murlak, F., Okulmus, C., Polleres, A., Savković,
O., Šimkus, M., & Tomaszuk, D. (2025). Common Foundations for SHACL, ShEx,
and PG-Schema. Proceedings of the ACM on Web Conference 2025, 8–12. https://doi.org/10.1145/3696410.3714694
bibtex: '@inproceedings{Ahmetaj_Boneva_Hidders_Hose_Jakubowski_Labra Gayo_Martens_Mogavero_Murlak_Okulmus_et
al._2025, title={Common Foundations for SHACL, ShEx, and PG-Schema}, DOI={10.1145/3696410.3714694},
booktitle={Proceedings of the ACM on Web Conference 2025}, publisher={ACM}, author={Ahmetaj,
Shqiponja and Boneva, Iovka and Hidders, Jan and Hose, Katja and Jakubowski, Maxime
and Labra Gayo, Jose Emilio and Martens, Wim and Mogavero, Fabio and Murlak, Filip
and Okulmus, Cem and et al.}, year={2025}, pages={8–12} }'
chicago: Ahmetaj, Shqiponja, Iovka Boneva, Jan Hidders, Katja Hose, Maxime Jakubowski,
Jose Emilio Labra Gayo, Wim Martens, et al. “Common Foundations for SHACL, ShEx,
and PG-Schema.” In Proceedings of the ACM on Web Conference 2025, 8–12.
ACM, 2025. https://doi.org/10.1145/3696410.3714694.
ieee: 'S. Ahmetaj et al., “Common Foundations for SHACL, ShEx, and PG-Schema,”
in Proceedings of the ACM on Web Conference 2025, Sidney, Australia, 2025,
pp. 8–12, doi: 10.1145/3696410.3714694.'
mla: Ahmetaj, Shqiponja, et al. “Common Foundations for SHACL, ShEx, and PG-Schema.”
Proceedings of the ACM on Web Conference 2025, ACM, 2025, pp. 8–12, doi:10.1145/3696410.3714694.
short: 'S. Ahmetaj, I. Boneva, J. Hidders, K. Hose, M. Jakubowski, J.E. Labra Gayo,
W. Martens, F. Mogavero, F. Murlak, C. Okulmus, A. Polleres, O. Savković, M. Šimkus,
D. Tomaszuk, in: Proceedings of the ACM on Web Conference 2025, ACM, 2025, pp.
8–12.'
conference:
end_date: 2025-05-02
location: Sidney, Australia
name: 'ACM Web Conference 2025 '
start_date: 2025-04-28
date_created: 2025-05-07T11:46:03Z
date_updated: 2025-05-07T11:51:17Z
department:
- _id: '888'
doi: 10.1145/3696410.3714694
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/2502.01295
oa: '1'
page: 8-12
publication: Proceedings of the ACM on Web Conference 2025
publication_status: published
publisher: ACM
status: public
title: Common Foundations for SHACL, ShEx, and PG-Schema
type: conference
user_id: '114410'
year: '2025'
...
---
_id: '63786'
author:
- first_name: Bianca
full_name: Löhnert, Bianca
last_name: Löhnert
- first_name: Nikolaus
full_name: Augsten, Nikolaus
last_name: Augsten
- first_name: Cem
full_name: Okulmus, Cem
id: '114410'
last_name: Okulmus
orcid: 0000-0002-7742-0439
- first_name: Magdalena
full_name: Ortiz, Magdalena
last_name: Ortiz
citation:
ama: 'Löhnert B, Augsten N, Okulmus C, Ortiz M. Query Rewriting for Nested Navigational
Queries over Property Graphs. In: Tendera L, Ibanez Garcia Y, Koopmann P, eds.
Proceedings of the 38th International Workshop on Description Logics (DL 2025),
Opole, Poland, September 3-6, 2025. Vol 4091. CEUR Workshop Proceedings. ;
2025.'
apa: Löhnert, B., Augsten, N., Okulmus, C., & Ortiz, M. (2025). Query Rewriting
for Nested Navigational Queries over Property Graphs. In L. Tendera, Y. Ibanez
Garcia, & P. Koopmann (Eds.), Proceedings of the 38th International Workshop
on Description Logics (DL 2025), Opole, Poland, September 3-6, 2025. (Vol.
4091).
bibtex: '@inproceedings{Löhnert_Augsten_Okulmus_Ortiz_2025, place={Opole, Poland},
series={CEUR Workshop Proceedings}, title={Query Rewriting for Nested Navigational
Queries over Property Graphs}, volume={4091}, booktitle={Proceedings of the 38th
International Workshop on Description Logics (DL 2025), Opole, Poland, September
3-6, 2025.}, author={Löhnert, Bianca and Augsten, Nikolaus and Okulmus, Cem and
Ortiz, Magdalena}, editor={Tendera, Lidia and Ibanez Garcia, Yazmin and Koopmann,
Patrick}, year={2025}, collection={CEUR Workshop Proceedings} }'
chicago: Löhnert, Bianca, Nikolaus Augsten, Cem Okulmus, and Magdalena Ortiz. “Query
Rewriting for Nested Navigational Queries over Property Graphs.” In Proceedings
of the 38th International Workshop on Description Logics (DL 2025), Opole, Poland,
September 3-6, 2025., edited by Lidia Tendera, Yazmin Ibanez Garcia, and Patrick
Koopmann, Vol. 4091. CEUR Workshop Proceedings. Opole, Poland, 2025.
ieee: B. Löhnert, N. Augsten, C. Okulmus, and M. Ortiz, “Query Rewriting for Nested
Navigational Queries over Property Graphs,” in Proceedings of the 38th International
Workshop on Description Logics (DL 2025), Opole, Poland, September 3-6, 2025.,
2025, vol. 4091.
mla: Löhnert, Bianca, et al. “Query Rewriting for Nested Navigational Queries over
Property Graphs.” Proceedings of the 38th International Workshop on Description
Logics (DL 2025), Opole, Poland, September 3-6, 2025., edited by Lidia Tendera
et al., vol. 4091, 2025.
short: 'B. Löhnert, N. Augsten, C. Okulmus, M. Ortiz, in: L. Tendera, Y. Ibanez
Garcia, P. Koopmann (Eds.), Proceedings of the 38th International Workshop on
Description Logics (DL 2025), Opole, Poland, September 3-6, 2025., Opole, Poland,
2025.'
date_created: 2026-01-28T10:37:05Z
date_updated: 2026-01-28T10:38:17Z
department:
- _id: '888'
editor:
- first_name: Lidia
full_name: Tendera, Lidia
last_name: Tendera
- first_name: Yazmin
full_name: Ibanez Garcia, Yazmin
last_name: Ibanez Garcia
- first_name: Patrick
full_name: Koopmann, Patrick
last_name: Koopmann
intvolume: ' 4091'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://ceur-ws.org/Vol-4091/paper40.pdf
oa: '1'
place: Opole, Poland
publication: Proceedings of the 38th International Workshop on Description Logics
(DL 2025), Opole, Poland, September 3-6, 2025.
publication_status: published
series_title: CEUR Workshop Proceedings
status: public
title: Query Rewriting for Nested Navigational Queries over Property Graphs
type: conference
user_id: '114410'
volume: 4091
year: '2025'
...
---
_id: '63857'
author:
- first_name: Anni-Yasmin
full_name: Turhan, Anni-Yasmin
id: '104470'
last_name: Turhan
citation:
ama: Turhan A-Y. Think Globally, Attend Locally. Künstliche Intell. 2025;39(4):271–272.
doi:10.1007/S13218-025-00894-9
apa: Turhan, A.-Y. (2025). Think Globally, Attend Locally. Künstliche Intell.,
39(4), 271–272. https://doi.org/10.1007/S13218-025-00894-9
bibtex: '@article{Turhan_2025, title={Think Globally, Attend Locally}, volume={39},
DOI={10.1007/S13218-025-00894-9},
number={4}, journal={Künstliche Intell.}, author={Turhan, Anni-Yasmin}, year={2025},
pages={271–272} }'
chicago: 'Turhan, Anni-Yasmin. “Think Globally, Attend Locally.” Künstliche Intell.
39, no. 4 (2025): 271–272. https://doi.org/10.1007/S13218-025-00894-9.'
ieee: 'A.-Y. Turhan, “Think Globally, Attend Locally,” Künstliche Intell.,
vol. 39, no. 4, pp. 271–272, 2025, doi: 10.1007/S13218-025-00894-9.'
mla: Turhan, Anni-Yasmin. “Think Globally, Attend Locally.” Künstliche Intell.,
vol. 39, no. 4, 2025, pp. 271–272, doi:10.1007/S13218-025-00894-9.
short: A.-Y. Turhan, Künstliche Intell. 39 (2025) 271–272.
date_created: 2026-02-04T07:01:02Z
date_updated: 2026-02-04T07:02:52Z
doi: 10.1007/S13218-025-00894-9
intvolume: ' 39'
issue: '4'
language:
- iso: eng
page: 271–272
publication: Künstliche Intell.
status: public
title: Think Globally, Attend Locally
type: journal_article
user_id: '117185'
volume: 39
year: '2025'
...
---
_id: '61065'
abstract:
- lang: eng
text: Abduction is the task of computing a sufficient extension of a knowledge base
(KB) that entails a conclusion not entailed by the original KB. It serves to compute
explanations, or hypotheses, for such missing entailments. While this task has
been intensively investigated for perfect data and under classical semantics,
less is known about abduction when erroneous data results in inconsistent KBs.
In this paper we define a suitable notion of abduction under repair semantics
and propose a set of minimality criteria that guides abduction towards `useful'
hypotheses. We provide initial complexity results on deciding existence of and
verifying abductive solutions with these criteria, under different repair semantics
and for the description logics DL-Lite and EL_bot.
author:
- first_name: Anselm
full_name: Haak, Anselm
id: '109969'
last_name: Haak
- first_name: Patrick
full_name: Koopmann, Patrick
last_name: Koopmann
- first_name: Yasir
full_name: Mahmood, Yasir
id: '99353'
last_name: Mahmood
- first_name: Anni-Yasmin
full_name: Turhan, Anni-Yasmin
id: '104470'
last_name: Turhan
citation:
ama: Haak A, Koopmann P, Mahmood Y, Turhan A-Y. Why not? Developing ABox Abduction
beyond Repairs. arXiv:250721955. Published online 2025.
apa: Haak, A., Koopmann, P., Mahmood, Y., & Turhan, A.-Y. (2025). Why not? Developing
ABox Abduction beyond Repairs. In arXiv:2507.21955.
bibtex: '@article{Haak_Koopmann_Mahmood_Turhan_2025, title={Why not? Developing
ABox Abduction beyond Repairs}, journal={arXiv:2507.21955}, author={Haak, Anselm
and Koopmann, Patrick and Mahmood, Yasir and Turhan, Anni-Yasmin}, year={2025}
}'
chicago: Haak, Anselm, Patrick Koopmann, Yasir Mahmood, and Anni-Yasmin Turhan.
“Why Not? Developing ABox Abduction beyond Repairs.” ArXiv:2507.21955,
2025.
ieee: A. Haak, P. Koopmann, Y. Mahmood, and A.-Y. Turhan, “Why not? Developing ABox
Abduction beyond Repairs,” arXiv:2507.21955. 2025.
mla: Haak, Anselm, et al. “Why Not? Developing ABox Abduction beyond Repairs.” ArXiv:2507.21955,
2025.
short: A. Haak, P. Koopmann, Y. Mahmood, A.-Y. Turhan, ArXiv:2507.21955 (2025).
date_created: 2025-08-29T07:58:08Z
date_updated: 2026-02-05T13:55:48Z
department:
- _id: '574'
- _id: '888'
external_id:
arxiv:
- '2507.21955'
language:
- iso: eng
project:
- _id: '121'
name: 'TRR 318; TP B01: Ein dialogbasierter Ansatz zur Erklärung von Modellen des
maschinellen Lernens'
publication: arXiv:2507.21955
status: public
title: Why not? Developing ABox Abduction beyond Repairs
type: preprint
user_id: '109969'
year: '2025'
...
---
_id: '63888'
author:
- first_name: Anselm
full_name: Haak, Anselm
id: '109969'
last_name: Haak
- first_name: Patrick
full_name: Koopmann, Patrick
last_name: Koopmann
- first_name: Yasir
full_name: Mahmood, Yasir
id: '99353'
last_name: Mahmood
- first_name: Anni-Yasmin
full_name: Turhan, Anni-Yasmin
id: '104470'
last_name: Turhan
citation:
ama: 'Haak A, Koopmann P, Mahmood Y, Turhan A-Y. Why not? Developing ABox Abduction
beyond Repairs. In: Tendera L, Ibanez Garcia Y, Koopmann P, eds. Proceedings
of the 38th International Workshop on Description Logics - DL 2025. ; 2025.'
apa: Haak, A., Koopmann, P., Mahmood, Y., & Turhan, A.-Y. (2025). Why not? Developing
ABox Abduction beyond Repairs. In L. Tendera, Y. Ibanez Garcia, & P. Koopmann
(Eds.), Proceedings of the 38th International Workshop on Description Logics
- DL 2025.
bibtex: '@inproceedings{Haak_Koopmann_Mahmood_Turhan_2025, title={Why not? Developing
ABox Abduction beyond Repairs}, booktitle={Proceedings of the 38th International
Workshop on Description Logics - DL 2025}, author={Haak, Anselm and Koopmann,
Patrick and Mahmood, Yasir and Turhan, Anni-Yasmin}, editor={Tendera, Lidia and
Ibanez Garcia, Yazmin and Koopmann, Patrick}, year={2025} }'
chicago: Haak, Anselm, Patrick Koopmann, Yasir Mahmood, and Anni-Yasmin Turhan.
“Why Not? Developing ABox Abduction beyond Repairs.” In Proceedings of the
38th International Workshop on Description Logics - DL 2025, edited by Lidia
Tendera, Yazmin Ibanez Garcia, and Patrick Koopmann, 2025.
ieee: A. Haak, P. Koopmann, Y. Mahmood, and A.-Y. Turhan, “Why not? Developing ABox
Abduction beyond Repairs,” in Proceedings of the 38th International Workshop
on Description Logics - DL 2025, Opole, Poland, 2025.
mla: Haak, Anselm, et al. “Why Not? Developing ABox Abduction beyond Repairs.” Proceedings
of the 38th International Workshop on Description Logics - DL 2025, edited
by Lidia Tendera et al., 2025.
short: 'A. Haak, P. Koopmann, Y. Mahmood, A.-Y. Turhan, in: L. Tendera, Y. Ibanez
Garcia, P. Koopmann (Eds.), Proceedings of the 38th International Workshop on
Description Logics - DL 2025, 2025.'
conference:
end_date: 2025-09-06
location: Opole, Poland
name: Description Logics 2025
start_date: 2025-09-03
date_created: 2026-02-05T13:54:08Z
date_updated: 2026-02-05T13:55:27Z
department:
- _id: '888'
- _id: '574'
editor:
- first_name: Lidia
full_name: Tendera, Lidia
last_name: Tendera
- first_name: Yazmin
full_name: Ibanez Garcia, Yazmin
last_name: Ibanez Garcia
- first_name: Patrick
full_name: Koopmann, Patrick
last_name: Koopmann
language:
- iso: eng
main_file_link:
- url: https://ceur-ws.org/Vol-4091/paper25.pdf
publication: Proceedings of the 38th International Workshop on Description Logics
- DL 2025
status: public
title: Why not? Developing ABox Abduction beyond Repairs
type: conference
user_id: '109969'
year: '2025'
...
---
_id: '61471'
author:
- first_name: Guido
full_name: Governatori, Guido
last_name: Governatori
- first_name: Anni-Yasmin
full_name: Turhan, Anni-Yasmin
id: '104470'
last_name: Turhan
citation:
ama: 'Governatori G, Turhan A-Y. Introduction to the Special Issue on Logic Rules
and Reasoning: Selected Papers From the 6th International Joint Conference on
Rules and Reasoning (RuleML+RR 2022). Theory Pract Log Program. 2025;25(2):132–133.
doi:10.1017/S1471068425000079'
apa: 'Governatori, G., & Turhan, A.-Y. (2025). Introduction to the Special Issue
on Logic Rules and Reasoning: Selected Papers From the 6th International Joint
Conference on Rules and Reasoning (RuleML+RR 2022). Theory Pract. Log. Program.,
25(2), 132–133. https://doi.org/10.1017/S1471068425000079'
bibtex: '@article{Governatori_Turhan_2025, title={Introduction to the Special Issue
on Logic Rules and Reasoning: Selected Papers From the 6th International Joint
Conference on Rules and Reasoning (RuleML+RR 2022)}, volume={25}, DOI={10.1017/S1471068425000079},
number={2}, journal={Theory Pract. Log. Program.}, author={Governatori, Guido
and Turhan, Anni-Yasmin}, year={2025}, pages={132–133} }'
chicago: 'Governatori, Guido, and Anni-Yasmin Turhan. “Introduction to the Special
Issue on Logic Rules and Reasoning: Selected Papers From the 6th International
Joint Conference on Rules and Reasoning (RuleML+RR 2022).” Theory Pract. Log.
Program. 25, no. 2 (2025): 132–133. https://doi.org/10.1017/S1471068425000079.'
ieee: 'G. Governatori and A.-Y. Turhan, “Introduction to the Special Issue on Logic
Rules and Reasoning: Selected Papers From the 6th International Joint Conference
on Rules and Reasoning (RuleML+RR 2022),” Theory Pract. Log. Program.,
vol. 25, no. 2, pp. 132–133, 2025, doi: 10.1017/S1471068425000079.'
mla: 'Governatori, Guido, and Anni-Yasmin Turhan. “Introduction to the Special Issue
on Logic Rules and Reasoning: Selected Papers From the 6th International Joint
Conference on Rules and Reasoning (RuleML+RR 2022).” Theory Pract. Log. Program.,
vol. 25, no. 2, 2025, pp. 132–133, doi:10.1017/S1471068425000079.'
short: G. Governatori, A.-Y. Turhan, Theory Pract. Log. Program. 25 (2025) 132–133.
date_created: 2025-09-30T07:58:55Z
date_updated: 2025-09-30T08:02:13Z
department:
- _id: '888'
doi: 10.1017/S1471068425000079
intvolume: ' 25'
issue: '2'
language:
- iso: eng
page: 132–133
publication: Theory Pract. Log. Program.
status: public
title: 'Introduction to the Special Issue on Logic Rules and Reasoning: Selected Papers
From the 6th International Joint Conference on Rules and Reasoning (RuleML+RR 2022)'
type: journal_article
user_id: '117185'
volume: 25
year: '2025'
...
---
_id: '61874'
abstract:
- lang: eng
text: "\r\n We study descriptive complexity of counting complexity
classes in the range from #P to\r\n \r\n
\ \\({\\text{#}\\!\\cdot\\!\\text{NP}}\\)\r\n
\ \r\n . The proof of Fagin’s characterization
of NP by existential second-order logic generalizes to the counting setting in
the following sense: The class #P can be logically described as the class of functions
counting satisfying assignments to free relation variables in first-order formulae.
This was first observed by Saluja et al. (1995). In this paper we extend this
study to classes beyond #P and extensions of first-order logic with team semantics.
These team-based logics are closely related to existential second-order logic
and its fragments, hence our results also shed light on the complexity of counting
for extensions of first-order logic in Tarski’s semantics. Our results show that
the class\r\n \r\n \\({\\text{#}\\!\\cdot\\!\\text{NP}}\\)\r\n
\ \r\n can be logically characterized
by independence logic and existential second-order logic, whereas dependence logic
and inclusion logic give rise to subclasses of\r\n \r\n \\({\\text{#}\\!\\cdot\\!\\text{NP}}\\)\r\n
\ \r\n and #P , respectively. We further
relate the class obtained from inclusion logic to the complexity class\r\n \r\n \\({\\text{TotP}} \\subseteq{\\text{#P}}\\)\r\n
\ \r\n .\r\n "
article_number: '3771721'
author:
- first_name: Anselm
full_name: Haak, Anselm
id: '109969'
last_name: Haak
- first_name: Juha
full_name: Kontinen, Juha
last_name: Kontinen
- first_name: Fabian
full_name: Müller, Fabian
last_name: Müller
- first_name: Heribert
full_name: Vollmer, Heribert
last_name: Vollmer
- first_name: Fan
full_name: Yang, Fan
last_name: Yang
citation:
ama: Haak A, Kontinen J, Müller F, Vollmer H, Yang F. Counting of Teams in First-Order
Team Logics. ACM Transactions on Computational Logic. Published online
2025. doi:10.1145/3771721
apa: Haak, A., Kontinen, J., Müller, F., Vollmer, H., & Yang, F. (2025). Counting
of Teams in First-Order Team Logics. ACM Transactions on Computational Logic,
Article 3771721. https://doi.org/10.1145/3771721
bibtex: '@article{Haak_Kontinen_Müller_Vollmer_Yang_2025, title={Counting of Teams
in First-Order Team Logics}, DOI={10.1145/3771721},
number={3771721}, journal={ACM Transactions on Computational Logic}, publisher={Association
for Computing Machinery (ACM)}, author={Haak, Anselm and Kontinen, Juha and Müller,
Fabian and Vollmer, Heribert and Yang, Fan}, year={2025} }'
chicago: Haak, Anselm, Juha Kontinen, Fabian Müller, Heribert Vollmer, and Fan Yang.
“Counting of Teams in First-Order Team Logics.” ACM Transactions on Computational
Logic, 2025. https://doi.org/10.1145/3771721.
ieee: 'A. Haak, J. Kontinen, F. Müller, H. Vollmer, and F. Yang, “Counting of Teams
in First-Order Team Logics,” ACM Transactions on Computational Logic, Art.
no. 3771721, 2025, doi: 10.1145/3771721.'
mla: Haak, Anselm, et al. “Counting of Teams in First-Order Team Logics.” ACM
Transactions on Computational Logic, 3771721, Association for Computing Machinery
(ACM), 2025, doi:10.1145/3771721.
short: A. Haak, J. Kontinen, F. Müller, H. Vollmer, F. Yang, ACM Transactions on
Computational Logic (2025).
date_created: 2025-10-17T09:43:42Z
date_updated: 2025-10-17T09:44:06Z
department:
- _id: '888'
doi: 10.1145/3771721
language:
- iso: eng
publication: ACM Transactions on Computational Logic
publication_identifier:
issn:
- 1529-3785
- 1557-945X
publication_status: published
publisher: Association for Computing Machinery (ACM)
status: public
title: Counting of Teams in First-Order Team Logics
type: journal_article
user_id: '109969'
year: '2025'
...
---
_id: '60496'
abstract:
- lang: eng
text: Hypertree decompositions provide a way to evaluate Conjunctive Queries
(CQs) in polynomial time, where the exponent of this polynomial is determined
by the width of the decomposition. In theory, the goal of efficient CQ evaluation
therefore has to be a minimisation of the width. However, in practical settings,
it turns out that there are also other properties of a decomposition that influence
the performance of query evaluation. It is therefore of interest to restrict the
computation of decompositions by constraints and to guide this computation by
preferences. To this end, we propose a novel framework based on candidate tree
decompositions, which allows us to introduce soft hypertree width (shw). This
width measure is a relaxation of hypertree width (hw); it is never greater than
hw and, in some cases, shw may actually be lower than hw. Most importantly, shw
preserves the tractability of deciding if a given CQ is below some fixed bound,
while offering more algorithmic flexibility. In particular, it provides a natural
way to incorporate preferences and constraints into the computation of decompositions.
A prototype implementation and preliminary experiments confirm that this novel
framework can indeed have a practical impact on query evaluation.
author:
- first_name: Matthias
full_name: Lanzinger, Matthias
last_name: Lanzinger
- first_name: Cem
full_name: Okulmus, Cem
id: '114410'
last_name: Okulmus
orcid: 0000-0002-7742-0439
- first_name: Reinhard
full_name: Pichler, Reinhard
last_name: Pichler
- first_name: Alexander
full_name: Selzer, Alexander
last_name: Selzer
- first_name: Georg
full_name: Gottlob, Georg
last_name: Gottlob
citation:
ama: Lanzinger M, Okulmus C, Pichler R, Selzer A, Gottlob G. Soft and Constrained
Hypertree Width. Proceedings of the ACM on Management of Data. 2025;3(2):1-25.
doi:10.1145/3725251
apa: Lanzinger, M., Okulmus, C., Pichler, R., Selzer, A., & Gottlob, G. (2025).
Soft and Constrained Hypertree Width. Proceedings of the ACM on Management
of Data, 3(2), 1–25. https://doi.org/10.1145/3725251
bibtex: '@article{Lanzinger_Okulmus_Pichler_Selzer_Gottlob_2025, title={Soft and
Constrained Hypertree Width}, volume={3}, DOI={10.1145/3725251},
number={2}, journal={Proceedings of the ACM on Management of Data}, publisher={Association
for Computing Machinery (ACM)}, author={Lanzinger, Matthias and Okulmus, Cem and
Pichler, Reinhard and Selzer, Alexander and Gottlob, Georg}, year={2025}, pages={1–25}
}'
chicago: 'Lanzinger, Matthias, Cem Okulmus, Reinhard Pichler, Alexander Selzer,
and Georg Gottlob. “Soft and Constrained Hypertree Width.” Proceedings of the
ACM on Management of Data 3, no. 2 (2025): 1–25. https://doi.org/10.1145/3725251.'
ieee: 'M. Lanzinger, C. Okulmus, R. Pichler, A. Selzer, and G. Gottlob, “Soft and
Constrained Hypertree Width,” Proceedings of the ACM on Management of Data,
vol. 3, no. 2, pp. 1–25, 2025, doi: 10.1145/3725251.'
mla: Lanzinger, Matthias, et al. “Soft and Constrained Hypertree Width.” Proceedings
of the ACM on Management of Data, vol. 3, no. 2, Association for Computing
Machinery (ACM), 2025, pp. 1–25, doi:10.1145/3725251.
short: M. Lanzinger, C. Okulmus, R. Pichler, A. Selzer, G. Gottlob, Proceedings
of the ACM on Management of Data 3 (2025) 1–25.
conference:
end_date: 2025-06-27
location: Berlin
name: 44th ACM Symposium on Principles of Database Systems (PODS) 2025
start_date: 2025-06-22
date_created: 2025-07-02T11:41:00Z
date_updated: 2025-07-02T11:45:18Z
department:
- _id: '888'
doi: 10.1145/3725251
intvolume: ' 3'
issue: '2'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/2412.11669
oa: '1'
page: 1-25
publication: Proceedings of the ACM on Management of Data
publication_identifier:
issn:
- 2836-6573
publication_status: published
publisher: Association for Computing Machinery (ACM)
status: public
title: Soft and Constrained Hypertree Width
type: journal_article
user_id: '114410'
volume: 3
year: '2025'
...
---
_id: '60497'
abstract:
- lang: eng
text: Despite the advantages that the virtual knowledge graph paradigm has brought
to many application domains, state-of-the-art systems still do not support popular
graph database management systems like Neo4j. Their query rewriting algorithms
focus on languages like conjunctive queries and their unions, which were developed
for relational data and are poorly suited for graph data. Moreover, they also
limit the expressiveness of the ontology languages that admit rewritings, restricting
them to those that enjoy the so-called FO-rewritability property. Rewritings have
thus focused on the DL-Lite family of Description Logics. In this paper, we propose
a technique for rewriting a family of navigational queries for a suitably tailored
fragment of ELHI. Leveraging navigational features in the target query language,
we can include some widely-used axiom shapes not supported by DL-Lite. We implemented
a proof-of-concept prototype that rewrites into Cypher queries, and tested it
on a real-world cognitive neuroscience use case with promising results.
author:
- first_name: Bianca
full_name: Löhnert, Bianca
last_name: Löhnert
- first_name: Nikolaus
full_name: Augsten, Nikolaus
last_name: Augsten
- first_name: Cem
full_name: Okulmus, Cem
id: '114410'
last_name: Okulmus
orcid: 0000-0002-7742-0439
- first_name: Magdalena
full_name: Ortiz, Magdalena
last_name: Ortiz
citation:
ama: 'Löhnert B, Augsten N, Okulmus C, Ortiz M. Towards Practicable Algorithms for Rewriting
Graph Queries Beyond DL-Lite. In: The Semantic Web - 22nd European Semantic
Web Conference, {ESWC} 2025, Portoroz, Slovenia, June 1-5, 2025, Proceedings,
Part {I}. Vol 15718. Lecture Notes in Computer Science. Springer Nature Switzerland;
2025:342--361. doi:10.1007/978-3-031-94575-5_19'
apa: Löhnert, B., Augsten, N., Okulmus, C., & Ortiz, M. (2025). Towards Practicable
Algorithms for Rewriting Graph Queries Beyond DL-Lite. The Semantic Web - 22nd
European Semantic Web Conference, {ESWC} 2025, Portoroz, Slovenia, June 1-5, 2025,
Proceedings, Part {I}, 15718, 342--361. https://doi.org/10.1007/978-3-031-94575-5_19
bibtex: '@inproceedings{Löhnert_Augsten_Okulmus_Ortiz_2025, series={Lecture Notes
in Computer Science}, title={Towards Practicable Algorithms for Rewriting Graph
Queries Beyond DL-Lite}, volume={15718}, DOI={10.1007/978-3-031-94575-5_19},
booktitle={The Semantic Web - 22nd European Semantic Web Conference, {ESWC} 2025,
Portoroz, Slovenia, June 1-5, 2025, Proceedings, Part {I}}, publisher={Springer
Nature Switzerland}, author={Löhnert, Bianca and Augsten, Nikolaus and Okulmus,
Cem and Ortiz, Magdalena}, year={2025}, pages={342--361}, collection={Lecture
Notes in Computer Science} }'
chicago: Löhnert, Bianca, Nikolaus Augsten, Cem Okulmus, and Magdalena Ortiz. “Towards
Practicable Algorithms for Rewriting Graph Queries Beyond DL-Lite.” In The
Semantic Web - 22nd European Semantic Web Conference, {ESWC} 2025, Portoroz, Slovenia,
June 1-5, 2025, Proceedings, Part {I}, 15718:342--361. Lecture Notes in Computer
Science. Springer Nature Switzerland, 2025. https://doi.org/10.1007/978-3-031-94575-5_19.
ieee: 'B. Löhnert, N. Augsten, C. Okulmus, and M. Ortiz, “Towards Practicable Algorithms
for Rewriting Graph Queries Beyond DL-Lite,” in The Semantic Web - 22nd European
Semantic Web Conference, {ESWC} 2025, Portoroz, Slovenia, June 1-5, 2025, Proceedings,
Part {I}, Portorož, Slovenia, 2025, vol. 15718, pp. 342--361, doi: 10.1007/978-3-031-94575-5_19.'
mla: Löhnert, Bianca, et al. “Towards Practicable Algorithms for Rewriting Graph
Queries Beyond DL-Lite.” The Semantic Web - 22nd European Semantic Web Conference,
{ESWC} 2025, Portoroz, Slovenia, June 1-5, 2025, Proceedings, Part {I}, vol.
15718, Springer Nature Switzerland, 2025, pp. 342--361, doi:10.1007/978-3-031-94575-5_19.
short: 'B. Löhnert, N. Augsten, C. Okulmus, M. Ortiz, in: The Semantic Web - 22nd
European Semantic Web Conference, {ESWC} 2025, Portoroz, Slovenia, June 1-5, 2025,
Proceedings, Part {I}, Springer Nature Switzerland, 2025, pp. 342--361.'
conference:
end_date: 2025-06-05
location: Portorož, Slovenia
name: 22th European Semantic Web Conference (ESWC 2025)
start_date: 2025-06-01
date_created: 2025-07-02T11:46:06Z
date_updated: 2025-07-02T11:55:19Z
department:
- _id: '888'
doi: 10.1007/978-3-031-94575-5_19
intvolume: ' 15718'
keyword:
- Ontology-based Data Access
- Property Graphs
- Navigational Queries
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/2405.18181
oa: '1'
page: 342--361
publication: The Semantic Web - 22nd European Semantic Web Conference, {ESWC} 2025,
Portoroz, Slovenia, June 1-5, 2025, Proceedings, Part {I}
publication_identifier:
isbn:
- '9783031945748'
- '9783031945755'
issn:
- 0302-9743
- 1611-3349
publication_status: published
publisher: Springer Nature Switzerland
quality_controlled: '1'
series_title: Lecture Notes in Computer Science
status: public
title: Towards Practicable Algorithms for Rewriting Graph Queries Beyond DL-Lite
type: conference
user_id: '114410'
volume: 15718
year: '2025'
...
---
_id: '64905'
author:
- first_name: Meghyn
full_name: Bienvenu, Meghyn
last_name: Bienvenu
- first_name: Camille
full_name: Bourgaux, Camille
last_name: Bourgaux
- first_name: Atefe
full_name: Khodadaditaghanaki, Atefe
id: '114980'
last_name: Khodadaditaghanaki
citation:
ama: 'Bienvenu M, Bourgaux C, Khodadaditaghanaki A. Inconsistency Handling in DatalogMTL.
In: Kwok J, ed. Proceedings of the Thirty-Fourth International Joint Conference
on Artificial Intelligence, {IJCAI-25}. International Joint Conferences on
Artificial Intelligence Organization; 2025:4374–4381. doi:10.24963/ijcai.2025/487'
apa: Bienvenu, M., Bourgaux, C., & Khodadaditaghanaki, A. (2025). Inconsistency
Handling in DatalogMTL. In J. Kwok (Ed.), Proceedings of the Thirty-Fourth
International Joint Conference on Artificial Intelligence, {IJCAI-25} (pp.
4374–4381). International Joint Conferences on Artificial Intelligence Organization.
https://doi.org/10.24963/ijcai.2025/487
bibtex: '@inproceedings{Bienvenu_Bourgaux_Khodadaditaghanaki_2025, title={Inconsistency
Handling in DatalogMTL}, DOI={10.24963/ijcai.2025/487},
booktitle={Proceedings of the Thirty-Fourth International Joint Conference on
Artificial Intelligence, {IJCAI-25}}, publisher={International Joint Conferences
on Artificial Intelligence Organization}, author={Bienvenu, Meghyn and Bourgaux,
Camille and Khodadaditaghanaki, Atefe}, editor={Kwok, James}, year={2025}, pages={4374–4381}
}'
chicago: Bienvenu, Meghyn, Camille Bourgaux, and Atefe Khodadaditaghanaki. “Inconsistency
Handling in DatalogMTL.” In Proceedings of the Thirty-Fourth International
Joint Conference on Artificial Intelligence, {IJCAI-25}, edited by James Kwok,
4374–4381. International Joint Conferences on Artificial Intelligence Organization,
2025. https://doi.org/10.24963/ijcai.2025/487.
ieee: 'M. Bienvenu, C. Bourgaux, and A. Khodadaditaghanaki, “Inconsistency Handling
in DatalogMTL,” in Proceedings of the Thirty-Fourth International Joint Conference
on Artificial Intelligence, {IJCAI-25}, 2025, pp. 4374–4381, doi: 10.24963/ijcai.2025/487.'
mla: Bienvenu, Meghyn, et al. “Inconsistency Handling in DatalogMTL.” Proceedings
of the Thirty-Fourth International Joint Conference on Artificial Intelligence,
{IJCAI-25}, edited by James Kwok, International Joint Conferences on Artificial
Intelligence Organization, 2025, pp. 4374–4381, doi:10.24963/ijcai.2025/487.
short: 'M. Bienvenu, C. Bourgaux, A. Khodadaditaghanaki, in: J. Kwok (Ed.), Proceedings
of the Thirty-Fourth International Joint Conference on Artificial Intelligence,
{IJCAI-25}, International Joint Conferences on Artificial Intelligence Organization,
2025, pp. 4374–4381.'
date_created: 2026-03-12T11:39:11Z
date_updated: 2026-03-17T12:54:10Z
ddc:
- '000'
doi: 10.24963/ijcai.2025/487
editor:
- first_name: James
full_name: Kwok, James
last_name: Kwok
file:
- access_level: closed
content_type: application/pdf
creator: atefe
date_created: 2026-03-12T11:43:29Z
date_updated: 2026-03-12T11:43:29Z
file_id: '64906'
file_name: Our Paper.pdf
file_size: 197125
relation: main_file
success: 1
file_date_updated: 2026-03-12T11:43:29Z
has_accepted_license: '1'
language:
- iso: eng
page: 4374–4381
publication: Proceedings of the Thirty-Fourth International Joint Conference on Artificial
Intelligence, {IJCAI-25}
publisher: International Joint Conferences on Artificial Intelligence Organization
status: public
title: Inconsistency Handling in DatalogMTL
type: conference
user_id: '114980'
year: '2025'
...
---
_id: '60168'
author:
- first_name: Holger
full_name: Dell, Holger
last_name: Dell
- first_name: Anselm
full_name: Haak, Anselm
id: '109969'
last_name: Haak
- first_name: Melvin
full_name: Kallmayer, Melvin
last_name: Kallmayer
- first_name: Leo
full_name: Wennmann, Leo
last_name: Wennmann
citation:
ama: 'Dell H, Haak A, Kallmayer M, Wennmann L. Solving Polynomial Equations Over
Finite Fields. In: Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete
Algorithms (SODA). Society for Industrial and Applied Mathematics; 2025. doi:10.1137/1.9781611978322.90'
apa: Dell, H., Haak, A., Kallmayer, M., & Wennmann, L. (2025). Solving Polynomial
Equations Over Finite Fields. Proceedings of the 2025 Annual ACM-SIAM Symposium
on Discrete Algorithms (SODA). ACM-SIAM Symposium on Discrete Algorithms (SODA25),
New Orleans, Louisiana, U.S. https://doi.org/10.1137/1.9781611978322.90
bibtex: '@inproceedings{Dell_Haak_Kallmayer_Wennmann_2025, place={Philadelphia,
PA}, title={Solving Polynomial Equations Over Finite Fields}, DOI={10.1137/1.9781611978322.90},
booktitle={Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms
(SODA)}, publisher={Society for Industrial and Applied Mathematics}, author={Dell,
Holger and Haak, Anselm and Kallmayer, Melvin and Wennmann, Leo}, year={2025}
}'
chicago: 'Dell, Holger, Anselm Haak, Melvin Kallmayer, and Leo Wennmann. “Solving
Polynomial Equations Over Finite Fields.” In Proceedings of the 2025 Annual
ACM-SIAM Symposium on Discrete Algorithms (SODA). Philadelphia, PA: Society
for Industrial and Applied Mathematics, 2025. https://doi.org/10.1137/1.9781611978322.90.'
ieee: 'H. Dell, A. Haak, M. Kallmayer, and L. Wennmann, “Solving Polynomial Equations
Over Finite Fields,” presented at the ACM-SIAM Symposium on Discrete Algorithms
(SODA25), New Orleans, Louisiana, U.S., 2025, doi: 10.1137/1.9781611978322.90.'
mla: Dell, Holger, et al. “Solving Polynomial Equations Over Finite Fields.” Proceedings
of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), Society
for Industrial and Applied Mathematics, 2025, doi:10.1137/1.9781611978322.90.
short: 'H. Dell, A. Haak, M. Kallmayer, L. Wennmann, in: Proceedings of the 2025
Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), Society for Industrial
and Applied Mathematics, Philadelphia, PA, 2025.'
conference:
end_date: 2025-01-15
location: New Orleans, Louisiana, U.S.
name: ACM-SIAM Symposium on Discrete Algorithms (SODA25)
start_date: 2025-01-12
date_created: 2025-06-10T13:48:14Z
date_updated: 2026-04-14T08:18:11Z
doi: 10.1137/1.9781611978322.90
language:
- iso: eng
place: Philadelphia, PA
publication: Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms
(SODA)
publication_identifier:
isbn:
- '9781611978322'
publication_status: published
publisher: Society for Industrial and Applied Mathematics
status: public
title: Solving Polynomial Equations Over Finite Fields
type: conference
user_id: '109969'
year: '2025'
...