---
_id: '63572'
author:
- first_name: Caglar
full_name: Demir, Caglar
id: '43817'
last_name: Demir
- first_name: Moshood Olawale
full_name: Yekini, Moshood Olawale
id: '114533'
last_name: Yekini
- first_name: Michael
full_name: Röder, Michael
id: '67199'
last_name: Röder
orcid: https://orcid.org/0000-0002-8609-8277
- first_name: Yasir
full_name: Mahmood, Yasir
id: '99353'
last_name: Mahmood
- first_name: Axel-Cyrille
full_name: Ngonga Ngomo, Axel-Cyrille
id: '65716'
last_name: Ngonga Ngomo
citation:
ama: 'Demir C, Yekini MO, Röder M, Mahmood Y, Ngonga Ngomo A-C. Tree-Based OWL Class
Expression Learner over Large Graphs. In: Lecture Notes in Computer Science.
Springer Nature Switzerland; 2025. doi:10.1007/978-3-032-06066-2_29'
apa: Demir, C., Yekini, M. O., Röder, M., Mahmood, Y., & Ngonga Ngomo, A.-C.
(2025). Tree-Based OWL Class Expression Learner over Large Graphs. Lecture
Notes in Computer Science. European Conference on Machine Learning and Principles
and Practice of Knowledge Discovery in Databases, Porto. https://doi.org/10.1007/978-3-032-06066-2_29
bibtex: '@inproceedings{Demir_Yekini_Röder_Mahmood_Ngonga Ngomo_2025, place={Cham},
title={Tree-Based OWL Class Expression Learner over Large Graphs}, DOI={10.1007/978-3-032-06066-2_29},
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} }'
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 Lecture Notes in Computer Science. Cham: Springer Nature Switzerland,
2025. https://doi.org/10.1007/978-3-032-06066-2_29.'
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: 10.1007/978-3-032-06066-2_29.'
mla: Demir, Caglar, et al. “Tree-Based OWL Class Expression Learner over Large Graphs.”
Lecture Notes in Computer Science, Springer Nature Switzerland, 2025, doi:10.1007/978-3-032-06066-2_29.
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.'
conference:
end_date: 2025-09-19
location: Porto
name: European Conference on Machine Learning and Principles and Practice of Knowledge
Discovery in Databases
start_date: 2025-09-15
date_created: 2026-01-12T17:13:22Z
date_updated: 2026-01-12T17:17:07Z
department:
- _id: '574'
- _id: '923'
doi: 10.1007/978-3-032-06066-2_29
language:
- iso: eng
place: Cham
publication: Lecture Notes in Computer Science
publication_identifier:
isbn:
- '9783032060655'
- '9783032060662'
issn:
- 0302-9743
- 1611-3349
publication_status: published
publisher: Springer Nature Switzerland
status: public
title: Tree-Based OWL Class Expression Learner over Large Graphs
type: conference
user_id: '67199'
year: '2025'
...
---
_id: '63575'
author:
- first_name: Sourabh
full_name: Kapoor, Sourabh
last_name: Kapoor
- first_name: Arnab
full_name: Sharma, Arnab
id: '67200'
last_name: Sharma
- first_name: Michael
full_name: Röder, Michael
id: '67199'
last_name: Röder
orcid: https://orcid.org/0000-0002-8609-8277
- first_name: Caglar
full_name: Demir, Caglar
id: '43817'
last_name: Demir
- first_name: Axel-Cyrille
full_name: Ngonga Ngomo, Axel-Cyrille
id: '65716'
last_name: Ngonga Ngomo
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: Lecture
Notes in Computer Science. Springer Nature Switzerland; 2025. doi:10.1007/978-3-031-94575-5_15'
apa: Kapoor, S., Sharma, A., Röder, M., Demir, C., & Ngonga Ngomo, A.-C. (2025).
Robustness Evaluation of Knowledge Graph Embedding Models Under Non-targeted Attacks.
Lecture Notes in Computer Science. https://doi.org/10.1007/978-3-031-94575-5_15
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={10.1007/978-3-031-94575-5_15},
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} }'
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 Lecture Notes in Computer Science. Cham: Springer
Nature Switzerland, 2025. https://doi.org/10.1007/978-3-031-94575-5_15.'
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: 10.1007/978-3-031-94575-5_15.'
mla: Kapoor, Sourabh, et al. “Robustness Evaluation of Knowledge Graph Embedding
Models Under Non-Targeted Attacks.” Lecture Notes in Computer Science,
Springer Nature Switzerland, 2025, doi:10.1007/978-3-031-94575-5_15.
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.'
date_created: 2026-01-12T17:24:11Z
date_updated: 2026-01-12T17:24:49Z
department:
- _id: '574'
- _id: '923'
doi: 10.1007/978-3-031-94575-5_15
language:
- iso: eng
place: Cham
publication: Lecture Notes in Computer Science
publication_identifier:
isbn:
- '9783031945748'
- '9783031945755'
issn:
- 0302-9743
- 1611-3349
publication_status: published
publisher: Springer Nature Switzerland
status: public
title: Robustness Evaluation of Knowledge Graph Embedding Models Under Non-targeted
Attacks
type: conference
user_id: '67199'
year: '2025'
...
---
_id: '63573'
author:
- first_name: Adel
full_name: Memariani, Adel
last_name: Memariani
- first_name: Michael
full_name: Röder, Michael
id: '67199'
last_name: Röder
orcid: https://orcid.org/0000-0002-8609-8277
- first_name: Arnab
full_name: Sharma, Arnab
id: '67200'
last_name: Sharma
- first_name: Caglar
full_name: Demir, Caglar
id: '43817'
last_name: Demir
- first_name: Axel-Cyrille
full_name: Ngonga Ngomo, Axel-Cyrille
id: '65716'
last_name: Ngonga Ngomo
citation:
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: Lecture Notes in
Computer Science. Springer Nature Switzerland; 2025. doi:10.1007/978-3-032-09527-5_6'
apa: 'Memariani, A., Röder, M., Sharma, A., Demir, C., & Ngonga Ngomo, A.-C.
(2025). Link Prediction Under Non-targeted Attacks: Do Soft Labels Always Help?
Lecture Notes in Computer Science. https://doi.org/10.1007/978-3-032-09527-5_6'
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={10.1007/978-3-032-09527-5_6},
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} }'
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 Lecture Notes in Computer Science. Cham: Springer Nature Switzerland,
2025. https://doi.org/10.1007/978-3-032-09527-5_6.'
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:
10.1007/978-3-032-09527-5_6.'
mla: 'Memariani, Adel, et al. “Link Prediction Under Non-Targeted Attacks: Do Soft
Labels Always Help?” Lecture Notes in Computer Science, Springer Nature
Switzerland, 2025, doi:10.1007/978-3-032-09527-5_6.'
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.'
date_created: 2026-01-12T17:18:35Z
date_updated: 2026-01-12T17:24:46Z
department:
- _id: '574'
- _id: '923'
doi: 10.1007/978-3-032-09527-5_6
language:
- iso: eng
place: Cham
publication: Lecture Notes in Computer Science
publication_identifier:
isbn:
- '9783032095268'
- '9783032095275'
issn:
- 0302-9743
- 1611-3349
publication_status: published
publisher: Springer Nature Switzerland
status: public
title: 'Link Prediction Under Non-targeted Attacks: Do Soft Labels Always Help?'
type: conference
user_id: '67199'
year: '2025'
...
---
_id: '63574'
author:
- first_name: Quannian
full_name: Zhang, Quannian
id: '104099'
last_name: Zhang
orcid: 0009-0008-9497-3204
- first_name: Michael
full_name: Röder, Michael
id: '67199'
last_name: Röder
orcid: https://orcid.org/0000-0002-8609-8277
- first_name: Nikit
full_name: Srivastava, Nikit
id: '70066'
last_name: Srivastava
orcid: 0009-0004-5164-4911
- first_name: N'Dah Jean
full_name: KOUAGOU, N'Dah Jean
id: '87189'
last_name: KOUAGOU
- first_name: Axel-Cyrille
full_name: Ngonga Ngomo, Axel-Cyrille
id: '65716'
last_name: Ngonga Ngomo
citation:
ama: 'Zhang Q, Röder M, Srivastava N, KOUAGOU NJ, Ngonga Ngomo A-C. Explainable
Benchmarking through the Lense of Concept Learning. In: Proceedings of the
Knowledge Capture Conference 2025. ACM; 2025. doi:10.1145/3731443.3771359'
apa: Zhang, Q., Röder, M., Srivastava, N., KOUAGOU, N. J., & Ngonga Ngomo, A.-C.
(2025). Explainable Benchmarking through the Lense of Concept Learning. Proceedings
of the Knowledge Capture Conference 2025. https://doi.org/10.1145/3731443.3771359
bibtex: '@inproceedings{Zhang_Röder_Srivastava_KOUAGOU_Ngonga Ngomo_2025, title={Explainable
Benchmarking through the Lense of Concept Learning}, DOI={10.1145/3731443.3771359},
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} }'
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 Proceedings of the Knowledge Capture Conference 2025. ACM,
2025. https://doi.org/10.1145/3731443.3771359.
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: 10.1145/3731443.3771359.'
mla: Zhang, Quannian, et al. “Explainable Benchmarking through the Lense of Concept
Learning.” Proceedings of the Knowledge Capture Conference 2025, ACM, 2025,
doi:10.1145/3731443.3771359.
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.'
date_created: 2026-01-12T17:21:05Z
date_updated: 2026-01-12T17:25:00Z
department:
- _id: '574'
- _id: '923'
doi: 10.1145/3731443.3771359
language:
- iso: eng
publication: Proceedings of the Knowledge Capture Conference 2025
publication_status: published
publisher: ACM
status: public
title: Explainable Benchmarking through the Lense of Concept Learning
type: conference
user_id: '67199'
year: '2025'
...
---
_id: '54449'
author:
- first_name: N'Dah Jean
full_name: KOUAGOU, N'Dah Jean
id: '87189'
last_name: KOUAGOU
- first_name: Caglar
full_name: Demir, Caglar
id: '43817'
last_name: Demir
- first_name: Hamada Mohamed Abdelsamee
full_name: Zahera, Hamada Mohamed Abdelsamee
id: '72768'
last_name: Zahera
orcid: 0000-0003-0215-1278
- first_name: Adrian
full_name: Wilke, Adrian
id: '9101'
last_name: Wilke
orcid: 0000-0002-6575-807X
- first_name: Stefan
full_name: Heindorf, Stefan
id: '11871'
last_name: Heindorf
orcid: 0000-0002-4525-6865
- first_name: Jiayi
full_name: Li, Jiayi
last_name: Li
- first_name: Axel-Cyrille
full_name: Ngonga Ngomo, Axel-Cyrille
id: '65716'
last_name: Ngonga Ngomo
citation:
ama: 'KOUAGOU NJ, Demir C, Zahera HMA, et al. Universal Knowledge Graph Embeddings.
In: Companion Proceedings of the ACM on Web Conference 2024. ACM; 2024.
doi:10.1145/3589335.3651978'
apa: KOUAGOU, N. J., Demir, C., Zahera, H. M. A., Wilke, A., Heindorf, S., Li, J.,
& Ngonga Ngomo, A.-C. (2024). Universal Knowledge Graph Embeddings. Companion
Proceedings of the ACM on Web Conference 2024. Companion Proceedings of the
ACM on Web Conference 2024, Singapore. https://doi.org/10.1145/3589335.3651978
bibtex: '@inproceedings{KOUAGOU_Demir_Zahera_Wilke_Heindorf_Li_Ngonga Ngomo_2024,
title={Universal Knowledge Graph Embeddings}, DOI={10.1145/3589335.3651978},
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} }'
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 Companion Proceedings of the ACM on Web Conference 2024.
ACM, 2024. https://doi.org/10.1145/3589335.3651978.
ieee: 'N. J. KOUAGOU et al., “Universal Knowledge Graph Embeddings,” presented
at the Companion Proceedings of the ACM on Web Conference 2024, Singapore, 2024,
doi: 10.1145/3589335.3651978.'
mla: KOUAGOU, N’Dah Jean, et al. “Universal Knowledge Graph Embeddings.” Companion
Proceedings of the ACM on Web Conference 2024, ACM, 2024, doi:10.1145/3589335.3651978.
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.'
conference:
end_date: 2024-05-17
location: Singapore
name: Companion Proceedings of the ACM on Web Conference 2024
start_date: 2024-05-13
date_created: 2024-05-26T18:52:47Z
date_updated: 2024-05-26T19:06:10Z
department:
- _id: '760'
- _id: '574'
doi: 10.1145/3589335.3651978
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://dl.acm.org/doi/abs/10.1145/3589335.3651978
oa: '1'
publication: Companion Proceedings of the ACM on Web Conference 2024
publication_status: published
publisher: ACM
status: public
title: Universal Knowledge Graph Embeddings
type: conference
user_id: '11871'
year: '2024'
...
---
_id: '54412'
author:
- first_name: Asep Fajar
full_name: Firmansyah, Asep Fajar
id: '76787'
last_name: Firmansyah
- first_name: Diego
full_name: Moussallem, Diego
id: '71635'
last_name: Moussallem
- first_name: Axel-Cyrille
full_name: Ngonga Ngomo, Axel-Cyrille
id: '65716'
last_name: Ngonga Ngomo
citation:
ama: 'Firmansyah AF, Moussallem D, Ngonga Ngomo A-C. ESLM: Improving Entity Summarization
by Leveraging Language Models. In: The Semantic Web. Springer Nature Switzerland;
2024. doi:10.1007/978-3-031-60626-7_9'
apa: 'Firmansyah, A. F., Moussallem, D., & Ngonga Ngomo, A.-C. (2024). ESLM:
Improving Entity Summarization by Leveraging Language Models. In The Semantic
Web. Springer Nature Switzerland. https://doi.org/10.1007/978-3-031-60626-7_9'
bibtex: '@inbook{Firmansyah_Moussallem_Ngonga Ngomo_2024, place={Cham}, title={ESLM:
Improving Entity Summarization by Leveraging Language Models}, DOI={10.1007/978-3-031-60626-7_9},
booktitle={The Semantic Web}, publisher={Springer Nature Switzerland}, author={Firmansyah,
Asep Fajar and Moussallem, Diego and Ngonga Ngomo, Axel-Cyrille}, year={2024}
}'
chicago: 'Firmansyah, Asep Fajar, Diego Moussallem, and Axel-Cyrille Ngonga Ngomo.
“ESLM: Improving Entity Summarization by Leveraging Language Models.” In The
Semantic Web. Cham: Springer Nature Switzerland, 2024. https://doi.org/10.1007/978-3-031-60626-7_9.'
ieee: 'A. F. Firmansyah, D. Moussallem, and A.-C. Ngonga Ngomo, “ESLM: Improving
Entity Summarization by Leveraging Language Models,” in The Semantic Web,
Cham: Springer Nature Switzerland, 2024.'
mla: 'Firmansyah, Asep Fajar, et al. “ESLM: Improving Entity Summarization by Leveraging
Language Models.” The Semantic Web, Springer Nature Switzerland, 2024,
doi:10.1007/978-3-031-60626-7_9.'
short: 'A.F. Firmansyah, D. Moussallem, A.-C. Ngonga Ngomo, in: The Semantic Web,
Springer Nature Switzerland, Cham, 2024.'
date_created: 2024-05-22T09:00:03Z
date_updated: 2024-06-04T11:09:23Z
department:
- _id: '574'
- _id: '34'
doi: 10.1007/978-3-031-60626-7_9
language:
- iso: eng
place: Cham
publication: The Semantic Web
publication_identifier:
isbn:
- '9783031606250'
- '9783031606267'
issn:
- 0302-9743
- 1611-3349
publication_status: published
publisher: Springer Nature Switzerland
status: public
title: 'ESLM: Improving Entity Summarization by Leveraging Language Models'
type: book_chapter
user_id: '76787'
year: '2024'
...
---
_id: '54580'
author:
- first_name: Yasir
full_name: Mahmood, Yasir
id: '99353'
last_name: Mahmood
- first_name: Jonni
full_name: Virtema, Jonni
last_name: Virtema
- first_name: Timon
full_name: Barlag, Timon
last_name: Barlag
- first_name: Axel-Cyrille
full_name: Ngonga Ngomo, Axel-Cyrille
id: '65716'
last_name: Ngonga Ngomo
citation:
ama: 'Mahmood Y, Virtema J, Barlag T, Ngonga Ngomo A-C. Computing Repairs Under
Functional and Inclusion Dependencies via Argumentation. In: Lecture Notes
in Computer Science. Springer Nature Switzerland; 2024. doi:10.1007/978-3-031-56940-1_2'
apa: Mahmood, Y., Virtema, J., Barlag, T., & Ngonga Ngomo, A.-C. (2024). Computing
Repairs Under Functional and Inclusion Dependencies via Argumentation. In Lecture
Notes in Computer Science. Springer Nature Switzerland. https://doi.org/10.1007/978-3-031-56940-1_2
bibtex: '@inbook{Mahmood_Virtema_Barlag_Ngonga Ngomo_2024, place={Cham}, title={Computing
Repairs Under Functional and Inclusion Dependencies via Argumentation}, DOI={10.1007/978-3-031-56940-1_2},
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} }'
chicago: 'Mahmood, Yasir, Jonni Virtema, Timon Barlag, and Axel-Cyrille Ngonga Ngomo.
“Computing Repairs Under Functional and Inclusion Dependencies via Argumentation.”
In Lecture Notes in Computer Science. Cham: Springer Nature Switzerland,
2024. https://doi.org/10.1007/978-3-031-56940-1_2.'
ieee: 'Y. Mahmood, J. Virtema, T. Barlag, and A.-C. Ngonga Ngomo, “Computing Repairs
Under Functional and Inclusion Dependencies via Argumentation,” in Lecture
Notes in Computer Science, Cham: Springer Nature Switzerland, 2024.'
mla: Mahmood, Yasir, et al. “Computing Repairs Under Functional and Inclusion Dependencies
via Argumentation.” Lecture Notes in Computer Science, Springer Nature
Switzerland, 2024, doi:10.1007/978-3-031-56940-1_2.
short: 'Y. Mahmood, J. Virtema, T. Barlag, A.-C. Ngonga Ngomo, in: Lecture Notes
in Computer Science, Springer Nature Switzerland, Cham, 2024.'
date_created: 2024-06-04T10:01:16Z
date_updated: 2024-06-04T15:53:59Z
department:
- _id: '574'
doi: 10.1007/978-3-031-56940-1_2
language:
- iso: eng
place: Cham
publication: Lecture Notes in Computer Science
publication_identifier:
isbn:
- '9783031569395'
- '9783031569401'
issn:
- 0302-9743
- 1611-3349
publication_status: published
publisher: Springer Nature Switzerland
status: public
title: Computing Repairs Under Functional and Inclusion Dependencies via Argumentation
type: book_chapter
user_id: '99353'
year: '2024'
...
---
_id: '54092'
author:
- first_name: Juha
full_name: Kontinen, Juha
last_name: Kontinen
- first_name: Yasir
full_name: Mahmood, Yasir
id: '99353'
last_name: Mahmood
- first_name: Arne
full_name: Meier, Arne
last_name: Meier
- first_name: Heribert
full_name: Vollmer, Heribert
last_name: Vollmer
citation:
ama: Kontinen J, Mahmood Y, Meier A, Vollmer H. Parameterized Complexity of Weighted
Team Definability. Mathematical Structures in Computer Science. Published
online 2024:1-15. doi:10.1017/S0960129524000033
apa: Kontinen, J., Mahmood, Y., Meier, A., & Vollmer, H. (2024). Parameterized
Complexity of Weighted Team Definability. Mathematical Structures in Computer
Science, 1–15. https://doi.org/10.1017/S0960129524000033
bibtex: '@article{Kontinen_Mahmood_Meier_Vollmer_2024, title={Parameterized Complexity
of Weighted Team Definability}, DOI={10.1017/S0960129524000033},
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} }'
chicago: Kontinen, Juha, Yasir Mahmood, Arne Meier, and Heribert Vollmer. “Parameterized
Complexity of Weighted Team Definability.” Mathematical Structures in Computer
Science, 2024, 1–15. https://doi.org/10.1017/S0960129524000033.
ieee: 'J. Kontinen, Y. Mahmood, A. Meier, and H. Vollmer, “Parameterized Complexity
of Weighted Team Definability,” Mathematical Structures in Computer Science,
pp. 1–15, 2024, doi: 10.1017/S0960129524000033.'
mla: Kontinen, Juha, et al. “Parameterized Complexity of Weighted Team Definability.”
Mathematical Structures in Computer Science, Cambridge University Press,
2024, pp. 1–15, doi:10.1017/S0960129524000033.
short: J. Kontinen, Y. Mahmood, A. Meier, H. Vollmer, Mathematical Structures in
Computer Science (2024) 1–15.
date_created: 2024-05-08T13:24:17Z
date_updated: 2024-09-17T15:25:54Z
department:
- _id: '574'
doi: 10.1017/S0960129524000033
keyword:
- dice mahmood
language:
- iso: eng
page: 1-15
publication: Mathematical Structures in Computer Science
publisher: Cambridge University Press
status: public
title: Parameterized Complexity of Weighted Team Definability
type: journal_article
user_id: '99353'
year: '2024'
...
---
_id: '56213'
author:
- first_name: Rupesh
full_name: Sapkota, Rupesh
id: '89326'
last_name: Sapkota
- first_name: Dominik
full_name: Köhler, Dominik
last_name: Köhler
- first_name: Stefan
full_name: Heindorf, Stefan
id: '11871'
last_name: Heindorf
orcid: 0000-0002-4525-6865
citation:
ama: 'Sapkota R, Köhler D, Heindorf S. EDGE: Evaluation Framework for Logical vs.
Subgraph Explanations for Node Classifiers on Knowledge Graphs. In: Proceedings
of the 33rd ACM International Conference on Information and Knowledge Management
(CIKM ’24),. ACM; 2024. doi:10.1145/3627673.3679904'
apa: 'Sapkota, R., Köhler, D., & Heindorf, S. (2024). EDGE: Evaluation Framework
for Logical vs. Subgraph Explanations for Node Classifiers on Knowledge Graphs.
Proceedings of the 33rd ACM International Conference on Information and Knowledge
Management (CIKM ’24),. 33rd ACM International Conference on Information and
Knowledge Management, Boise, Idaho, USA. https://doi.org/10.1145/3627673.3679904'
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={10.1145/3627673.3679904},
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} }'
chicago: 'Sapkota, Rupesh, Dominik Köhler, and Stefan Heindorf. “EDGE: Evaluation
Framework for Logical vs. Subgraph Explanations for Node Classifiers on Knowledge
Graphs.” In Proceedings of the 33rd ACM International Conference on Information
and Knowledge Management (CIKM ’24),. Boise, Idaho, USA: ACM, 2024. https://doi.org/10.1145/3627673.3679904.'
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: 10.1145/3627673.3679904.'
mla: 'Sapkota, Rupesh, et al. “EDGE: Evaluation Framework for Logical vs. Subgraph
Explanations for Node Classifiers on Knowledge Graphs.” Proceedings of the
33rd ACM International Conference on Information and Knowledge Management (CIKM
’24), ACM, 2024, doi:10.1145/3627673.3679904.'
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.'
conference:
end_date: 2024-10-25
location: Boise, Idaho, USA
name: 33rd ACM International Conference on Information and Knowledge Management
start_date: 2024-10-21
date_created: 2024-09-23T12:30:10Z
date_updated: 2024-09-23T12:30:25Z
department:
- _id: '760'
- _id: '574'
doi: 10.1145/3627673.3679904
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://papers.dice-research.org/2024/CIKM_EDGE/public.pdf
oa: '1'
place: Boise, Idaho, USA
project:
- _id: '285'
grant_number: NW21-059D
name: 'SAIL: SAIL - Nachhaltiger Lebenszyklus von intelligenten soziotechnischen
Systemen'
publication: Proceedings of the 33rd ACM International Conference on Information and
Knowledge Management (CIKM ’24),
publisher: ACM
status: public
title: 'EDGE: Evaluation Framework for Logical vs. Subgraph Explanations for Node
Classifiers on Knowledge Graphs'
type: conference
user_id: '11871'
year: '2024'
...
---
_id: '56214'
author:
- first_name: Jiayi
full_name: Li, Jiayi
last_name: Li
- first_name: Sheetal
full_name: Satheesh, Sheetal
last_name: Satheesh
- first_name: Stefan
full_name: Heindorf, Stefan
id: '11871'
last_name: Heindorf
orcid: 0000-0002-4525-6865
- first_name: Diego
full_name: Moussallem, Diego
id: '71635'
last_name: Moussallem
- first_name: René
full_name: Speck, René
id: '70843'
last_name: Speck
- first_name: Axel-Cyrille
full_name: Ngonga Ngomo, Axel-Cyrille
id: '65716'
last_name: Ngonga Ngomo
citation:
ama: 'Li J, Satheesh S, Heindorf S, Moussallem D, Speck R, Ngonga Ngomo A-C. AutoCL:
AutoML for Concept Learning. In: Communications in Computer and Information
Science. Springer Nature Switzerland; 2024. doi:10.1007/978-3-031-63787-2_7'
apa: 'Li, J., Satheesh, S., Heindorf, S., Moussallem, D., Speck, R., & Ngonga
Ngomo, A.-C. (2024). AutoCL: AutoML for Concept Learning. In Communications
in Computer and Information Science. The 2nd World Conference on eXplainable
Artificial Intelligence, Malta, Valletta. Springer Nature Switzerland. https://doi.org/10.1007/978-3-031-63787-2_7'
bibtex: '@inbook{Li_Satheesh_Heindorf_Moussallem_Speck_Ngonga Ngomo_2024, place={Cham},
title={AutoCL: AutoML for Concept Learning}, DOI={10.1007/978-3-031-63787-2_7},
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}
}'
chicago: 'Li, Jiayi, Sheetal Satheesh, Stefan Heindorf, Diego Moussallem, René Speck,
and Axel-Cyrille Ngonga Ngomo. “AutoCL: AutoML for Concept Learning.” In Communications
in Computer and Information Science. Cham: Springer Nature Switzerland, 2024.
https://doi.org/10.1007/978-3-031-63787-2_7.'
ieee: 'J. Li, S. Satheesh, S. Heindorf, D. Moussallem, R. Speck, and A.-C. Ngonga
Ngomo, “AutoCL: AutoML for Concept Learning,” in Communications in Computer
and Information Science, Cham: Springer Nature Switzerland, 2024.'
mla: 'Li, Jiayi, et al. “AutoCL: AutoML for Concept Learning.” Communications
in Computer and Information Science, Springer Nature Switzerland, 2024, doi:10.1007/978-3-031-63787-2_7.'
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.'
conference:
end_date: 2024-07-19
location: Malta, Valletta
name: The 2nd World Conference on eXplainable Artificial Intelligence
start_date: 2024-07-17
date_created: 2024-09-23T12:31:23Z
date_updated: 2024-09-23T12:36:17Z
department:
- _id: '760'
- _id: '574'
doi: 10.1007/978-3-031-63787-2_7
language:
- iso: eng
place: Cham
publication: Communications in Computer and Information Science
publication_identifier:
isbn:
- '9783031637865'
- '9783031637872'
issn:
- 1865-0929
- 1865-0937
publication_status: published
publisher: Springer Nature Switzerland
status: public
title: 'AutoCL: AutoML for Concept Learning'
type: book_chapter
user_id: '11871'
year: '2024'
...
---
_id: '59911'
abstract:
- lang: eng
text: "AbstractIn 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 \r\n$\\varphi$\r\n
of central team-based logics. Given a first-order structure \r\n$\\mathcal{A}$\r\n
and the parameter value \r\n$k\\in
\\mathbb N$\r\n as input,
the question is to determine whether \r\n$\\mathcal{A},T\\models
\\varphi$\r\n for some
team T of size k. 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."
author:
- first_name: Juha
full_name: Kontinen, Juha
last_name: Kontinen
- first_name: Yasir
full_name: Mahmood, Yasir
id: '99353'
last_name: Mahmood
- first_name: Arne
full_name: Meier, Arne
last_name: Meier
- first_name: Heribert
full_name: Vollmer, Heribert
last_name: Vollmer
citation:
ama: Kontinen J, Mahmood Y, Meier A, Vollmer H. Parameterized complexity of weighted
team definability. Mathematical Structures in Computer Science. 2024;34(5):375-389.
doi:10.1017/s0960129524000033
apa: Kontinen, J., Mahmood, Y., Meier, A., & Vollmer, H. (2024). Parameterized
complexity of weighted team definability. Mathematical Structures in Computer
Science, 34(5), 375–389. https://doi.org/10.1017/s0960129524000033
bibtex: '@article{Kontinen_Mahmood_Meier_Vollmer_2024, title={Parameterized complexity
of weighted team definability}, volume={34}, DOI={10.1017/s0960129524000033},
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} }'
chicago: 'Kontinen, Juha, Yasir Mahmood, Arne Meier, and Heribert Vollmer. “Parameterized
Complexity of Weighted Team Definability.” Mathematical Structures in Computer
Science 34, no. 5 (2024): 375–89. https://doi.org/10.1017/s0960129524000033.'
ieee: 'J. Kontinen, Y. Mahmood, A. Meier, and H. Vollmer, “Parameterized complexity
of weighted team definability,” Mathematical Structures in Computer Science,
vol. 34, no. 5, pp. 375–389, 2024, doi: 10.1017/s0960129524000033.'
mla: Kontinen, Juha, et al. “Parameterized Complexity of Weighted Team Definability.”
Mathematical Structures in Computer Science, vol. 34, no. 5, Cambridge
University Press (CUP), 2024, pp. 375–89, doi:10.1017/s0960129524000033.
short: J. Kontinen, Y. Mahmood, A. Meier, H. Vollmer, Mathematical Structures in
Computer Science 34 (2024) 375–389.
date_created: 2025-05-15T11:06:56Z
date_updated: 2025-05-15T11:07:08Z
department:
- _id: '574'
doi: 10.1017/s0960129524000033
intvolume: ' 34'
issue: '5'
language:
- iso: eng
page: 375-389
publication: Mathematical Structures in Computer Science
publication_identifier:
issn:
- 0960-1295
- 1469-8072
publication_status: published
publisher: Cambridge University Press (CUP)
status: public
title: Parameterized complexity of weighted team definability
type: journal_article
user_id: '99353'
volume: 34
year: '2024'
...
---
_id: '57323'
author:
- first_name: Nikolaos
full_name: Karalis, Nikolaos
last_name: Karalis
- first_name: Alexander
full_name: Bigerl, Alexander
last_name: Bigerl
- first_name: Caglar
full_name: Demir, Caglar
last_name: Demir
- first_name: Liss
full_name: Heidrich, Liss
last_name: Heidrich
- first_name: Axel-Cyrille
full_name: Ngonga Ngomo, Axel-Cyrille
last_name: Ngonga Ngomo
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: Lecture Notes
in Computer Science. Springer Nature Switzerland; 2024. doi:10.1007/978-3-031-70365-2_12'
apa: Karalis, N., Bigerl, A., Demir, C., Heidrich, L., & Ngonga Ngomo, A.-C.
(2024). Evaluating Negation with Multi-way Joins Accelerates Class Expression
Learning. In Lecture Notes in Computer Science. Springer Nature Switzerland.
https://doi.org/10.1007/978-3-031-70365-2_12
bibtex: '@inbook{Karalis_Bigerl_Demir_Heidrich_Ngonga Ngomo_2024, place={Cham},
title={Evaluating Negation with Multi-way Joins Accelerates Class Expression Learning},
DOI={10.1007/978-3-031-70365-2_12},
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} }'
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 Lecture Notes in Computer Science. Cham:
Springer Nature Switzerland, 2024. https://doi.org/10.1007/978-3-031-70365-2_12.'
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 Lecture
Notes in Computer Science, Cham: Springer Nature Switzerland, 2024.'
mla: Karalis, Nikolaos, et al. “Evaluating Negation with Multi-Way Joins Accelerates
Class Expression Learning.” Lecture Notes in Computer Science, Springer
Nature Switzerland, 2024, doi:10.1007/978-3-031-70365-2_12.
short: 'N. Karalis, A. Bigerl, C. Demir, L. Heidrich, A.-C. Ngonga Ngomo, in: Lecture
Notes in Computer Science, Springer Nature Switzerland, Cham, 2024.'
date_created: 2024-11-22T09:45:01Z
date_updated: 2024-11-22T10:31:34Z
department:
- _id: '574'
doi: 10.1007/978-3-031-70365-2_12
language:
- iso: eng
place: Cham
publication: Lecture Notes in Computer Science
publication_identifier:
isbn:
- '9783031703645'
- '9783031703652'
issn:
- 0302-9743
- 1611-3349
publication_status: published
publisher: Springer Nature Switzerland
status: public
title: Evaluating Negation with Multi-way Joins Accelerates Class Expression Learning
type: book_chapter
user_id: '84532'
year: '2024'
...
---
_id: '58377'
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."
author:
- first_name: Yasir
full_name: Mahmood, Yasir
id: '99353'
last_name: Mahmood
- first_name: Markus
full_name: Hecher, Markus
last_name: Hecher
- first_name: Axel-Cyrille
full_name: Ngonga Ngomo, Axel-Cyrille
id: '65716'
last_name: Ngonga Ngomo
citation:
ama: 'Mahmood Y, Hecher M, Ngonga Ngomo A-C. Dung’s Argumentation Framework: Unveiling
the Expressive Power with Inconsistent Databases. In: ; 2024. doi:10.1609/AAAI.V39I14.33651'
apa: 'Mahmood, Y., Hecher, M., & Ngonga Ngomo, A.-C. (2024). Dung’s Argumentation
Framework: Unveiling the Expressive Power with Inconsistent Databases. https://doi.org/10.1609/AAAI.V39I14.33651'
bibtex: '@inproceedings{Mahmood_Hecher_Ngonga Ngomo_2024, title={Dung’s Argumentation
Framework: Unveiling the Expressive Power with Inconsistent Databases}, DOI={10.1609/AAAI.V39I14.33651},
author={Mahmood, Yasir and Hecher, Markus and Ngonga Ngomo, Axel-Cyrille}, year={2024}
}'
chicago: 'Mahmood, Yasir, Markus Hecher, and Axel-Cyrille Ngonga Ngomo. “Dung’s
Argumentation Framework: Unveiling the Expressive Power with Inconsistent Databases,”
2024. https://doi.org/10.1609/AAAI.V39I14.33651.'
ieee: 'Y. Mahmood, M. Hecher, and A.-C. Ngonga Ngomo, “Dung’s Argumentation Framework:
Unveiling the Expressive Power with Inconsistent Databases,” 2024, doi: 10.1609/AAAI.V39I14.33651.'
mla: 'Mahmood, Yasir, et al. Dung’s Argumentation Framework: Unveiling the Expressive
Power with Inconsistent Databases. 2024, doi:10.1609/AAAI.V39I14.33651.'
short: 'Y. Mahmood, M. Hecher, A.-C. Ngonga Ngomo, in: 2024.'
date_created: 2025-01-27T15:30:41Z
date_updated: 2025-09-11T10:01:11Z
department:
- _id: '574'
doi: 10.1609/AAAI.V39I14.33651
external_id:
arxiv:
- '2412.11617'
language:
- iso: eng
project:
- _id: '121'
name: 'TRR 318; TP B01: Ein dialogbasierter Ansatz zur Erklärung von Modellen des
maschinellen Lernens'
status: public
title: 'Dung''s Argumentation Framework: Unveiling the Expressive Power with Inconsistent
Databases'
type: conference
user_id: '99353'
year: '2024'
...
---
_id: '57238'
abstract:
- lang: eng
text: 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.
author:
- first_name: Johannes K.
full_name: Fichte, Johannes K.
last_name: Fichte
- first_name: Markus
full_name: Hecher, Markus
last_name: Hecher
- first_name: Yasir
full_name: Mahmood, Yasir
id: '99353'
last_name: Mahmood
- first_name: Arne
full_name: Meier, Arne
last_name: Meier
citation:
ama: 'Fichte JK, Hecher M, Mahmood Y, Meier A. Rejection in Abstract Argumentation:
Harder Than Acceptance? In: Frontiers in Artificial Intelligence and Applications.
IOS Press; 2024. doi:10.3233/faia240867'
apa: 'Fichte, J. K., Hecher, M., Mahmood, Y., & Meier, A. (2024). Rejection
in Abstract Argumentation: Harder Than Acceptance? In Frontiers in Artificial
Intelligence and Applications. ECAI} 2024 - 27th European Conference on Artificial
Intelligence, Santiago de Compostela, Spain. IOS Press. https://doi.org/10.3233/faia240867'
bibtex: '@inbook{Fichte_Hecher_Mahmood_Meier_2024, title={Rejection in Abstract
Argumentation: Harder Than Acceptance?}, DOI={10.3233/faia240867},
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} }'
chicago: 'Fichte, Johannes K., Markus Hecher, Yasir Mahmood, and Arne Meier. “Rejection
in Abstract Argumentation: Harder Than Acceptance?” In Frontiers in Artificial
Intelligence and Applications. IOS Press, 2024. https://doi.org/10.3233/faia240867.'
ieee: 'J. K. Fichte, M. Hecher, Y. Mahmood, and A. Meier, “Rejection in Abstract
Argumentation: Harder Than Acceptance?,” in Frontiers in Artificial Intelligence
and Applications, IOS Press, 2024.'
mla: 'Fichte, Johannes K., et al. “Rejection in Abstract Argumentation: Harder Than
Acceptance?” Frontiers in Artificial Intelligence and Applications, IOS
Press, 2024, doi:10.3233/faia240867.'
short: 'J.K. Fichte, M. Hecher, Y. Mahmood, A. Meier, in: Frontiers in Artificial
Intelligence and Applications, IOS Press, 2024.'
conference:
location: Santiago de Compostela, Spain
name: ECAI} 2024 - 27th European Conference on Artificial Intelligence
date_created: 2024-11-19T11:46:55Z
date_updated: 2025-09-11T10:01:52Z
department:
- _id: '574'
doi: 10.3233/faia240867
language:
- iso: eng
project:
- _id: '121'
name: 'TRR 318; TP B01: Ein dialogbasierter Ansatz zur Erklärung von Modellen des
maschinellen Lernens'
publication: Frontiers in Artificial Intelligence and Applications
publication_identifier:
isbn:
- '9781643685489'
issn:
- 0922-6389
- 1879-8314
publication_status: published
publisher: IOS Press
status: public
title: 'Rejection in Abstract Argumentation: Harder Than Acceptance?'
type: book_chapter
user_id: '99353'
year: '2024'
...
---
_id: '55655'
abstract:
- lang: eng
text: 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.
author:
- first_name: Markus
full_name: Hecher, Markus
last_name: Hecher
- first_name: Yasir
full_name: Mahmood, Yasir
id: '99353'
last_name: Mahmood
- first_name: Arne
full_name: Meier, Arne
last_name: Meier
- first_name: Johannes
full_name: Schmidt, Johannes
last_name: Schmidt
citation:
ama: 'Hecher M, Mahmood Y, Meier A, Schmidt J. Quantitative Claim-Centric Reasoning
in Logic-Based Argumentation. In: Proceedings of the Thirty-ThirdInternational
Joint Conference on Artificial Intelligence. International Joint Conferences
on Artificial Intelligence Organization; 2024. doi:10.24963/ijcai.2024/377'
apa: Hecher, M., Mahmood, Y., Meier, A., & Schmidt, J. (2024). Quantitative
Claim-Centric Reasoning in Logic-Based Argumentation. Proceedings of the Thirty-ThirdInternational
Joint Conference on Artificial Intelligence. https://doi.org/10.24963/ijcai.2024/377
bibtex: '@inproceedings{Hecher_Mahmood_Meier_Schmidt_2024, title={Quantitative Claim-Centric
Reasoning in Logic-Based Argumentation}, DOI={10.24963/ijcai.2024/377},
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} }'
chicago: Hecher, Markus, Yasir Mahmood, Arne Meier, and Johannes Schmidt. “Quantitative
Claim-Centric Reasoning in Logic-Based Argumentation.” In Proceedings of the
Thirty-ThirdInternational Joint Conference on Artificial Intelligence. International
Joint Conferences on Artificial Intelligence Organization, 2024. https://doi.org/10.24963/ijcai.2024/377.
ieee: 'M. Hecher, Y. Mahmood, A. Meier, and J. Schmidt, “Quantitative Claim-Centric
Reasoning in Logic-Based Argumentation,” 2024, doi: 10.24963/ijcai.2024/377.'
mla: Hecher, Markus, et al. “Quantitative Claim-Centric Reasoning in Logic-Based
Argumentation.” Proceedings of the Thirty-ThirdInternational Joint Conference
on Artificial Intelligence, International Joint Conferences on Artificial
Intelligence Organization, 2024, doi:10.24963/ijcai.2024/377.
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.'
date_created: 2024-08-19T16:21:51Z
date_updated: 2025-09-11T10:02:03Z
department:
- _id: '574'
doi: 10.24963/ijcai.2024/377
language:
- iso: eng
project:
- _id: '121'
name: 'TRR 318; TP B01: Ein dialogbasierter Ansatz zur Erklärung von Modellen des
maschinellen Lernens'
publication: Proceedings of the Thirty-ThirdInternational Joint Conference on Artificial
Intelligence
publication_status: published
publisher: International Joint Conferences on Artificial Intelligence Organization
status: public
title: Quantitative Claim-Centric Reasoning in Logic-Based Argumentation
type: conference
user_id: '99353'
year: '2024'
...
---
_id: '57814'
abstract:
- lang: eng
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."
author:
- first_name: Teemu
full_name: Hankala, Teemu
last_name: Hankala
- first_name: Miika
full_name: Hannula, Miika
last_name: Hannula
- first_name: Yasir
full_name: Mahmood, Yasir
id: '99353'
last_name: Mahmood
- first_name: Arne
full_name: Meier, Arne
last_name: Meier
citation:
ama: Hankala T, Hannula M, Mahmood Y, Meier A. Parameterised Complexity of Consistent
Query Answering via Graph Representations. arXiv:241208324. Published
online 2024.
apa: Hankala, T., Hannula, M., Mahmood, Y., & Meier, A. (2024). Parameterised
Complexity of Consistent Query Answering via Graph Representations. In arXiv:2412.08324.
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.” ArXiv:2412.08324,
2024.
ieee: T. Hankala, M. Hannula, Y. Mahmood, and A. Meier, “Parameterised Complexity
of Consistent Query Answering via Graph Representations,” arXiv:2412.08324.
2024.
mla: Hankala, Teemu, et al. “Parameterised Complexity of Consistent Query Answering
via Graph Representations.” ArXiv:2412.08324, 2024.
short: T. Hankala, M. Hannula, Y. Mahmood, A. Meier, ArXiv:2412.08324 (2024).
date_created: 2024-12-15T20:12:56Z
date_updated: 2025-09-11T10:01:35Z
department:
- _id: '574'
external_id:
arxiv:
- '2412.08324'
language:
- iso: eng
project:
- _id: '121'
name: 'TRR 318; TP B01: Ein dialogbasierter Ansatz zur Erklärung von Modellen des
maschinellen Lernens'
publication: arXiv:2412.08324
status: public
title: Parameterised Complexity of Consistent Query Answering via Graph Representations
type: preprint
user_id: '99353'
year: '2024'
...
---
_id: '61210'
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:
- first_name: Alexander
full_name: Becker, Alexander
last_name: Becker
- first_name: Mohamed
full_name: Sherif, Mohamed
id: '67234'
last_name: Sherif
orcid: https://orcid.org/0000-0002-9927-2203
- first_name: Axel-Cyrille
full_name: Ngonga Ngomo, Axel-Cyrille
id: '65716'
last_name: Ngonga Ngomo
citation:
ama: 'Becker A, Sherif M, Ngonga Ngomo A-C. Blink: Blank Node Matching Using Embeddings.
In: Lecture Notes in Computer Science. Springer Nature Switzerland; 2024.
doi:10.1007/978-3-031-77844-5_12'
apa: 'Becker, A., Sherif, M., & Ngonga Ngomo, A.-C. (2024). Blink: Blank Node
Matching Using Embeddings. In Lecture Notes in Computer Science. ISWC 2024: :
The 23ed International Semantic Web Conference, Baltimore, USA. Springer Nature
Switzerland. https://doi.org/10.1007/978-3-031-77844-5_12'
bibtex: '@inbook{Becker_Sherif_Ngonga Ngomo_2024, place={Cham}, title={Blink: Blank
Node Matching Using Embeddings}, DOI={10.1007/978-3-031-77844-5_12},
booktitle={Lecture Notes in Computer Science}, publisher={Springer Nature Switzerland},
author={Becker, Alexander and Sherif, Mohamed and Ngonga Ngomo, Axel-Cyrille},
year={2024} }'
chicago: 'Becker, Alexander, Mohamed Sherif, and Axel-Cyrille Ngonga Ngomo. “Blink:
Blank Node Matching Using Embeddings.” In Lecture Notes in Computer Science.
Cham: Springer Nature Switzerland, 2024. https://doi.org/10.1007/978-3-031-77844-5_12.'
ieee: 'A. Becker, M. Sherif, and A.-C. Ngonga Ngomo, “Blink: Blank Node Matching
Using Embeddings,” in Lecture Notes in Computer Science, Cham: Springer
Nature Switzerland, 2024.'
mla: 'Becker, Alexander, et al. “Blink: Blank Node Matching Using Embeddings.” Lecture
Notes in Computer Science, Springer Nature Switzerland, 2024, doi:10.1007/978-3-031-77844-5_12.'
short: 'A. Becker, M. Sherif, A.-C. Ngonga Ngomo, in: Lecture Notes in Computer
Science, Springer Nature Switzerland, Cham, 2024.'
conference:
end_date: 2024-11-15
location: Baltimore, USA
name: 'ISWC 2024: : The 23ed International Semantic Web Conference'
start_date: 2024-11-11
date_created: 2025-09-11T10:19:47Z
date_updated: 2025-09-11T10:34:02Z
department:
- _id: '574'
doi: 10.1007/978-3-031-77844-5_12
language:
- iso: eng
main_file_link:
- url: https://papers.dice-research.org/2024/ISWC_BLINK/public.pdf
place: Cham
project:
- _id: '285'
name: SAIL - Nachhaltiger Lebenszyklus von intelligenten soziotechnischen Systemen
publication: Lecture Notes in Computer Science
publication_identifier:
isbn:
- '9783031778438'
- '9783031778445'
issn:
- 0302-9743
- 1611-3349
publication_status: published
publisher: Springer Nature Switzerland
status: public
title: 'Blink: Blank Node Matching Using Embeddings'
type: book_chapter
user_id: '67234'
year: '2024'
...
---
_id: '54084'
author:
- first_name: Nikolaos
full_name: Karalis, Nikolaos
last_name: Karalis
- first_name: Alexander
full_name: Bigerl, Alexander
id: '72857'
last_name: Bigerl
- first_name: Liss
full_name: Heidrich, Liss
last_name: Heidrich
- first_name: Mohamed
full_name: Sherif, Mohamed
id: '67234'
last_name: Sherif
orcid: https://orcid.org/0000-0002-9927-2203
- first_name: Axel-Cyrille
full_name: Ngonga Ngomo, Axel-Cyrille
id: '65716'
last_name: Ngonga Ngomo
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: ESWC. ;
2024.'
apa: Karalis, N., Bigerl, A., Heidrich, L., Sherif, M., & Ngonga Ngomo, A.-C.
(2024). Efficient Evaluation of Conjunctive Regular Path Queries Using Multi-way
Joins. ESWC.
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} }'
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 ESWC, 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.
mla: Karalis, Nikolaos, et al. “Efficient Evaluation of Conjunctive Regular Path
Queries Using Multi-Way Joins.” ESWC, 2024.
short: 'N. Karalis, A. Bigerl, L. Heidrich, M. Sherif, A.-C. Ngonga Ngomo, in: ESWC,
2024.'
date_created: 2024-05-08T10:25:54Z
date_updated: 2025-09-11T10:36:03Z
department:
- _id: '574'
keyword:
- bigerl dice enexa heidrich karalis ngonga sail sherif
language:
- iso: eng
publication: ESWC
status: public
title: Efficient Evaluation of Conjunctive Regular Path Queries Using Multi-way Joins
type: conference
user_id: '67234'
year: '2024'
...
---
_id: '61219'
author:
- first_name: Ajay
full_name: Kumar, Ajay
last_name: Kumar
- first_name: Marius
full_name: Naumann, Marius
id: '94950'
last_name: Naumann
- first_name: Kevin
full_name: Henne, Kevin
id: '56918'
last_name: Henne
- first_name: Mohamed
full_name: Sherif, Mohamed
id: '67234'
last_name: Sherif
orcid: https://orcid.org/0000-0002-9927-2203
citation:
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. 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. Vol 3759. CEUR Workshop Proceedings.
CEUR-WS.org; 2024.'
apa: 'Kumar, A., Naumann, M., Henne, K., & 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, & 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 (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}
}'
chicago: 'Kumar, Ajay, Marius Naumann, Kevin Henne, and Mohamed Sherif. “PCFWebUI:
Data-Driven WebUI for Holistic Decarbonization Based on PCF-Tracking.” In 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, 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 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, Amsterdam,The
Netherlands, 2024, vol. 3759.'
mla: 'Kumar, Ajay, et al. “PCFWebUI: Data-Driven WebUI for Holistic Decarbonization
Based on PCF-Tracking.” 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, 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.'
conference:
end_date: 2024-09-19
location: ' Amsterdam,The Netherlands'
name: International Conference on Semantic Systems (SEMANTiCS 2024)
start_date: 2024-09-17
date_created: 2025-09-11T10:43:04Z
date_updated: 2025-09-11T10:46:35Z
department:
- _id: '574'
editor:
- first_name: Daniel
full_name: Garijo, Daniel
last_name: Garijo
- first_name: Anna Lisa
full_name: Gentile, Anna Lisa
last_name: Gentile
- first_name: Anelia
full_name: Kurteva, Anelia
last_name: Kurteva
- first_name: Andrea
full_name: Mannocci, Andrea
last_name: Mannocci
- first_name: Francesco
full_name: Osborne, Francesco
last_name: Osborne
- first_name: Sahar
full_name: Vahdati, Sahar
last_name: Vahdati
intvolume: ' 3759'
keyword:
- kumar sherif enexa climatebowl ingrid simba dice whale
language:
- iso: eng
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
publisher: CEUR-WS.org
series_title: CEUR Workshop Proceedings
status: public
title: 'PCFWebUI: Data-driven WebUI for holistic decarbonization based on PCF-Tracking'
type: conference
user_id: '67234'
volume: 3759
year: '2024'
...
---
_id: '55094'
author:
- first_name: Hamada Mohamed Abdelsamee
full_name: Zahera, Hamada Mohamed Abdelsamee
id: '72768'
last_name: Zahera
orcid: 0000-0003-0215-1278
- first_name: Ali
full_name: Manzoor, Ali
id: '77309'
last_name: Manzoor
orcid: https://orcid.org/0000-0001-8403-5160
- first_name: Mohamed
full_name: Sherif, Mohamed
id: '67234'
last_name: Sherif
orcid: https://orcid.org/0000-0002-9927-2203
- first_name: Diego
full_name: Moussallem, Diego
id: '71635'
last_name: Moussallem
- first_name: Axel-Cyrille
full_name: Ngonga Ngomo, Axel-Cyrille
id: '65716'
last_name: Ngonga Ngomo
citation:
ama: 'Zahera HMA, Manzoor A, Sherif M, Moussallem D, Ngonga Ngomo A-C. Generating
SPARQL from Natural Language Using Chain-of-Thoughts Prompting. In: SEMANTiCS.
; 2024.'
apa: Zahera, H. M. A., Manzoor, A., Sherif, M., Moussallem, D., & Ngonga Ngomo,
A.-C. (2024). Generating SPARQL from Natural Language Using Chain-of-Thoughts
Prompting. SEMANTiCS.
bibtex: '@inproceedings{Zahera_Manzoor_Sherif_Moussallem_Ngonga Ngomo_2024, place={Amsterdam,
Netherlands}, title={Generating SPARQL from Natural Language Using Chain-of-Thoughts
Prompting}, booktitle={SEMANTiCS}, author={Zahera, Hamada Mohamed Abdelsamee and
Manzoor, Ali and Sherif, Mohamed and Moussallem, Diego and Ngonga Ngomo, Axel-Cyrille},
year={2024} }'
chicago: Zahera, Hamada Mohamed Abdelsamee, Ali Manzoor, Mohamed Sherif, Diego Moussallem,
and Axel-Cyrille Ngonga Ngomo. “Generating SPARQL from Natural Language Using
Chain-of-Thoughts Prompting.” In SEMANTiCS. Amsterdam, Netherlands, 2024.
ieee: H. M. A. Zahera, A. Manzoor, M. Sherif, D. Moussallem, and A.-C. Ngonga Ngomo,
“Generating SPARQL from Natural Language Using Chain-of-Thoughts Prompting,” 2024.
mla: Zahera, Hamada Mohamed Abdelsamee, et al. “Generating SPARQL from Natural Language
Using Chain-of-Thoughts Prompting.” SEMANTiCS, 2024.
short: 'H.M.A. Zahera, A. Manzoor, M. Sherif, D. Moussallem, A.-C. Ngonga Ngomo,
in: SEMANTiCS, Amsterdam, Netherlands, 2024.'
date_created: 2024-07-05T13:59:24Z
date_updated: 2025-09-11T10:37:39Z
department:
- _id: '574'
keyword:
- TRR318 climatebowl colide dice enexa kiam manzoor moussallem ngonga sailproject
sherif simba zahera
language:
- iso: eng
place: Amsterdam, Netherlands
publication: SEMANTiCS
status: public
title: Generating SPARQL from Natural Language Using Chain-of-Thoughts Prompting
type: conference
user_id: '67234'
year: '2024'
...