[{"citation":{"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} }","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.","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.","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>.","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.","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.","ieee":"D. Böhm <i>et al.</i>, “Selective Use of Yannakakis’ Algorithm for Consistent Performance Gains,” 2026."},"place":"Tampere, Finland","year":"2026","main_file_link":[{"url":"https://ceur-ws.org/Vol-4186/paper2.pdf","open_access":"1"}],"title":"Selective Use of Yannakakis’ Algorithm for Consistent Performance Gains","author":[{"last_name":"Böhm","full_name":"Böhm, Daniela","first_name":"Daniela"},{"first_name":"Georg","full_name":"Gottlob, Georg","last_name":"Gottlob"},{"full_name":"Lanzinger, Matthias","last_name":"Lanzinger","first_name":"Matthias"},{"full_name":"Longo, Davide Mario","last_name":"Longo","first_name":"Davide Mario"},{"last_name":"Okulmus","orcid":"0000-0002-7742-0439","full_name":"Okulmus, Cem","id":"114410","first_name":"Cem"},{"first_name":"Reinhard","full_name":"Pichler, Reinhard","last_name":"Pichler"},{"first_name":"Alexander","full_name":"Selzer, Alexander","last_name":"Selzer"}],"date_created":"2026-03-27T15:20:54Z","oa":"1","date_updated":"2026-03-27T15:22:01Z","status":"public","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"}],"type":"conference","publication":"Proceedings of the 28th International Workshop on Design, Optimization, Languages and Analytical Processing of Big Data (DOLAP 2026)","language":[{"iso":"eng"}],"keyword":["Join Queries","Acyclic Queries","Query Processing"],"user_id":"114410","department":[{"_id":"888"}],"_id":"65178"},{"date_updated":"2026-04-22T14:17:20Z","author":[{"id":"114410","full_name":"Okulmus, Cem","last_name":"Okulmus","orcid":"0000-0002-7742-0439","first_name":"Cem"},{"first_name":"Shqiponja","last_name":"Ahmetaj","full_name":"Ahmetaj, Shqiponja"},{"last_name":"Boneva","full_name":"Boneva, Iovka ","first_name":"Iovka "},{"full_name":"Hidders, Jan","last_name":"Hidders","first_name":"Jan"},{"last_name":"Jakubowski","full_name":"Jakubowski, Maxime ","first_name":"Maxime "},{"last_name":" Labra Gayo","full_name":" Labra Gayo, José Emilio","first_name":"José Emilio"},{"first_name":"Wim","last_name":"Martens","full_name":"Martens, Wim"},{"first_name":"Fabio ","full_name":"Mogavero, Fabio ","last_name":"Mogavero"},{"first_name":"Filip ","full_name":"Murlak, Filip ","last_name":"Murlak"},{"last_name":"Savković","full_name":"Savković,  Ognjen ","first_name":" Ognjen "},{"first_name":"Mantas ","full_name":"Šimkus, Mantas ","last_name":"Šimkus"},{"full_name":"Tomaszuk, Dominik ","last_name":"Tomaszuk","first_name":"Dominik "}],"date_created":"2026-04-22T14:16:58Z","title":"Common Foundations for Recursive Shape Languages","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"},"year":"2026","citation":{"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.","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.","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.","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.","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} }","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.","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."},"_id":"65489","department":[{"_id":"888"}],"user_id":"114410","language":[{"iso":"eng"}],"publication":"Proceedings of the 23rd International Conference on Principles of Knowledge Representation and Reasoning (KR 2026)","type":"conference","status":"public"},{"_id":"59840","department":[{"_id":"888"}],"user_id":"114410","language":[{"iso":"eng"}],"publication":"Proceedings of the ACM on Web Conference 2025","type":"conference","abstract":[{"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","lang":"eng"}],"status":"public","oa":"1","date_updated":"2025-05-07T11:51:17Z","publisher":"ACM","author":[{"first_name":"Shqiponja","full_name":"Ahmetaj, Shqiponja","last_name":"Ahmetaj"},{"first_name":"Iovka","last_name":"Boneva","full_name":"Boneva, Iovka"},{"first_name":"Jan","full_name":"Hidders, Jan","last_name":"Hidders"},{"first_name":"Katja","full_name":"Hose, Katja","last_name":"Hose"},{"full_name":"Jakubowski, Maxime","last_name":"Jakubowski","first_name":"Maxime"},{"first_name":"Jose Emilio","last_name":"Labra Gayo","full_name":"Labra Gayo, Jose Emilio"},{"first_name":"Wim","full_name":"Martens, Wim","last_name":"Martens"},{"first_name":"Fabio","last_name":"Mogavero","full_name":"Mogavero, Fabio"},{"full_name":"Murlak, Filip","last_name":"Murlak","first_name":"Filip"},{"last_name":"Okulmus","orcid":"0000-0002-7742-0439","id":"114410","full_name":"Okulmus, Cem","first_name":"Cem"},{"last_name":"Polleres","full_name":"Polleres, Axel","first_name":"Axel"},{"last_name":"Savković","full_name":"Savković, Ognjen","first_name":"Ognjen"},{"last_name":"Šimkus","full_name":"Šimkus, Mantas","first_name":"Mantas"},{"first_name":"Dominik","last_name":"Tomaszuk","full_name":"Tomaszuk, Dominik"}],"date_created":"2025-05-07T11:46:03Z","title":"Common Foundations for SHACL, ShEx, and PG-Schema","conference":{"name":"ACM Web Conference 2025 ","start_date":"2025-04-28","end_date":"2025-05-02","location":"Sidney, Australia"},"doi":"10.1145/3696410.3714694","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2502.01295"}],"publication_status":"published","year":"2025","page":"8-12","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.","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} }","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>.","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>","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>.","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>"}},{"title":"Query Rewriting for Nested Navigational Queries over Property Graphs","main_file_link":[{"open_access":"1","url":"https://ceur-ws.org/Vol-4091/paper40.pdf"}],"date_updated":"2026-01-28T10:38:17Z","oa":"1","volume":4091,"author":[{"first_name":"Bianca","full_name":"Löhnert, Bianca","last_name":"Löhnert"},{"full_name":"Augsten, Nikolaus","last_name":"Augsten","first_name":"Nikolaus"},{"first_name":"Cem","id":"114410","full_name":"Okulmus, Cem","last_name":"Okulmus","orcid":"0000-0002-7742-0439"},{"first_name":"Magdalena","full_name":"Ortiz, Magdalena","last_name":"Ortiz"}],"date_created":"2026-01-28T10:37:05Z","year":"2025","place":"Opole, Poland","intvolume":"      4091","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.","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.","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} }","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.","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.","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)."},"publication_status":"published","language":[{"iso":"eng"}],"_id":"63786","department":[{"_id":"888"}],"user_id":"114410","series_title":"CEUR Workshop Proceedings","editor":[{"first_name":"Lidia","last_name":"Tendera","full_name":"Tendera, Lidia"},{"first_name":"Yazmin","full_name":"Ibanez Garcia, Yazmin","last_name":"Ibanez Garcia"},{"first_name":"Patrick","full_name":"Koopmann, Patrick","last_name":"Koopmann"}],"status":"public","publication":"Proceedings of the 38th International Workshop on Description Logics (DL 2025), Opole, Poland, September 3-6, 2025.","type":"conference"},{"date_updated":"2026-02-05T13:55:48Z","author":[{"first_name":"Anselm","last_name":"Haak","id":"109969","full_name":"Haak, Anselm"},{"full_name":"Koopmann, Patrick","last_name":"Koopmann","first_name":"Patrick"},{"full_name":"Mahmood, Yasir","id":"99353","last_name":"Mahmood","first_name":"Yasir"},{"first_name":"Anni-Yasmin","last_name":"Turhan","id":"104470","full_name":"Turhan, Anni-Yasmin"}],"date_created":"2025-08-29T07:58:08Z","title":"Why not? Developing ABox Abduction beyond Repairs","year":"2025","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>.","mla":"Haak, Anselm, et al. “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).","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} }","ama":"Haak A, Koopmann P, Mahmood Y, Turhan A-Y. Why not? Developing ABox Abduction beyond Repairs. <i>arXiv:250721955</i>. Published online 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.","ieee":"A. Haak, P. Koopmann, Y. Mahmood, and A.-Y. Turhan, “Why not? Developing ABox Abduction beyond Repairs,” <i>arXiv:2507.21955</i>. 2025."},"project":[{"_id":"121","name":"TRR 318; TP B01: Ein dialogbasierter Ansatz zur Erklärung von Modellen des maschinellen Lernens"}],"external_id":{"arxiv":["2507.21955"]},"_id":"61065","user_id":"109969","department":[{"_id":"574"},{"_id":"888"}],"language":[{"iso":"eng"}],"type":"preprint","publication":"arXiv:2507.21955","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."}],"status":"public"},{"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>.","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.","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.","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} }","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.","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.","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."},"year":"2025","conference":{"location":"Opole, Poland","end_date":"2025-09-06","start_date":"2025-09-03","name":"Description Logics 2025"},"main_file_link":[{"url":"https://ceur-ws.org/Vol-4091/paper25.pdf"}],"title":"Why not? Developing ABox Abduction beyond Repairs","date_created":"2026-02-05T13:54:08Z","author":[{"last_name":"Haak","full_name":"Haak, Anselm","id":"109969","first_name":"Anselm"},{"full_name":"Koopmann, Patrick","last_name":"Koopmann","first_name":"Patrick"},{"first_name":"Yasir","full_name":"Mahmood, Yasir","id":"99353","last_name":"Mahmood"},{"full_name":"Turhan, Anni-Yasmin","id":"104470","last_name":"Turhan","first_name":"Anni-Yasmin"}],"date_updated":"2026-02-05T13:55:27Z","status":"public","editor":[{"last_name":"Tendera","full_name":"Tendera, Lidia","first_name":"Lidia"},{"first_name":"Yazmin","full_name":"Ibanez Garcia, Yazmin","last_name":"Ibanez Garcia"},{"full_name":"Koopmann, Patrick","last_name":"Koopmann","first_name":"Patrick"}],"publication":"Proceedings of the 38th International Workshop on Description Logics - DL 2025","type":"conference","language":[{"iso":"eng"}],"department":[{"_id":"888"},{"_id":"574"}],"user_id":"109969","_id":"63888"},{"user_id":"114410","department":[{"_id":"888"}],"_id":"60496","type":"journal_article","status":"public","author":[{"first_name":"Matthias","last_name":"Lanzinger","full_name":"Lanzinger, Matthias"},{"id":"114410","full_name":"Okulmus, Cem","last_name":"Okulmus","orcid":"0000-0002-7742-0439","first_name":"Cem"},{"first_name":"Reinhard","full_name":"Pichler, Reinhard","last_name":"Pichler"},{"full_name":"Selzer, Alexander","last_name":"Selzer","first_name":"Alexander"},{"full_name":"Gottlob, Georg","last_name":"Gottlob","first_name":"Georg"}],"volume":3,"date_updated":"2025-07-02T11:45:18Z","oa":"1","main_file_link":[{"url":"https://arxiv.org/abs/2412.11669","open_access":"1"}],"doi":"10.1145/3725251","conference":{"name":"44th ACM Symposium on Principles of Database Systems (PODS) 2025","start_date":"2025-06-22","end_date":"2025-06-27","location":"Berlin"},"publication_status":"published","publication_identifier":{"issn":["2836-6573"]},"citation":{"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>","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>.","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>.","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>","short":"M. Lanzinger, C. Okulmus, R. Pichler, A. Selzer, G. Gottlob, Proceedings of the ACM on Management of Data 3 (2025) 1–25.","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} }","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>."},"intvolume":"         3","page":"1-25","language":[{"iso":"eng"}],"publication":"Proceedings of the ACM on Management of Data","abstract":[{"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>","lang":"eng"}],"date_created":"2025-07-02T11:41:00Z","publisher":"Association for Computing Machinery (ACM)","title":"Soft and Constrained Hypertree Width","issue":"2","year":"2025"},{"conference":{"location":"Portorož, Slovenia","end_date":"2025-06-05","start_date":"2025-06-01","name":"22th European Semantic Web Conference (ESWC 2025)"},"doi":"10.1007/978-3-031-94575-5_19","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2405.18181"}],"date_updated":"2025-07-02T11:55:19Z","oa":"1","volume":15718,"author":[{"first_name":"Bianca","last_name":"Löhnert","full_name":"Löhnert, Bianca"},{"first_name":"Nikolaus","full_name":"Augsten, Nikolaus","last_name":"Augsten"},{"first_name":"Cem","orcid":"0000-0002-7742-0439","last_name":"Okulmus","id":"114410","full_name":"Okulmus, Cem"},{"last_name":"Ortiz","full_name":"Ortiz, Magdalena","first_name":"Magdalena"}],"intvolume":"     15718","page":"342--361","citation":{"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>","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} }","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.","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>.","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>.","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>.","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>"},"publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783031945748","9783031945755"]},"publication_status":"published","_id":"60497","department":[{"_id":"888"}],"user_id":"114410","series_title":"Lecture Notes in Computer Science","status":"public","type":"conference","title":"Towards Practicable Algorithms for Rewriting Graph Queries Beyond DL-Lite","publisher":"Springer Nature Switzerland","date_created":"2025-07-02T11:46:06Z","year":"2025","quality_controlled":"1","keyword":["Ontology-based Data Access","Property Graphs","Navigational Queries"],"language":[{"iso":"eng"}],"abstract":[{"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.","lang":"eng"}],"publication":"The Semantic Web - 22nd European Semantic Web Conference, {ESWC} 2025, Portoroz, Slovenia, June 1-5, 2025, Proceedings, Part {I}"},{"date_updated":"2025-09-30T08:02:13Z","volume":25,"author":[{"last_name":"Governatori","full_name":"Governatori, Guido","first_name":"Guido"},{"id":"104470","full_name":"Turhan, Anni-Yasmin","last_name":"Turhan","first_name":"Anni-Yasmin"}],"date_created":"2025-09-30T07:58:55Z","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)","doi":"10.1017/S1471068425000079","issue":"2","year":"2025","intvolume":"        25","page":"132–133","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). <i>Theory Pract Log Program</i>. 2025;25(2):132–133. doi:<a href=\"https://doi.org/10.1017/S1471068425000079\">10.1017/S1471068425000079</a>","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>.","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>.","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} }","short":"G. Governatori, A.-Y. Turhan, Theory Pract. Log. Program. 25 (2025) 132–133.","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>"},"_id":"61471","department":[{"_id":"888"}],"user_id":"117185","language":[{"iso":"eng"}],"publication":"Theory Pract. Log. Program.","type":"journal_article","status":"public"},{"publication":"ACM Transactions on Computational Logic","type":"journal_article","status":"public","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>"}],"department":[{"_id":"888"}],"user_id":"109969","_id":"61874","language":[{"iso":"eng"}],"article_number":"3771721","publication_identifier":{"issn":["1529-3785","1557-945X"]},"publication_status":"published","citation":{"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>","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>.","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>.","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} }","short":"A. Haak, J. Kontinen, F. Müller, H. Vollmer, F. Yang, ACM Transactions on Computational Logic (2025).","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>"},"year":"2025","date_created":"2025-10-17T09:43:42Z","author":[{"last_name":"Haak","full_name":"Haak, Anselm","id":"109969","first_name":"Anselm"},{"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","last_name":"Vollmer","full_name":"Vollmer, Heribert"},{"first_name":"Fan","last_name":"Yang","full_name":"Yang, Fan"}],"publisher":"Association for Computing Machinery (ACM)","date_updated":"2025-10-17T09:44:06Z","doi":"10.1145/3771721","title":"Counting of Teams in First-Order Team Logics"},{"doi":"10.1007/978-3-031-72407-7\\_11","title":"Reasoning in Rough Description Logics with Multiple Indiscernibility Relations","date_created":"2024-08-01T12:30:48Z","author":[{"full_name":"Peñaloza, Rafael","last_name":"Peñaloza","first_name":"Rafael"},{"first_name":"Anni-Yasmin","full_name":"Turhan, Anni-Yasmin","last_name":"Turhan"}],"publisher":"Springer","date_updated":"2024-10-11T08:42:39Z","citation":{"ama":"Peñaloza R, Turhan A-Y. Reasoning in Rough Description Logics with Multiple Indiscernibility Relations. In: Kirrane S, Simkus M, Soylu A, Roman D, eds. <i>Rules and Reasoning - Eighth International Joint Conference, RuleML+RR 2024, Proceedings</i>. LNCS. Springer; 2024. doi:<a href=\"https://doi.org/10.1007/978-3-031-72407-7\\_11\">10.1007/978-3-031-72407-7\\_11</a>","ieee":"R. Peñaloza and A.-Y. Turhan, “Reasoning in Rough Description Logics with Multiple Indiscernibility Relations,” in <i>Rules and Reasoning - Eighth International Joint Conference, RuleML+RR 2024, Proceedings</i>, 2024, doi: <a href=\"https://doi.org/10.1007/978-3-031-72407-7\\_11\">10.1007/978-3-031-72407-7\\_11</a>.","chicago":"Peñaloza, Rafael, and Anni-Yasmin Turhan. “Reasoning in Rough Description Logics with Multiple Indiscernibility Relations.” In <i>Rules and Reasoning - Eighth International Joint Conference, RuleML+RR 2024, Proceedings</i>, edited by Sabrina Kirrane, Mantas Simkus, Ahmet Soylu, and Dumitru Roman. LNCS. Springer, 2024. <a href=\"https://doi.org/10.1007/978-3-031-72407-7\\_11\">https://doi.org/10.1007/978-3-031-72407-7\\_11</a>.","short":"R. Peñaloza, A.-Y. Turhan, in: S. Kirrane, M. Simkus, A. Soylu, D. Roman (Eds.), Rules and Reasoning - Eighth International Joint Conference, RuleML+RR 2024, Proceedings, Springer, 2024.","bibtex":"@inproceedings{Peñaloza_Turhan_2024, series={LNCS}, title={Reasoning in Rough Description Logics with Multiple Indiscernibility Relations}, DOI={<a href=\"https://doi.org/10.1007/978-3-031-72407-7\\_11\">10.1007/978-3-031-72407-7\\_11</a>}, booktitle={Rules and Reasoning - Eighth International Joint Conference, RuleML+RR 2024, Proceedings}, publisher={Springer}, author={Peñaloza, Rafael and Turhan, Anni-Yasmin}, editor={Kirrane, Sabrina and Simkus, Mantas and Soylu, Ahmet and Roman, Dumitru}, year={2024}, collection={LNCS} }","mla":"Peñaloza, Rafael, and Anni-Yasmin Turhan. “Reasoning in Rough Description Logics with Multiple Indiscernibility Relations.” <i>Rules and Reasoning - Eighth International Joint Conference, RuleML+RR 2024, Proceedings</i>, edited by Sabrina Kirrane et al., Springer, 2024, doi:<a href=\"https://doi.org/10.1007/978-3-031-72407-7\\_11\">10.1007/978-3-031-72407-7\\_11</a>.","apa":"Peñaloza, R., &#38; Turhan, A.-Y. (2024). Reasoning in Rough Description Logics with Multiple Indiscernibility Relations. In S. Kirrane, M. Simkus, A. Soylu, &#38; D. Roman (Eds.), <i>Rules and Reasoning - Eighth International Joint Conference, RuleML+RR 2024, Proceedings</i>. Springer. <a href=\"https://doi.org/10.1007/978-3-031-72407-7\\_11\">https://doi.org/10.1007/978-3-031-72407-7\\_11</a>"},"year":"2024","language":[{"iso":"eng"}],"user_id":"104470","series_title":"LNCS","department":[{"_id":"888"}],"_id":"55479","status":"public","editor":[{"full_name":"Kirrane, Sabrina","last_name":"Kirrane","first_name":"Sabrina"},{"first_name":"Mantas","last_name":"Simkus","full_name":"Simkus, Mantas"},{"first_name":"Ahmet","full_name":"Soylu, Ahmet","last_name":"Soylu"},{"last_name":"Roman","full_name":"Roman, Dumitru","first_name":"Dumitru"}],"type":"conference","publication":"Rules and Reasoning - Eighth International Joint Conference, RuleML+RR 2024, Proceedings"},{"publication":"Proceedings of the 37th International Workshop on Description Logics (DL 2024), Bergen, Norway, June 18-21, 2024","type":"conference","editor":[{"first_name":"Laura","last_name":"Giordano","full_name":"Giordano, Laura"},{"full_name":"Jung, Jean Christoph","last_name":"Jung","first_name":"Jean Christoph"},{"full_name":"Ozaki, Ana","last_name":"Ozaki","first_name":"Ana"}],"status":"public","_id":"56158","department":[{"_id":"888"}],"series_title":"CEUR Workshop Proceedings","user_id":"15504","language":[{"iso":"eng"}],"year":"2024","intvolume":"      3739","citation":{"ama":"Gil OF, Patrizi F, Perelli G, Turhan A-Y. Optimal Alignment of Temporal Knowledge Bases (Extended Abstract). In: Giordano L, Jung JC, Ozaki A, eds. <i>Proceedings of the 37th International Workshop on Description Logics (DL 2024), Bergen, Norway, June 18-21, 2024</i>. Vol 3739. CEUR Workshop Proceedings. CEUR-WS.org; 2024.","ieee":"O. F. Gil, F. Patrizi, G. Perelli, and A.-Y. Turhan, “Optimal Alignment of Temporal Knowledge Bases (Extended Abstract),” in <i>Proceedings of the 37th International Workshop on Description Logics (DL 2024), Bergen, Norway, June 18-21, 2024</i>, 2024, vol. 3739.","chicago":"Gil, Oliver Fernández, Fabio Patrizi, Giuseppe Perelli, and Anni-Yasmin Turhan. “Optimal Alignment of Temporal Knowledge Bases (Extended Abstract).” In <i>Proceedings of the 37th International Workshop on Description Logics (DL 2024), Bergen, Norway, June 18-21, 2024</i>, edited by Laura Giordano, Jean Christoph Jung, and Ana Ozaki, Vol. 3739. CEUR Workshop Proceedings. CEUR-WS.org, 2024.","apa":"Gil, O. F., Patrizi, F., Perelli, G., &#38; Turhan, A.-Y. (2024). Optimal Alignment of Temporal Knowledge Bases (Extended Abstract). In L. Giordano, J. C. Jung, &#38; A. Ozaki (Eds.), <i>Proceedings of the 37th International Workshop on Description Logics (DL 2024), Bergen, Norway, June 18-21, 2024</i> (Vol. 3739). CEUR-WS.org.","short":"O.F. Gil, F. Patrizi, G. Perelli, A.-Y. Turhan, in: L. Giordano, J.C. Jung, A. Ozaki (Eds.), Proceedings of the 37th International Workshop on Description Logics (DL 2024), Bergen, Norway, June 18-21, 2024, CEUR-WS.org, 2024.","mla":"Gil, Oliver Fernández, et al. “Optimal Alignment of Temporal Knowledge Bases (Extended Abstract).” <i>Proceedings of the 37th International Workshop on Description Logics (DL 2024), Bergen, Norway, June 18-21, 2024</i>, edited by Laura Giordano et al., vol. 3739, CEUR-WS.org, 2024.","bibtex":"@inproceedings{Gil_Patrizi_Perelli_Turhan_2024, series={CEUR Workshop Proceedings}, title={Optimal Alignment of Temporal Knowledge Bases (Extended Abstract)}, volume={3739}, booktitle={Proceedings of the 37th International Workshop on Description Logics (DL 2024), Bergen, Norway, June 18-21, 2024}, publisher={CEUR-WS.org}, author={Gil, Oliver Fernández and Patrizi, Fabio and Perelli, Giuseppe and Turhan, Anni-Yasmin}, editor={Giordano, Laura and Jung, Jean Christoph and Ozaki, Ana}, year={2024}, collection={CEUR Workshop Proceedings} }"},"publisher":"CEUR-WS.org","date_updated":"2024-10-14T08:03:03Z","volume":3739,"author":[{"full_name":"Gil, Oliver Fernández","last_name":"Gil","first_name":"Oliver Fernández"},{"full_name":"Patrizi, Fabio","last_name":"Patrizi","first_name":"Fabio"},{"first_name":"Giuseppe","last_name":"Perelli","full_name":"Perelli, Giuseppe"},{"last_name":"Turhan","id":"104470","full_name":"Turhan, Anni-Yasmin","first_name":"Anni-Yasmin"}],"date_created":"2024-09-17T08:45:01Z","title":"Optimal Alignment of Temporal Knowledge Bases (Extended Abstract)"},{"citation":{"ama":"Peñaloza R, Turhan A-Y. Rough, Rougher, Roughest: Extending EL with a Hierarchy of Indiscernibility Relations. In: Giordano L, Jung JC, Ozaki A, eds. <i>Proceedings of the 37th International Workshop on Description Logics (DL 2024), Bergen, Norway, June 18-21, 2024</i>. Vol 3739. CEUR Workshop Proceedings. CEUR-WS.org; 2024.","chicago":"Peñaloza, Rafael, and Anni-Yasmin Turhan. “Rough, Rougher, Roughest: Extending EL with a Hierarchy of Indiscernibility Relations.” In <i>Proceedings of the 37th International Workshop on Description Logics (DL 2024), Bergen, Norway, June 18-21, 2024</i>, edited by Laura Giordano, Jean Christoph Jung, and Ana Ozaki, Vol. 3739. CEUR Workshop Proceedings. CEUR-WS.org, 2024.","ieee":"R. Peñaloza and A.-Y. Turhan, “Rough, Rougher, Roughest: Extending EL with a Hierarchy of Indiscernibility Relations,” in <i>Proceedings of the 37th International Workshop on Description Logics (DL 2024), Bergen, Norway, June 18-21, 2024</i>, 2024, vol. 3739.","short":"R. Peñaloza, A.-Y. Turhan, in: L. Giordano, J.C. Jung, A. Ozaki (Eds.), Proceedings of the 37th International Workshop on Description Logics (DL 2024), Bergen, Norway, June 18-21, 2024, CEUR-WS.org, 2024.","bibtex":"@inproceedings{Peñaloza_Turhan_2024, series={CEUR Workshop Proceedings}, title={Rough, Rougher, Roughest: Extending EL with a Hierarchy of Indiscernibility Relations}, volume={3739}, booktitle={Proceedings of the 37th International Workshop on Description Logics (DL 2024), Bergen, Norway, June 18-21, 2024}, publisher={CEUR-WS.org}, author={Peñaloza, Rafael and Turhan, Anni-Yasmin}, editor={Giordano, Laura and Jung, Jean Christoph and Ozaki, Ana}, year={2024}, collection={CEUR Workshop Proceedings} }","mla":"Peñaloza, Rafael, and Anni-Yasmin Turhan. “Rough, Rougher, Roughest: Extending EL with a Hierarchy of Indiscernibility Relations.” <i>Proceedings of the 37th International Workshop on Description Logics (DL 2024), Bergen, Norway, June 18-21, 2024</i>, edited by Laura Giordano et al., vol. 3739, CEUR-WS.org, 2024.","apa":"Peñaloza, R., &#38; Turhan, A.-Y. (2024). Rough, Rougher, Roughest: Extending EL with a Hierarchy of Indiscernibility Relations. In L. Giordano, J. C. Jung, &#38; A. Ozaki (Eds.), <i>Proceedings of the 37th International Workshop on Description Logics (DL 2024), Bergen, Norway, June 18-21, 2024</i> (Vol. 3739). CEUR-WS.org."},"intvolume":"      3739","year":"2024","title":"Rough, Rougher, Roughest: Extending EL with a Hierarchy of Indiscernibility Relations","date_created":"2024-09-17T08:46:26Z","author":[{"full_name":"Peñaloza, Rafael","last_name":"Peñaloza","first_name":"Rafael"},{"id":"104470","full_name":"Turhan, Anni-Yasmin","last_name":"Turhan","first_name":"Anni-Yasmin"}],"volume":3739,"publisher":"CEUR-WS.org","date_updated":"2025-05-28T06:50:50Z","status":"public","editor":[{"first_name":"Laura","last_name":"Giordano","full_name":"Giordano, Laura"},{"first_name":"Jean Christoph","last_name":"Jung","full_name":"Jung, Jean Christoph"},{"last_name":"Ozaki","full_name":"Ozaki, Ana","first_name":"Ana"}],"type":"conference","publication":"Proceedings of the 37th International Workshop on Description Logics (DL 2024), Bergen, Norway, June 18-21, 2024","language":[{"iso":"eng"}],"user_id":"117185","series_title":"CEUR Workshop Proceedings","department":[{"_id":"888"}],"_id":"56159"},{"department":[{"_id":"888"}],"user_id":"9503","_id":"52861","language":[{"iso":"eng"}],"publication":"CoRR","type":"journal_article","status":"public","volume":"abs/2307.15439","date_created":"2024-03-25T13:58:27Z","author":[{"full_name":"Gil, Oliver Fernández","last_name":"Gil","first_name":"Oliver Fernández"},{"first_name":"Fabio","last_name":"Patrizi","full_name":"Patrizi, Fabio"},{"first_name":"Giuseppe","full_name":"Perelli, Giuseppe","last_name":"Perelli"},{"first_name":"Anni-Yasmin","last_name":"Turhan","id":"104470","full_name":"Turhan, Anni-Yasmin"}],"date_updated":"2024-03-25T13:59:45Z","doi":"10.48550/ARXIV.2307.15439","title":"Optimal Alignment of Temporal Knowledge Bases","citation":{"short":"O.F. Gil, F. Patrizi, G. Perelli, A.-Y. Turhan, CoRR abs/2307.15439 (2023).","bibtex":"@article{Gil_Patrizi_Perelli_Turhan_2023, title={Optimal Alignment of Temporal Knowledge Bases}, volume={abs/2307.15439}, DOI={<a href=\"https://doi.org/10.48550/ARXIV.2307.15439\">10.48550/ARXIV.2307.15439</a>}, journal={CoRR}, author={Gil, Oliver Fernández and Patrizi, Fabio and Perelli, Giuseppe and Turhan, Anni-Yasmin}, year={2023} }","mla":"Gil, Oliver Fernández, et al. “Optimal Alignment of Temporal Knowledge Bases.” <i>CoRR</i>, vol. abs/2307.15439, 2023, doi:<a href=\"https://doi.org/10.48550/ARXIV.2307.15439\">10.48550/ARXIV.2307.15439</a>.","apa":"Gil, O. F., Patrizi, F., Perelli, G., &#38; Turhan, A.-Y. (2023). Optimal Alignment of Temporal Knowledge Bases. <i>CoRR</i>, <i>abs/2307.15439</i>. <a href=\"https://doi.org/10.48550/ARXIV.2307.15439\">https://doi.org/10.48550/ARXIV.2307.15439</a>","ieee":"O. F. Gil, F. Patrizi, G. Perelli, and A.-Y. Turhan, “Optimal Alignment of Temporal Knowledge Bases,” <i>CoRR</i>, vol. abs/2307.15439, 2023, doi: <a href=\"https://doi.org/10.48550/ARXIV.2307.15439\">10.48550/ARXIV.2307.15439</a>.","chicago":"Gil, Oliver Fernández, Fabio Patrizi, Giuseppe Perelli, and Anni-Yasmin Turhan. “Optimal Alignment of Temporal Knowledge Bases.” <i>CoRR</i> abs/2307.15439 (2023). <a href=\"https://doi.org/10.48550/ARXIV.2307.15439\">https://doi.org/10.48550/ARXIV.2307.15439</a>.","ama":"Gil OF, Patrizi F, Perelli G, Turhan A-Y. Optimal Alignment of Temporal Knowledge Bases. <i>CoRR</i>. 2023;abs/2307.15439. doi:<a href=\"https://doi.org/10.48550/ARXIV.2307.15439\">10.48550/ARXIV.2307.15439</a>"},"year":"2023"},{"language":[{"iso":"eng"}],"user_id":"9503","series_title":"CEUR Workshop Proceedings","department":[{"_id":"888"}],"_id":"52913","status":"public","editor":[{"first_name":"Oliver","last_name":"Kutz","full_name":"Kutz, Oliver"},{"first_name":"Carsten","full_name":"Lutz, Carsten","last_name":"Lutz"},{"first_name":"Ana","last_name":"Ozaki","full_name":"Ozaki, Ana"}],"type":"conference","publication":"Proceedings of the 36th International Workshop on Description Logics {(DL} 2023) co-located with the 20th International Conference on Principles of Knowledge Representation and Reasoning and the 21st International Workshop on Non-Monotonic Reasoning {(KR} 2023 and NMR 2023)., Rhodes, Greece, September 2-4, 2023","title":"Brushing-up DLs to Cope with Imperfect Data (Abstract of Joint DL+NMR Invited Talk)","author":[{"first_name":"Anni-Yasmin","id":"104470","full_name":"Turhan, Anni-Yasmin","last_name":"Turhan"}],"date_created":"2024-03-26T10:50:16Z","volume":3515,"publisher":"CEUR-WS.org","date_updated":"2024-03-26T10:50:47Z","citation":{"ama":"Turhan A-Y. Brushing-up DLs to Cope with Imperfect Data (Abstract of Joint DL+NMR Invited Talk). In: Kutz O, Lutz C, Ozaki A, eds. <i>Proceedings of the 36th International Workshop on Description Logics {(DL} 2023) Co-Located with the 20th International Conference on Principles of Knowledge Representation and Reasoning and the 21st International Workshop on Non-Monotonic Reasoning {(KR} 2023 and NMR 2023)., Rhodes, Greece, September 2-4, 2023</i>. Vol 3515. CEUR Workshop Proceedings. CEUR-WS.org; 2023.","chicago":"Turhan, Anni-Yasmin. “Brushing-up DLs to Cope with Imperfect Data (Abstract of Joint DL+NMR Invited Talk).” In <i>Proceedings of the 36th International Workshop on Description Logics {(DL} 2023) Co-Located with the 20th International Conference on Principles of Knowledge Representation and Reasoning and the 21st International Workshop on Non-Monotonic Reasoning {(KR} 2023 and NMR 2023)., Rhodes, Greece, September 2-4, 2023</i>, edited by Oliver Kutz, Carsten Lutz, and Ana Ozaki, Vol. 3515. CEUR Workshop Proceedings. CEUR-WS.org, 2023.","ieee":"A.-Y. Turhan, “Brushing-up DLs to Cope with Imperfect Data (Abstract of Joint DL+NMR Invited Talk),” in <i>Proceedings of the 36th International Workshop on Description Logics {(DL} 2023) co-located with the 20th International Conference on Principles of Knowledge Representation and Reasoning and the 21st International Workshop on Non-Monotonic Reasoning {(KR} 2023 and NMR 2023)., Rhodes, Greece, September 2-4, 2023</i>, 2023, vol. 3515.","short":"A.-Y. Turhan, in: O. Kutz, C. Lutz, A. Ozaki (Eds.), Proceedings of the 36th International Workshop on Description Logics {(DL} 2023) Co-Located with the 20th International Conference on Principles of Knowledge Representation and Reasoning and the 21st International Workshop on Non-Monotonic Reasoning {(KR} 2023 and NMR 2023)., Rhodes, Greece, September 2-4, 2023, CEUR-WS.org, 2023.","mla":"Turhan, Anni-Yasmin. “Brushing-up DLs to Cope with Imperfect Data (Abstract of Joint DL+NMR Invited Talk).” <i>Proceedings of the 36th International Workshop on Description Logics {(DL} 2023) Co-Located with the 20th International Conference on Principles of Knowledge Representation and Reasoning and the 21st International Workshop on Non-Monotonic Reasoning {(KR} 2023 and NMR 2023)., Rhodes, Greece, September 2-4, 2023</i>, edited by Oliver Kutz et al., vol. 3515, CEUR-WS.org, 2023.","bibtex":"@inproceedings{Turhan_2023, series={CEUR Workshop Proceedings}, title={Brushing-up DLs to Cope with Imperfect Data (Abstract of Joint DL+NMR Invited Talk)}, volume={3515}, booktitle={Proceedings of the 36th International Workshop on Description Logics {(DL} 2023) co-located with the 20th International Conference on Principles of Knowledge Representation and Reasoning and the 21st International Workshop on Non-Monotonic Reasoning {(KR} 2023 and NMR 2023)., Rhodes, Greece, September 2-4, 2023}, publisher={CEUR-WS.org}, author={Turhan, Anni-Yasmin}, editor={Kutz, Oliver and Lutz, Carsten and Ozaki, Ana}, year={2023}, collection={CEUR Workshop Proceedings} }","apa":"Turhan, A.-Y. (2023). Brushing-up DLs to Cope with Imperfect Data (Abstract of Joint DL+NMR Invited Talk). In O. Kutz, C. Lutz, &#38; A. Ozaki (Eds.), <i>Proceedings of the 36th International Workshop on Description Logics {(DL} 2023) co-located with the 20th International Conference on Principles of Knowledge Representation and Reasoning and the 21st International Workshop on Non-Monotonic Reasoning {(KR} 2023 and NMR 2023)., Rhodes, Greece, September 2-4, 2023</i> (Vol. 3515). CEUR-WS.org."},"intvolume":"      3515","year":"2023"},{"status":"public","editor":[{"last_name":"Kutz","full_name":"Kutz, Oliver","first_name":"Oliver"},{"first_name":"Carsten","last_name":"Lutz","full_name":"Lutz, Carsten"},{"first_name":"Ana","full_name":"Ozaki, Ana","last_name":"Ozaki"}],"type":"conference","publication":"Proceedings of the 36th International Workshop on Description Logics {(DL} 2023) co-located with the 20th International Conference on Principles of Knowledge Representation and Reasoning and the 21st International Workshop on Non-Monotonic Reasoning {(KR} 2023 and NMR 2023)., Rhodes, Greece, September 2-4, 2023","language":[{"iso":"eng"}],"user_id":"9503","series_title":"CEUR Workshop Proceedings","department":[{"_id":"888"}],"_id":"54997","citation":{"ieee":"A.-Y. Turhan, “Brushing-up DLs to Cope with Imperfect Data (Abstract of Joint DL+NMR Invited Talk),” in <i>Proceedings of the 36th International Workshop on Description Logics {(DL} 2023) co-located with the 20th International Conference on Principles of Knowledge Representation and Reasoning and the 21st International Workshop on Non-Monotonic Reasoning {(KR} 2023 and NMR 2023)., Rhodes, Greece, September 2-4, 2023</i>, 2023, vol. 3515.","chicago":"Turhan, Anni-Yasmin. “Brushing-up DLs to Cope with Imperfect Data (Abstract of Joint DL+NMR Invited Talk).” In <i>Proceedings of the 36th International Workshop on Description Logics {(DL} 2023) Co-Located with the 20th International Conference on Principles of Knowledge Representation and Reasoning and the 21st International Workshop on Non-Monotonic Reasoning {(KR} 2023 and NMR 2023)., Rhodes, Greece, September 2-4, 2023</i>, edited by Oliver Kutz, Carsten Lutz, and Ana Ozaki, Vol. 3515. CEUR Workshop Proceedings. CEUR-WS.org, 2023.","ama":"Turhan A-Y. Brushing-up DLs to Cope with Imperfect Data (Abstract of Joint DL+NMR Invited Talk). In: Kutz O, Lutz C, Ozaki A, eds. <i>Proceedings of the 36th International Workshop on Description Logics {(DL} 2023) Co-Located with the 20th International Conference on Principles of Knowledge Representation and Reasoning and the 21st International Workshop on Non-Monotonic Reasoning {(KR} 2023 and NMR 2023)., Rhodes, Greece, September 2-4, 2023</i>. Vol 3515. CEUR Workshop Proceedings. CEUR-WS.org; 2023.","bibtex":"@inproceedings{Turhan_2023, series={CEUR Workshop Proceedings}, title={Brushing-up DLs to Cope with Imperfect Data (Abstract of Joint DL+NMR Invited Talk)}, volume={3515}, booktitle={Proceedings of the 36th International Workshop on Description Logics {(DL} 2023) co-located with the 20th International Conference on Principles of Knowledge Representation and Reasoning and the 21st International Workshop on Non-Monotonic Reasoning {(KR} 2023 and NMR 2023)., Rhodes, Greece, September 2-4, 2023}, publisher={CEUR-WS.org}, author={Turhan, Anni-Yasmin}, editor={Kutz, Oliver and Lutz, Carsten and Ozaki, Ana}, year={2023}, collection={CEUR Workshop Proceedings} }","mla":"Turhan, Anni-Yasmin. “Brushing-up DLs to Cope with Imperfect Data (Abstract of Joint DL+NMR Invited Talk).” <i>Proceedings of the 36th International Workshop on Description Logics {(DL} 2023) Co-Located with the 20th International Conference on Principles of Knowledge Representation and Reasoning and the 21st International Workshop on Non-Monotonic Reasoning {(KR} 2023 and NMR 2023)., Rhodes, Greece, September 2-4, 2023</i>, edited by Oliver Kutz et al., vol. 3515, CEUR-WS.org, 2023.","short":"A.-Y. Turhan, in: O. Kutz, C. Lutz, A. Ozaki (Eds.), Proceedings of the 36th International Workshop on Description Logics {(DL} 2023) Co-Located with the 20th International Conference on Principles of Knowledge Representation and Reasoning and the 21st International Workshop on Non-Monotonic Reasoning {(KR} 2023 and NMR 2023)., Rhodes, Greece, September 2-4, 2023, CEUR-WS.org, 2023.","apa":"Turhan, A.-Y. (2023). Brushing-up DLs to Cope with Imperfect Data (Abstract of Joint DL+NMR Invited Talk). In O. Kutz, C. Lutz, &#38; A. Ozaki (Eds.), <i>Proceedings of the 36th International Workshop on Description Logics {(DL} 2023) co-located with the 20th International Conference on Principles of Knowledge Representation and Reasoning and the 21st International Workshop on Non-Monotonic Reasoning {(KR} 2023 and NMR 2023)., Rhodes, Greece, September 2-4, 2023</i> (Vol. 3515). CEUR-WS.org."},"intvolume":"      3515","year":"2023","title":"Brushing-up DLs to Cope with Imperfect Data (Abstract of Joint DL+NMR Invited Talk)","author":[{"first_name":"Anni-Yasmin","full_name":"Turhan, Anni-Yasmin","last_name":"Turhan"}],"date_created":"2024-07-03T09:09:00Z","volume":3515,"publisher":"CEUR-WS.org","date_updated":"2024-08-01T11:17:17Z"},{"year":"2023","page":"708–715","intvolume":"       372","citation":{"ama":"Gil OF, Patrizi F, Perelli G, Turhan A-Y. Optimal Alignment of Temporal Knowledge Bases. In: Gal K, Nowé A, Nalepa GJ, Fairstein R, Radulescu R, eds. <i>ECAI 2023 - 26th European Conference on Artificial Intelligence, September 30 - October 4, 2023, Kraków, Poland - Including 12th Conference on Prestigious Applications of Intelligent Systems (PAIS 2023)</i>. Vol 372. Frontiers in Artificial Intelligence and Applications. IOS Press; 2023:708–715. doi:<a href=\"https://doi.org/10.3233/FAIA230335\">10.3233/FAIA230335</a>","ieee":"O. F. Gil, F. Patrizi, G. Perelli, and A.-Y. Turhan, “Optimal Alignment of Temporal Knowledge Bases,” in <i>ECAI 2023 - 26th European Conference on Artificial Intelligence, September 30 - October 4, 2023, Kraków, Poland - Including 12th Conference on Prestigious Applications of Intelligent Systems (PAIS 2023)</i>, 2023, vol. 372, pp. 708–715, doi: <a href=\"https://doi.org/10.3233/FAIA230335\">10.3233/FAIA230335</a>.","chicago":"Gil, Oliver Fernández, Fabio Patrizi, Giuseppe Perelli, and Anni-Yasmin Turhan. “Optimal Alignment of Temporal Knowledge Bases.” In <i>ECAI 2023 - 26th European Conference on Artificial Intelligence, September 30 - October 4, 2023, Kraków, Poland - Including 12th Conference on Prestigious Applications of Intelligent Systems (PAIS 2023)</i>, edited by Kobi Gal, Ann Nowé, Grzegorz J. Nalepa, Roy Fairstein, and Roxana Radulescu, 372:708–715. Frontiers in Artificial Intelligence and Applications. IOS Press, 2023. <a href=\"https://doi.org/10.3233/FAIA230335\">https://doi.org/10.3233/FAIA230335</a>.","apa":"Gil, O. F., Patrizi, F., Perelli, G., &#38; Turhan, A.-Y. (2023). Optimal Alignment of Temporal Knowledge Bases. In K. Gal, A. Nowé, G. J. Nalepa, R. Fairstein, &#38; R. Radulescu (Eds.), <i>ECAI 2023 - 26th European Conference on Artificial Intelligence, September 30 - October 4, 2023, Kraków, Poland - Including 12th Conference on Prestigious Applications of Intelligent Systems (PAIS 2023)</i> (Vol. 372, pp. 708–715). IOS Press. <a href=\"https://doi.org/10.3233/FAIA230335\">https://doi.org/10.3233/FAIA230335</a>","mla":"Gil, Oliver Fernández, et al. “Optimal Alignment of Temporal Knowledge Bases.” <i>ECAI 2023 - 26th European Conference on Artificial Intelligence, September 30 - October 4, 2023, Kraków, Poland - Including 12th Conference on Prestigious Applications of Intelligent Systems (PAIS 2023)</i>, edited by Kobi Gal et al., vol. 372, IOS Press, 2023, pp. 708–715, doi:<a href=\"https://doi.org/10.3233/FAIA230335\">10.3233/FAIA230335</a>.","short":"O.F. Gil, F. Patrizi, G. Perelli, A.-Y. Turhan, in: K. Gal, A. Nowé, G.J. Nalepa, R. Fairstein, R. Radulescu (Eds.), ECAI 2023 - 26th European Conference on Artificial Intelligence, September 30 - October 4, 2023, Kraków, Poland - Including 12th Conference on Prestigious Applications of Intelligent Systems (PAIS 2023), IOS Press, 2023, pp. 708–715.","bibtex":"@inproceedings{Gil_Patrizi_Perelli_Turhan_2023, series={Frontiers in Artificial Intelligence and Applications}, title={Optimal Alignment of Temporal Knowledge Bases}, volume={372}, DOI={<a href=\"https://doi.org/10.3233/FAIA230335\">10.3233/FAIA230335</a>}, booktitle={ECAI 2023 - 26th European Conference on Artificial Intelligence, September 30 - October 4, 2023, Kraków, Poland - Including 12th Conference on Prestigious Applications of Intelligent Systems (PAIS 2023)}, publisher={IOS Press}, author={Gil, Oliver Fernández and Patrizi, Fabio and Perelli, Giuseppe and Turhan, Anni-Yasmin}, editor={Gal, Kobi and Nowé, Ann and Nalepa, Grzegorz J. and Fairstein, Roy and Radulescu, Roxana}, year={2023}, pages={708–715}, collection={Frontiers in Artificial Intelligence and Applications} }"},"title":"Optimal Alignment of Temporal Knowledge Bases","doi":"10.3233/FAIA230335","publisher":"IOS Press","date_updated":"2024-09-25T09:25:40Z","volume":372,"date_created":"2024-09-10T12:33:40Z","author":[{"full_name":"Gil, Oliver Fernández","last_name":"Gil","first_name":"Oliver Fernández"},{"last_name":"Patrizi","full_name":"Patrizi, Fabio","first_name":"Fabio"},{"last_name":"Perelli","full_name":"Perelli, Giuseppe","first_name":"Giuseppe"},{"first_name":"Anni-Yasmin","last_name":"Turhan","id":"104470","full_name":"Turhan, Anni-Yasmin"}],"editor":[{"first_name":"Kobi","last_name":"Gal","full_name":"Gal, Kobi"},{"last_name":"Nowé","full_name":"Nowé, Ann","first_name":"Ann"},{"full_name":"Nalepa, Grzegorz J.","last_name":"Nalepa","first_name":"Grzegorz J."},{"first_name":"Roy","last_name":"Fairstein","full_name":"Fairstein, Roy"},{"last_name":"Radulescu","full_name":"Radulescu, Roxana","first_name":"Roxana"}],"status":"public","publication":"ECAI 2023 - 26th European Conference on Artificial Intelligence, September 30 - October 4, 2023, Kraków, Poland - Including 12th Conference on Prestigious Applications of Intelligent Systems (PAIS 2023)","type":"conference","language":[{"iso":"eng"}],"_id":"56096","department":[{"_id":"888"}],"series_title":"Frontiers in Artificial Intelligence and Applications","user_id":"15504"},{"date_created":"2024-03-25T13:56:30Z","author":[{"last_name":"de Camargo e Souza Câmara","full_name":"de Camargo e Souza Câmara, Igor","first_name":"Igor"},{"first_name":"Anni-Yasmin","id":"104470","full_name":"Turhan, Anni-Yasmin","last_name":"Turhan"}],"date_updated":"2024-12-11T13:57:36Z","publisher":"Springer Nature Switzerland","doi":"10.1007/978-3-031-43619-2_36","title":"Deciding Subsumption in Defeasible 𝓔𝓛𝓘⊥ with Typicality Models","publication_status":"published","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783031436185","9783031436192"]},"citation":{"apa":"de Camargo e Souza Câmara, I., &#38; Turhan, A.-Y. (2023). Deciding Subsumption in Defeasible 𝓔𝓛𝓘⊥ with Typicality Models. In <i>Logics in Artificial Intelligence</i>. Springer Nature Switzerland. <a href=\"https://doi.org/10.1007/978-3-031-43619-2_36\">https://doi.org/10.1007/978-3-031-43619-2_36</a>","mla":"de Camargo e Souza Câmara, Igor, and Anni-Yasmin Turhan. “Deciding Subsumption in Defeasible 𝓔𝓛𝓘⊥ with Typicality Models.” <i>Logics in Artificial Intelligence</i>, Springer Nature Switzerland, 2023, doi:<a href=\"https://doi.org/10.1007/978-3-031-43619-2_36\">10.1007/978-3-031-43619-2_36</a>.","bibtex":"@inbook{de Camargo e Souza Câmara_Turhan_2023, place={Cham}, title={Deciding Subsumption in Defeasible 𝓔𝓛𝓘⊥ with Typicality Models}, DOI={<a href=\"https://doi.org/10.1007/978-3-031-43619-2_36\">10.1007/978-3-031-43619-2_36</a>}, booktitle={Logics in Artificial Intelligence}, publisher={Springer Nature Switzerland}, author={de Camargo e Souza Câmara, Igor and Turhan, Anni-Yasmin}, year={2023} }","short":"I. de Camargo e Souza Câmara, A.-Y. Turhan, in: Logics in Artificial Intelligence, Springer Nature Switzerland, Cham, 2023.","ama":"de Camargo e Souza Câmara I, Turhan A-Y. Deciding Subsumption in Defeasible 𝓔𝓛𝓘⊥ with Typicality Models. In: <i>Logics in Artificial Intelligence</i>. Springer Nature Switzerland; 2023. doi:<a href=\"https://doi.org/10.1007/978-3-031-43619-2_36\">10.1007/978-3-031-43619-2_36</a>","ieee":"I. de Camargo e Souza Câmara and A.-Y. Turhan, “Deciding Subsumption in Defeasible 𝓔𝓛𝓘⊥ with Typicality Models,” in <i>Logics in Artificial Intelligence</i>, Cham: Springer Nature Switzerland, 2023.","chicago":"Camargo e Souza Câmara, Igor de, and Anni-Yasmin Turhan. “Deciding Subsumption in Defeasible 𝓔𝓛𝓘⊥ with Typicality Models.” In <i>Logics in Artificial Intelligence</i>. Cham: Springer Nature Switzerland, 2023. <a href=\"https://doi.org/10.1007/978-3-031-43619-2_36\">https://doi.org/10.1007/978-3-031-43619-2_36</a>."},"place":"Cham","year":"2023","user_id":"15504","department":[{"_id":"888"}],"_id":"52859","language":[{"iso":"eng"}],"type":"book_chapter","publication":"Logics in Artificial Intelligence","status":"public"},{"status":"public","publication":"KI - Künstliche Intelligenz","type":"journal_article","keyword":["Artificial Intelligence"],"language":[{"iso":"eng"}],"_id":"52862","department":[{"_id":"888"}],"user_id":"9503","year":"2022","page":"1-4","intvolume":"        36","citation":{"bibtex":"@article{Turhan_2022, title={A Double Take at Conferences: The Hybrid Format}, volume={36}, DOI={<a href=\"https://doi.org/10.1007/s13218-022-00758-6\">10.1007/s13218-022-00758-6</a>}, number={1}, journal={KI - Künstliche Intelligenz}, publisher={Springer Science and Business Media LLC}, author={Turhan, Anni-Yasmin}, year={2022}, pages={1–4} }","mla":"Turhan, Anni-Yasmin. “A Double Take at Conferences: The Hybrid Format.” <i>KI - Künstliche Intelligenz</i>, vol. 36, no. 1, Springer Science and Business Media LLC, 2022, pp. 1–4, doi:<a href=\"https://doi.org/10.1007/s13218-022-00758-6\">10.1007/s13218-022-00758-6</a>.","short":"A.-Y. Turhan, KI - Künstliche Intelligenz 36 (2022) 1–4.","apa":"Turhan, A.-Y. (2022). A Double Take at Conferences: The Hybrid Format. <i>KI - Künstliche Intelligenz</i>, <i>36</i>(1), 1–4. <a href=\"https://doi.org/10.1007/s13218-022-00758-6\">https://doi.org/10.1007/s13218-022-00758-6</a>","ieee":"A.-Y. Turhan, “A Double Take at Conferences: The Hybrid Format,” <i>KI - Künstliche Intelligenz</i>, vol. 36, no. 1, pp. 1–4, 2022, doi: <a href=\"https://doi.org/10.1007/s13218-022-00758-6\">10.1007/s13218-022-00758-6</a>.","chicago":"Turhan, Anni-Yasmin. “A Double Take at Conferences: The Hybrid Format.” <i>KI - Künstliche Intelligenz</i> 36, no. 1 (2022): 1–4. <a href=\"https://doi.org/10.1007/s13218-022-00758-6\">https://doi.org/10.1007/s13218-022-00758-6</a>.","ama":"Turhan A-Y. A Double Take at Conferences: The Hybrid Format. <i>KI - Künstliche Intelligenz</i>. 2022;36(1):1-4. doi:<a href=\"https://doi.org/10.1007/s13218-022-00758-6\">10.1007/s13218-022-00758-6</a>"},"publication_identifier":{"issn":["0933-1875","1610-1987"]},"publication_status":"published","issue":"1","title":"A Double Take at Conferences: The Hybrid Format","doi":"10.1007/s13218-022-00758-6","date_updated":"2024-03-26T10:52:36Z","publisher":"Springer Science and Business Media LLC","volume":36,"author":[{"last_name":"Turhan","id":"104470","full_name":"Turhan, Anni-Yasmin","first_name":"Anni-Yasmin"}],"date_created":"2024-03-25T14:00:30Z"},{"citation":{"bibtex":"@inproceedings{de Camargo e Souza Câmara_Turhan_2022, series={CEUR Workshop Proceedings}, title={Rational Defeasible Subsumption in DLs with Nested Quantifiers: the Case of ELI\\(\\perp\\)}, volume={3197}, booktitle={Proceedings of the 20th International Workshop on Non-Monotonic Reasoning, NMR 2022, Part of the Federated Logic Conference (FLoC 2022), Haifa, Israel, August 7-9, 2022}, publisher={CEUR-WS.org}, author={de Camargo e Souza Câmara, Igor and Turhan, Anni-Yasmin}, editor={Arieli, Ofer and Casini, Giovanni and Giordano, Laura}, year={2022}, pages={159–162}, collection={CEUR Workshop Proceedings} }","mla":"de Camargo e Souza Câmara, Igor, and Anni-Yasmin Turhan. “Rational Defeasible Subsumption in DLs with Nested Quantifiers: The Case of ELI\\(\\perp\\).” <i>Proceedings of the 20th International Workshop on Non-Monotonic Reasoning, NMR 2022, Part of the Federated Logic Conference (FLoC 2022), Haifa, Israel, August 7-9, 2022</i>, edited by Ofer Arieli et al., vol. 3197, CEUR-WS.org, 2022, pp. 159–162.","short":"I. de Camargo e Souza Câmara, A.-Y. Turhan, in: O. Arieli, G. Casini, L. Giordano (Eds.), Proceedings of the 20th International Workshop on Non-Monotonic Reasoning, NMR 2022, Part of the Federated Logic Conference (FLoC 2022), Haifa, Israel, August 7-9, 2022, CEUR-WS.org, 2022, pp. 159–162.","apa":"de Camargo e Souza Câmara, I., &#38; Turhan, A.-Y. (2022). Rational Defeasible Subsumption in DLs with Nested Quantifiers: the Case of ELI\\(\\perp\\). In O. Arieli, G. Casini, &#38; L. Giordano (Eds.), <i>Proceedings of the 20th International Workshop on Non-Monotonic Reasoning, NMR 2022, Part of the Federated Logic Conference (FLoC 2022), Haifa, Israel, August 7-9, 2022</i> (Vol. 3197, pp. 159–162). CEUR-WS.org.","ieee":"I. de Camargo e Souza Câmara and A.-Y. Turhan, “Rational Defeasible Subsumption in DLs with Nested Quantifiers: the Case of ELI\\(\\perp\\),” in <i>Proceedings of the 20th International Workshop on Non-Monotonic Reasoning, NMR 2022, Part of the Federated Logic Conference (FLoC 2022), Haifa, Israel, August 7-9, 2022</i>, 2022, vol. 3197, pp. 159–162.","chicago":"Camargo e Souza Câmara, Igor de, and Anni-Yasmin Turhan. “Rational Defeasible Subsumption in DLs with Nested Quantifiers: The Case of ELI\\(\\perp\\).” In <i>Proceedings of the 20th International Workshop on Non-Monotonic Reasoning, NMR 2022, Part of the Federated Logic Conference (FLoC 2022), Haifa, Israel, August 7-9, 2022</i>, edited by Ofer Arieli, Giovanni Casini, and Laura Giordano, 3197:159–162. CEUR Workshop Proceedings. CEUR-WS.org, 2022.","ama":"de Camargo e Souza Câmara I, Turhan A-Y. Rational Defeasible Subsumption in DLs with Nested Quantifiers: the Case of ELI\\(\\perp\\). In: Arieli O, Casini G, Giordano L, eds. <i>Proceedings of the 20th International Workshop on Non-Monotonic Reasoning, NMR 2022, Part of the Federated Logic Conference (FLoC 2022), Haifa, Israel, August 7-9, 2022</i>. Vol 3197. CEUR Workshop Proceedings. CEUR-WS.org; 2022:159–162."},"intvolume":"      3197","page":"159–162","year":"2022","title":"Rational Defeasible Subsumption in DLs with Nested Quantifiers: the Case of ELI\\(\\perp\\)","author":[{"full_name":"de Camargo e Souza Câmara, Igor","last_name":"de Camargo e Souza Câmara","first_name":"Igor"},{"full_name":"Turhan, Anni-Yasmin","id":"104470","last_name":"Turhan","first_name":"Anni-Yasmin"}],"date_created":"2024-03-26T10:54:06Z","volume":3197,"date_updated":"2024-03-26T10:56:19Z","publisher":"CEUR-WS.org","status":"public","editor":[{"first_name":"Ofer","last_name":"Arieli","full_name":"Arieli, Ofer"},{"full_name":"Casini, Giovanni","last_name":"Casini","first_name":"Giovanni"},{"first_name":"Laura","full_name":"Giordano, Laura","last_name":"Giordano"}],"type":"conference","publication":"Proceedings of the 20th International Workshop on Non-Monotonic Reasoning, NMR 2022, Part of the Federated Logic Conference (FLoC 2022), Haifa, Israel, August 7-9, 2022","language":[{"iso":"eng"}],"user_id":"9503","series_title":"CEUR Workshop Proceedings","department":[{"_id":"888"}],"_id":"52923"}]