[{"publication_status":"published","publication_identifier":{"isbn":["9783031945748","9783031945755"],"issn":["0302-9743","1611-3349"]},"citation":{"short":"G. Pandit, M. Röder, A.-C. Ngonga Ngomo, in: Lecture Notes in Computer Science, Springer Nature Switzerland, Cham, 2025.","bibtex":"@inbook{Pandit_Röder_Ngonga Ngomo_2025, place={Cham}, title={Evaluating Approximate Nearest Neighbour Search Systems on Knowledge Graph Embeddings}, DOI={<a href=\"https://doi.org/10.1007/978-3-031-94575-5_4\">10.1007/978-3-031-94575-5_4</a>}, booktitle={Lecture Notes in Computer Science}, publisher={Springer Nature Switzerland}, author={Pandit, Gaurav and Röder, Michael and Ngonga Ngomo, Axel-Cyrille}, year={2025} }","mla":"Pandit, Gaurav, et al. “Evaluating Approximate Nearest Neighbour Search Systems on Knowledge Graph Embeddings.” <i>Lecture Notes in Computer Science</i>, Springer Nature Switzerland, 2025, doi:<a href=\"https://doi.org/10.1007/978-3-031-94575-5_4\">10.1007/978-3-031-94575-5_4</a>.","apa":"Pandit, G., Röder, M., &#38; Ngonga Ngomo, A.-C. (2025). Evaluating Approximate Nearest Neighbour Search Systems on Knowledge Graph Embeddings. In <i>Lecture Notes in Computer Science</i>. Springer Nature Switzerland. <a href=\"https://doi.org/10.1007/978-3-031-94575-5_4\">https://doi.org/10.1007/978-3-031-94575-5_4</a>","ama":"Pandit G, Röder M, Ngonga Ngomo A-C. Evaluating Approximate Nearest Neighbour Search Systems on Knowledge Graph Embeddings. In: <i>Lecture Notes in Computer Science</i>. Springer Nature Switzerland; 2025. doi:<a href=\"https://doi.org/10.1007/978-3-031-94575-5_4\">10.1007/978-3-031-94575-5_4</a>","chicago":"Pandit, Gaurav, Michael Röder, and Axel-Cyrille Ngonga Ngomo. “Evaluating Approximate Nearest Neighbour Search Systems on Knowledge Graph Embeddings.” In <i>Lecture Notes in Computer Science</i>. Cham: Springer Nature Switzerland, 2025. <a href=\"https://doi.org/10.1007/978-3-031-94575-5_4\">https://doi.org/10.1007/978-3-031-94575-5_4</a>.","ieee":"G. Pandit, M. Röder, and A.-C. Ngonga Ngomo, “Evaluating Approximate Nearest Neighbour Search Systems on Knowledge Graph Embeddings,” in <i>Lecture Notes in Computer Science</i>, Cham: Springer Nature Switzerland, 2025."},"place":"Cham","year":"2025","date_created":"2026-01-06T09:53:58Z","author":[{"full_name":"Pandit, Gaurav","last_name":"Pandit","first_name":"Gaurav"},{"first_name":"Michael","last_name":"Röder","orcid":"https://orcid.org/0000-0002-8609-8277","full_name":"Röder, Michael","id":"67199"},{"full_name":"Ngonga Ngomo, Axel-Cyrille","id":"65716","last_name":"Ngonga Ngomo","first_name":"Axel-Cyrille"}],"publisher":"Springer Nature Switzerland","date_updated":"2026-01-06T09:55:26Z","doi":"10.1007/978-3-031-94575-5_4","title":"Evaluating Approximate Nearest Neighbour Search Systems on Knowledge Graph Embeddings","type":"book_chapter","publication":"Lecture Notes in Computer Science","status":"public","user_id":"67199","department":[{"_id":"574"},{"_id":"923"}],"_id":"63507","language":[{"iso":"eng"}]},{"conference":{"location":"Porto","end_date":"2025-09-19","start_date":"2025-09-15","name":"European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases"},"doi":"10.1007/978-3-032-06066-2_29","title":"Tree-Based OWL Class Expression Learner over Large Graphs","date_created":"2026-01-12T17:13:22Z","author":[{"first_name":"Caglar","full_name":"Demir, Caglar","id":"43817","last_name":"Demir"},{"full_name":"Yekini, Moshood Olawale","id":"114533","last_name":"Yekini","first_name":"Moshood Olawale"},{"orcid":"https://orcid.org/0000-0002-8609-8277","last_name":"Röder","id":"67199","full_name":"Röder, Michael","first_name":"Michael"},{"first_name":"Yasir","last_name":"Mahmood","id":"99353","full_name":"Mahmood, Yasir"},{"id":"65716","full_name":"Ngonga Ngomo, Axel-Cyrille","last_name":"Ngonga Ngomo","first_name":"Axel-Cyrille"}],"publisher":"Springer Nature Switzerland","date_updated":"2026-01-12T17:17:07Z","citation":{"short":"C. Demir, M.O. Yekini, M. Röder, Y. Mahmood, A.-C. Ngonga Ngomo, in: Lecture Notes in Computer Science, Springer Nature Switzerland, Cham, 2025.","bibtex":"@inproceedings{Demir_Yekini_Röder_Mahmood_Ngonga Ngomo_2025, place={Cham}, title={Tree-Based OWL Class Expression Learner over Large Graphs}, DOI={<a href=\"https://doi.org/10.1007/978-3-032-06066-2_29\">10.1007/978-3-032-06066-2_29</a>}, booktitle={Lecture Notes in Computer Science}, publisher={Springer Nature Switzerland}, author={Demir, Caglar and Yekini, Moshood Olawale and Röder, Michael and Mahmood, Yasir and Ngonga Ngomo, Axel-Cyrille}, year={2025} }","mla":"Demir, Caglar, et al. “Tree-Based OWL Class Expression Learner over Large Graphs.” <i>Lecture Notes in Computer Science</i>, Springer Nature Switzerland, 2025, doi:<a href=\"https://doi.org/10.1007/978-3-032-06066-2_29\">10.1007/978-3-032-06066-2_29</a>.","apa":"Demir, C., Yekini, M. O., Röder, M., Mahmood, Y., &#38; Ngonga Ngomo, A.-C. (2025). Tree-Based OWL Class Expression Learner over Large Graphs. <i>Lecture Notes in Computer Science</i>. European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases, Porto. <a href=\"https://doi.org/10.1007/978-3-032-06066-2_29\">https://doi.org/10.1007/978-3-032-06066-2_29</a>","chicago":"Demir, Caglar, Moshood Olawale Yekini, Michael Röder, Yasir Mahmood, and Axel-Cyrille Ngonga Ngomo. “Tree-Based OWL Class Expression Learner over Large Graphs.” In <i>Lecture Notes in Computer Science</i>. Cham: Springer Nature Switzerland, 2025. <a href=\"https://doi.org/10.1007/978-3-032-06066-2_29\">https://doi.org/10.1007/978-3-032-06066-2_29</a>.","ieee":"C. Demir, M. O. Yekini, M. Röder, Y. Mahmood, and A.-C. Ngonga Ngomo, “Tree-Based OWL Class Expression Learner over Large Graphs,” presented at the European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases, Porto, 2025, doi: <a href=\"https://doi.org/10.1007/978-3-032-06066-2_29\">10.1007/978-3-032-06066-2_29</a>.","ama":"Demir C, Yekini MO, Röder M, Mahmood Y, Ngonga Ngomo A-C. Tree-Based OWL Class Expression Learner over Large Graphs. In: <i>Lecture Notes in Computer Science</i>. Springer Nature Switzerland; 2025. doi:<a href=\"https://doi.org/10.1007/978-3-032-06066-2_29\">10.1007/978-3-032-06066-2_29</a>"},"year":"2025","place":"Cham","publication_status":"published","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783032060655","9783032060662"]},"language":[{"iso":"eng"}],"user_id":"67199","department":[{"_id":"574"},{"_id":"923"}],"_id":"63572","status":"public","type":"conference","publication":"Lecture Notes in Computer Science"},{"department":[{"_id":"574"},{"_id":"923"}],"user_id":"67199","_id":"63575","language":[{"iso":"eng"}],"publication":"Lecture Notes in Computer Science","type":"conference","status":"public","date_created":"2026-01-12T17:24:11Z","author":[{"last_name":"Kapoor","full_name":"Kapoor, Sourabh","first_name":"Sourabh"},{"last_name":"Sharma","id":"67200","full_name":"Sharma, Arnab","first_name":"Arnab"},{"first_name":"Michael","id":"67199","full_name":"Röder, Michael","last_name":"Röder","orcid":"https://orcid.org/0000-0002-8609-8277"},{"first_name":"Caglar","last_name":"Demir","id":"43817","full_name":"Demir, Caglar"},{"full_name":"Ngonga Ngomo, Axel-Cyrille","id":"65716","last_name":"Ngonga Ngomo","first_name":"Axel-Cyrille"}],"publisher":"Springer Nature Switzerland","date_updated":"2026-01-12T17:24:49Z","doi":"10.1007/978-3-031-94575-5_15","title":"Robustness Evaluation of Knowledge Graph Embedding Models Under Non-targeted Attacks","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783031945748","9783031945755"]},"publication_status":"published","citation":{"ama":"Kapoor S, Sharma A, Röder M, Demir C, Ngonga Ngomo A-C. Robustness Evaluation of Knowledge Graph Embedding Models Under Non-targeted Attacks. In: <i>Lecture Notes in Computer Science</i>. Springer Nature Switzerland; 2025. doi:<a href=\"https://doi.org/10.1007/978-3-031-94575-5_15\">10.1007/978-3-031-94575-5_15</a>","chicago":"Kapoor, Sourabh, Arnab Sharma, Michael Röder, Caglar Demir, and Axel-Cyrille Ngonga Ngomo. “Robustness Evaluation of Knowledge Graph Embedding Models Under Non-Targeted Attacks.” In <i>Lecture Notes in Computer Science</i>. Cham: Springer Nature Switzerland, 2025. <a href=\"https://doi.org/10.1007/978-3-031-94575-5_15\">https://doi.org/10.1007/978-3-031-94575-5_15</a>.","ieee":"S. Kapoor, A. Sharma, M. Röder, C. Demir, and A.-C. Ngonga Ngomo, “Robustness Evaluation of Knowledge Graph Embedding Models Under Non-targeted Attacks,” 2025, doi: <a href=\"https://doi.org/10.1007/978-3-031-94575-5_15\">10.1007/978-3-031-94575-5_15</a>.","mla":"Kapoor, Sourabh, et al. “Robustness Evaluation of Knowledge Graph Embedding Models Under Non-Targeted Attacks.” <i>Lecture Notes in Computer Science</i>, Springer Nature Switzerland, 2025, doi:<a href=\"https://doi.org/10.1007/978-3-031-94575-5_15\">10.1007/978-3-031-94575-5_15</a>.","bibtex":"@inproceedings{Kapoor_Sharma_Röder_Demir_Ngonga Ngomo_2025, place={Cham}, title={Robustness Evaluation of Knowledge Graph Embedding Models Under Non-targeted Attacks}, DOI={<a href=\"https://doi.org/10.1007/978-3-031-94575-5_15\">10.1007/978-3-031-94575-5_15</a>}, booktitle={Lecture Notes in Computer Science}, publisher={Springer Nature Switzerland}, author={Kapoor, Sourabh and Sharma, Arnab and Röder, Michael and Demir, Caglar and Ngonga Ngomo, Axel-Cyrille}, year={2025} }","short":"S. Kapoor, A. Sharma, M. Röder, C. Demir, A.-C. Ngonga Ngomo, in: Lecture Notes in Computer Science, Springer Nature Switzerland, Cham, 2025.","apa":"Kapoor, S., Sharma, A., Röder, M., Demir, C., &#38; Ngonga Ngomo, A.-C. (2025). Robustness Evaluation of Knowledge Graph Embedding Models Under Non-targeted Attacks. <i>Lecture Notes in Computer Science</i>. <a href=\"https://doi.org/10.1007/978-3-031-94575-5_15\">https://doi.org/10.1007/978-3-031-94575-5_15</a>"},"place":"Cham","year":"2025"},{"_id":"63573","department":[{"_id":"574"},{"_id":"923"}],"user_id":"67199","language":[{"iso":"eng"}],"publication":"Lecture Notes in Computer Science","type":"conference","status":"public","date_updated":"2026-01-12T17:24:46Z","publisher":"Springer Nature Switzerland","date_created":"2026-01-12T17:18:35Z","author":[{"first_name":"Adel","last_name":"Memariani","full_name":"Memariani, Adel"},{"full_name":"Röder, Michael","id":"67199","last_name":"Röder","orcid":"https://orcid.org/0000-0002-8609-8277","first_name":"Michael"},{"first_name":"Arnab","last_name":"Sharma","id":"67200","full_name":"Sharma, Arnab"},{"first_name":"Caglar","id":"43817","full_name":"Demir, Caglar","last_name":"Demir"},{"last_name":"Ngonga Ngomo","id":"65716","full_name":"Ngonga Ngomo, Axel-Cyrille","first_name":"Axel-Cyrille"}],"title":"Link Prediction Under Non-targeted Attacks: Do Soft Labels Always Help?","doi":"10.1007/978-3-032-09527-5_6","publication_identifier":{"isbn":["9783032095268","9783032095275"],"issn":["0302-9743","1611-3349"]},"publication_status":"published","year":"2025","place":"Cham","citation":{"chicago":"Memariani, Adel, Michael Röder, Arnab Sharma, Caglar Demir, and Axel-Cyrille Ngonga Ngomo. “Link Prediction Under Non-Targeted Attacks: Do Soft Labels Always Help?” In <i>Lecture Notes in Computer Science</i>. Cham: Springer Nature Switzerland, 2025. <a href=\"https://doi.org/10.1007/978-3-032-09527-5_6\">https://doi.org/10.1007/978-3-032-09527-5_6</a>.","ieee":"A. Memariani, M. Röder, A. Sharma, C. Demir, and A.-C. Ngonga Ngomo, “Link Prediction Under Non-targeted Attacks: Do Soft Labels Always Help?,” 2025, doi: <a href=\"https://doi.org/10.1007/978-3-032-09527-5_6\">10.1007/978-3-032-09527-5_6</a>.","ama":"Memariani A, Röder M, Sharma A, Demir C, Ngonga Ngomo A-C. Link Prediction Under Non-targeted Attacks: Do Soft Labels Always Help? In: <i>Lecture Notes in Computer Science</i>. Springer Nature Switzerland; 2025. doi:<a href=\"https://doi.org/10.1007/978-3-032-09527-5_6\">10.1007/978-3-032-09527-5_6</a>","bibtex":"@inproceedings{Memariani_Röder_Sharma_Demir_Ngonga Ngomo_2025, place={Cham}, title={Link Prediction Under Non-targeted Attacks: Do Soft Labels Always Help?}, DOI={<a href=\"https://doi.org/10.1007/978-3-032-09527-5_6\">10.1007/978-3-032-09527-5_6</a>}, booktitle={Lecture Notes in Computer Science}, publisher={Springer Nature Switzerland}, author={Memariani, Adel and Röder, Michael and Sharma, Arnab and Demir, Caglar and Ngonga Ngomo, Axel-Cyrille}, year={2025} }","short":"A. Memariani, M. Röder, A. Sharma, C. Demir, A.-C. Ngonga Ngomo, in: Lecture Notes in Computer Science, Springer Nature Switzerland, Cham, 2025.","mla":"Memariani, Adel, et al. “Link Prediction Under Non-Targeted Attacks: Do Soft Labels Always Help?” <i>Lecture Notes in Computer Science</i>, Springer Nature Switzerland, 2025, doi:<a href=\"https://doi.org/10.1007/978-3-032-09527-5_6\">10.1007/978-3-032-09527-5_6</a>.","apa":"Memariani, A., Röder, M., Sharma, A., Demir, C., &#38; Ngonga Ngomo, A.-C. (2025). Link Prediction Under Non-targeted Attacks: Do Soft Labels Always Help? <i>Lecture Notes in Computer Science</i>. <a href=\"https://doi.org/10.1007/978-3-032-09527-5_6\">https://doi.org/10.1007/978-3-032-09527-5_6</a>"}},{"doi":"10.1145/3731443.3771359","title":"Explainable Benchmarking through the Lense of Concept Learning","author":[{"first_name":"Quannian","orcid":"0009-0008-9497-3204","last_name":"Zhang","id":"104099","full_name":"Zhang, Quannian"},{"first_name":"Michael","orcid":"https://orcid.org/0000-0002-8609-8277","last_name":"Röder","id":"67199","full_name":"Röder, Michael"},{"last_name":"Srivastava","orcid":"0009-0004-5164-4911","id":"70066","full_name":"Srivastava, Nikit","first_name":"Nikit"},{"full_name":"KOUAGOU, N'Dah Jean","id":"87189","last_name":"KOUAGOU","first_name":"N'Dah Jean"},{"first_name":"Axel-Cyrille","id":"65716","full_name":"Ngonga Ngomo, Axel-Cyrille","last_name":"Ngonga Ngomo"}],"date_created":"2026-01-12T17:21:05Z","date_updated":"2026-01-12T17:25:00Z","publisher":"ACM","citation":{"chicago":"Zhang, Quannian, Michael Röder, Nikit Srivastava, N’Dah Jean KOUAGOU, and Axel-Cyrille Ngonga Ngomo. “Explainable Benchmarking through the Lense of Concept Learning.” In <i>Proceedings of the Knowledge Capture Conference 2025</i>. ACM, 2025. <a href=\"https://doi.org/10.1145/3731443.3771359\">https://doi.org/10.1145/3731443.3771359</a>.","ieee":"Q. Zhang, M. Röder, N. Srivastava, N. J. KOUAGOU, and A.-C. Ngonga Ngomo, “Explainable Benchmarking through the Lense of Concept Learning,” 2025, doi: <a href=\"https://doi.org/10.1145/3731443.3771359\">10.1145/3731443.3771359</a>.","ama":"Zhang Q, Röder M, Srivastava N, KOUAGOU NJ, Ngonga Ngomo A-C. Explainable Benchmarking through the Lense of Concept Learning. In: <i>Proceedings of the Knowledge Capture Conference 2025</i>. ACM; 2025. doi:<a href=\"https://doi.org/10.1145/3731443.3771359\">10.1145/3731443.3771359</a>","bibtex":"@inproceedings{Zhang_Röder_Srivastava_KOUAGOU_Ngonga Ngomo_2025, title={Explainable Benchmarking through the Lense of Concept Learning}, DOI={<a href=\"https://doi.org/10.1145/3731443.3771359\">10.1145/3731443.3771359</a>}, booktitle={Proceedings of the Knowledge Capture Conference 2025}, publisher={ACM}, author={Zhang, Quannian and Röder, Michael and Srivastava, Nikit and KOUAGOU, N’Dah Jean and Ngonga Ngomo, Axel-Cyrille}, year={2025} }","mla":"Zhang, Quannian, et al. “Explainable Benchmarking through the Lense of Concept Learning.” <i>Proceedings of the Knowledge Capture Conference 2025</i>, ACM, 2025, doi:<a href=\"https://doi.org/10.1145/3731443.3771359\">10.1145/3731443.3771359</a>.","short":"Q. Zhang, M. Röder, N. Srivastava, N.J. KOUAGOU, A.-C. Ngonga Ngomo, in: Proceedings of the Knowledge Capture Conference 2025, ACM, 2025.","apa":"Zhang, Q., Röder, M., Srivastava, N., KOUAGOU, N. J., &#38; Ngonga Ngomo, A.-C. (2025). Explainable Benchmarking through the Lense of Concept Learning. <i>Proceedings of the Knowledge Capture Conference 2025</i>. <a href=\"https://doi.org/10.1145/3731443.3771359\">https://doi.org/10.1145/3731443.3771359</a>"},"year":"2025","publication_status":"published","language":[{"iso":"eng"}],"department":[{"_id":"574"},{"_id":"923"}],"user_id":"67199","_id":"63574","status":"public","publication":"Proceedings of the Knowledge Capture Conference 2025","type":"conference"},{"status":"public","type":"conference","publication":"Companion Proceedings of the ACM on Web Conference 2024","language":[{"iso":"eng"}],"user_id":"11871","department":[{"_id":"760"},{"_id":"574"}],"_id":"54449","citation":{"ama":"KOUAGOU NJ, Demir C, Zahera HMA, et al. Universal Knowledge Graph Embeddings. In: <i>Companion Proceedings of the ACM on Web Conference 2024</i>. ACM; 2024. doi:<a href=\"https://doi.org/10.1145/3589335.3651978\">10.1145/3589335.3651978</a>","ieee":"N. J. KOUAGOU <i>et al.</i>, “Universal Knowledge Graph Embeddings,” presented at the Companion Proceedings of the ACM on Web Conference 2024, Singapore, 2024, doi: <a href=\"https://doi.org/10.1145/3589335.3651978\">10.1145/3589335.3651978</a>.","chicago":"KOUAGOU, N’Dah Jean, Caglar Demir, Hamada Mohamed Abdelsamee Zahera, Adrian Wilke, Stefan Heindorf, Jiayi Li, and Axel-Cyrille Ngonga Ngomo. “Universal Knowledge Graph Embeddings.” In <i>Companion Proceedings of the ACM on Web Conference 2024</i>. ACM, 2024. <a href=\"https://doi.org/10.1145/3589335.3651978\">https://doi.org/10.1145/3589335.3651978</a>.","short":"N.J. KOUAGOU, C. Demir, H.M.A. Zahera, A. Wilke, S. Heindorf, J. Li, A.-C. Ngonga Ngomo, in: Companion Proceedings of the ACM on Web Conference 2024, ACM, 2024.","bibtex":"@inproceedings{KOUAGOU_Demir_Zahera_Wilke_Heindorf_Li_Ngonga Ngomo_2024, title={Universal Knowledge Graph Embeddings}, DOI={<a href=\"https://doi.org/10.1145/3589335.3651978\">10.1145/3589335.3651978</a>}, booktitle={Companion Proceedings of the ACM on Web Conference 2024}, publisher={ACM}, author={KOUAGOU, N’Dah Jean and Demir, Caglar and Zahera, Hamada Mohamed Abdelsamee and Wilke, Adrian and Heindorf, Stefan and Li, Jiayi and Ngonga Ngomo, Axel-Cyrille}, year={2024} }","mla":"KOUAGOU, N’Dah Jean, et al. “Universal Knowledge Graph Embeddings.” <i>Companion Proceedings of the ACM on Web Conference 2024</i>, ACM, 2024, doi:<a href=\"https://doi.org/10.1145/3589335.3651978\">10.1145/3589335.3651978</a>.","apa":"KOUAGOU, N. J., Demir, C., Zahera, H. M. A., Wilke, A., Heindorf, S., Li, J., &#38; Ngonga Ngomo, A.-C. (2024). Universal Knowledge Graph Embeddings. <i>Companion Proceedings of the ACM on Web Conference 2024</i>. Companion Proceedings of the ACM on Web Conference 2024, Singapore. <a href=\"https://doi.org/10.1145/3589335.3651978\">https://doi.org/10.1145/3589335.3651978</a>"},"year":"2024","publication_status":"published","main_file_link":[{"url":"https://dl.acm.org/doi/abs/10.1145/3589335.3651978","open_access":"1"}],"doi":"10.1145/3589335.3651978","conference":{"end_date":"2024-05-17","location":"Singapore","name":"Companion Proceedings of the ACM on Web Conference 2024","start_date":"2024-05-13"},"title":"Universal Knowledge Graph Embeddings","author":[{"last_name":"KOUAGOU","id":"87189","full_name":"KOUAGOU, N'Dah Jean","first_name":"N'Dah Jean"},{"first_name":"Caglar","last_name":"Demir","full_name":"Demir, Caglar","id":"43817"},{"first_name":"Hamada Mohamed Abdelsamee","id":"72768","full_name":"Zahera, Hamada Mohamed Abdelsamee","orcid":"0000-0003-0215-1278","last_name":"Zahera"},{"last_name":"Wilke","orcid":"0000-0002-6575-807X","id":"9101","full_name":"Wilke, Adrian","first_name":"Adrian"},{"first_name":"Stefan","id":"11871","full_name":"Heindorf, Stefan","orcid":"0000-0002-4525-6865","last_name":"Heindorf"},{"last_name":"Li","full_name":"Li, Jiayi","first_name":"Jiayi"},{"first_name":"Axel-Cyrille","id":"65716","full_name":"Ngonga Ngomo, Axel-Cyrille","last_name":"Ngonga Ngomo"}],"date_created":"2024-05-26T18:52:47Z","date_updated":"2024-05-26T19:06:10Z","publisher":"ACM","oa":"1"},{"publication":"The Semantic Web","type":"book_chapter","status":"public","department":[{"_id":"574"},{"_id":"34"}],"user_id":"76787","_id":"54412","language":[{"iso":"eng"}],"publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783031606250","9783031606267"]},"publication_status":"published","citation":{"bibtex":"@inbook{Firmansyah_Moussallem_Ngonga Ngomo_2024, place={Cham}, title={ESLM: Improving Entity Summarization by Leveraging Language Models}, DOI={<a href=\"https://doi.org/10.1007/978-3-031-60626-7_9\">10.1007/978-3-031-60626-7_9</a>}, booktitle={The Semantic Web}, publisher={Springer Nature Switzerland}, author={Firmansyah, Asep Fajar and Moussallem, Diego and Ngonga Ngomo, Axel-Cyrille}, year={2024} }","mla":"Firmansyah, Asep Fajar, et al. “ESLM: Improving Entity Summarization by Leveraging Language Models.” <i>The Semantic Web</i>, Springer Nature Switzerland, 2024, doi:<a href=\"https://doi.org/10.1007/978-3-031-60626-7_9\">10.1007/978-3-031-60626-7_9</a>.","short":"A.F. Firmansyah, D. Moussallem, A.-C. Ngonga Ngomo, in: The Semantic Web, Springer Nature Switzerland, Cham, 2024.","apa":"Firmansyah, A. F., Moussallem, D., &#38; Ngonga Ngomo, A.-C. (2024). ESLM: Improving Entity Summarization by Leveraging Language Models. In <i>The Semantic Web</i>. Springer Nature Switzerland. <a href=\"https://doi.org/10.1007/978-3-031-60626-7_9\">https://doi.org/10.1007/978-3-031-60626-7_9</a>","ama":"Firmansyah AF, Moussallem D, Ngonga Ngomo A-C. ESLM: Improving Entity Summarization by Leveraging Language Models. In: <i>The Semantic Web</i>. Springer Nature Switzerland; 2024. doi:<a href=\"https://doi.org/10.1007/978-3-031-60626-7_9\">10.1007/978-3-031-60626-7_9</a>","ieee":"A. F. Firmansyah, D. Moussallem, and A.-C. Ngonga Ngomo, “ESLM: Improving Entity Summarization by Leveraging Language Models,” in <i>The Semantic Web</i>, Cham: Springer Nature Switzerland, 2024.","chicago":"Firmansyah, Asep Fajar, Diego Moussallem, and Axel-Cyrille Ngonga Ngomo. “ESLM: Improving Entity Summarization by Leveraging Language Models.” In <i>The Semantic Web</i>. Cham: Springer Nature Switzerland, 2024. <a href=\"https://doi.org/10.1007/978-3-031-60626-7_9\">https://doi.org/10.1007/978-3-031-60626-7_9</a>."},"year":"2024","place":"Cham","date_created":"2024-05-22T09:00:03Z","author":[{"id":"76787","full_name":"Firmansyah, Asep Fajar","last_name":"Firmansyah","first_name":"Asep Fajar"},{"last_name":"Moussallem","full_name":"Moussallem, Diego","id":"71635","first_name":"Diego"},{"full_name":"Ngonga Ngomo, Axel-Cyrille","id":"65716","last_name":"Ngonga Ngomo","first_name":"Axel-Cyrille"}],"date_updated":"2024-06-04T11:09:23Z","publisher":"Springer Nature Switzerland","doi":"10.1007/978-3-031-60626-7_9","title":"ESLM: Improving Entity Summarization by Leveraging Language Models"},{"title":"Computing Repairs Under Functional and Inclusion Dependencies via Argumentation","doi":"10.1007/978-3-031-56940-1_2","date_updated":"2024-06-04T15:53:59Z","publisher":"Springer Nature Switzerland","author":[{"last_name":"Mahmood","id":"99353","full_name":"Mahmood, Yasir","first_name":"Yasir"},{"first_name":"Jonni","last_name":"Virtema","full_name":"Virtema, Jonni"},{"first_name":"Timon","full_name":"Barlag, Timon","last_name":"Barlag"},{"id":"65716","full_name":"Ngonga Ngomo, Axel-Cyrille","last_name":"Ngonga Ngomo","first_name":"Axel-Cyrille"}],"date_created":"2024-06-04T10:01:16Z","place":"Cham","year":"2024","citation":{"chicago":"Mahmood, Yasir, Jonni Virtema, Timon Barlag, and Axel-Cyrille Ngonga Ngomo. “Computing Repairs Under Functional and Inclusion Dependencies via Argumentation.” In <i>Lecture Notes in Computer Science</i>. Cham: Springer Nature Switzerland, 2024. <a href=\"https://doi.org/10.1007/978-3-031-56940-1_2\">https://doi.org/10.1007/978-3-031-56940-1_2</a>.","ieee":"Y. Mahmood, J. Virtema, T. Barlag, and A.-C. Ngonga Ngomo, “Computing Repairs Under Functional and Inclusion Dependencies via Argumentation,” in <i>Lecture Notes in Computer Science</i>, Cham: Springer Nature Switzerland, 2024.","ama":"Mahmood Y, Virtema J, Barlag T, Ngonga Ngomo A-C. Computing Repairs Under Functional and Inclusion Dependencies via Argumentation. In: <i>Lecture Notes in Computer Science</i>. Springer Nature Switzerland; 2024. doi:<a href=\"https://doi.org/10.1007/978-3-031-56940-1_2\">10.1007/978-3-031-56940-1_2</a>","apa":"Mahmood, Y., Virtema, J., Barlag, T., &#38; Ngonga Ngomo, A.-C. (2024). Computing Repairs Under Functional and Inclusion Dependencies via Argumentation. In <i>Lecture Notes in Computer Science</i>. Springer Nature Switzerland. <a href=\"https://doi.org/10.1007/978-3-031-56940-1_2\">https://doi.org/10.1007/978-3-031-56940-1_2</a>","bibtex":"@inbook{Mahmood_Virtema_Barlag_Ngonga Ngomo_2024, place={Cham}, title={Computing Repairs Under Functional and Inclusion Dependencies via Argumentation}, DOI={<a href=\"https://doi.org/10.1007/978-3-031-56940-1_2\">10.1007/978-3-031-56940-1_2</a>}, booktitle={Lecture Notes in Computer Science}, publisher={Springer Nature Switzerland}, author={Mahmood, Yasir and Virtema, Jonni and Barlag, Timon and Ngonga Ngomo, Axel-Cyrille}, year={2024} }","short":"Y. Mahmood, J. Virtema, T. Barlag, A.-C. Ngonga Ngomo, in: Lecture Notes in Computer Science, Springer Nature Switzerland, Cham, 2024.","mla":"Mahmood, Yasir, et al. “Computing Repairs Under Functional and Inclusion Dependencies via Argumentation.” <i>Lecture Notes in Computer Science</i>, Springer Nature Switzerland, 2024, doi:<a href=\"https://doi.org/10.1007/978-3-031-56940-1_2\">10.1007/978-3-031-56940-1_2</a>."},"publication_status":"published","publication_identifier":{"isbn":["9783031569395","9783031569401"],"issn":["0302-9743","1611-3349"]},"language":[{"iso":"eng"}],"_id":"54580","user_id":"99353","department":[{"_id":"574"}],"status":"public","type":"book_chapter","publication":"Lecture Notes in Computer Science"},{"status":"public","type":"journal_article","publication":"Mathematical Structures in Computer Science","language":[{"iso":"eng"}],"keyword":["dice mahmood"],"user_id":"99353","department":[{"_id":"574"}],"_id":"54092","citation":{"ama":"Kontinen J, Mahmood Y, Meier A, Vollmer H. Parameterized Complexity of Weighted Team Definability. <i>Mathematical Structures in Computer Science</i>. Published online 2024:1-15. doi:<a href=\"https://doi.org/10.1017/S0960129524000033\">10.1017/S0960129524000033</a>","chicago":"Kontinen, Juha, Yasir Mahmood, Arne Meier, and Heribert Vollmer. “Parameterized Complexity of Weighted Team Definability.” <i>Mathematical Structures in Computer Science</i>, 2024, 1–15. <a href=\"https://doi.org/10.1017/S0960129524000033\">https://doi.org/10.1017/S0960129524000033</a>.","ieee":"J. Kontinen, Y. Mahmood, A. Meier, and H. Vollmer, “Parameterized Complexity of Weighted Team Definability,” <i>Mathematical Structures in Computer Science</i>, pp. 1–15, 2024, doi: <a href=\"https://doi.org/10.1017/S0960129524000033\">10.1017/S0960129524000033</a>.","short":"J. Kontinen, Y. Mahmood, A. Meier, H. Vollmer, Mathematical Structures in Computer Science (2024) 1–15.","mla":"Kontinen, Juha, et al. “Parameterized Complexity of Weighted Team Definability.” <i>Mathematical Structures in Computer Science</i>, Cambridge University Press, 2024, pp. 1–15, doi:<a href=\"https://doi.org/10.1017/S0960129524000033\">10.1017/S0960129524000033</a>.","bibtex":"@article{Kontinen_Mahmood_Meier_Vollmer_2024, title={Parameterized Complexity of Weighted Team Definability}, DOI={<a href=\"https://doi.org/10.1017/S0960129524000033\">10.1017/S0960129524000033</a>}, journal={Mathematical Structures in Computer Science}, publisher={Cambridge University Press}, author={Kontinen, Juha and Mahmood, Yasir and Meier, Arne and Vollmer, Heribert}, year={2024}, pages={1–15} }","apa":"Kontinen, J., Mahmood, Y., Meier, A., &#38; Vollmer, H. (2024). Parameterized Complexity of Weighted Team Definability. <i>Mathematical Structures in Computer Science</i>, 1–15. <a href=\"https://doi.org/10.1017/S0960129524000033\">https://doi.org/10.1017/S0960129524000033</a>"},"page":"1-15","year":"2024","doi":"10.1017/S0960129524000033","title":"Parameterized Complexity of Weighted Team Definability","date_created":"2024-05-08T13:24:17Z","author":[{"last_name":"Kontinen","full_name":"Kontinen, Juha","first_name":"Juha"},{"last_name":"Mahmood","full_name":"Mahmood, Yasir","id":"99353","first_name":"Yasir"},{"full_name":"Meier, Arne","last_name":"Meier","first_name":"Arne"},{"first_name":"Heribert","last_name":"Vollmer","full_name":"Vollmer, Heribert"}],"publisher":"Cambridge University Press","date_updated":"2024-09-17T15:25:54Z"},{"publication":"Proceedings of the 33rd ACM International Conference on Information and Knowledge Management (CIKM ’24),","type":"conference","status":"public","department":[{"_id":"760"},{"_id":"574"}],"user_id":"11871","_id":"56213","project":[{"grant_number":"NW21-059D","name":"SAIL: SAIL - Nachhaltiger Lebenszyklus von intelligenten soziotechnischen Systemen","_id":"285"}],"language":[{"iso":"eng"}],"citation":{"mla":"Sapkota, Rupesh, et al. “EDGE: Evaluation Framework for Logical vs. Subgraph Explanations for Node Classifiers on Knowledge Graphs.” <i>Proceedings of the 33rd ACM International Conference on Information and Knowledge Management (CIKM ’24),</i> ACM, 2024, doi:<a href=\"https://doi.org/10.1145/3627673.3679904\">10.1145/3627673.3679904</a>.","bibtex":"@inproceedings{Sapkota_Köhler_Heindorf_2024, place={Boise, Idaho, USA}, title={EDGE: Evaluation Framework for Logical vs. Subgraph Explanations for Node Classifiers on Knowledge Graphs}, DOI={<a href=\"https://doi.org/10.1145/3627673.3679904\">10.1145/3627673.3679904</a>}, booktitle={Proceedings of the 33rd ACM International Conference on Information and Knowledge Management (CIKM ’24),}, publisher={ACM}, author={Sapkota, Rupesh and Köhler, Dominik and Heindorf, Stefan}, year={2024} }","short":"R. Sapkota, D. Köhler, S. Heindorf, in: Proceedings of the 33rd ACM International Conference on Information and Knowledge Management (CIKM ’24), ACM, Boise, Idaho, USA, 2024.","apa":"Sapkota, R., Köhler, D., &#38; Heindorf, S. (2024). EDGE: Evaluation Framework for Logical vs. Subgraph Explanations for Node Classifiers on Knowledge Graphs. <i>Proceedings of the 33rd ACM International Conference on Information and Knowledge Management (CIKM ’24),</i>. 33rd ACM International Conference on Information and Knowledge Management, Boise, Idaho, USA. <a href=\"https://doi.org/10.1145/3627673.3679904\">https://doi.org/10.1145/3627673.3679904</a>","ama":"Sapkota R, Köhler D, Heindorf S. EDGE: Evaluation Framework for Logical vs. Subgraph Explanations for Node Classifiers on Knowledge Graphs. In: <i>Proceedings of the 33rd ACM International Conference on Information and Knowledge Management (CIKM ’24),</i>. ACM; 2024. doi:<a href=\"https://doi.org/10.1145/3627673.3679904\">10.1145/3627673.3679904</a>","chicago":"Sapkota, Rupesh, Dominik Köhler, and Stefan Heindorf. “EDGE: Evaluation Framework for Logical vs. Subgraph Explanations for Node Classifiers on Knowledge Graphs.” In <i>Proceedings of the 33rd ACM International Conference on Information and Knowledge Management (CIKM ’24),</i>. Boise, Idaho, USA: ACM, 2024. <a href=\"https://doi.org/10.1145/3627673.3679904\">https://doi.org/10.1145/3627673.3679904</a>.","ieee":"R. Sapkota, D. Köhler, and S. Heindorf, “EDGE: Evaluation Framework for Logical vs. Subgraph Explanations for Node Classifiers on Knowledge Graphs,” presented at the 33rd ACM International Conference on Information and Knowledge Management, Boise, Idaho, USA, 2024, doi: <a href=\"https://doi.org/10.1145/3627673.3679904\">10.1145/3627673.3679904</a>."},"place":"Boise, Idaho, USA","year":"2024","author":[{"id":"89326","full_name":"Sapkota, Rupesh","last_name":"Sapkota","first_name":"Rupesh"},{"last_name":"Köhler","full_name":"Köhler, Dominik","first_name":"Dominik"},{"full_name":"Heindorf, Stefan","id":"11871","last_name":"Heindorf","orcid":"0000-0002-4525-6865","first_name":"Stefan"}],"date_created":"2024-09-23T12:30:10Z","oa":"1","date_updated":"2024-09-23T12:30:25Z","publisher":"ACM","conference":{"location":"Boise, Idaho, USA","end_date":"2024-10-25","start_date":"2024-10-21","name":"33rd ACM International Conference on Information and Knowledge Management"},"doi":"10.1145/3627673.3679904","main_file_link":[{"url":"https://papers.dice-research.org/2024/CIKM_EDGE/public.pdf","open_access":"1"}],"title":"EDGE: Evaluation Framework for Logical vs. Subgraph Explanations for Node Classifiers on Knowledge Graphs"},{"date_created":"2024-09-23T12:31:23Z","author":[{"first_name":"Jiayi","last_name":"Li","full_name":"Li, Jiayi"},{"first_name":"Sheetal","full_name":"Satheesh, Sheetal","last_name":"Satheesh"},{"id":"11871","full_name":"Heindorf, Stefan","orcid":"0000-0002-4525-6865","last_name":"Heindorf","first_name":"Stefan"},{"last_name":"Moussallem","id":"71635","full_name":"Moussallem, Diego","first_name":"Diego"},{"last_name":"Speck","id":"70843","full_name":"Speck, René","first_name":"René"},{"full_name":"Ngonga Ngomo, Axel-Cyrille","id":"65716","last_name":"Ngonga Ngomo","first_name":"Axel-Cyrille"}],"date_updated":"2024-09-23T12:36:17Z","publisher":"Springer Nature Switzerland","conference":{"name":"The 2nd World Conference on eXplainable Artificial Intelligence","start_date":"2024-07-17","end_date":"2024-07-19","location":"Malta, Valletta"},"doi":"10.1007/978-3-031-63787-2_7","title":"AutoCL: AutoML for Concept Learning","publication_status":"published","publication_identifier":{"isbn":["9783031637865","9783031637872"],"issn":["1865-0929","1865-0937"]},"citation":{"bibtex":"@inbook{Li_Satheesh_Heindorf_Moussallem_Speck_Ngonga Ngomo_2024, place={Cham}, title={AutoCL: AutoML for Concept Learning}, DOI={<a href=\"https://doi.org/10.1007/978-3-031-63787-2_7\">10.1007/978-3-031-63787-2_7</a>}, booktitle={Communications in Computer and Information Science}, publisher={Springer Nature Switzerland}, author={Li, Jiayi and Satheesh, Sheetal and Heindorf, Stefan and Moussallem, Diego and Speck, René and Ngonga Ngomo, Axel-Cyrille}, year={2024} }","mla":"Li, Jiayi, et al. “AutoCL: AutoML for Concept Learning.” <i>Communications in Computer and Information Science</i>, Springer Nature Switzerland, 2024, doi:<a href=\"https://doi.org/10.1007/978-3-031-63787-2_7\">10.1007/978-3-031-63787-2_7</a>.","short":"J. Li, S. Satheesh, S. Heindorf, D. Moussallem, R. Speck, A.-C. Ngonga Ngomo, in: Communications in Computer and Information Science, Springer Nature Switzerland, Cham, 2024.","apa":"Li, J., Satheesh, S., Heindorf, S., Moussallem, D., Speck, R., &#38; Ngonga Ngomo, A.-C. (2024). AutoCL: AutoML for Concept Learning. In <i>Communications in Computer and Information Science</i>. The 2nd World Conference on eXplainable Artificial Intelligence, Malta, Valletta. Springer Nature Switzerland. <a href=\"https://doi.org/10.1007/978-3-031-63787-2_7\">https://doi.org/10.1007/978-3-031-63787-2_7</a>","ieee":"J. Li, S. Satheesh, S. Heindorf, D. Moussallem, R. Speck, and A.-C. Ngonga Ngomo, “AutoCL: AutoML for Concept Learning,” in <i>Communications in Computer and Information Science</i>, Cham: Springer Nature Switzerland, 2024.","chicago":"Li, Jiayi, Sheetal Satheesh, Stefan Heindorf, Diego Moussallem, René Speck, and Axel-Cyrille Ngonga Ngomo. “AutoCL: AutoML for Concept Learning.” In <i>Communications in Computer and Information Science</i>. Cham: Springer Nature Switzerland, 2024. <a href=\"https://doi.org/10.1007/978-3-031-63787-2_7\">https://doi.org/10.1007/978-3-031-63787-2_7</a>.","ama":"Li J, Satheesh S, Heindorf S, Moussallem D, Speck R, Ngonga Ngomo A-C. AutoCL: AutoML for Concept Learning. In: <i>Communications in Computer and Information Science</i>. Springer Nature Switzerland; 2024. doi:<a href=\"https://doi.org/10.1007/978-3-031-63787-2_7\">10.1007/978-3-031-63787-2_7</a>"},"year":"2024","place":"Cham","user_id":"11871","department":[{"_id":"760"},{"_id":"574"}],"_id":"56214","language":[{"iso":"eng"}],"type":"book_chapter","publication":"Communications in Computer and Information Science","status":"public"},{"publication_identifier":{"issn":["0960-1295","1469-8072"]},"publication_status":"published","page":"375-389","intvolume":"        34","citation":{"ama":"Kontinen J, Mahmood Y, Meier A, Vollmer H. Parameterized complexity of weighted team definability. <i>Mathematical Structures in Computer Science</i>. 2024;34(5):375-389. doi:<a href=\"https://doi.org/10.1017/s0960129524000033\">10.1017/s0960129524000033</a>","chicago":"Kontinen, Juha, Yasir Mahmood, Arne Meier, and Heribert Vollmer. “Parameterized Complexity of Weighted Team Definability.” <i>Mathematical Structures in Computer Science</i> 34, no. 5 (2024): 375–89. <a href=\"https://doi.org/10.1017/s0960129524000033\">https://doi.org/10.1017/s0960129524000033</a>.","ieee":"J. Kontinen, Y. Mahmood, A. Meier, and H. Vollmer, “Parameterized complexity of weighted team definability,” <i>Mathematical Structures in Computer Science</i>, vol. 34, no. 5, pp. 375–389, 2024, doi: <a href=\"https://doi.org/10.1017/s0960129524000033\">10.1017/s0960129524000033</a>.","apa":"Kontinen, J., Mahmood, Y., Meier, A., &#38; Vollmer, H. (2024). Parameterized complexity of weighted team definability. <i>Mathematical Structures in Computer Science</i>, <i>34</i>(5), 375–389. <a href=\"https://doi.org/10.1017/s0960129524000033\">https://doi.org/10.1017/s0960129524000033</a>","short":"J. Kontinen, Y. Mahmood, A. Meier, H. Vollmer, Mathematical Structures in Computer Science 34 (2024) 375–389.","bibtex":"@article{Kontinen_Mahmood_Meier_Vollmer_2024, title={Parameterized complexity of weighted team definability}, volume={34}, DOI={<a href=\"https://doi.org/10.1017/s0960129524000033\">10.1017/s0960129524000033</a>}, number={5}, journal={Mathematical Structures in Computer Science}, publisher={Cambridge University Press (CUP)}, author={Kontinen, Juha and Mahmood, Yasir and Meier, Arne and Vollmer, Heribert}, year={2024}, pages={375–389} }","mla":"Kontinen, Juha, et al. “Parameterized Complexity of Weighted Team Definability.” <i>Mathematical Structures in Computer Science</i>, vol. 34, no. 5, Cambridge University Press (CUP), 2024, pp. 375–89, doi:<a href=\"https://doi.org/10.1017/s0960129524000033\">10.1017/s0960129524000033</a>."},"volume":34,"author":[{"first_name":"Juha","full_name":"Kontinen, Juha","last_name":"Kontinen"},{"id":"99353","full_name":"Mahmood, Yasir","last_name":"Mahmood","first_name":"Yasir"},{"first_name":"Arne","last_name":"Meier","full_name":"Meier, Arne"},{"last_name":"Vollmer","full_name":"Vollmer, Heribert","first_name":"Heribert"}],"date_updated":"2025-05-15T11:07:08Z","doi":"10.1017/s0960129524000033","type":"journal_article","status":"public","department":[{"_id":"574"}],"user_id":"99353","_id":"59911","issue":"5","year":"2024","date_created":"2025-05-15T11:06:56Z","publisher":"Cambridge University Press (CUP)","title":"Parameterized complexity of weighted team definability","publication":"Mathematical Structures in Computer Science","abstract":[{"lang":"eng","text":"<jats:title>Abstract</jats:title><jats:p>In this article, we study the complexity of weighted team definability for logics with team semantics. This problem is a natural analog of one of the most studied problems in parameterized complexity, the notion of weighted Fagin-definability, which is formulated in terms of satisfaction of first-order formulas with free relation variables. We focus on the parameterized complexity of weighted team definability for a fixed formula <jats:inline-formula><jats:alternatives><jats:inline-graphic xmlns:xlink=\"http://www.w3.org/1999/xlink\" mime-subtype=\"png\" xlink:href=\"S0960129524000033_inline1.png\"/><jats:tex-math>\r\n$\\varphi$\r\n</jats:tex-math></jats:alternatives></jats:inline-formula> of central team-based logics. Given a first-order structure <jats:inline-formula><jats:alternatives><jats:inline-graphic xmlns:xlink=\"http://www.w3.org/1999/xlink\" mime-subtype=\"png\" xlink:href=\"S0960129524000033_inline2.png\"/><jats:tex-math>\r\n$\\mathcal{A}$\r\n</jats:tex-math></jats:alternatives></jats:inline-formula> and the parameter value <jats:inline-formula><jats:alternatives><jats:inline-graphic xmlns:xlink=\"http://www.w3.org/1999/xlink\" mime-subtype=\"png\" xlink:href=\"S0960129524000033_inline3.png\"/><jats:tex-math>\r\n$k\\in \\mathbb N$\r\n</jats:tex-math></jats:alternatives></jats:inline-formula> as input, the question is to determine whether <jats:inline-formula><jats:alternatives><jats:inline-graphic xmlns:xlink=\"http://www.w3.org/1999/xlink\" mime-subtype=\"png\" xlink:href=\"S0960129524000033_inline4.png\"/><jats:tex-math>\r\n$\\mathcal{A},T\\models \\varphi$\r\n</jats:tex-math></jats:alternatives></jats:inline-formula> for some team <jats:italic>T</jats:italic> of size <jats:italic>k</jats:italic>. We show several results on the complexity of this problem for dependence, independence, and inclusion logic formulas. Moreover, we also relate the complexity of weighted team definability to the complexity classes in the well-known W-hierarchy as well as paraNP.</jats:p>"}],"language":[{"iso":"eng"}]},{"language":[{"iso":"eng"}],"_id":"57323","department":[{"_id":"574"}],"user_id":"84532","status":"public","publication":"Lecture Notes in Computer Science","type":"book_chapter","title":"Evaluating Negation with Multi-way Joins Accelerates Class Expression Learning","doi":"10.1007/978-3-031-70365-2_12","publisher":"Springer Nature Switzerland","date_updated":"2024-11-22T10:31:34Z","author":[{"first_name":"Nikolaos","last_name":"Karalis","full_name":"Karalis, Nikolaos"},{"first_name":"Alexander","last_name":"Bigerl","full_name":"Bigerl, Alexander"},{"last_name":"Demir","full_name":"Demir, Caglar","first_name":"Caglar"},{"full_name":"Heidrich, Liss","last_name":"Heidrich","first_name":"Liss"},{"full_name":"Ngonga Ngomo, Axel-Cyrille","last_name":"Ngonga Ngomo","first_name":"Axel-Cyrille"}],"date_created":"2024-11-22T09:45:01Z","year":"2024","place":"Cham","citation":{"ama":"Karalis N, Bigerl A, Demir C, Heidrich L, Ngonga Ngomo A-C. Evaluating Negation with Multi-way Joins Accelerates Class Expression Learning. In: <i>Lecture Notes in Computer Science</i>. Springer Nature Switzerland; 2024. doi:<a href=\"https://doi.org/10.1007/978-3-031-70365-2_12\">10.1007/978-3-031-70365-2_12</a>","chicago":"Karalis, Nikolaos, Alexander Bigerl, Caglar Demir, Liss Heidrich, and Axel-Cyrille Ngonga Ngomo. “Evaluating Negation with Multi-Way Joins Accelerates Class Expression Learning.” In <i>Lecture Notes in Computer Science</i>. Cham: Springer Nature Switzerland, 2024. <a href=\"https://doi.org/10.1007/978-3-031-70365-2_12\">https://doi.org/10.1007/978-3-031-70365-2_12</a>.","ieee":"N. Karalis, A. Bigerl, C. Demir, L. Heidrich, and A.-C. Ngonga Ngomo, “Evaluating Negation with Multi-way Joins Accelerates Class Expression Learning,” in <i>Lecture Notes in Computer Science</i>, Cham: Springer Nature Switzerland, 2024.","mla":"Karalis, Nikolaos, et al. “Evaluating Negation with Multi-Way Joins Accelerates Class Expression Learning.” <i>Lecture Notes in Computer Science</i>, Springer Nature Switzerland, 2024, doi:<a href=\"https://doi.org/10.1007/978-3-031-70365-2_12\">10.1007/978-3-031-70365-2_12</a>.","short":"N. Karalis, A. Bigerl, C. Demir, L. Heidrich, A.-C. Ngonga Ngomo, in: Lecture Notes in Computer Science, Springer Nature Switzerland, Cham, 2024.","bibtex":"@inbook{Karalis_Bigerl_Demir_Heidrich_Ngonga Ngomo_2024, place={Cham}, title={Evaluating Negation with Multi-way Joins Accelerates Class Expression Learning}, DOI={<a href=\"https://doi.org/10.1007/978-3-031-70365-2_12\">10.1007/978-3-031-70365-2_12</a>}, booktitle={Lecture Notes in Computer Science}, publisher={Springer Nature Switzerland}, author={Karalis, Nikolaos and Bigerl, Alexander and Demir, Caglar and Heidrich, Liss and Ngonga Ngomo, Axel-Cyrille}, year={2024} }","apa":"Karalis, N., Bigerl, A., Demir, C., Heidrich, L., &#38; Ngonga Ngomo, A.-C. (2024). Evaluating Negation with Multi-way Joins Accelerates Class Expression Learning. In <i>Lecture Notes in Computer Science</i>. Springer Nature Switzerland. <a href=\"https://doi.org/10.1007/978-3-031-70365-2_12\">https://doi.org/10.1007/978-3-031-70365-2_12</a>"},"publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783031703645","9783031703652"]},"publication_status":"published"},{"abstract":[{"lang":"eng","text":"The connection between inconsistent databases and Dung's abstract\r\nargumentation framework has recently drawn growing interest. Specifically, an\r\ninconsistent database, involving certain types of integrity constraints such as\r\nfunctional and inclusion dependencies, can be viewed as an argumentation\r\nframework in Dung's setting. Nevertheless, no prior work has explored the exact\r\nexpressive power of Dung's theory of argumentation when compared to\r\ninconsistent databases and integrity constraints. In this paper, we close this\r\ngap by arguing that an argumentation framework can also be viewed as an\r\ninconsistent database. We first establish a connection between subset-repairs\r\nfor databases and extensions for AFs, considering conflict-free, naive,\r\nadmissible, and preferred semantics. Further, we define a new family of\r\nattribute-based repairs based on the principle of maximal content preservation.\r\nThe effectiveness of these repairs is then highlighted by connecting them to\r\nstable, semi-stable, and stage semantics. Our main contributions include\r\ntranslating an argumentation framework into a database together with integrity\r\nconstraints. Moreover, this translation can be achieved in polynomial time,\r\nwhich is essential in transferring complexity results between the two\r\nformalisms."}],"status":"public","type":"conference","language":[{"iso":"eng"}],"_id":"58377","external_id":{"arxiv":["2412.11617"]},"project":[{"_id":"121","name":"TRR 318; TP B01: Ein dialogbasierter Ansatz zur Erklärung von Modellen des maschinellen Lernens"}],"department":[{"_id":"574"}],"user_id":"99353","year":"2024","citation":{"ama":"Mahmood Y, Hecher M, Ngonga Ngomo A-C. Dung’s Argumentation Framework: Unveiling the Expressive Power with  Inconsistent Databases. In: ; 2024. doi:<a href=\"https://doi.org/10.1609/AAAI.V39I14.33651\">10.1609/AAAI.V39I14.33651</a>","ieee":"Y. Mahmood, M. Hecher, and A.-C. Ngonga Ngomo, “Dung’s Argumentation Framework: Unveiling the Expressive Power with  Inconsistent Databases,” 2024, doi: <a href=\"https://doi.org/10.1609/AAAI.V39I14.33651\">10.1609/AAAI.V39I14.33651</a>.","chicago":"Mahmood, Yasir, Markus Hecher, and Axel-Cyrille Ngonga Ngomo. “Dung’s Argumentation Framework: Unveiling the Expressive Power with  Inconsistent Databases,” 2024. <a href=\"https://doi.org/10.1609/AAAI.V39I14.33651\">https://doi.org/10.1609/AAAI.V39I14.33651</a>.","mla":"Mahmood, Yasir, et al. <i>Dung’s Argumentation Framework: Unveiling the Expressive Power with  Inconsistent Databases</i>. 2024, doi:<a href=\"https://doi.org/10.1609/AAAI.V39I14.33651\">10.1609/AAAI.V39I14.33651</a>.","bibtex":"@inproceedings{Mahmood_Hecher_Ngonga Ngomo_2024, title={Dung’s Argumentation Framework: Unveiling the Expressive Power with  Inconsistent Databases}, DOI={<a href=\"https://doi.org/10.1609/AAAI.V39I14.33651\">10.1609/AAAI.V39I14.33651</a>}, author={Mahmood, Yasir and Hecher, Markus and Ngonga Ngomo, Axel-Cyrille}, year={2024} }","short":"Y. Mahmood, M. Hecher, A.-C. Ngonga Ngomo, in: 2024.","apa":"Mahmood, Y., Hecher, M., &#38; Ngonga Ngomo, A.-C. (2024). <i>Dung’s Argumentation Framework: Unveiling the Expressive Power with  Inconsistent Databases</i>. <a href=\"https://doi.org/10.1609/AAAI.V39I14.33651\">https://doi.org/10.1609/AAAI.V39I14.33651</a>"},"title":"Dung's Argumentation Framework: Unveiling the Expressive Power with  Inconsistent Databases","doi":"10.1609/AAAI.V39I14.33651","date_updated":"2025-09-11T10:01:11Z","date_created":"2025-01-27T15:30:41Z","author":[{"id":"99353","full_name":"Mahmood, Yasir","last_name":"Mahmood","first_name":"Yasir"},{"full_name":"Hecher, Markus","last_name":"Hecher","first_name":"Markus"},{"id":"65716","full_name":"Ngonga Ngomo, Axel-Cyrille","last_name":"Ngonga Ngomo","first_name":"Axel-Cyrille"}]},{"year":"2024","citation":{"bibtex":"@inbook{Fichte_Hecher_Mahmood_Meier_2024, title={Rejection in Abstract Argumentation: Harder Than Acceptance?}, DOI={<a href=\"https://doi.org/10.3233/faia240867\">10.3233/faia240867</a>}, booktitle={Frontiers in Artificial Intelligence and Applications}, publisher={IOS Press}, author={Fichte, Johannes K. and Hecher, Markus and Mahmood, Yasir and Meier, Arne}, year={2024} }","short":"J.K. Fichte, M. Hecher, Y. Mahmood, A. Meier, in: Frontiers in Artificial Intelligence and Applications, IOS Press, 2024.","mla":"Fichte, Johannes K., et al. “Rejection in Abstract Argumentation: Harder Than Acceptance?” <i>Frontiers in Artificial Intelligence and Applications</i>, IOS Press, 2024, doi:<a href=\"https://doi.org/10.3233/faia240867\">10.3233/faia240867</a>.","apa":"Fichte, J. K., Hecher, M., Mahmood, Y., &#38; Meier, A. (2024). Rejection in Abstract Argumentation: Harder Than Acceptance? In <i>Frontiers in Artificial Intelligence and Applications</i>. ECAI} 2024 - 27th European Conference on Artificial Intelligence, Santiago de Compostela, Spain. IOS Press. <a href=\"https://doi.org/10.3233/faia240867\">https://doi.org/10.3233/faia240867</a>","ieee":"J. K. Fichte, M. Hecher, Y. Mahmood, and A. Meier, “Rejection in Abstract Argumentation: Harder Than Acceptance?,” in <i>Frontiers in Artificial Intelligence and Applications</i>, IOS Press, 2024.","chicago":"Fichte, Johannes K., Markus Hecher, Yasir Mahmood, and Arne Meier. “Rejection in Abstract Argumentation: Harder Than Acceptance?” In <i>Frontiers in Artificial Intelligence and Applications</i>. IOS Press, 2024. <a href=\"https://doi.org/10.3233/faia240867\">https://doi.org/10.3233/faia240867</a>.","ama":"Fichte JK, Hecher M, Mahmood Y, Meier A. Rejection in Abstract Argumentation: Harder Than Acceptance? In: <i>Frontiers in Artificial Intelligence and Applications</i>. IOS Press; 2024. doi:<a href=\"https://doi.org/10.3233/faia240867\">10.3233/faia240867</a>"},"publication_status":"published","publication_identifier":{"issn":["0922-6389","1879-8314"],"isbn":["9781643685489"]},"title":"Rejection in Abstract Argumentation: Harder Than Acceptance?","doi":"10.3233/faia240867","conference":{"name":"ECAI} 2024 - 27th European Conference on Artificial Intelligence","location":"Santiago de Compostela, Spain"},"publisher":"IOS Press","date_updated":"2025-09-11T10:01:52Z","author":[{"full_name":"Fichte, Johannes K.","last_name":"Fichte","first_name":"Johannes K."},{"full_name":"Hecher, Markus","last_name":"Hecher","first_name":"Markus"},{"last_name":"Mahmood","id":"99353","full_name":"Mahmood, Yasir","first_name":"Yasir"},{"first_name":"Arne","last_name":"Meier","full_name":"Meier, Arne"}],"date_created":"2024-11-19T11:46:55Z","abstract":[{"lang":"eng","text":"<jats:p>Abstract argumentation is a popular toolkit for modeling, evaluating, and comparing arguments. Relationships between arguments are specified in argumentation frameworks (AFs), and conditions are placed on sets (extensions) of arguments that allow AFs to be evaluated. For more expressiveness, AFs are augmented with acceptance conditions on directly interacting arguments or a constraint on the admissible sets of arguments, resulting in dialectic frameworks or constrained argumentation frameworks. In this paper, we consider flexible conditions for rejecting an argument from an extension, which we call rejection conditions (RCs). On the technical level, we associate each argument with a specific logic program. We analyze the resulting complexity, including the structural parameter treewidth. Rejection AFs are highly expressive, giving rise to natural problems on higher levels of the polynomial hierarchy.</jats:p>"}],"status":"public","type":"book_chapter","publication":"Frontiers in Artificial Intelligence and Applications","language":[{"iso":"eng"}],"project":[{"name":"TRR 318; TP B01: Ein dialogbasierter Ansatz zur Erklärung von Modellen des maschinellen Lernens","_id":"121"}],"_id":"57238","user_id":"99353","department":[{"_id":"574"}]},{"publication_status":"published","year":"2024","citation":{"mla":"Hecher, Markus, et al. “Quantitative Claim-Centric Reasoning in Logic-Based Argumentation.” <i>Proceedings of the Thirty-ThirdInternational Joint Conference on Artificial Intelligence</i>, International Joint Conferences on Artificial Intelligence Organization, 2024, doi:<a href=\"https://doi.org/10.24963/ijcai.2024/377\">10.24963/ijcai.2024/377</a>.","bibtex":"@inproceedings{Hecher_Mahmood_Meier_Schmidt_2024, title={Quantitative Claim-Centric Reasoning in Logic-Based Argumentation}, DOI={<a href=\"https://doi.org/10.24963/ijcai.2024/377\">10.24963/ijcai.2024/377</a>}, booktitle={Proceedings of the Thirty-ThirdInternational Joint Conference on Artificial Intelligence}, publisher={International Joint Conferences on Artificial Intelligence Organization}, author={Hecher, Markus and Mahmood, Yasir and Meier, Arne and Schmidt, Johannes}, year={2024} }","short":"M. Hecher, Y. Mahmood, A. Meier, J. Schmidt, in: Proceedings of the Thirty-ThirdInternational Joint Conference on Artificial Intelligence, International Joint Conferences on Artificial Intelligence Organization, 2024.","apa":"Hecher, M., Mahmood, Y., Meier, A., &#38; Schmidt, J. (2024). Quantitative Claim-Centric Reasoning in Logic-Based Argumentation. <i>Proceedings of the Thirty-ThirdInternational Joint Conference on Artificial Intelligence</i>. <a href=\"https://doi.org/10.24963/ijcai.2024/377\">https://doi.org/10.24963/ijcai.2024/377</a>","ama":"Hecher M, Mahmood Y, Meier A, Schmidt J. Quantitative Claim-Centric Reasoning in Logic-Based Argumentation. In: <i>Proceedings of the Thirty-ThirdInternational Joint Conference on Artificial Intelligence</i>. International Joint Conferences on Artificial Intelligence Organization; 2024. doi:<a href=\"https://doi.org/10.24963/ijcai.2024/377\">10.24963/ijcai.2024/377</a>","ieee":"M. Hecher, Y. Mahmood, A. Meier, and J. Schmidt, “Quantitative Claim-Centric Reasoning in Logic-Based Argumentation,” 2024, doi: <a href=\"https://doi.org/10.24963/ijcai.2024/377\">10.24963/ijcai.2024/377</a>.","chicago":"Hecher, Markus, Yasir Mahmood, Arne Meier, and Johannes Schmidt. “Quantitative Claim-Centric Reasoning in Logic-Based Argumentation.” In <i>Proceedings of the Thirty-ThirdInternational Joint Conference on Artificial Intelligence</i>. International Joint Conferences on Artificial Intelligence Organization, 2024. <a href=\"https://doi.org/10.24963/ijcai.2024/377\">https://doi.org/10.24963/ijcai.2024/377</a>."},"date_updated":"2025-09-11T10:02:03Z","publisher":"International Joint Conferences on Artificial Intelligence Organization","date_created":"2024-08-19T16:21:51Z","author":[{"first_name":"Markus","last_name":"Hecher","full_name":"Hecher, Markus"},{"first_name":"Yasir","last_name":"Mahmood","full_name":"Mahmood, Yasir","id":"99353"},{"full_name":"Meier, Arne","last_name":"Meier","first_name":"Arne"},{"first_name":"Johannes","last_name":"Schmidt","full_name":"Schmidt, Johannes"}],"title":"Quantitative Claim-Centric Reasoning in Logic-Based Argumentation","doi":"10.24963/ijcai.2024/377","publication":"Proceedings of the Thirty-ThirdInternational Joint Conference on Artificial Intelligence","type":"conference","abstract":[{"text":"<jats:p>Argumentation is a well-established formalism for nonmonotonic reasoning, with popular frameworks being Dung’s abstract argumentation (AFs) or logic-based argumentation (Besnard-Hunter’s framework). Structurally, a set of formulas forms support for a claim if it is consistent, subset-minimal, and implies the claim. Then, an argument comprises support and a claim. We observe that the computational task (ARG) of asking for support of a claim in a knowledge base is “brave”, since many claims with a single support are accepted. As a result, ARG falls short when it comes to the question of confidence in a claim, or claim strength. In this paper, we propose a concept for measuring the (acceptance) strength of claims, based on counting supports for a claim. Further, we settle classical and structural complexity of counting arguments favoring a given claim in propositional knowledge bases (KBs). We introduce quantitative reasoning to measure the strength of claims in a KB and to determine the relevance strength of a formula for a claim.</jats:p>","lang":"eng"}],"status":"public","_id":"55655","project":[{"name":"TRR 318; TP B01: Ein dialogbasierter Ansatz zur Erklärung von Modellen des maschinellen Lernens","_id":"121"}],"department":[{"_id":"574"}],"user_id":"99353","language":[{"iso":"eng"}]},{"citation":{"apa":"Hankala, T., Hannula, M., Mahmood, Y., &#38; Meier, A. (2024). Parameterised Complexity of Consistent Query Answering via Graph  Representations. In <i>arXiv:2412.08324</i>.","short":"T. Hankala, M. Hannula, Y. Mahmood, A. Meier, ArXiv:2412.08324 (2024).","mla":"Hankala, Teemu, et al. “Parameterised Complexity of Consistent Query Answering via Graph  Representations.” <i>ArXiv:2412.08324</i>, 2024.","bibtex":"@article{Hankala_Hannula_Mahmood_Meier_2024, title={Parameterised Complexity of Consistent Query Answering via Graph  Representations}, journal={arXiv:2412.08324}, author={Hankala, Teemu and Hannula, Miika and Mahmood, Yasir and Meier, Arne}, year={2024} }","chicago":"Hankala, Teemu, Miika Hannula, Yasir Mahmood, and Arne Meier. “Parameterised Complexity of Consistent Query Answering via Graph  Representations.” <i>ArXiv:2412.08324</i>, 2024.","ieee":"T. Hankala, M. Hannula, Y. Mahmood, and A. Meier, “Parameterised Complexity of Consistent Query Answering via Graph  Representations,” <i>arXiv:2412.08324</i>. 2024.","ama":"Hankala T, Hannula M, Mahmood Y, Meier A. Parameterised Complexity of Consistent Query Answering via Graph  Representations. <i>arXiv:241208324</i>. Published online 2024."},"year":"2024","date_created":"2024-12-15T20:12:56Z","author":[{"last_name":"Hankala","full_name":"Hankala, Teemu","first_name":"Teemu"},{"last_name":"Hannula","full_name":"Hannula, Miika","first_name":"Miika"},{"last_name":"Mahmood","id":"99353","full_name":"Mahmood, Yasir","first_name":"Yasir"},{"full_name":"Meier, Arne","last_name":"Meier","first_name":"Arne"}],"date_updated":"2025-09-11T10:01:35Z","title":"Parameterised Complexity of Consistent Query Answering via Graph  Representations","publication":"arXiv:2412.08324","type":"preprint","status":"public","abstract":[{"text":"We study consistent query answering via different graph representations.\r\nFirst, we introduce solution-conflict hypergraphs in which nodes represent\r\nfacts and edges represent either conflicts or query solutions. Considering a\r\nmonotonic query and a set of antimonotonic constraints, we present an explicit\r\nalgorithm for counting the number of repairs satisfying the query based on a\r\ntree decomposition of the solution-conflict hypergraph. The algorithm not only\r\nprovides fixed-parameter tractability results for data complexity over\r\nexpressive query and constraint classes, but also introduces a novel and\r\npotentially implementable approach to repair counting. Second, we consider the\r\nGaifman graphs arising from MSO descriptions of consistent query answering.\r\nUsing a generalization of Courcelle's theorem, we then present fixed-parameter\r\ntractability results for combined complexity over expressive query and\r\nconstraint classes.","lang":"eng"}],"department":[{"_id":"574"}],"user_id":"99353","_id":"57814","external_id":{"arxiv":["2412.08324"]},"project":[{"name":"TRR 318; TP B01: Ein dialogbasierter Ansatz zur Erklärung von Modellen des maschinellen Lernens","_id":"121"}],"language":[{"iso":"eng"}]},{"date_created":"2025-09-11T10:19:47Z","publisher":"Springer Nature Switzerland","title":"Blink: Blank Node Matching Using Embeddings","year":"2024","language":[{"iso":"eng"}],"publication":"Lecture Notes in Computer Science","abstract":[{"lang":"eng","text":"Knowledge graphs (KGs) differ significantly over multiple different versions of the same data source. They also often contain blank nodes that do not have a constant identifier over all versions. Linking such blank nodes from different versions is a challenging task. Previous works propose different approaches to create signatures for all blank nodes based on named nodes in their neighborhood to match blank nodes with similar signatures. However, these works struggle to find a good mapping when the difference between the KGs’ versions grows too large. In this work, we propose Blink, an embedding-based approach for blank node linking. Blink merges two KGs’ versions and embeds the merged graph into a latent vector space based on translational embeddings and subsequently matches the closest pairs of blank nodes from different graphs. We evaluate our approach using real-world datasets against state-of-the-art approaches by computing the blank node matching for isomorphic graphs and graphs that contain triple changes (i.e., added or removed triples). The results indicate that Blink achieves perfect accuracy for isomorphic graphs. For graph versions that contain changes, such as having up to 20% of triples removed in one version, Blink still produces a mapping with an Optimal Mapping Deviation Ratio of under 1%. These results show that Blink leads to a better linking of KGs over different versions and similar graphs adhering to the linked data guidelines."}],"author":[{"last_name":"Becker","full_name":"Becker, Alexander","first_name":"Alexander"},{"first_name":"Mohamed","full_name":"Sherif, Mohamed","id":"67234","orcid":"https://orcid.org/0000-0002-9927-2203","last_name":"Sherif"},{"first_name":"Axel-Cyrille","id":"65716","full_name":"Ngonga Ngomo, Axel-Cyrille","last_name":"Ngonga Ngomo"}],"date_updated":"2025-09-11T10:34:02Z","main_file_link":[{"url":"https://papers.dice-research.org/2024/ISWC_BLINK/public.pdf"}],"doi":"10.1007/978-3-031-77844-5_12","conference":{"end_date":"2024-11-15","location":"Baltimore, USA","name":"ISWC 2024: : The 23ed International Semantic Web Conference","start_date":"2024-11-11"},"publication_status":"published","publication_identifier":{"isbn":["9783031778438","9783031778445"],"issn":["0302-9743","1611-3349"]},"citation":{"apa":"Becker, A., Sherif, M., &#38; Ngonga Ngomo, A.-C. (2024). Blink: Blank Node Matching Using Embeddings. In <i>Lecture Notes in Computer Science</i>. ISWC 2024: : The 23ed International Semantic Web Conference, Baltimore, USA. Springer Nature Switzerland. <a href=\"https://doi.org/10.1007/978-3-031-77844-5_12\">https://doi.org/10.1007/978-3-031-77844-5_12</a>","bibtex":"@inbook{Becker_Sherif_Ngonga Ngomo_2024, place={Cham}, title={Blink: Blank Node Matching Using Embeddings}, DOI={<a href=\"https://doi.org/10.1007/978-3-031-77844-5_12\">10.1007/978-3-031-77844-5_12</a>}, booktitle={Lecture Notes in Computer Science}, publisher={Springer Nature Switzerland}, author={Becker, Alexander and Sherif, Mohamed and Ngonga Ngomo, Axel-Cyrille}, year={2024} }","short":"A. Becker, M. Sherif, A.-C. Ngonga Ngomo, in: Lecture Notes in Computer Science, Springer Nature Switzerland, Cham, 2024.","mla":"Becker, Alexander, et al. “Blink: Blank Node Matching Using Embeddings.” <i>Lecture Notes in Computer Science</i>, Springer Nature Switzerland, 2024, doi:<a href=\"https://doi.org/10.1007/978-3-031-77844-5_12\">10.1007/978-3-031-77844-5_12</a>.","chicago":"Becker, Alexander, Mohamed Sherif, and Axel-Cyrille Ngonga Ngomo. “Blink: Blank Node Matching Using Embeddings.” In <i>Lecture Notes in Computer Science</i>. Cham: Springer Nature Switzerland, 2024. <a href=\"https://doi.org/10.1007/978-3-031-77844-5_12\">https://doi.org/10.1007/978-3-031-77844-5_12</a>.","ieee":"A. Becker, M. Sherif, and A.-C. Ngonga Ngomo, “Blink: Blank Node Matching Using Embeddings,” in <i>Lecture Notes in Computer Science</i>, Cham: Springer Nature Switzerland, 2024.","ama":"Becker A, Sherif M, Ngonga Ngomo A-C. Blink: Blank Node Matching Using Embeddings. In: <i>Lecture Notes in Computer Science</i>. Springer Nature Switzerland; 2024. doi:<a href=\"https://doi.org/10.1007/978-3-031-77844-5_12\">10.1007/978-3-031-77844-5_12</a>"},"place":"Cham","user_id":"67234","department":[{"_id":"574"}],"project":[{"_id":"285","name":"SAIL - Nachhaltiger Lebenszyklus von intelligenten soziotechnischen Systemen"}],"_id":"61210","type":"book_chapter","status":"public"},{"status":"public","publication":"ESWC","type":"conference","language":[{"iso":"eng"}],"keyword":["bigerl dice enexa heidrich karalis ngonga sail sherif"],"department":[{"_id":"574"}],"user_id":"67234","_id":"54084","citation":{"ama":"Karalis N, Bigerl A, Heidrich L, Sherif M, Ngonga Ngomo A-C. Efficient Evaluation of Conjunctive Regular Path Queries Using Multi-way Joins. In: <i>ESWC</i>. ; 2024.","chicago":"Karalis, Nikolaos, Alexander Bigerl, Liss Heidrich, Mohamed Sherif, and Axel-Cyrille Ngonga Ngomo. “Efficient Evaluation of Conjunctive Regular Path Queries Using Multi-Way Joins.” In <i>ESWC</i>, 2024.","ieee":"N. Karalis, A. Bigerl, L. Heidrich, M. Sherif, and A.-C. Ngonga Ngomo, “Efficient Evaluation of Conjunctive Regular Path Queries Using Multi-way Joins,” 2024.","bibtex":"@inproceedings{Karalis_Bigerl_Heidrich_Sherif_Ngonga Ngomo_2024, title={Efficient Evaluation of Conjunctive Regular Path Queries Using Multi-way Joins}, booktitle={ESWC}, author={Karalis, Nikolaos and Bigerl, Alexander and Heidrich, Liss and Sherif, Mohamed and Ngonga Ngomo, Axel-Cyrille}, year={2024} }","short":"N. Karalis, A. Bigerl, L. Heidrich, M. Sherif, A.-C. Ngonga Ngomo, in: ESWC, 2024.","mla":"Karalis, Nikolaos, et al. “Efficient Evaluation of Conjunctive Regular Path Queries Using Multi-Way Joins.” <i>ESWC</i>, 2024.","apa":"Karalis, N., Bigerl, A., Heidrich, L., Sherif, M., &#38; Ngonga Ngomo, A.-C. (2024). Efficient Evaluation of Conjunctive Regular Path Queries Using Multi-way Joins. <i>ESWC</i>."},"year":"2024","title":"Efficient Evaluation of Conjunctive Regular Path Queries Using Multi-way Joins","author":[{"first_name":"Nikolaos","last_name":"Karalis","full_name":"Karalis, Nikolaos"},{"id":"72857","full_name":"Bigerl, Alexander","last_name":"Bigerl","first_name":"Alexander"},{"last_name":"Heidrich","full_name":"Heidrich, Liss","first_name":"Liss"},{"first_name":"Mohamed","orcid":"https://orcid.org/0000-0002-9927-2203","last_name":"Sherif","full_name":"Sherif, Mohamed","id":"67234"},{"full_name":"Ngonga Ngomo, Axel-Cyrille","id":"65716","last_name":"Ngonga Ngomo","first_name":"Axel-Cyrille"}],"date_created":"2024-05-08T10:25:54Z","date_updated":"2025-09-11T10:36:03Z"},{"year":"2024","intvolume":"      3759","citation":{"apa":"Kumar, A., Naumann, M., Henne, K., &#38; Sherif, M. (2024). PCFWebUI: Data-driven WebUI for holistic decarbonization based on PCF-Tracking. In D. Garijo, A. L. Gentile, A. Kurteva, A. Mannocci, F. Osborne, &#38; S. Vahdati (Eds.), <i>Joint Proceedings of Posters, Demos, Workshops, and Tutorials of the 20th International Conference on Semantic Systems co-located with 20th International Conference on Semantic Systems (SEMANTiCS 2024), Amsterdam, The Netherlands, September 17-19, 2024</i> (Vol. 3759). CEUR-WS.org.","bibtex":"@inproceedings{Kumar_Naumann_Henne_Sherif_2024, series={CEUR Workshop Proceedings}, title={PCFWebUI: Data-driven WebUI for holistic decarbonization based on PCF-Tracking}, volume={3759}, booktitle={Joint Proceedings of Posters, Demos, Workshops, and Tutorials of the 20th International Conference on Semantic Systems co-located with 20th International Conference on Semantic Systems (SEMANTiCS 2024), Amsterdam, The Netherlands, September 17-19, 2024}, publisher={CEUR-WS.org}, author={Kumar, Ajay and Naumann, Marius and Henne, Kevin and Sherif, Mohamed}, editor={Garijo, Daniel and Gentile, Anna Lisa and Kurteva, Anelia and Mannocci, Andrea and Osborne, Francesco and Vahdati, Sahar}, year={2024}, collection={CEUR Workshop Proceedings} }","mla":"Kumar, Ajay, et al. “PCFWebUI: Data-Driven WebUI for Holistic Decarbonization Based on PCF-Tracking.” <i>Joint Proceedings of Posters, Demos, Workshops, and Tutorials of the 20th International Conference on Semantic Systems Co-Located with 20th International Conference on Semantic Systems (SEMANTiCS 2024), Amsterdam, The Netherlands, September 17-19, 2024</i>, edited by Daniel Garijo et al., vol. 3759, CEUR-WS.org, 2024.","short":"A. Kumar, M. Naumann, K. Henne, M. Sherif, in: D. Garijo, A.L. Gentile, A. Kurteva, A. Mannocci, F. Osborne, S. Vahdati (Eds.), Joint Proceedings of Posters, Demos, Workshops, and Tutorials of the 20th International Conference on Semantic Systems Co-Located with 20th International Conference on Semantic Systems (SEMANTiCS 2024), Amsterdam, The Netherlands, September 17-19, 2024, CEUR-WS.org, 2024.","chicago":"Kumar, Ajay, Marius Naumann, Kevin Henne, and Mohamed Sherif. “PCFWebUI: Data-Driven WebUI for Holistic Decarbonization Based on PCF-Tracking.” In <i>Joint Proceedings of Posters, Demos, Workshops, and Tutorials of the 20th International Conference on Semantic Systems Co-Located with 20th International Conference on Semantic Systems (SEMANTiCS 2024), Amsterdam, The Netherlands, September 17-19, 2024</i>, edited by Daniel Garijo, Anna Lisa Gentile, Anelia Kurteva, Andrea Mannocci, Francesco Osborne, and Sahar Vahdati, Vol. 3759. CEUR Workshop Proceedings. CEUR-WS.org, 2024.","ieee":"A. Kumar, M. Naumann, K. Henne, and M. Sherif, “PCFWebUI: Data-driven WebUI for holistic decarbonization based on PCF-Tracking,” in <i>Joint Proceedings of Posters, Demos, Workshops, and Tutorials of the 20th International Conference on Semantic Systems co-located with 20th International Conference on Semantic Systems (SEMANTiCS 2024), Amsterdam, The Netherlands, September 17-19, 2024</i>,  Amsterdam,The Netherlands, 2024, vol. 3759.","ama":"Kumar A, Naumann M, Henne K, Sherif M. PCFWebUI: Data-driven WebUI for holistic decarbonization based on PCF-Tracking. In: Garijo D, Gentile AL, Kurteva A, Mannocci A, Osborne F, Vahdati S, eds. <i>Joint Proceedings of Posters, Demos, Workshops, and Tutorials of the 20th International Conference on Semantic Systems Co-Located with 20th International Conference on Semantic Systems (SEMANTiCS 2024), Amsterdam, The Netherlands, September 17-19, 2024</i>. Vol 3759. CEUR Workshop Proceedings. CEUR-WS.org; 2024."},"title":"PCFWebUI: Data-driven WebUI for holistic decarbonization based on PCF-Tracking","conference":{"location":" Amsterdam,The Netherlands","end_date":"2024-09-19","start_date":"2024-09-17","name":"International Conference on Semantic Systems (SEMANTiCS 2024)"},"date_updated":"2025-09-11T10:46:35Z","publisher":"CEUR-WS.org","volume":3759,"author":[{"first_name":"Ajay","last_name":"Kumar","full_name":"Kumar, Ajay"},{"full_name":"Naumann, Marius","id":"94950","last_name":"Naumann","first_name":"Marius"},{"first_name":"Kevin","last_name":"Henne","full_name":"Henne, Kevin","id":"56918"},{"first_name":"Mohamed","orcid":"https://orcid.org/0000-0002-9927-2203","last_name":"Sherif","full_name":"Sherif, Mohamed","id":"67234"}],"date_created":"2025-09-11T10:43:04Z","editor":[{"first_name":"Daniel","last_name":"Garijo","full_name":"Garijo, Daniel"},{"last_name":"Gentile","full_name":"Gentile, Anna Lisa","first_name":"Anna Lisa"},{"full_name":"Kurteva, Anelia","last_name":"Kurteva","first_name":"Anelia"},{"full_name":"Mannocci, Andrea","last_name":"Mannocci","first_name":"Andrea"},{"full_name":"Osborne, Francesco","last_name":"Osborne","first_name":"Francesco"},{"first_name":"Sahar","last_name":"Vahdati","full_name":"Vahdati, Sahar"}],"status":"public","publication":"Joint Proceedings of Posters, Demos, Workshops, and Tutorials of the 20th International Conference on Semantic Systems co-located with 20th International Conference on Semantic Systems (SEMANTiCS 2024), Amsterdam, The Netherlands, September 17-19, 2024","type":"conference","keyword":["kumar sherif enexa climatebowl ingrid simba dice whale"],"language":[{"iso":"eng"}],"_id":"61219","department":[{"_id":"574"}],"user_id":"67234","series_title":"CEUR Workshop Proceedings"}]