@article{54566,
  author       = {{Göllner, Denis and Dzienus, Sophie and Rasor, Rik and Anacker, Harald and Dumitrescu, Roman}},
  issn         = {{2212-8271}},
  journal      = {{Procedia CIRP}},
  location     = {{Kapstadt}},
  pages        = {{1433--1438}},
  publisher    = {{Elsevier BV}},
  title        = {{{Guidelines for providing digital twins}}},
  doi          = {{10.1016/j.procir.2023.09.189}},
  volume       = {{120}},
  year         = {{2023}},
}

@inproceedings{54568,
  author       = {{Machon, Fabian and Haarmann, Lennard and Rabe, Martin and Dumitrescu, Roman and Bierbüsse, Marie and Tack, Mareen and Hanke, Rebecca and Kinder, Daniel}},
  booktitle    = {{Vorausschau und Technologieplanung}},
  editor       = {{Dumitrescu, Roman and Hölzle, Katharina}},
  isbn         = {{978-3-947647-32-3}},
  location     = {{Berlin}},
  title        = {{{Mehr Innovationen durch Venture Clienting – Fallstudie zur Initiative „Stratosfare“}}},
  volume       = {{413}},
  year         = {{2023}},
}

@inproceedings{54569,
  author       = {{Wiederkehr, Ingrid and Koldewey, Christian and Dumitrescu, Roman and Schlegel, Michael and Albers, Albert }},
  location     = {{Ljubljana}},
  title        = {{{Bridging the Gap between Product Innovation and Product Planning: A literature-based Conceptual Investigation}}},
  year         = {{2023}},
}

