Speaker
Description
In the MathAlgoDB (formerly AlgoData) project, we focus on the Findability part of the FAIR principles in scientific computing.
Currently, there is no way of directly discovering matching algorithms for a problem with specific properties, corresponding publications, benchmarks, and implementations. We fix this problem by creating a structured, curated database that adheres to a strict ontology and provide interfaces for easy access to its contents.
In a first step, an ontology for algorithms in scientific computing has been developed. A knowledge graph based on that ontology has been created in sample fields. A user interface that allows interaction with the graph has been implemented. Recently, an editor interface that allows appointed editors to easily add data and users to propose contents was established.
In the talk, we will focus on use cases, further development of the ontology, and the connection to the model ontology MathModDB.
