EDBT 2026 Demo / reviewers in the wild / expert
Martin Liebenberg
dblp:146/7980
· DBLP profile ↗
5ranked-venue papers
2as first author
2since 2021 · last 2023
0000-0002-6105-6716ORCID · verified
Domains — the database's venue-derived domains; a paper can count in several
Computer networks · 2 · 1 since 2021Databases, data management, data science and information retrieval · 2 · 2 first-author · 1 since 2021Artificial intelligence and machine learning · 1Software engineering, systems software and programming languages · 1 · 1 first-authorGraphics, computer vision, multimedia, augmented reality and games · 1
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Artificial intelligence
1 paper |
Knowledge representation and reasoning · 100% | |
| Theoretical computer science
1 paper |
Automated reasoning and model checking · 50% Logic in computer science · 50% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Knowledge, reasoning and agents › Knowledge representation and reasoning › reasoning about action and change › reasoning about actions
golog |
0.2 | 1 | 2014 | Exploring the Boundaries of Decidable Verification of Non-Terminating Golog Programs · AAAI 2014 |
Knowledge, reasoning and agents › Knowledge representation and reasoning › reasoning about action and change
reasoning about actions |
0.2 | 1 | 2014 | Exploring the Boundaries of Decidable Verification of Non-Terminating Golog Programs · AAAI 2014 |
Logic in computer science
semantics |
0.2 | 1 | 2014 | Exploring the Boundaries of Decidable Verification of Non-Terminating Golog Programs · AAAI 2014 |
Automated reasoning and model checking
temporal logic verification |
0.2 | 1 | 2014 | Exploring the Boundaries of Decidable Verification of Non-Terminating Golog Programs · AAAI 2014 |
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2023 | Information systems engineering with Digital Shadows: Concept and use cases in the Internet of ProductionabstractEntering the second decade of the Industrie 4.0 vision, the production sector is facing challenges in taking full advantage of global digitalization. Production research has focused on sophisticated mathematical models ranging from molecular materials modeling to production control to supply chain logistics. These models help simulate and control the related physical system but the variety of individual situations and behaviors is captured only as statistical uncertainty. The emergence of data-driven methods adds statistical or AI models learned from real-time production data to Digital Twins, and ideally allows for continuous synchronization (twinning) between physical and virtual system. However, the complexity of today’s production systems precludes Digital Twins covering more than just a few system perspectives, especially if realtime performance is required. To achieve better performance and more precise context adaptation, the interdisciplinary research cluster “Internet of Production” at RWTH Aachen University is exploring the concept of Digital Shadows. We conceptualize Digital Shadows as a generalization of compact views on dynamic processes, whose defining “query” combines condensed measurement data with efficient simplified mathematical models. Their small size makes Digital Shadows amenable to dynamic function allocation in hybrid cloud–edge settings. In addition to showing the similarities and differences to the traditional view concept, we also present a conceptual embedding of Digital Shadows in the context of large distributed system architectures, and sovereign data exchange in international Data Space communities. Two production use case experiences demonstrate that Digital Shadows can be valuable carriers of deep and reusable engineering knowledge for technical and ecological progress. Martin Liebenberg, Matthias Jarke |
Inf. Syst. | 1 |
| 2022 | A Computer Science Perspective on Digital Transformation in ProductionabstractThe Industrial Internet-of-Things (IIoT) promises significant improvements for the manufacturing industry by facilitating the integration of manufacturing systems by Digital Twins. However, ecological and economic demands also require a cross-domain linkage of multiple scientific perspectives from material sciences, engineering, operations, business, and ergonomics, as optimization opportunities can be derived from any of these perspectives. To extend the IIoT to a trueInternet of Production, two concepts are required: first, a complex, interrelated network of Digital Shadows which combine domain-specific models with data-driven AI methods; and second, the integration of a large number of research labs, engineering, and production sites as a World Wide Lab which offers controlled exchange of selected, innovation-relevant data even across company boundaries. In this article, we define the underlying Computer Science challenges implied by these novel concepts in four layers:Smart human interfacesprovide access to information that has been generated bymodel-integrated AI. Given the large variety of manufacturing data, newdata modelingtechniques should enable efficient management of Digital Shadows, which is supported by aninterconnected infrastructure. Based on a detailed analysis of these challenges, we derive a systematized research roadmap to make the vision of the Internet of Production a reality. Philipp Brauner, Manuela Dalibor, Matthias Jarke, Ike Kunze, István Koren, Gerhard Lakemeyer, Martin Liebenberg, Judith Michael, Jan Pennekamp, Christoph Quix, Bernhard Rumpe, Wil M. P. van der Aalst, Klaus Wehrle, Andreas Wortmann 0001, Martina Ziefle |
ACM Trans. Internet Things | 7 |
| 2020 | Information Systems Engineering with Digital Shadows: Concept and Case Studies - An Exploratory Paper
Martin Liebenberg, Matthias Jarke |
CAiSE | 1 |
| 2020 | FactDAG: Formalizing Data Interoperability in an Internet of ProductionabstractIn the production industry, the volume, variety, and velocity of data as well as the number of deployed protocols increase exponentially due to the influences of the Internet-of-Things (IoT) advances. While hundreds of isolated solutions exist to utilize these data, e.g., optimizing processes or monitoring machine conditions, the lack of a unified data handling and exchange mechanism hinders the implementation of approaches to improve the quality of decisions and processes in such an interconnected environment. The vision of anInternet of Productionpromises the establishment of aWorldwide Lab, where data from every process in the network can be utilized, even interorganizational and across domains. While numerous existing approaches consider interoperability from an interface and communication system perspective, fundamental questions of data and information interoperability remain insufficiently addressed. In this article, we identifytenkey issues, derived from three distinctive real-world use cases that hinder large-scale data interoperability for industrial processes. Based on these issues, we derive a set offivekey requirements for future (IoT) data layers, building upon the FAIR data principles. We propose to address them by creatingFactDAG, a conceptual data layer model for maintaining a provenance-based, directed acyclic graph of facts, inspired by successful distributed version-control and collaboration systems. Eventually, such a standardization should greatly shape the future of interoperability in an interconnected production industry. Lars Christoph Gleim, Jan Pennekamp, Martin Liebenberg, Melanie Buchsbaum, Philipp Niemietz, Simon Knape, Alexander Epple, Simon Storms, Daniel Trauth, Thomas Bergs, Christian Brecher, Stefan Decker, Gerhard Lakemeyer, Klaus Wehrle |
IEEE Internet Things J. | 3 |
| 2014 | Exploring the Boundaries of Decidable Verification of Non-Terminating Golog ProgramsabstractThe action programming language GOLOG has been found useful for the control of autonomous agents such as mobile robots. In scenarios like these, tasks are often open-ended so that the respective control programs are non-terminating. Before deploying such programs on a robot, it is often desirable to verify that they meet certain requirements. For this purpose, Claßen and Lakemeyer recently introduced algorithms for the verification of temporal properties of GOLOG programs. However, given the expressiveness of GOLOG, their verification procedures are not guaranteed to terminate. In this paper, we show how decidability can be obtained by suitably restricting the underlying base logic, the effect axioms for primitive actions, and the use of actions within GOLOG programs. Moreover, we show that dropping any of these restrictions immediately leads to undecidability of the verification problem. Jens Claßen, Martin Liebenberg, Gerhard Lakemeyer, Benjamin Zarrieß |
AAAI | 2 |