[{"year":"2026","title":"Rules and Reasoning - 9th International Joint Conference, RuleML+RR 2025, Istanbul, Turkey, September 22-24, 2025, Proceedings","status":"public","publication_identifier":{"isbn":["978-3-032-08886-4"]},"date_updated":"2026-02-04T07:13:38Z","intvolume":"     16144","_id":"63860","series_title":"Lecture Notes in Computer Science","publisher":"Springer","language":[{"iso":"eng"}],"doi":"10.1007/978-3-032-08887-1","user_id":"117185","editor":[{"last_name":"Hogan","first_name":"Aidan","full_name":"Hogan, Aidan"},{"full_name":"Satoh, Ken","first_name":"Ken","last_name":"Satoh"},{"first_name":"Hasan","last_name":"Dag","full_name":"Dag, Hasan"},{"id":"104470","full_name":"Turhan, Anni-Yasmin","first_name":"Anni-Yasmin","last_name":"Turhan"},{"last_name":"Roman","first_name":"Dumitru","full_name":"Roman, Dumitru"},{"first_name":"Ahmet","last_name":"Soylu","full_name":"Soylu, Ahmet"}],"volume":16144,"citation":{"ama":"Hogan A, Satoh K, Dag H, Turhan A-Y, Roman D, Soylu A, eds. <i>Rules and Reasoning - 9th International Joint Conference, RuleML+RR 2025, Istanbul, Turkey, September 22-24, 2025, Proceedings</i>. Vol 16144. Springer; 2026. doi:<a href=\"https://doi.org/10.1007/978-3-032-08887-1\">10.1007/978-3-032-08887-1</a>","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={<a href=\"https://doi.org/10.1007/978-3-032-08887-1\">10.1007/978-3-032-08887-1</a>}, publisher={Springer}, year={2026}, collection={Lecture Notes in Computer Science} }","mla":"Hogan, Aidan, et al., editors. <i>Rules and Reasoning - 9th International Joint Conference, RuleML+RR 2025, Istanbul, Turkey, September 22-24, 2025, Proceedings</i>. Springer, 2026, doi:<a href=\"https://doi.org/10.1007/978-3-032-08887-1\">10.1007/978-3-032-08887-1</a>.","chicago":"Hogan, Aidan, Ken Satoh, Hasan Dag, Anni-Yasmin Turhan, Dumitru Roman, and Ahmet Soylu, eds. <i>Rules and Reasoning - 9th International Joint Conference, RuleML+RR 2025, Istanbul, Turkey, September 22-24, 2025, Proceedings</i>. Vol. 16144. Lecture Notes in Computer Science. Springer, 2026. <a href=\"https://doi.org/10.1007/978-3-032-08887-1\">https://doi.org/10.1007/978-3-032-08887-1</a>.","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.","apa":"Hogan, A., Satoh, K., Dag, H., Turhan, A.-Y., Roman, D., &#38; Soylu, A. (Eds.). (2026). <i>Rules and Reasoning - 9th International Joint Conference, RuleML+RR 2025, Istanbul, Turkey, September 22-24, 2025, Proceedings</i> (Vol. 16144). Springer. <a href=\"https://doi.org/10.1007/978-3-032-08887-1\">https://doi.org/10.1007/978-3-032-08887-1</a>","ieee":"A. Hogan, K. Satoh, H. Dag, A.-Y. Turhan, D. Roman, and A. Soylu, Eds., <i>Rules and Reasoning - 9th International Joint Conference, RuleML+RR 2025, Istanbul, Turkey, September 22-24, 2025, Proceedings</i>, vol. 16144. Springer, 2026."},"date_created":"2026-02-04T07:12:48Z","type":"conference_editor"},{"citation":{"mla":"Böhm, Daniela, et al. “Selective Use of Yannakakis’ Algorithm for Consistent Performance Gains.” <i>Proceedings of the 28th International Workshop on Design, Optimization, Languages and Analytical Processing of Big Data (DOLAP 2026)</i>, 2026.","ama":"Böhm D, Gottlob G, Lanzinger M, et al. Selective Use of Yannakakis’ Algorithm for Consistent Performance Gains. In: <i>Proceedings of the 28th International Workshop on Design, Optimization, Languages and Analytical Processing of Big Data (DOLAP 2026)</i>. ; 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} }","apa":"Böhm, D., Gottlob, G., Lanzinger, M., Longo, D. M., Okulmus, C., Pichler, R., &#38; Selzer, A. (2026). Selective Use of Yannakakis’ Algorithm for Consistent Performance Gains. <i>Proceedings of the 28th International Workshop on Design, Optimization, Languages and Analytical Processing of Big Data (DOLAP 2026)</i>.","ieee":"D. Böhm <i>et al.</i>, “Selective Use of Yannakakis’ Algorithm for Consistent Performance Gains,” 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.","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 <i>Proceedings of the 28th International Workshop on Design, Optimization, Languages and Analytical Processing of Big Data (DOLAP 2026)</i>. Tampere, Finland, 2026."},"publication":"Proceedings of the 28th International Workshop on Design, Optimization, Languages and Analytical Processing of Big Data (DOLAP 2026)","abstract":[{"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.","lang":"eng"}],"place":"Tampere, Finland","date_created":"2026-03-27T15:20:54Z","oa":"1","department":[{"_id":"888"}],"keyword":["Join Queries","Acyclic Queries","Query Processing"],"type":"conference","author":[{"last_name":"Böhm","first_name":"Daniela","full_name":"Böhm, Daniela"},{"full_name":"Gottlob, Georg","last_name":"Gottlob","first_name":"Georg"},{"full_name":"Lanzinger, Matthias","last_name":"Lanzinger","first_name":"Matthias"},{"full_name":"Longo, Davide Mario","first_name":"Davide Mario","last_name":"Longo"},{"id":"114410","full_name":"Okulmus, Cem","last_name":"Okulmus","orcid":"0000-0002-7742-0439","first_name":"Cem"},{"full_name":"Pichler, Reinhard","last_name":"Pichler","first_name":"Reinhard"},{"full_name":"Selzer, Alexander","first_name":"Alexander","last_name":"Selzer"}],"year":"2026","status":"public","title":"Selective Use of Yannakakis’ Algorithm for Consistent Performance Gains","date_updated":"2026-03-27T15:22:01Z","_id":"65178","language":[{"iso":"eng"}],"main_file_link":[{"url":"https://ceur-ws.org/Vol-4186/paper2.pdf","open_access":"1"}],"user_id":"114410"},{"date_updated":"2026-04-22T14:17:20Z","conference":{"start_date":"2026-07-20","name":"23rd International Conference on Principles of Knowledge Representation and Reasoning (KR 2026)","location":"Lisbon, Portugal","end_date":"2026-07-23"},"author":[{"id":"114410","last_name":"Okulmus","first_name":"Cem","orcid":"0000-0002-7742-0439","full_name":"Okulmus, Cem"},{"full_name":"Ahmetaj, Shqiponja","first_name":"Shqiponja","last_name":"Ahmetaj"},{"last_name":"Boneva","first_name":"Iovka ","full_name":"Boneva, Iovka "},{"full_name":"Hidders, Jan","last_name":"Hidders","first_name":"Jan"},{"full_name":"Jakubowski, Maxime ","first_name":"Maxime ","last_name":"Jakubowski"},{"full_name":" Labra Gayo, José Emilio","first_name":"José Emilio","last_name":" Labra Gayo"},{"full_name":"Martens, Wim","last_name":"Martens","first_name":"Wim"},{"full_name":"Mogavero, Fabio ","first_name":"Fabio ","last_name":"Mogavero"},{"first_name":"Filip ","last_name":"Murlak","full_name":"Murlak, Filip "},{"full_name":"Savković,  Ognjen ","last_name":"Savković","first_name":" Ognjen "},{"last_name":"Šimkus","first_name":"Mantas ","full_name":"Šimkus, Mantas "},{"first_name":"Dominik ","last_name":"Tomaszuk","full_name":"Tomaszuk, Dominik "}],"year":"2026","title":"Common Foundations for Recursive Shape Languages","status":"public","user_id":"114410","_id":"65489","language":[{"iso":"eng"}],"citation":{"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} }","ama":"Okulmus C, Ahmetaj S, Boneva I, et al. Common Foundations for Recursive Shape Languages. In: <i>Proceedings of the 23rd International Conference on Principles of Knowledge Representation and Reasoning (KR 2026)</i>. ; 2026.","mla":"Okulmus, Cem, et al. “Common Foundations for Recursive Shape Languages.” <i>Proceedings of the 23rd International Conference on Principles of Knowledge Representation and Reasoning (KR 2026)</i>, 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 <i>Proceedings of the 23rd International Conference on Principles of Knowledge Representation and Reasoning (KR 2026)</i>, 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.","ieee":"C. Okulmus <i>et al.</i>, “Common Foundations for Recursive Shape Languages,” presented at the 23rd International Conference on Principles of Knowledge Representation and Reasoning (KR 2026), Lisbon, Portugal, 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., &#38; Tomaszuk, D. (2026). Common Foundations for Recursive Shape Languages. <i>Proceedings of the 23rd International Conference on Principles of Knowledge Representation and Reasoning (KR 2026)</i>. 23rd International Conference on Principles of Knowledge Representation and Reasoning (KR 2026), Lisbon, Portugal."},"publication":"Proceedings of the 23rd International Conference on Principles of Knowledge Representation and Reasoning (KR 2026)","department":[{"_id":"888"}],"type":"conference","date_created":"2026-04-22T14:16:58Z"},{"intvolume":"     16475","date_updated":"2026-05-11T08:50:25Z","publication_identifier":{"isbn":["978-3-032-21539-0"]},"status":"public","title":"Foundations of Information and Knowledge Systems - 14th International Symposium, FoIKS 2026, Hanover, Germany, March 23-26, 2026, Proceedings","year":"2026","editor":[{"full_name":"Turhan, Anni-Yasmin","first_name":"Anni-Yasmin","last_name":"Turhan","id":"104470"},{"last_name":"Virtema","first_name":"Jonni","full_name":"Virtema, Jonni"}],"volume":16475,"doi":"10.1007/978-3-032-21540-6","user_id":"117185","_id":"65605","publisher":"Springer","series_title":"Lecture Notes in Computer Science","language":[{"iso":"eng"}],"citation":{"chicago":"Turhan, Anni-Yasmin, and Jonni Virtema, eds. <i>Foundations of Information and Knowledge Systems - 14th International Symposium, FoIKS 2026, Hanover, Germany, March 23-26, 2026, Proceedings</i>. Vol. 16475. Lecture Notes in Computer Science. Springer, 2026. <a href=\"https://doi.org/10.1007/978-3-032-21540-6\">https://doi.org/10.1007/978-3-032-21540-6</a>.","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.","ieee":"A.-Y. Turhan and J. Virtema, Eds., <i>Foundations of Information and Knowledge Systems - 14th International Symposium, FoIKS 2026, Hanover, Germany, March 23-26, 2026, Proceedings</i>, vol. 16475. Springer, 2026.","apa":"Turhan, A.-Y., &#38; Virtema, J. (Eds.). (2026). <i>Foundations of Information and Knowledge Systems - 14th International Symposium, FoIKS 2026, Hanover, Germany, March 23-26, 2026, Proceedings</i> (Vol. 16475). Springer. <a href=\"https://doi.org/10.1007/978-3-032-21540-6\">https://doi.org/10.1007/978-3-032-21540-6</a>","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={<a href=\"https://doi.org/10.1007/978-3-032-21540-6\">10.1007/978-3-032-21540-6</a>}, publisher={Springer}, year={2026}, collection={Lecture Notes in Computer Science} }","ama":"Turhan A-Y, Virtema J, eds. <i>Foundations of Information and Knowledge Systems - 14th International Symposium, FoIKS 2026, Hanover, Germany, March 23-26, 2026, Proceedings</i>. Vol 16475. Springer; 2026. doi:<a href=\"https://doi.org/10.1007/978-3-032-21540-6\">10.1007/978-3-032-21540-6</a>","mla":"Turhan, Anni-Yasmin, and Jonni Virtema, editors. <i>Foundations of Information and Knowledge Systems - 14th International Symposium, FoIKS 2026, Hanover, Germany, March 23-26, 2026, Proceedings</i>. Springer, 2026, doi:<a href=\"https://doi.org/10.1007/978-3-032-21540-6\">10.1007/978-3-032-21540-6</a>."},"type":"conference_editor","date_created":"2026-05-11T08:46:09Z"},{"type":"conference","department":[{"_id":"888"},{"_id":"574"}],"date_created":"2026-05-05T14:29:38Z","citation":{"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.","apa":"Haak, A., Koopmann, P., Mahmood, Y., &#38; Turhan, A.-Y. (2026). <i>ABox Abduction for Inconsistent Knowledge Bases under Repair Semantics</i>. 23rd International Conference on Principles of Knowledge Representation and Reasoning, Lisbon.","chicago":"Haak, Anselm, Patrick Koopmann, Yasir Mahmood, and Anni-Yasmin Turhan. “ABox Abduction for Inconsistent Knowledge Bases under Repair Semantics,” 2026.","short":"A. Haak, P. Koopmann, Y. Mahmood, A.-Y. Turhan, in: 2026.","mla":"Haak, Anselm, et al. <i>ABox Abduction for Inconsistent Knowledge Bases under Repair Semantics</i>. 2026.","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} }","ama":"Haak A, Koopmann P, Mahmood Y, Turhan A-Y. ABox Abduction for Inconsistent Knowledge Bases under Repair Semantics. In: ; 2026."},"user_id":"109969","language":[{"iso":"eng"}],"_id":"65566","date_updated":"2026-05-21T08:26:07Z","title":"ABox Abduction for Inconsistent Knowledge Bases under Repair Semantics","status":"public","year":"2026","author":[{"id":"109969","first_name":"Anselm","last_name":"Haak","full_name":"Haak, Anselm"},{"last_name":"Koopmann","first_name":"Patrick","full_name":"Koopmann, Patrick"},{"last_name":"Mahmood","first_name":"Yasir","full_name":"Mahmood, Yasir","id":"99353"},{"first_name":"Anni-Yasmin","last_name":"Turhan","full_name":"Turhan, Anni-Yasmin","id":"104470"}],"conference":{"end_date":"2026-07-23","start_date":"2026-07-20","name":"23rd International Conference on Principles of Knowledge Representation and Reasoning","location":"Lisbon"}},{"conference":{"end_date":"2026-09-03","start_date":"2026-09-01","name":"33rd International Symposium on Temporal Representation and Reasoning (TIME 2026)","location":"Cork, Ireland"},"author":[{"full_name":"Corman, Julien","last_name":"Corman","first_name":"Julien"},{"full_name":"Kontchakov, Roman","last_name":"Kontchakov","first_name":"Roman"},{"first_name":"Cem","last_name":"Okulmus","orcid":"0000-0002-7742-0439","full_name":"Okulmus, Cem","id":"114410"}],"year":"2026","title":"Querying Interval-Based Temporal Data with SPARQL","status":"public","date_updated":"2026-07-08T11:13:04Z","language":[{"iso":"eng"}],"_id":"66378","user_id":"114410","citation":{"ama":"Corman J, Kontchakov R, Okulmus C. Querying Interval-Based Temporal Data with SPARQL. In: <i>Proceedings of the 33rd International Symposium on Temporal Representation and Reasoning (TIME 2026)</i>. ; 2026.","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} }","mla":"Corman, Julien, et al. “Querying Interval-Based Temporal Data with SPARQL.” <i>Proceedings of the 33rd International Symposium on Temporal Representation and Reasoning (TIME 2026)</i>, 2026.","chicago":"Corman, Julien, Roman Kontchakov, and Cem Okulmus. “Querying Interval-Based Temporal Data with SPARQL.” In <i>Proceedings of the 33rd International Symposium on Temporal Representation and Reasoning (TIME 2026)</i>, 2026.","short":"J. Corman, R. Kontchakov, C. Okulmus, in: Proceedings of the 33rd International Symposium on Temporal Representation and Reasoning (TIME 2026), 2026.","apa":"Corman, J., Kontchakov, R., &#38; Okulmus, C. (2026). Querying Interval-Based Temporal Data with SPARQL. <i>Proceedings of the 33rd International Symposium on Temporal Representation and Reasoning (TIME 2026)</i>. 33rd International Symposium on Temporal Representation and Reasoning (TIME 2026), Cork, Ireland.","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."},"publication":"Proceedings of the 33rd International Symposium on Temporal Representation and Reasoning (TIME 2026)","date_created":"2026-07-08T11:11:24Z","department":[{"_id":"888"}],"type":"conference"},{"citation":{"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} }","ama":"Gortworst B, Okulmus C, Ortiz M, Turhan A-Y. Reaching for the Stars in EL Concept Learning. In: <i>Proceedings of the 39th International Workshop on Description Logics (DL 2026)</i>. ; 2026.","mla":"Gortworst, Bente, et al. “Reaching for the Stars in EL Concept Learning.” <i>Proceedings of the 39th International Workshop on Description Logics (DL 2026)</i>, 2026.","chicago":"Gortworst, Bente, Cem Okulmus, Magdalena Ortiz, and Anni-Yasmin Turhan. “Reaching for the Stars in EL Concept Learning.” In <i>Proceedings of the 39th International Workshop on Description Logics (DL 2026)</i>, 2026.","short":"B. Gortworst, C. Okulmus, M. Ortiz, A.-Y. Turhan, 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.","apa":"Gortworst, B., Okulmus, C., Ortiz, M., &#38; Turhan, A.-Y. (2026). Reaching for the Stars in EL Concept Learning. <i>Proceedings of the 39th International Workshop on Description Logics (DL 2026)</i>."},"publication":"Proceedings of the 39th International Workshop on Description Logics (DL 2026)","date_created":"2026-07-08T11:23:20Z","department":[{"_id":"888"}],"type":"conference","author":[{"full_name":"Gortworst, Bente","last_name":"Gortworst","first_name":"Bente"},{"id":"114410","full_name":"Okulmus, Cem","last_name":"Okulmus","first_name":"Cem","orcid":"0000-0002-7742-0439"},{"full_name":"Ortiz, Magdalena","first_name":"Magdalena","last_name":"Ortiz"},{"id":"104470","full_name":"Turhan, Anni-Yasmin","first_name":"Anni-Yasmin","last_name":"Turhan"}],"year":"2026","status":"public","title":"Reaching for the Stars in EL Concept Learning","date_updated":"2026-07-08T11:23:25Z","language":[{"iso":"eng"}],"_id":"66379","user_id":"114410"},{"date_updated":"2026-08-02T18:50:22Z","author":[{"first_name":"Bente","last_name":"Gortworst","full_name":"Gortworst, Bente"},{"id":"114410","orcid":"0000-0002-7742-0439","last_name":"Okulmus","first_name":"Cem","full_name":"Okulmus, Cem"},{"full_name":"Ortiz, Magdalena","first_name":"Magdalena","last_name":"Ortiz"},{"last_name":"Turhan","first_name":"Anni-Yasmin","full_name":"Turhan, Anni-Yasmin","id":"104470"}],"year":"2026","status":"public","title":"Shapes from Examples: Foundations of Shape Learning in Recursive SHACL","user_id":"114410","_id":"66631","language":[{"iso":"eng"}],"citation":{"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} }","ama":"Gortworst B, Okulmus C, Ortiz M, Turhan A-Y. Shapes from Examples: Foundations of Shape Learning in Recursive SHACL. In: <i>Proceedings of the 25th International Semantic Web Conference (ISWC 2026)</i>. ; 2026.","mla":"Gortworst, Bente, et al. “Shapes from Examples: Foundations of Shape Learning in Recursive SHACL.” <i>Proceedings of the 25th International Semantic Web Conference (ISWC 2026)</i>, 2026.","chicago":"Gortworst, Bente, Cem Okulmus, Magdalena Ortiz, and Anni-Yasmin Turhan. “Shapes from Examples: Foundations of Shape Learning in Recursive SHACL.” In <i>Proceedings of the 25th International Semantic Web Conference (ISWC 2026)</i>, 2026.","short":"B. Gortworst, C. Okulmus, M. Ortiz, A.-Y. Turhan, 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.","apa":"Gortworst, B., Okulmus, C., Ortiz, M., &#38; Turhan, A.-Y. (2026). Shapes from Examples: Foundations of Shape Learning in Recursive SHACL. <i>Proceedings of the 25th International Semantic Web Conference (ISWC 2026)</i>."},"publication":"Proceedings of the 25th International Semantic Web Conference (ISWC 2026)","department":[{"_id":"888"}],"type":"conference","date_created":"2026-08-02T18:50:17Z"},{"language":[{"iso":"eng"}],"_id":"66710","user_id":"114410","year":"2026","status":"public","title":"Rewriting Ontology-Mediated Property Graph Queries into GQL","author":[{"full_name":"Löhnert, Bianca","first_name":"Bianca","last_name":"Löhnert"},{"full_name":"Augsten, Nikolaus","first_name":"Nikolaus","last_name":"Augsten"},{"full_name":"Okulmus, Cem","first_name":"Cem","last_name":"Okulmus","orcid":"0000-0002-7742-0439","id":"114410"},{"full_name":"Ortiz, Magdalena","last_name":"Ortiz","first_name":"Magdalena"}],"date_updated":"2026-08-13T13:50:46Z","date_created":"2026-08-13T13:50:38Z","type":"conference","department":[{"_id":"888"}],"publication":"Proceedings of the 35th International ACM Conference on Knowledge and Information Management (CIKM 2026)","citation":{"mla":"Löhnert, Bianca, et al. “Rewriting Ontology-Mediated Property Graph Queries into GQL.” <i>Proceedings of the 35th International ACM Conference on Knowledge and Information Management (CIKM 2026)</i>, 2026.","ama":"Löhnert B, Augsten N, Okulmus C, Ortiz M. Rewriting Ontology-Mediated Property Graph Queries into GQL. In: <i>Proceedings of the 35th International ACM Conference on Knowledge and Information Management (CIKM 2026)</i>. ; 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} }","apa":"Löhnert, B., Augsten, N., Okulmus, C., &#38; Ortiz, M. (2026). Rewriting Ontology-Mediated Property Graph Queries into GQL. <i>Proceedings of the 35th International ACM Conference on Knowledge and Information Management (CIKM 2026)</i>.","ieee":"B. Löhnert, N. Augsten, C. Okulmus, and M. Ortiz, “Rewriting Ontology-Mediated Property Graph Queries into GQL,” 2026.","chicago":"Löhnert, Bianca, Nikolaus Augsten, Cem Okulmus, and Magdalena Ortiz. “Rewriting Ontology-Mediated Property Graph Queries into GQL.” In <i>Proceedings of the 35th International ACM Conference on Knowledge and Information Management (CIKM 2026)</i>, 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."}},{"doi":"10.1145/3696410.3714694","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2502.01295"}],"language":[{"iso":"eng"}],"date_updated":"2025-05-07T11:51:17Z","publication_status":"published","year":"2025","title":"Common Foundations for SHACL, ShEx, and PG-Schema","author":[{"first_name":"Shqiponja","last_name":"Ahmetaj","full_name":"Ahmetaj, Shqiponja"},{"last_name":"Boneva","first_name":"Iovka","full_name":"Boneva, Iovka"},{"full_name":"Hidders, Jan","first_name":"Jan","last_name":"Hidders"},{"full_name":"Hose, Katja","first_name":"Katja","last_name":"Hose"},{"first_name":"Maxime","last_name":"Jakubowski","full_name":"Jakubowski, Maxime"},{"first_name":"Jose Emilio","last_name":"Labra Gayo","full_name":"Labra Gayo, Jose Emilio"},{"last_name":"Martens","first_name":"Wim","full_name":"Martens, Wim"},{"first_name":"Fabio","last_name":"Mogavero","full_name":"Mogavero, Fabio"},{"first_name":"Filip","last_name":"Murlak","full_name":"Murlak, Filip"},{"id":"114410","orcid":"0000-0002-7742-0439","first_name":"Cem","last_name":"Okulmus","full_name":"Okulmus, Cem"},{"full_name":"Polleres, Axel","last_name":"Polleres","first_name":"Axel"},{"first_name":"Ognjen","last_name":"Savković","full_name":"Savković, Ognjen"},{"first_name":"Mantas","last_name":"Šimkus","full_name":"Šimkus, Mantas"},{"full_name":"Tomaszuk, Dominik","last_name":"Tomaszuk","first_name":"Dominik"}],"type":"conference","department":[{"_id":"888"}],"date_created":"2025-05-07T11:46:03Z","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"}],"publication":"Proceedings of the ACM on Web Conference 2025","user_id":"114410","page":"8-12","_id":"59840","publisher":"ACM","status":"public","conference":{"location":"Sidney, Australia","name":"ACM Web Conference 2025 ","start_date":"2025-04-28","end_date":"2025-05-02"},"oa":"1","citation":{"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.","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 <i>Proceedings of the ACM on Web Conference 2025</i>, 8–12. ACM, 2025. <a href=\"https://doi.org/10.1145/3696410.3714694\">https://doi.org/10.1145/3696410.3714694</a>.","ieee":"S. Ahmetaj <i>et al.</i>, “Common Foundations for SHACL, ShEx, and PG-Schema,” in <i>Proceedings of the ACM on Web Conference 2025</i>, Sidney, Australia, 2025, pp. 8–12, doi: <a href=\"https://doi.org/10.1145/3696410.3714694\">10.1145/3696410.3714694</a>.","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., &#38; Tomaszuk, D. (2025). Common Foundations for SHACL, ShEx, and PG-Schema. <i>Proceedings of the ACM on Web Conference 2025</i>, 8–12. <a href=\"https://doi.org/10.1145/3696410.3714694\">https://doi.org/10.1145/3696410.3714694</a>","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={<a href=\"https://doi.org/10.1145/3696410.3714694\">10.1145/3696410.3714694</a>}, 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} }","ama":"Ahmetaj S, Boneva I, Hidders J, et al. Common Foundations for SHACL, ShEx, and PG-Schema. In: <i>Proceedings of the ACM on Web Conference 2025</i>. ACM; 2025:8-12. doi:<a href=\"https://doi.org/10.1145/3696410.3714694\">10.1145/3696410.3714694</a>","mla":"Ahmetaj, Shqiponja, et al. “Common Foundations for SHACL, ShEx, and PG-Schema.” <i>Proceedings of the ACM on Web Conference 2025</i>, ACM, 2025, pp. 8–12, doi:<a href=\"https://doi.org/10.1145/3696410.3714694\">10.1145/3696410.3714694</a>."}},{"citation":{"ieee":"B. Löhnert, N. Augsten, C. Okulmus, and M. Ortiz, “Query Rewriting for Nested Navigational Queries over Property Graphs,” in <i>Proceedings of the 38th International Workshop on Description Logics (DL 2025), Opole, Poland, September 3-6, 2025.</i>, 2025, vol. 4091.","apa":"Löhnert, B., Augsten, N., Okulmus, C., &#38; Ortiz, M. (2025). Query Rewriting for Nested Navigational Queries over Property Graphs. In L. Tendera, Y. Ibanez Garcia, &#38; P. Koopmann (Eds.), <i>Proceedings of the 38th International Workshop on Description Logics (DL 2025), Opole, Poland, September 3-6, 2025.</i> (Vol. 4091).","mla":"Löhnert, Bianca, et al. “Query Rewriting for Nested Navigational Queries over Property Graphs.” <i>Proceedings of the 38th International Workshop on Description Logics (DL 2025), Opole, Poland, September 3-6, 2025.</i>, edited by Lidia Tendera et al., vol. 4091, 2025.","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 <i>Proceedings of the 38th International Workshop on Description Logics (DL 2025), Opole, Poland, September 3-6, 2025.</i>, edited by Lidia Tendera, Yazmin Ibanez Garcia, and Patrick Koopmann, Vol. 4091. CEUR Workshop Proceedings. Opole, Poland, 2025.","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. <i>Proceedings of the 38th International Workshop on Description Logics (DL 2025), Opole, Poland, September 3-6, 2025.</i> Vol 4091. CEUR Workshop Proceedings. ; 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."},"oa":"1","place":"Opole, Poland","status":"public","volume":4091,"editor":[{"full_name":"Tendera, Lidia","last_name":"Tendera","first_name":"Lidia"},{"first_name":"Yazmin","last_name":"Ibanez Garcia","full_name":"Ibanez Garcia, Yazmin"},{"full_name":"Koopmann, Patrick","last_name":"Koopmann","first_name":"Patrick"}],"user_id":"114410","_id":"63786","publication":"Proceedings of the 38th International Workshop on Description Logics (DL 2025), Opole, Poland, September 3-6, 2025.","department":[{"_id":"888"}],"type":"conference","date_created":"2026-01-28T10:37:05Z","intvolume":"      4091","publication_status":"published","date_updated":"2026-01-28T10:38:17Z","author":[{"last_name":"Löhnert","first_name":"Bianca","full_name":"Löhnert, Bianca"},{"full_name":"Augsten, Nikolaus","first_name":"Nikolaus","last_name":"Augsten"},{"id":"114410","full_name":"Okulmus, Cem","orcid":"0000-0002-7742-0439","last_name":"Okulmus","first_name":"Cem"},{"full_name":"Ortiz, Magdalena","last_name":"Ortiz","first_name":"Magdalena"}],"title":"Query Rewriting for Nested Navigational Queries over Property Graphs","year":"2025","series_title":"CEUR Workshop Proceedings","language":[{"iso":"eng"}],"main_file_link":[{"url":"https://ceur-ws.org/Vol-4091/paper40.pdf","open_access":"1"}]},{"page":"271–272","language":[{"iso":"eng"}],"_id":"63857","user_id":"117185","doi":"10.1007/S13218-025-00894-9","volume":39,"title":"Think Globally, Attend Locally","status":"public","year":"2025","author":[{"full_name":"Turhan, Anni-Yasmin","last_name":"Turhan","first_name":"Anni-Yasmin","id":"104470"}],"date_updated":"2026-02-04T07:02:52Z","intvolume":"        39","date_created":"2026-02-04T07:01:02Z","type":"journal_article","publication":"Künstliche Intell.","issue":"4","citation":{"mla":"Turhan, Anni-Yasmin. “Think Globally, Attend Locally.” <i>Künstliche Intell.</i>, vol. 39, no. 4, 2025, pp. 271–272, doi:<a href=\"https://doi.org/10.1007/S13218-025-00894-9\">10.1007/S13218-025-00894-9</a>.","bibtex":"@article{Turhan_2025, title={Think Globally, Attend Locally}, volume={39}, DOI={<a href=\"https://doi.org/10.1007/S13218-025-00894-9\">10.1007/S13218-025-00894-9</a>}, number={4}, journal={Künstliche Intell.}, author={Turhan, Anni-Yasmin}, year={2025}, pages={271–272} }","ama":"Turhan A-Y. Think Globally, Attend Locally. <i>Künstliche Intell</i>. 2025;39(4):271–272. doi:<a href=\"https://doi.org/10.1007/S13218-025-00894-9\">10.1007/S13218-025-00894-9</a>","ieee":"A.-Y. Turhan, “Think Globally, Attend Locally,” <i>Künstliche Intell.</i>, vol. 39, no. 4, pp. 271–272, 2025, doi: <a href=\"https://doi.org/10.1007/S13218-025-00894-9\">10.1007/S13218-025-00894-9</a>.","apa":"Turhan, A.-Y. (2025). Think Globally, Attend Locally. <i>Künstliche Intell.</i>, <i>39</i>(4), 271–272. <a href=\"https://doi.org/10.1007/S13218-025-00894-9\">https://doi.org/10.1007/S13218-025-00894-9</a>","chicago":"Turhan, Anni-Yasmin. “Think Globally, Attend Locally.” <i>Künstliche Intell.</i> 39, no. 4 (2025): 271–272. <a href=\"https://doi.org/10.1007/S13218-025-00894-9\">https://doi.org/10.1007/S13218-025-00894-9</a>.","short":"A.-Y. Turhan, Künstliche Intell. 39 (2025) 271–272."}},{"publication":"arXiv:2507.21955","citation":{"apa":"Haak, A., Koopmann, P., Mahmood, Y., &#38; Turhan, A.-Y. (2025). Why not? Developing ABox Abduction beyond Repairs. In <i>arXiv:2507.21955</i>.","ieee":"A. Haak, P. Koopmann, Y. Mahmood, and A.-Y. Turhan, “Why not? Developing ABox Abduction beyond Repairs,” <i>arXiv:2507.21955</i>. 2025.","short":"A. Haak, P. Koopmann, Y. Mahmood, A.-Y. Turhan, ArXiv:2507.21955 (2025).","chicago":"Haak, Anselm, Patrick Koopmann, Yasir Mahmood, and Anni-Yasmin Turhan. “Why Not? Developing ABox Abduction beyond Repairs.” <i>ArXiv:2507.21955</i>, 2025.","mla":"Haak, Anselm, et al. “Why Not? Developing ABox Abduction beyond Repairs.” <i>ArXiv:2507.21955</i>, 2025.","ama":"Haak A, Koopmann P, Mahmood Y, Turhan A-Y. Why not? Developing ABox Abduction beyond Repairs. <i>arXiv:250721955</i>. Published online 2025.","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} }"},"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."}],"project":[{"name":"TRR 318; TP B01: Ein dialogbasierter Ansatz zur Erklärung von Modellen des maschinellen Lernens","_id":"121"}],"external_id":{"arxiv":["2507.21955"]},"date_created":"2025-08-29T07:58:08Z","type":"preprint","department":[{"_id":"574"},{"_id":"888"}],"year":"2025","status":"public","title":"Why not? Developing ABox Abduction beyond Repairs","author":[{"full_name":"Haak, Anselm","last_name":"Haak","first_name":"Anselm","id":"109969"},{"last_name":"Koopmann","first_name":"Patrick","full_name":"Koopmann, Patrick"},{"id":"99353","first_name":"Yasir","last_name":"Mahmood","full_name":"Mahmood, Yasir"},{"id":"104470","first_name":"Anni-Yasmin","last_name":"Turhan","full_name":"Turhan, Anni-Yasmin"}],"date_updated":"2026-02-05T13:55:48Z","language":[{"iso":"eng"}],"_id":"61065","user_id":"109969"},{"publication":"Proceedings of the 38th International Workshop on Description Logics - DL 2025","citation":{"apa":"Haak, A., Koopmann, P., Mahmood, Y., &#38; Turhan, A.-Y. (2025). Why not? Developing ABox Abduction beyond Repairs. In L. Tendera, Y. Ibanez Garcia, &#38; P. Koopmann (Eds.), <i>Proceedings of the 38th International Workshop on Description Logics - DL 2025</i>.","ieee":"A. Haak, P. Koopmann, Y. Mahmood, and A.-Y. Turhan, “Why not? Developing ABox Abduction beyond Repairs,” in <i>Proceedings of the 38th International Workshop on Description Logics - DL 2025</i>, Opole, Poland, 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.","chicago":"Haak, Anselm, Patrick Koopmann, Yasir Mahmood, and Anni-Yasmin Turhan. “Why Not? Developing ABox Abduction beyond Repairs.” In <i>Proceedings of the 38th International Workshop on Description Logics - DL 2025</i>, edited by Lidia Tendera, Yazmin Ibanez Garcia, and Patrick Koopmann, 2025.","mla":"Haak, Anselm, et al. “Why Not? Developing ABox Abduction beyond Repairs.” <i>Proceedings of the 38th International Workshop on Description Logics - DL 2025</i>, edited by Lidia Tendera et al., 2025.","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. <i>Proceedings of the 38th International Workshop on Description Logics - DL 2025</i>. ; 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} }"},"date_created":"2026-02-05T13:54:08Z","type":"conference","department":[{"_id":"888"},{"_id":"574"}],"year":"2025","status":"public","title":"Why not? Developing ABox Abduction beyond Repairs","author":[{"full_name":"Haak, Anselm","last_name":"Haak","first_name":"Anselm","id":"109969"},{"full_name":"Koopmann, Patrick","last_name":"Koopmann","first_name":"Patrick"},{"first_name":"Yasir","last_name":"Mahmood","full_name":"Mahmood, Yasir","id":"99353"},{"full_name":"Turhan, Anni-Yasmin","first_name":"Anni-Yasmin","last_name":"Turhan","id":"104470"}],"conference":{"end_date":"2025-09-06","location":"Opole, Poland","start_date":"2025-09-03","name":"Description Logics 2025"},"date_updated":"2026-02-05T13:55:27Z","main_file_link":[{"url":"https://ceur-ws.org/Vol-4091/paper25.pdf"}],"language":[{"iso":"eng"}],"_id":"63888","user_id":"109969","editor":[{"first_name":"Lidia","last_name":"Tendera","full_name":"Tendera, Lidia"},{"full_name":"Ibanez Garcia, Yazmin","last_name":"Ibanez Garcia","first_name":"Yazmin"},{"full_name":"Koopmann, Patrick","first_name":"Patrick","last_name":"Koopmann"}]},{"date_created":"2025-09-30T07:58:55Z","department":[{"_id":"888"}],"type":"journal_article","citation":{"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={<a href=\"https://doi.org/10.1017/S1471068425000079\">10.1017/S1471068425000079</a>}, number={2}, journal={Theory Pract. Log. Program.}, author={Governatori, Guido and Turhan, Anni-Yasmin}, year={2025}, pages={132–133} }","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). <i>Theory Pract Log Program</i>. 2025;25(2):132–133. doi:<a href=\"https://doi.org/10.1017/S1471068425000079\">10.1017/S1471068425000079</a>","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).” <i>Theory Pract. Log. Program.</i>, vol. 25, no. 2, 2025, pp. 132–133, doi:<a href=\"https://doi.org/10.1017/S1471068425000079\">10.1017/S1471068425000079</a>.","short":"G. Governatori, A.-Y. Turhan, Theory Pract. Log. Program. 25 (2025) 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).” <i>Theory Pract. Log. Program.</i> 25, no. 2 (2025): 132–133. <a href=\"https://doi.org/10.1017/S1471068425000079\">https://doi.org/10.1017/S1471068425000079</a>.","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),” <i>Theory Pract. Log. Program.</i>, vol. 25, no. 2, pp. 132–133, 2025, doi: <a href=\"https://doi.org/10.1017/S1471068425000079\">10.1017/S1471068425000079</a>.","apa":"Governatori, G., &#38; 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). <i>Theory Pract. Log. Program.</i>, <i>25</i>(2), 132–133. <a href=\"https://doi.org/10.1017/S1471068425000079\">https://doi.org/10.1017/S1471068425000079</a>"},"publication":"Theory Pract. Log. Program.","issue":"2","language":[{"iso":"eng"}],"_id":"61471","page":"132–133","volume":25,"user_id":"117185","doi":"10.1017/S1471068425000079","author":[{"first_name":"Guido","last_name":"Governatori","full_name":"Governatori, Guido"},{"id":"104470","full_name":"Turhan, Anni-Yasmin","last_name":"Turhan","first_name":"Anni-Yasmin"}],"year":"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)","status":"public","intvolume":"        25","date_updated":"2025-09-30T08:02:13Z"},{"abstract":[{"lang":"eng","text":"<jats:p>\r\n            We study descriptive complexity of counting complexity classes in the range from #P to\r\n            <jats:inline-formula content-type=\"math/tex\">\r\n              <jats:tex-math notation=\"LaTeX\" version=\"MathJax\">\\({\\text{#}\\!\\cdot\\!\\text{NP}}\\)</jats:tex-math>\r\n            </jats:inline-formula>\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            <jats:inline-formula content-type=\"math/tex\">\r\n              <jats:tex-math notation=\"LaTeX\" version=\"MathJax\">\\({\\text{#}\\!\\cdot\\!\\text{NP}}\\)</jats:tex-math>\r\n            </jats:inline-formula>\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            <jats:inline-formula content-type=\"math/tex\">\r\n              <jats:tex-math notation=\"LaTeX\" version=\"MathJax\">\\({\\text{#}\\!\\cdot\\!\\text{NP}}\\)</jats:tex-math>\r\n            </jats:inline-formula>\r\n            and #P , respectively. We further relate the class obtained from inclusion logic to the complexity class\r\n            <jats:inline-formula content-type=\"math/tex\">\r\n              <jats:tex-math notation=\"LaTeX\" version=\"MathJax\">\\({\\text{TotP}} \\subseteq{\\text{#P}}\\)</jats:tex-math>\r\n            </jats:inline-formula>\r\n            .\r\n          </jats:p>"}],"publication":"ACM Transactions on Computational Logic","citation":{"apa":"Haak, A., Kontinen, J., Müller, F., Vollmer, H., &#38; Yang, F. (2025). Counting of Teams in First-Order Team Logics. <i>ACM Transactions on Computational Logic</i>, Article 3771721. <a href=\"https://doi.org/10.1145/3771721\">https://doi.org/10.1145/3771721</a>","ieee":"A. Haak, J. Kontinen, F. Müller, H. Vollmer, and F. Yang, “Counting of Teams in First-Order Team Logics,” <i>ACM Transactions on Computational Logic</i>, Art. no. 3771721, 2025, doi: <a href=\"https://doi.org/10.1145/3771721\">10.1145/3771721</a>.","short":"A. Haak, J. Kontinen, F. Müller, H. Vollmer, F. Yang, ACM Transactions on Computational Logic (2025).","chicago":"Haak, Anselm, Juha Kontinen, Fabian Müller, Heribert Vollmer, and Fan Yang. “Counting of Teams in First-Order Team Logics.” <i>ACM Transactions on Computational Logic</i>, 2025. <a href=\"https://doi.org/10.1145/3771721\">https://doi.org/10.1145/3771721</a>.","mla":"Haak, Anselm, et al. “Counting of Teams in First-Order Team Logics.” <i>ACM Transactions on Computational Logic</i>, 3771721, Association for Computing Machinery (ACM), 2025, doi:<a href=\"https://doi.org/10.1145/3771721\">10.1145/3771721</a>.","ama":"Haak A, Kontinen J, Müller F, Vollmer H, Yang F. Counting of Teams in First-Order Team Logics. <i>ACM Transactions on Computational Logic</i>. Published online 2025. doi:<a href=\"https://doi.org/10.1145/3771721\">10.1145/3771721</a>","bibtex":"@article{Haak_Kontinen_Müller_Vollmer_Yang_2025, title={Counting of Teams in First-Order Team Logics}, DOI={<a href=\"https://doi.org/10.1145/3771721\">10.1145/3771721</a>}, 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} }"},"type":"journal_article","department":[{"_id":"888"}],"date_created":"2025-10-17T09:43:42Z","date_updated":"2025-10-17T09:44:06Z","publication_status":"published","status":"public","title":"Counting of Teams in First-Order Team Logics","year":"2025","author":[{"full_name":"Haak, Anselm","last_name":"Haak","first_name":"Anselm","id":"109969"},{"first_name":"Juha","last_name":"Kontinen","full_name":"Kontinen, Juha"},{"full_name":"Müller, Fabian","first_name":"Fabian","last_name":"Müller"},{"first_name":"Heribert","last_name":"Vollmer","full_name":"Vollmer, Heribert"},{"full_name":"Yang, Fan","last_name":"Yang","first_name":"Fan"}],"publication_identifier":{"issn":["1529-3785","1557-945X"]},"doi":"10.1145/3771721","user_id":"109969","article_number":"3771721","publisher":"Association for Computing Machinery (ACM)","_id":"61874","language":[{"iso":"eng"}]},{"conference":{"end_date":"2025-06-27","location":"Berlin","start_date":"2025-06-22","name":"44th ACM Symposium on Principles of Database Systems (PODS) 2025"},"status":"public","volume":3,"user_id":"114410","_id":"60496","publisher":"Association for Computing Machinery (ACM)","page":"1-25","citation":{"apa":"Lanzinger, M., Okulmus, C., Pichler, R., Selzer, A., &#38; Gottlob, G. (2025). Soft and Constrained Hypertree Width. <i>Proceedings of the ACM on Management of Data</i>, <i>3</i>(2), 1–25. <a href=\"https://doi.org/10.1145/3725251\">https://doi.org/10.1145/3725251</a>","ieee":"M. Lanzinger, C. Okulmus, R. Pichler, A. Selzer, and G. Gottlob, “Soft and Constrained Hypertree Width,” <i>Proceedings of the ACM on Management of Data</i>, vol. 3, no. 2, pp. 1–25, 2025, doi: <a href=\"https://doi.org/10.1145/3725251\">10.1145/3725251</a>.","chicago":"Lanzinger, Matthias, Cem Okulmus, Reinhard Pichler, Alexander Selzer, and Georg Gottlob. “Soft and Constrained Hypertree Width.” <i>Proceedings of the ACM on Management of Data</i> 3, no. 2 (2025): 1–25. <a href=\"https://doi.org/10.1145/3725251\">https://doi.org/10.1145/3725251</a>.","short":"M. Lanzinger, C. Okulmus, R. Pichler, A. Selzer, G. Gottlob, Proceedings of the ACM on Management of Data 3 (2025) 1–25.","mla":"Lanzinger, Matthias, et al. “Soft and Constrained Hypertree Width.” <i>Proceedings of the ACM on Management of Data</i>, vol. 3, no. 2, Association for Computing Machinery (ACM), 2025, pp. 1–25, doi:<a href=\"https://doi.org/10.1145/3725251\">10.1145/3725251</a>.","ama":"Lanzinger M, Okulmus C, Pichler R, Selzer A, Gottlob G. Soft and Constrained Hypertree Width. <i>Proceedings of the ACM on Management of Data</i>. 2025;3(2):1-25. doi:<a href=\"https://doi.org/10.1145/3725251\">10.1145/3725251</a>","bibtex":"@article{Lanzinger_Okulmus_Pichler_Selzer_Gottlob_2025, title={Soft and Constrained Hypertree Width}, volume={3}, DOI={<a href=\"https://doi.org/10.1145/3725251\">10.1145/3725251</a>}, 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} }"},"oa":"1","intvolume":"         3","date_updated":"2025-07-02T11:45:18Z","publication_status":"published","publication_identifier":{"issn":["2836-6573"]},"author":[{"last_name":"Lanzinger","first_name":"Matthias","full_name":"Lanzinger, Matthias"},{"id":"114410","full_name":"Okulmus, Cem","orcid":"0000-0002-7742-0439","first_name":"Cem","last_name":"Okulmus"},{"last_name":"Pichler","first_name":"Reinhard","full_name":"Pichler, Reinhard"},{"full_name":"Selzer, Alexander","first_name":"Alexander","last_name":"Selzer"},{"last_name":"Gottlob","first_name":"Georg","full_name":"Gottlob, Georg"}],"title":"Soft and Constrained Hypertree Width","year":"2025","doi":"10.1145/3725251","language":[{"iso":"eng"}],"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2412.11669"}],"abstract":[{"lang":"eng","text":"<jats:p>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.</jats:p>"}],"issue":"2","publication":"Proceedings of the ACM on Management of Data","department":[{"_id":"888"}],"type":"journal_article","date_created":"2025-07-02T11:41:00Z"},{"volume":15718,"user_id":"114410","_id":"60497","publisher":"Springer Nature Switzerland","page":"342--361","conference":{"name":"22th European Semantic Web Conference (ESWC 2025)","start_date":"2025-06-01","location":"Portorož, Slovenia","end_date":"2025-06-05"},"status":"public","oa":"1","quality_controlled":"1","citation":{"mla":"Löhnert, Bianca, et al. “Towards Practicable Algorithms for Rewriting Graph Queries Beyond DL-Lite.” <i>The Semantic Web - 22nd European Semantic Web Conference, {ESWC} 2025, Portoroz, Slovenia, June 1-5, 2025, Proceedings, Part {I}</i>, vol. 15718, Springer Nature Switzerland, 2025, pp. 342--361, doi:<a href=\"https://doi.org/10.1007/978-3-031-94575-5_19\">10.1007/978-3-031-94575-5_19</a>.","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={<a href=\"https://doi.org/10.1007/978-3-031-94575-5_19\">10.1007/978-3-031-94575-5_19</a>}, 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} }","ama":"Löhnert B, Augsten N, Okulmus C, Ortiz M. Towards Practicable Algorithms for Rewriting Graph Queries Beyond DL-Lite. In: <i>The Semantic Web - 22nd European Semantic Web Conference, {ESWC} 2025, Portoroz, Slovenia, June 1-5, 2025, Proceedings, Part {I}</i>. Vol 15718. Lecture Notes in Computer Science. Springer Nature Switzerland; 2025:342--361. doi:<a href=\"https://doi.org/10.1007/978-3-031-94575-5_19\">10.1007/978-3-031-94575-5_19</a>","ieee":"B. Löhnert, N. Augsten, C. Okulmus, and M. Ortiz, “Towards Practicable Algorithms for Rewriting Graph Queries Beyond DL-Lite,” in <i>The Semantic Web - 22nd European Semantic Web Conference, {ESWC} 2025, Portoroz, Slovenia, June 1-5, 2025, Proceedings, Part {I}</i>, Portorož, Slovenia, 2025, vol. 15718, pp. 342--361, doi: <a href=\"https://doi.org/10.1007/978-3-031-94575-5_19\">10.1007/978-3-031-94575-5_19</a>.","apa":"Löhnert, B., Augsten, N., Okulmus, C., &#38; Ortiz, M. (2025). Towards Practicable Algorithms for Rewriting Graph Queries Beyond DL-Lite. <i>The Semantic Web - 22nd European Semantic Web Conference, {ESWC} 2025, Portoroz, Slovenia, June 1-5, 2025, Proceedings, Part {I}</i>, <i>15718</i>, 342--361. <a href=\"https://doi.org/10.1007/978-3-031-94575-5_19\">https://doi.org/10.1007/978-3-031-94575-5_19</a>","chicago":"Löhnert, Bianca, Nikolaus Augsten, Cem Okulmus, and Magdalena Ortiz. “Towards Practicable Algorithms for Rewriting Graph Queries Beyond DL-Lite.” In <i>The Semantic Web - 22nd European Semantic Web Conference, {ESWC} 2025, Portoroz, Slovenia, June 1-5, 2025, Proceedings, Part {I}</i>, 15718:342--361. Lecture Notes in Computer Science. Springer Nature Switzerland, 2025. <a href=\"https://doi.org/10.1007/978-3-031-94575-5_19\">https://doi.org/10.1007/978-3-031-94575-5_19</a>.","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."},"doi":"10.1007/978-3-031-94575-5_19","language":[{"iso":"eng"}],"series_title":"Lecture Notes in Computer Science","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2405.18181"}],"intvolume":"     15718","date_updated":"2025-07-02T11:55:19Z","publication_status":"published","author":[{"first_name":"Bianca","last_name":"Löhnert","full_name":"Löhnert, Bianca"},{"last_name":"Augsten","first_name":"Nikolaus","full_name":"Augsten, Nikolaus"},{"full_name":"Okulmus, Cem","first_name":"Cem","orcid":"0000-0002-7742-0439","last_name":"Okulmus","id":"114410"},{"full_name":"Ortiz, Magdalena","last_name":"Ortiz","first_name":"Magdalena"}],"publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783031945748","9783031945755"]},"title":"Towards Practicable Algorithms for Rewriting Graph Queries Beyond DL-Lite","year":"2025","department":[{"_id":"888"}],"keyword":["Ontology-based Data Access","Property Graphs","Navigational Queries"],"type":"conference","date_created":"2025-07-02T11:46:06Z","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."}],"publication":"The Semantic Web - 22nd European Semantic Web Conference, {ESWC} 2025, Portoroz, Slovenia, June 1-5, 2025, Proceedings, Part {I}"},{"file_date_updated":"2026-03-12T11:43:29Z","citation":{"ieee":"M. Bienvenu, C. Bourgaux, and A. Khodadaditaghanaki, “Inconsistency Handling in DatalogMTL,” in <i>Proceedings of the Thirty-Fourth International Joint Conference on Artificial Intelligence, {IJCAI-25}</i>, 2025, pp. 4374–4381, doi: <a href=\"https://doi.org/10.24963/ijcai.2025/487\">10.24963/ijcai.2025/487</a>.","apa":"Bienvenu, M., Bourgaux, C., &#38; Khodadaditaghanaki, A. (2025). Inconsistency Handling in DatalogMTL. In J. Kwok (Ed.), <i>Proceedings of the Thirty-Fourth International Joint Conference on Artificial Intelligence, {IJCAI-25}</i> (pp. 4374–4381). International Joint Conferences on Artificial Intelligence Organization. <a href=\"https://doi.org/10.24963/ijcai.2025/487\">https://doi.org/10.24963/ijcai.2025/487</a>","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.","chicago":"Bienvenu, Meghyn, Camille Bourgaux, and Atefe Khodadaditaghanaki. “Inconsistency Handling in DatalogMTL.” In <i>Proceedings of the Thirty-Fourth International Joint Conference on Artificial Intelligence, {IJCAI-25}</i>, edited by James Kwok, 4374–4381. International Joint Conferences on Artificial Intelligence Organization, 2025. <a href=\"https://doi.org/10.24963/ijcai.2025/487\">https://doi.org/10.24963/ijcai.2025/487</a>.","mla":"Bienvenu, Meghyn, et al. “Inconsistency Handling in DatalogMTL.” <i>Proceedings of the Thirty-Fourth International Joint Conference on Artificial Intelligence, {IJCAI-25}</i>, edited by James Kwok, International Joint Conferences on Artificial Intelligence Organization, 2025, pp. 4374–4381, doi:<a href=\"https://doi.org/10.24963/ijcai.2025/487\">10.24963/ijcai.2025/487</a>.","bibtex":"@inproceedings{Bienvenu_Bourgaux_Khodadaditaghanaki_2025, title={Inconsistency Handling in DatalogMTL}, DOI={<a href=\"https://doi.org/10.24963/ijcai.2025/487\">10.24963/ijcai.2025/487</a>}, 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} }","ama":"Bienvenu M, Bourgaux C, Khodadaditaghanaki A. Inconsistency Handling in DatalogMTL. In: Kwok J, ed. <i>Proceedings of the Thirty-Fourth International Joint Conference on Artificial Intelligence, {IJCAI-25}</i>. International Joint Conferences on Artificial Intelligence Organization; 2025:4374–4381. doi:<a href=\"https://doi.org/10.24963/ijcai.2025/487\">10.24963/ijcai.2025/487</a>"},"page":"4374–4381","_id":"64905","publisher":"International Joint Conferences on Artificial Intelligence Organization","ddc":["000"],"user_id":"114980","editor":[{"full_name":"Kwok, James","first_name":"James","last_name":"Kwok"}],"status":"public","has_accepted_license":"1","file":[{"file_id":"64906","content_type":"application/pdf","success":1,"file_name":"Our Paper.pdf","file_size":197125,"access_level":"closed","relation":"main_file","date_updated":"2026-03-12T11:43:29Z","date_created":"2026-03-12T11:43:29Z","creator":"atefe"}],"date_created":"2026-03-12T11:39:11Z","type":"conference","publication":"Proceedings of the Thirty-Fourth International Joint Conference on Artificial Intelligence, {IJCAI-25}","language":[{"iso":"eng"}],"doi":"10.24963/ijcai.2025/487","title":"Inconsistency Handling in DatalogMTL","year":"2025","author":[{"full_name":"Bienvenu, Meghyn","first_name":"Meghyn","last_name":"Bienvenu"},{"full_name":"Bourgaux, Camille","first_name":"Camille","last_name":"Bourgaux"},{"id":"114980","first_name":"Atefe","last_name":"Khodadaditaghanaki","full_name":"Khodadaditaghanaki, Atefe"}],"date_updated":"2026-03-17T12:54:10Z"},{"citation":{"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.","chicago":"Dell, Holger, Anselm Haak, Melvin Kallmayer, and Leo Wennmann. “Solving Polynomial Equations Over Finite Fields.” In <i>Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)</i>. Philadelphia, PA: Society for Industrial and Applied Mathematics, 2025. <a href=\"https://doi.org/10.1137/1.9781611978322.90\">https://doi.org/10.1137/1.9781611978322.90</a>.","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: <a href=\"https://doi.org/10.1137/1.9781611978322.90\">10.1137/1.9781611978322.90</a>.","apa":"Dell, H., Haak, A., Kallmayer, M., &#38; Wennmann, L. (2025). Solving Polynomial Equations Over Finite Fields. <i>Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)</i>. ACM-SIAM Symposium on Discrete Algorithms (SODA25), New Orleans, Louisiana, U.S. <a href=\"https://doi.org/10.1137/1.9781611978322.90\">https://doi.org/10.1137/1.9781611978322.90</a>","bibtex":"@inproceedings{Dell_Haak_Kallmayer_Wennmann_2025, place={Philadelphia, PA}, title={Solving Polynomial Equations Over Finite Fields}, DOI={<a href=\"https://doi.org/10.1137/1.9781611978322.90\">10.1137/1.9781611978322.90</a>}, 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} }","ama":"Dell H, Haak A, Kallmayer M, Wennmann L. Solving Polynomial Equations Over Finite Fields. In: <i>Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)</i>. Society for Industrial and Applied Mathematics; 2025. doi:<a href=\"https://doi.org/10.1137/1.9781611978322.90\">10.1137/1.9781611978322.90</a>","mla":"Dell, Holger, et al. “Solving Polynomial Equations Over Finite Fields.” <i>Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)</i>, Society for Industrial and Applied Mathematics, 2025, doi:<a href=\"https://doi.org/10.1137/1.9781611978322.90\">10.1137/1.9781611978322.90</a>."},"publication":"Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)","type":"conference","place":"Philadelphia, PA","date_created":"2025-06-10T13:48:14Z","date_updated":"2026-04-14T08:18:11Z","publication_status":"published","conference":{"name":"ACM-SIAM Symposium on Discrete Algorithms (SODA25)","start_date":"2025-01-12","location":"New Orleans, Louisiana, U.S.","end_date":"2025-01-15"},"publication_identifier":{"isbn":["9781611978322"]},"author":[{"last_name":"Dell","first_name":"Holger","full_name":"Dell, Holger"},{"id":"109969","full_name":"Haak, Anselm","last_name":"Haak","first_name":"Anselm"},{"full_name":"Kallmayer, Melvin","last_name":"Kallmayer","first_name":"Melvin"},{"first_name":"Leo","last_name":"Wennmann","full_name":"Wennmann, Leo"}],"title":"Solving Polynomial Equations Over Finite Fields","year":"2025","status":"public","doi":"10.1137/1.9781611978322.90","user_id":"109969","publisher":"Society for Industrial and Applied Mathematics","_id":"60168","language":[{"iso":"eng"}]}]