@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}},
}

@inbook{54613,
  author       = {{Hanselle, Jonas Manuel and Hüllermeier, Eyke and Mohr, Felix and Ngonga Ngomo, Axel-Cyrille and Sherif, Mohamed and Tornede, Alexander and Wever, Marcel Dominik}},
  booktitle    = {{On-The-Fly Computing – Individualized IT-services in dynamic markets}},
  editor       = {{Haake, Claus-Jochen and Meyer auf der Heide, Friedhelm and Platzner, Marco and Wachsmuth, Henning and Wehrheim, Heike}},
  keywords     = {{dice ngonga sfb901 sherif}},
  pages        = {{85–104}},
  publisher    = {{Heinz Nixdorf Institut, Universität Paderborn}},
  title        = {{{Configuration and Evaluation}}},
  doi          = {{10.5281/zenodo.8068466}},
  volume       = {{412}},
  year         = {{2023}},
}

@inproceedings{54614,
  author       = {{Srivastava, Nikit and Perevalov, Aleksandr and Kuchelev, Denis and Moussallem, Diego and Ngonga Ngomo, Axel-Cyrille and Both, Andreas}},
  booktitle    = {{Proceedings of the 12th Knowledge Capture Conference 2023, {K-CAP} 2023, Pensacola, FL, USA, December 5-7, 2023}},
  editor       = {{Venable, Kristen Brent and Garijo, Daniel and Jalaian, Brian}},
  keywords     = {{dice kuchelev moussallem ngonga srivastava}},
  pages        = {{122–130}},
  publisher    = {{ACM}},
  title        = {{{Lingua Franca - Entity-Aware Machine Translation Approach for Question Answering over Knowledge Graphs}}},
  doi          = {{10.1145/3587259.3627567}},
  year         = {{2023}},
}

@inproceedings{54615,
  author       = {{Demir, Caglar and Ngonga Ngomo, Axel-Cyrille}},
  booktitle    = {{Advances in Intelligent Data Analysis XXI: 21st International Symposium on Intelligent Data Analysis, IDA 2023, Louvain-la-Neuve, Belgium, April 12–14, 2023, Proceedings}},
  keywords     = {{318 SFB-TRR demir dice enexa ngonga sail}},
  pages        = {{103–115}},
  title        = {{{Learning Permutation-Invariant Embeddings for Description Logic Concepts}}},
  year         = {{2023}},
}

@inproceedings{54616,
  author       = {{Becker, Alexander and Ahmed, Abdullah Fathi Ahmed and Sherif, Mohamed and Ngonga Ngomo, Axel-Cyrille}},
  booktitle    = {{SEMANTiCS}},
  keywords     = {{ahmed becker dice ngonga sail sherif}},
  title        = {{{COBALT: A Content-Based Similarity Approach for Link Discovery over Geospatial Knowledge Graphs}}},
  year         = {{2023}},
}

@inproceedings{54618,
  author       = {{Wilke, Daria  and Grewe, Carolin and Thavathilakarjah, Dhusjanth and Anacker, Harald and Dumitrescu, Roman}},
  location     = {{Kapstadt}},
  title        = {{{Method Engineering – a Systematic Literature Review on Scopus Base}}},
  year         = {{2023}},
}

@inproceedings{54620,
  author       = {{Seidenberg, Tobias and Ayoub, Joe and Figge, Mike and Anacker, Harald and Dumitrescu, Roman}},
  location     = {{Bangkok}},
  title        = {{{Method to support the selection of localization technologies for Industry 4.0}}},
  year         = {{2023}},
}

@inproceedings{54621,
  author       = {{Schreiner, Nick and Kürpick, Christian and Kühn, Arno and Dumitrescu, Roman}},
  location     = {{Buenos Aires}},
  title        = {{{Sustainability Data Map: Framework for Data-Based Product Carbon Footprinting of Technical Products}}},
  year         = {{2023}},
}

@article{47845,
  author       = {{Aslan, Fatma and Duman, Papatya and Trockel, Walter}},
  journal      = {{Economics Bulletin}},
  number       = {{3}},
  pages        = {{1279--1285}},
  title        = {{{PEA: core-analogue for non-cohesive games}}},
  volume       = {{43}},
  year         = {{2023}},
}

@misc{54622,
  author       = {{Gabriel, Stefan and Fechtelpeter,, Christian and Wulf, Jessica and Leßmann, Salome and Dumitrescu, Roman}},
  title        = {{{Transferkonzept eines Kompetenzzentrums der Arbeitsforschung in einer von mittelständischen Unternehmen geprägten Region}}},
  year         = {{2023}},
}

@inproceedings{47306,
  author       = {{Herbert, Franziska and Becker, Steffen and Schaewitz, Leonie and Hielscher, Jonas and Kowalewski, Marvin and Sasse, M. Angela and Acar, Yasemin and Dürmuth, Markus}},
  booktitle    = {{Proceedings of the 2023 CHI Conference on Human Factors in Computing Systems, CHI 2023, Hamburg, Germany, April 23-28, 2023}},
  editor       = {{Schmidt, Albrecht and Väänänen, Kaisa and Goyal, Tesh and Kristensson, Per Ola and Peters, Anicia and Mueller, Stefanie and Williamson, Julie R. and Wilson, Max L.}},
  pages        = {{582:1–582:23}},
  publisher    = {{ACM}},
  title        = {{{A World Full of Privacy and Security (Mis)conceptions? Findings of a Representative Survey in 12 Countries}}},
  doi          = {{10.1145/3544548.3581410}},
  year         = {{2023}},
}

@inproceedings{47304,
  author       = {{Wermke, Dominik and Klemmer, Jan H. and Wöhler, Noah and Schmüser, Juliane and Sri Ramulu, Harshini and Acar, Yasemin and Fahl, Sascha}},
  booktitle    = {{44th IEEE Symposium on Security and Privacy, SP 2023, San Francisco, CA, USA, May 21-25, 2023}},
  pages        = {{1545–1560}},
  publisher    = {{IEEE}},
  title        = {{{"Always Contribute Back": A Qualitative Study on Security Challenges of the Open Source Supply Chain}}},
  doi          = {{10.1109/SP46215.2023.10179378}},
  year         = {{2023}},
}