@inproceedings{35942,
  abstract     = {{Partial coverage of the traditional grid is one of the factors that con-tribute to the low electrical energy access levels in developing countries. This often results in long distances between the grid and unconnected communities. Microgrids, due to their distributed energy resources, have the potential to increase energy access levels. However, there is limited access to microgrids-related knowledge. The knowledge is essential for the effective and efficient use of energy, operation, and hence sustainability of microgrids. To contribute to the sustainability of microgrids, a Virtual and Interactive Microgrids Learning Environment (VIMLE) for microgrids knowledge transfer is developed. VIMLE development is guided by design-based research. With knowledge transfer and skills acquisition through the use of VIMLE, local capacity for designing, installing, operating and maintenance of microgrids is built. Skilled local capacity will contribute to microgrids sustainability. Hence, improve electrical energy access levels and contribute to the achievement of SDG 7.}},
  author       = {{Bogere, Paul and Bode, Henrik and Temmen, Katrin}},
  booktitle    = {{Learning in the Age of Digital and Green Transition. ICL 2022. Lecture Notes in Networks and Systems}},
  editor       = {{E. Auer, Michael and Pachatz, Wolfgang and Rüütmann, Tiia}},
  keywords     = {{Knowledge Transfer, Microgrids, Sustainability}},
  location     = {{Wien}},
  pages        = {{671 -- 679}},
  publisher    = {{Springer Nature}},
  title        = {{{Work in Progress: Development of a Virtual and Interactive Microgrids Learning Environment for Microgrids Sustainability – The case of East Africa}}},
  doi          = {{https://doi.org/10.1007/978-3-031-26876-2_63}},
  volume       = {{633}},
  year         = {{2023}},
}

@inproceedings{54571,
  author       = {{Schlegel, Michael and Wiederkehr, Ingrid and Rapp, Simon and Koldewey, Christian and Albers, Albert and Dumitrescu, Roman}},
  booktitle    = {{Procedia CIRP}},
  editor       = {{Liu, Ang  and Kara, Sami}},
  issn         = {{2212-8271}},
  location     = {{Sydney}},
  pages        = {{764--769}},
  publisher    = {{Elsevier BV}},
  title        = {{{Ontology for Future-robust Product Portfolio Evolution: A Basis for the Development of Models and Methods}}},
  doi          = {{10.1016/j.procir.2023.01.017}},
  volume       = {{119}},
  year         = {{2023}},
}

@inproceedings{48499,
  author       = {{Bogere, Paul and Temmen, Katrin and Bode, Henrik}},
  booktitle    = {{2023 IEEE Global Engineering Education Conference (EDUCON)}},
  publisher    = {{IEEE}},
  title        = {{{Knowledge Transfer Concepts for Microgrids Sustainability - The Case of East Africa}}},
  doi          = {{10.1109/educon54358.2023.10125208}},
  year         = {{2023}},
}

@inproceedings{54574,
  author       = {{Weller, Julian and Nico Migenda, Nico Migenda and Rui Liu, Rui Liu and Arthur Wegel, Arthur Wegel and Martin Kohlhase, Martin Kohlhase and Wolfram Schenck, Wolfram Schenck and Sebastian von Enzberg, Sebastian von Enzberg and Dumitrescu, Roman}},
  location     = {{Hamburg}},
  title        = {{{Towards a systematic approach for Prescriptive Analytics use cases in smart factories}}},
  year         = {{2023}},
}

@inproceedings{54556,
  author       = {{Bogere, Paul and Bode, Henrik and Temmen, Katrin}},
  booktitle    = {{2023 IEEE AFRICON}},
  publisher    = {{IEEE}},
  title        = {{{Skill Sets for Microgrids Sustainability - The Case of East Africa}}},
  doi          = {{10.1109/africon55910.2023.10293306}},
  year         = {{2023}},
}

@inproceedings{50797,
  author       = {{Röder, Michael and Kuchelev, Denis and Ngonga Ngomo, Axel-Cyrille}},
  booktitle    = {{Knowledge Graphs and Semantic Web}},
  editor       = {{Ortiz-Rodriguez, Fernando and Villazón-Terrazas, Boris and Tiwari, Sanju and Bobed, Carlos}},
  isbn         = {{978-3-031-47745-4}},
  keywords     = {{sail dice roeder kuchelev ngonga}},
  pages        = {{183–198}},
  publisher    = {{Springer Nature Switzerland}},
  title        = {{{A Topic Model for the Data Web}}},
  doi          = {{10.1007/978-3-031-47745-4_14}},
  year         = {{2023}},
}

@inbook{46516,
  abstract     = {{Linked knowledge graphs build the backbone of many data-driven applications such as search engines, conversational agents and e-commerce solutions. Declarative link discovery frameworks use complex link specifications to express the conditions under which a link between two resources can be deemed to exist. However, understanding such complex link specifications is a challenging task for non-expert users of link discovery frameworks. In this paper, we address this drawback by devising NMV-LS, a language model-based verbalization approach for translating complex link specifications into natural language. NMV-LS relies on the results of rule-based link specification verbalization to apply continuous training on T5, a large language model based on the Transformerarchitecture. We evaluated NMV-LS on English and German datasets using well-known machine translation metrics such as BLUE, METEOR, ChrF++ and TER. Our results suggest that our approach achieves a verbalization performance close to that of humans and outperforms state of the art approaches. Our source code and datasets are publicly available at https://github.com/dice-group/NMV-LS.}},
  author       = {{Ahmed, Abdullah Fathi Ahmed and Firmansyah, Asep Fajar and Sherif, Mohamed and Moussallem, Diego and Ngonga Ngomo, Axel-Cyrille}},
  booktitle    = {{Natural Language Processing and Information Systems}},
  isbn         = {{9783031353192}},
  issn         = {{0302-9743}},
  publisher    = {{Springer Nature Switzerland}},
  title        = {{{Explainable Integration of Knowledge Graphs Using Large Language Models}}},
  doi          = {{10.1007/978-3-031-35320-8_9}},
  year         = {{2023}},
}

@inproceedings{54581,
  author       = {{Manzoor, Ali and Saleem, Muhammad and Ngonga Ngomo, Axel-Cyrille}},
  booktitle    = {{2023 IEEE 17th International Conference on Semantic Computing (ICSC)}},
  pages        = {{274–277}},
  title        = {{{Unsupervised Relation Extraction with Sentence level Distributional Semantics}}},
  year         = {{2023}},
}

@phdthesis{54607,
  author       = {{Röder, Michael}},
  keywords     = {{dice roeder}},
  publisher    = {{Paderborn University}},
  title        = {{{Automating the Discovery of Linking Candidates}}},
  doi          = {{10.17619/UNIPB/1-1666}},
  year         = {{2023}},
}

@inproceedings{54612,
  author       = {{KOUAGOU, N'Dah Jean and Heindorf, Stefan and Demir, Caglar and Ngonga Ngomo, Axel-Cyrille}},
  booktitle    = {{NeSy 2023, 17th International Workshop on Neural-Symbolic Learning and Reasoning, Certosa di Pontignano, Siena, Italy}},
  keywords     = {{318 SFB-TRR demir dice enexa heindorf knowgraphs kouagou ngonga sail}},
  publisher    = {{CEUR-WS}},
  title        = {{{Neural Class Expression Synthesis (Extended Abstract)}}},
  year         = {{2023}},
}

@inproceedings{54608,
  author       = {{Zahera, Hamada Mohamed Abdelsamee and Vitiugin, Fedor and Sherif, Mohamed and Castillo, Carlos and Ngonga Ngomo, Axel-Cyrille}},
  booktitle    = {{SEMANTiCS}},
  keywords     = {{dice kiam ngonga porque sherif zahera}},
  title        = {{{Using Pre-trained Language Models for Abstractive DBPEDIA Summarization: A Comparative Study}}},
  year         = {{2023}},
}

@inproceedings{54610,
  author       = {{Wilke, Adrian and Ngonga Ngomo, Axel-Cyrille}},
  booktitle    = {{The Semantic Web (ESWC 2023)}},
  keywords     = {{dice eml4u ngonga opal wilke}},
  title        = {{{LauNuts: A Knowledge Graph to identify and compare geographic regions in the European Union}}},
  year         = {{2023}},
}

@inproceedings{54611,
  author       = {{Karalis, Nikolaos and Bigerl, Alexander and Ngonga Ngomo, Axel-Cyrille}},
  booktitle    = {{SEMANTiCS}},
  keywords     = {{bigerl dice enexa karalis knowgraphs ngonga sail}},
  title        = {{{Native Execution of GraphQL Queries over RDF Graphs Using Multi-way Joins}}},
  year         = {{2023}},
}

@article{54577,
  abstract     = {{<jats:p>Argumentation is a well-established formalism dealing with conflicting information by generating and comparing arguments. It has been playing a major role in AI for decades. In logic-based argumentation, we explore the internal structure of an argument. Informally, a set of formulas is the support for a given claim if it is consistent, subset-minimal, and implies the claim. In such a case, the pair of the support and the claim together is called an argument. In this article, we study the propositional variants of the following three computational tasks studied in argumentation: ARG (exists a support for a given claim with respect to a given set of formulas), ARG-Check (is a given set a support for a given claim), and ARG-Rel (similarly as ARG plus requiring an additionally given formula to be contained in the support). ARG-Check is complete for the complexity class DP, and the other two problems are known to be complete for the second level of the polynomial hierarchy (Creignou et al. 2014 and Parson et al., 2003) and, accordingly, are highly intractable. Analyzing the reason for this intractability, we perform a two-dimensional classification: First, we consider all possible propositional fragments of the problem within Schaefer’s framework (STOC 1978) and then study different parameterizations for each of the fragments. We identify a list of reasonable structural parameters (size of the claim, support, knowledge base) that are connected to the aforementioned decision problems. Eventually, we thoroughly draw a fine border of parameterized intractability for each of the problems showing where the problems are fixed-parameter tractable and when this exactly stops. Surprisingly, several cases are of very high intractability (para-NP and beyond).</jats:p>}},
  author       = {{Mahmood, Yasir and Meier, Arne and Schmidt, Johannes}},
  issn         = {{1529-3785}},
  journal      = {{ACM Transactions on Computational Logic}},
  number       = {{3}},
  pages        = {{1--25}},
  publisher    = {{Association for Computing Machinery (ACM)}},
  title        = {{{Parameterized Complexity of Logic-based Argumentation in Schaefer’s Framework}}},
  doi          = {{10.1145/3582499}},
  volume       = {{24}},
  year         = {{2023}},
}

@inproceedings{54578,
  abstract     = {{<jats:p>Argumentation is a well-established formalism for nonmonotonic reasoning and a vibrant area of research in AI. Claim-augmented argumentation frameworks (CAFs) have been introduced to deploy a conclusion-oriented perspective. CAFs expand argumentation frameworks by an additional step which involves retaining claims for an accepted set of arguments. We introduce a novel concept of a justification status for claims, a quantitative measure of extensions supporting a particular claim. The well-studied problems of credulous and skeptical reasoning can then be seen as simply the two endpoints of the spectrum when considered as a justification level of a claim. Furthermore, we explore the parameterized complexity of various reasoning problems for CAFs, including the quantitative reasoning for claim assertions. We begin by presenting a suitable graph representation that includes arguments and their associated claims. Our analysis includes the parameter treewidth, and we present decomposition-guided reductions between reasoning problems in CAF and the validity problem for QBF.</jats:p>}},
  author       = {{Fichte, Johannes K. and Hecher, Markus and Mahmood, Yasir and Meier, Arne}},
  booktitle    = {{Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence}},
  publisher    = {{International Joint Conferences on Artificial Intelligence Organization}},
  title        = {{{Quantitative Reasoning and Structural Complexity for Claim-Centric Argumentation}}},
  doi          = {{10.24963/ijcai.2023/358}},
  year         = {{2023}},
}

@inbook{54579,
  author       = {{Mahmood, Yasir and Virtema, Jonni}},
  booktitle    = {{Logic, Language, Information, and Computation}},
  isbn         = {{9783031397837}},
  issn         = {{0302-9743}},
  publisher    = {{Springer Nature Switzerland}},
  title        = {{{Parameterized Complexity of Propositional Inclusion and Independence Logic}}},
  doi          = {{10.1007/978-3-031-39784-4_17}},
  year         = {{2023}},
}

@inproceedings{54089,
  author       = {{Hannula, Miika and Hirvonen, Minna and Kontinen, Juha and Mahmood, Yasir and Meier, Arne and Virtema, Jonni}},
  booktitle    = {{18th European Conference on Logics in Artificial Intelligence, JELIA 2023, Proceedings}},
  keywords     = {{dice enexa mahmood}},
  title        = {{{Logics with probabilistic team semantics and the Boolean negation}}},
  year         = {{2023}},
}