Özgür Lütfü Özçep
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Özgür Lütfü Özçep has a total of 93 co-authors. Here are the top co-authors by number of shared publications:
- Ralf Möller
University of Hamburg
10 shared publications - Björn Filter
Institute for Humanities-Centered AI (CHAI) University of Hamburg Germany
7 shared publications - Diedrich Wolter
University of Lübeck
7 shared publications - Mena Leemhuis
Johannes Kepler University Linz
7 shared publications - Christian Neuenstadt
University of Luebeck, Ratzeburger Allee 160, 23562, Lübeck, Germany
3 shared publications Mena Leemhuis
Institute of Information Systems University of Lübeck Ratzeburger Allee 160 23562 Lübeck Germany
3 shared publications
Latest Publications
- 20 March 2026
- Published by Springer Nature
- p. 109-120
Abductive Expansion for Belief Bases
- Open Access
- 28 February 2026
- Published by Elsevier in Information and Computation
- Vol. 310
A scalable mechanism for mutual fairness in allocating replicable resources
- 28 February 2026
- Published by Elsevier in Information and Computation
- Vol. 310
Open AccessA scalable mechanism for mutual fairness in allocating replicable resources
- 15 December 2025
- Published by Springer Nature
- p. 348-365
Fair Mechanisms for Replicable Resources: A General Approach Based on Analogical Beneficence
- 15 December 2025
- Published by Springer Nature
- p. 348-365
Fair Mechanisms for Replicable Resources: A General Approach Based on Analogical Beneficence
- 15 December 2025
- Published by Springer Nature
- p. 366-373
A Ratio-Based Shapley Value for Collaborative Machine Learning
- 15 December 2025
- Published by Springer Nature
- p. 366-373
A Ratio-Based Shapley Value for Collaborative Machine Learning
- Open Access
- 21 October 2025
- Published by IOS Press
- p. 1278-1285
A Mechanism for Mutual Fairness in Cooperative Games with Replicable Resources
The latest developments in AI focus on agentic systems where artificial and human agents cooperate to realize global goals. An example is collaborative learning, which aims to train a global model based on data from individual agents. A major challenge in designing such systems is to guarantee safety and alignment with human values, particularly a fair distribution of rewards upon achieving the global goal. Cooperative game theory offers useful abstractions of cooperating agents via value functions, which assign value to each coalition, and via reward functions. With these, the idea of fair allocation can be formalized by specifying fairness axioms and designing concrete mechanisms. Classical cooperative game theory, exemplified by the Shapley value, does not fully capture scenarios like collaborative learning, as it assumes non-replicable resources, whereas data and models can be replicated. Infinite replicability requires a generalized notion of fairness, formalized through new axioms and mechanisms. These must address imbalances in reciprocal benefits among participants, which can lead to strategic exploitation and unfair allocations. The main contribution of this paper is a mechanism and a proof that it fulfills the property of mutual fairness, formalized by the Balanced Reciprocity Axiom. It ensures that, for every pair of players, each benefits equally from the participation of the other.
- 21 October 2025
- Published by IOS Press
- p. 1278-1285
Open AccessA Mechanism for Mutual Fairness in Cooperative Games with Replicable Resources
The latest developments in AI focus on agentic systems where artificial and human agents cooperate to realize global goals. An example is collaborative learning, which aims to train a global model based on data from individual agents. A major challenge in designing such systems is to guarantee safety and alignment with human values, particularly a fair distribution of rewards upon achieving the global goal. Cooperative game theory offers useful abstractions of cooperating agents via value functions, which assign value to each coalition, and via reward functions. With these, the idea of fair allocation can be formalized by specifying fairness axioms and designing concrete mechanisms. Classical cooperative game theory, exemplified by the Shapley value, does not fully capture scenarios like collaborative learning, as it assumes non-replicable resources, whereas data and models can be replicated. Infinite replicability requires a generalized notion of fairness, formalized through new axioms and mechanisms. These must address imbalances in reciprocal benefits among participants, which can lead to strategic exploitation and unfair allocations. The main contribution of this paper is a mechanism and a proof that it fulfills the property of mutual fairness, formalized by the Balanced Reciprocity Axiom. It ensures that, for every pair of players, each benefits equally from the participation of the other.
- Open Access
- 6 October 2025
- Published by Springer Nature in International Journal of Digital Humanities
- Vol. 7 (3) , 417-441
Ontology-based federated information systems with NLP-enhanced retrieval
Analysing large volumes of humanities data requires considerable time and resources due to the high and varied requirements of researchers in terms of data presentation. In addition, humanities scholars wish to enter their search queries in natural language, quickly synchronising distributed data. Efficient approaches, such as DBoD (DataBasing on Demand), can quickly transfer and insert research data into a database. Natural Language Processing (NLP) is used to make these systems more intuitive and user-friendly, and the use of Ontology-based Data Access (OBDA) ensures that the distributed datasets are mapped semantically correctly. In this article, we explain – using a large dataset from the field of epigraphy – how to build a federated information system that supports natural language queries and how OBDA ensures the semantically correct mapping of distributed datasets. We have significantly reduced the implementation time of information systems and a federated information system from months or years to hours. The research data are project-specific and published in a federated information system, complete with the required styles, allowing direct access to the information. In addition, we have a high usability of the federated information systems with NLP-enhanced retrieval.
- 6 October 2025
- Published by Springer Nature in International Journal of Digital Humanities
- Vol. 7 (3) , 417-441
Open AccessOntology-based federated information systems with NLP-enhanced retrieval
Analysing large volumes of humanities data requires considerable time and resources due to the high and varied requirements of researchers in terms of data presentation. In addition, humanities scholars wish to enter their search queries in natural language, quickly synchronising distributed data. Efficient approaches, such as DBoD (DataBasing on Demand), can quickly transfer and insert research data into a database. Natural Language Processing (NLP) is used to make these systems more intuitive and user-friendly, and the use of Ontology-based Data Access (OBDA) ensures that the distributed datasets are mapped semantically correctly. In this article, we explain – using a large dataset from the field of epigraphy – how to build a federated information system that supports natural language queries and how OBDA ensures the semantically correct mapping of distributed datasets. We have significantly reduced the implementation time of information systems and a federated information system from months or years to hours. The research data are project-specific and published in a federated information system, complete with the required styles, allowing direct access to the information. In addition, we have a high usability of the federated information systems with NLP-enhanced retrieval.
- 1 September 2025
- Published by Springer Nature
- p. 18-31
Balanced Reciprocity for Data Sharing—Axiomatization and Mechanism Design
- 1 September 2025
- Published by Springer Nature
- p. 18-31
Balanced Reciprocity for Data Sharing—Axiomatization and Mechanism Design
- 22 April 2025
- Published by Wiley in Advanced Engineering Materials
- Vol. 27 (8)
Concepts for a Semantically Accessible Materials Data Space: Overview over Specific Implementations in Materials Science
- 22 April 2025
- Published by Wiley in Advanced Engineering Materials
- Vol. 27 (8)
Concepts for a Semantically Accessible Materials Data Space: Overview over Specific Implementations in Materials Science
- Open Access
- 18 December 2024
- Published by Wiley in Advanced Engineering Materials
- Vol. 27 (8)
Concepts for a Semantically Accessible Materials Data Space: Overview over Specific Implementations in Materials Science
This article describes advancements in the ongoing digital transformation in materials science and engineering. It is driven by domain‐specific successes and the development of specialized digital data spaces. There is an evident and increasing need for standardization across various subdomains to support science data exchange across entities. The MaterialDigital Initiative, funded by the German Federal Ministry of Education and Research, takes on a key role in this context, fostering collaborative efforts to establish a unified materials data space. The implementation of digital workflows and Semantic Web technologies, such as ontologies and knowledge graphs, facilitates the semantic integration of heterogeneous data and tools at multiple scales. Central to this effort is the prototyping of a knowledge graph that employs application ontologies tailored to specific data domains, thereby enhancing semantic interoperability. The collaborative approach of the Initiative's community provides significant support infrastructure for understanding and implementing standardized data structures, enhancing the efficiency of data‐driven processes in materials development and discovery. Insights and methodologies developed via the MaterialDigital Initiative emphasize the transformative potential of ontology‐based approaches in materials science, paving the way toward simplified integration into a unified, consolidated data space of high value.
- 18 December 2024
- Published by Wiley in Advanced Engineering Materials
- Vol. 27 (8)
Open AccessConcepts for a Semantically Accessible Materials Data Space: Overview over Specific Implementations in Materials Science
This article describes advancements in the ongoing digital transformation in materials science and engineering. It is driven by domain‐specific successes and the development of specialized digital data spaces. There is an evident and increasing need for standardization across various subdomains to support science data exchange across entities. The MaterialDigital Initiative, funded by the German Federal Ministry of Education and Research, takes on a key role in this context, fostering collaborative efforts to establish a unified materials data space. The implementation of digital workflows and Semantic Web technologies, such as ontologies and knowledge graphs, facilitates the semantic integration of heterogeneous data and tools at multiple scales. Central to this effort is the prototyping of a knowledge graph that employs application ontologies tailored to specific data domains, thereby enhancing semantic interoperability. The collaborative approach of the Initiative's community provides significant support infrastructure for understanding and implementing standardized data structures, enhancing the efficiency of data‐driven processes in materials development and discovery. Insights and methodologies developed via the MaterialDigital Initiative emphasize the transformative potential of ontology‐based approaches in materials science, paving the way toward simplified integration into a unified, consolidated data space of high value.
- Open Access
- 30 November 2024
- Published by Wiley in Advanced Engineering Materials
- Vol. 27 (8)
Modeling and Accessing Smart Materials with Integrity Constraints in the Shapes Constraint Language and Ontologies—The SmaDi Way
Various types of semantic artifacts play a vital role in developing software systems, for example, information systems for materials scientists that adhere to the findability, accessibility, interoperability, reusability principles for digital assets. Among them, integrity constraints (ICs) are essential artifacts as they orthogonally add to the representation capabilities of ontologies a means to enforce consistency and completeness of given data. An IC language recommended by the worldwide web consortium (W3C) for use with linked open data is Shapes Constraint Language (SHACL). This article discusses the algorithm and evaluation results for a new SHACL validator developed in the context of SmaDi, a project for digitalizing smart materials associated with MaterialDigital. The new validator reduces SHACL constraints to SPARQL Protocol and RDF Query Language (SPARQL) queries, that is, queries in the W3C recommended query language over repositories represented in the standard syntax for linked open data, RDF. Hence, in contrast to off‐the‐shelf validators, it can be used with any SPARQL endpoint, even if there is only a (virtual) view of the RDF data. The article demonstrates the use of SHACL ICs for modeling some simple constraints over smart materials. The evaluation shows that our SHACL validator has processing times comparable to off‐the‐shelf SHACL validators.
- 30 November 2024
- Published by Wiley in Advanced Engineering Materials
- Vol. 27 (8)
Open AccessModeling and Accessing Smart Materials with Integrity Constraints in the Shapes Constraint Language and Ontologies—The SmaDi Way
Various types of semantic artifacts play a vital role in developing software systems, for example, information systems for materials scientists that adhere to the findability, accessibility, interoperability, reusability principles for digital assets. Among them, integrity constraints (ICs) are essential artifacts as they orthogonally add to the representation capabilities of ontologies a means to enforce consistency and completeness of given data. An IC language recommended by the worldwide web consortium (W3C) for use with linked open data is Shapes Constraint Language (SHACL). This article discusses the algorithm and evaluation results for a new SHACL validator developed in the context of SmaDi, a project for digitalizing smart materials associated with MaterialDigital. The new validator reduces SHACL constraints to SPARQL Protocol and RDF Query Language (SPARQL) queries, that is, queries in the W3C recommended query language over repositories represented in the standard syntax for linked open data, RDF. Hence, in contrast to off‐the‐shelf validators, it can be used with any SPARQL endpoint, even if there is only a (virtual) view of the RDF data. The article demonstrates the use of SHACL ICs for modeling some simple constraints over smart materials. The evaluation shows that our SHACL validator has processing times comparable to off‐the‐shelf SHACL validators.