Published in: OASIcs, Volume 126, Symposium on Scaling AI Assessments (SAIA 2024)
Carmen Frischknecht-Gruber, Philipp Denzel, Monika Reif, Yann Billeter, Stefan Brunner, Oliver Forster, Frank-Peter Schilling, Joanna Weng, and Ricardo Chavarriaga. AI Assessment in Practice: Implementing a Certification Scheme for AI Trustworthiness (Academic Track). In Symposium on Scaling AI Assessments (SAIA 2024). Open Access Series in Informatics (OASIcs), Volume 126, pp. 15:1-15:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)
@InProceedings{frischknechtgruber_et_al:OASIcs.SAIA.2024.15,
author = {Frischknecht-Gruber, Carmen and Denzel, Philipp and Reif, Monika and Billeter, Yann and Brunner, Stefan and Forster, Oliver and Schilling, Frank-Peter and Weng, Joanna and Chavarriaga, Ricardo},
title = {{AI Assessment in Practice: Implementing a Certification Scheme for AI Trustworthiness}},
booktitle = {Symposium on Scaling AI Assessments (SAIA 2024)},
pages = {15:1--15:18},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-95977-357-7},
ISSN = {2190-6807},
year = {2025},
volume = {126},
editor = {G\"{o}rge, Rebekka and Haedecke, Elena and Poretschkin, Maximilian and Schmitz, Anna},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.SAIA.2024.15},
URN = {urn:nbn:de:0030-drops-227554},
doi = {10.4230/OASIcs.SAIA.2024.15},
annote = {Keywords: AI Assessment, Certification Scheme, Artificial Intelligence, Trustworthiness of AI systems, AI Standards, AI Safety}
}
Published in: TGDK, Volume 1, Issue 1 (2023): Special Issue on Trends in Graph Data and Knowledge. Transactions on Graph Data and Knowledge, Volume 1, Issue 1
Claudia d'Amato, Louis Mahon, Pierre Monnin, and Giorgos Stamou. Machine Learning and Knowledge Graphs: Existing Gaps and Future Research Challenges. In Special Issue on Trends in Graph Data and Knowledge. Transactions on Graph Data and Knowledge (TGDK), Volume 1, Issue 1, pp. 8:1-8:35, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@Article{damato_et_al:TGDK.1.1.8,
author = {d'Amato, Claudia and Mahon, Louis and Monnin, Pierre and Stamou, Giorgos},
title = {{Machine Learning and Knowledge Graphs: Existing Gaps and Future Research Challenges}},
journal = {Transactions on Graph Data and Knowledge},
pages = {8:1--8:35},
year = {2023},
volume = {1},
number = {1},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/TGDK.1.1.8},
URN = {urn:nbn:de:0030-drops-194824},
doi = {10.4230/TGDK.1.1.8},
annote = {Keywords: Graph-based Learning, Knowledge Graph Embeddings, Large Language Models, Explainable AI, Knowledge Graph Completion \& Curation}
}
Published in: LIPIcs, Volume 21, 24th International Conference on Rewriting Techniques and Applications (RTA 2013)
Alexander Bau, Markus Lohrey, Eric Nöth, and Johannes Waldmann. Compression of Rewriting Systems for Termination Analysis. In 24th International Conference on Rewriting Techniques and Applications (RTA 2013). Leibniz International Proceedings in Informatics (LIPIcs), Volume 21, pp. 97-112, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2013)
@InProceedings{bau_et_al:LIPIcs.RTA.2013.97,
author = {Bau, Alexander and Lohrey, Markus and N\"{o}th, Eric and Waldmann, Johannes},
title = {{Compression of Rewriting Systems for Termination Analysis}},
booktitle = {24th International Conference on Rewriting Techniques and Applications (RTA 2013)},
pages = {97--112},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-53-8},
ISSN = {1868-8969},
year = {2013},
volume = {21},
editor = {van Raamsdonk, Femke},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.RTA.2013.97},
URN = {urn:nbn:de:0030-drops-40561},
doi = {10.4230/LIPIcs.RTA.2013.97},
annote = {Keywords: termination of rewriting, matrix interpretations, constraint solving, tree compression}
}