Stephan Mennicke
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
Research Subjects
Stephan Mennicke has a total of 16 co-authors. Here are the top co-authors by number of shared publications:
- Jan-Christoph Kalo
Technische Universität Braunschweig
2 shared publications - Malte Lochau
University of Siegen
2 shared publications - Markus Krötzsch
TU Dresden
2 shared publications - Wolf-Tilo Balke
TU Braunschweig
2 shared publications - Alex Ivliev
TU Dresden
1 shared publication - Ali Elhalawati
TU Dresden
1 shared publication
Latest Publications
- Open Access
- 1 May 2025
- Published by Cambridge University Press (CUP) in Theory and Practice of Logic Programming
- Vol. 25 (3) , 304-339
Existential Notation3 Logic
In this paper, we delve into Notation3 Logic (N3), an extension of Resource Description Framework (RDF), which empowers users to craft rules introducing fresh blank nodes to RDF graphs. This capability is pivotal in various applications such as ontology mapping, given the ubiquitous presence of blank nodes directly or in auxiliary constructs across the Web. However, the availability of fast N3 reasoners fully supporting blank node introduction remains limited. Conversely, engines like VLog or Nemo, though not explicitly designed for Semantic Web rule formats, cater to analogous constructs, namely existential rules.We investigate the correlation between N3 rules featuring blank nodes in their heads and existential rules. We pinpoint a subset of N3 that seamlessly translates to existential rules and establish a mapping preserving the equivalence of N3 formulae. To showcase the potential benefits of this translation in N3 reasoning, we implement this mapping and compare the performance of N3 reasoners like EYE and cwm against VLog and Nemo, both on native N3 rules and their translated counterparts. Our findings reveal that existential rule reasoners excel in scenarios with abundant facts, while the EYE reasoner demonstrates exceptional speed in managing a high volume of dependent rules.Additionally to the original conference version of this paper, we include all proofs of the theorems and introduce a new section dedicated to N3 lists featuring built-in functions and how they are implemented in existential rules. Adding lists to our translation/framework gives interesting insights on related design decisions influencing the standardization of N3.
- 1 May 2025
- Published by Cambridge University Press (CUP) in Theory and Practice of Logic Programming
- Vol. 25 (3) , 304-339
Open AccessExistential Notation3 Logic
In this paper, we delve into Notation3 Logic (N3), an extension of Resource Description Framework (RDF), which empowers users to craft rules introducing fresh blank nodes to RDF graphs. This capability is pivotal in various applications such as ontology mapping, given the ubiquitous presence of blank nodes directly or in auxiliary constructs across the Web. However, the availability of fast N3 reasoners fully supporting blank node introduction remains limited. Conversely, engines like VLog or Nemo, though not explicitly designed for Semantic Web rule formats, cater to analogous constructs, namely existential rules.We investigate the correlation between N3 rules featuring blank nodes in their heads and existential rules. We pinpoint a subset of N3 that seamlessly translates to existential rules and establish a mapping preserving the equivalence of N3 formulae. To showcase the potential benefits of this translation in N3 reasoning, we implement this mapping and compare the performance of N3 reasoners like EYE and cwm against VLog and Nemo, both on native N3 rules and their translated counterparts. Our findings reveal that existential rule reasoners excel in scenarios with abundant facts, while the EYE reasoner demonstrates exceptional speed in managing a high volume of dependent rules.Additionally to the original conference version of this paper, we include all proofs of the theorems and introduce a new section dedicated to N3 lists featuring built-in functions and how they are implemented in existential rules. Adding lists to our translation/framework gives interesting insights on related design decisions influencing the standardization of N3.
- 15 October 2023
- Published by Springer Nature
- p. 222-237
Abstract Domains for Database Manipulating Processes
- 15 October 2023
- Published by Springer Nature
- p. 222-237
Abstract Domains for Database Manipulating Processes
- 14 December 2022
- Published by Springer Nature
- p. 146-163
An Existential Rule Framework for Computing Why-Provenance On-Demand for Datalog
- 14 December 2022
- Published by Springer Nature
- p. 146-163
An Existential Rule Framework for Computing Why-Provenance On-Demand for Datalog
- 16 October 2022
- Published by Springer Nature
- p. 267-283
Efficient Dependency Analysis for Rule-Based Ontologies
- 16 October 2022
- Published by Springer Nature
- p. 267-283
Efficient Dependency Analysis for Rule-Based Ontologies
- Open Access
- 27 May 2020
- Published by Springer Nature
- Vol. 12123, 360-375
Detecting Synonymous Properties by Shared Data-Driven Definitions
Knowledge graphs have become an essential source of entity-centric information for modern applications. Today’s KGs have reached a size of billions of RDF triples extracted from a variety of sources, including structured sources and text. While this definitely improves completeness, the inherent variety of sources leads to severe heterogeneity, negatively affecting data quality by introducing duplicate information. We present a novel technique for detecting synonymous properties in large knowledge graphs by mining interpretable definitions of properties using association rule mining. Relying on such shared definitions, our technique is able to mine even synonym rules that have only little support in the data. In particular, our extensive experiments on DBpedia and Wikidata show that our rule-based approach can outperform state-of-the-art knowledge graph embedding techniques, while offering good interpretability through shared logical rules.
- 27 May 2020
- Published by Springer Nature
- Vol. 12123, 360-375
Open AccessDetecting Synonymous Properties by Shared Data-Driven Definitions
Knowledge graphs have become an essential source of entity-centric information for modern applications. Today’s KGs have reached a size of billions of RDF triples extracted from a variety of sources, including structured sources and text. While this definitely improves completeness, the inherent variety of sources leads to severe heterogeneity, negatively affecting data quality by introducing duplicate information. We present a novel technique for detecting synonymous properties in large knowledge graphs by mining interpretable definitions of properties using association rule mining. Relying on such shared definitions, our technique is able to mine even synonym rules that have only little support in the data. In particular, our extensive experiments on DBpedia and Wikidata show that our rule-based approach can outperform state-of-the-art knowledge graph embedding techniques, while offering good interpretability through shared logical rules.
- 1 March 2019
- Published by Elsevier in Science of Computer Programming
- Vol. 172, 27-47
Unifying modal interface theories and compositional input/output conformance testing
- 1 March 2019
- Published by Elsevier in Science of Computer Programming
- Vol. 172, 27-47
Unifying modal interface theories and compositional input/output conformance testing
- Open Access
Fast Dual Simulation Processing of Graph Database Queries (Supplement)
Graph database query languages feature expressive, yet computationally expensive pattern matching capabilities. Answering optional query clauses in SPARQL for instance renders the query evaluation problem immediately Pspace-complete. Therefore, light-weight graph pattern matching relations, such as simulation, have recently been investigated as promising alternatives to more expensive query mechanisms like, e.g., computing subgraph isomorphism. Still, graph pattern matching alone lacks expressive query capabilities: all patterns are combined by usual join constructs, where more sophisticated capabilities would be inevitable for making solutions useful to emerging applications. In this paper we bridge this gap by introducing a new dual simulation process operating on SPARQL queries. In addition to supporting the full syntactic structure of SPARQL queries, it features polynomial-time pattern matching to compute an overapproximation of query results from the database. Moreover, to achieve runtimes competing with state-of-the-art database systems, we develop a novel algorithmic solution to dual simulation graph pattern matching, based on a system of inequalities that allows for several optimization heuristics. Finally, we achieve soundness of our process for SPARQL queries including UNION, AND and OPTIONAL operators not restricted to well-designed patterns. Our experiments on synthetic and real-world graph data promise a clear gain for graph database systems when incorporating the new dual simulation techniques. In this supplement paper we present in detail all proofs, discussions of experimental results, and complexity analysis for the original paper "Fast Dual Simulation Processing of Graph Database Queries" included in the Proceedings of the 35th IEEE International Conference on Data Engineering (ICDE 2019), Macau, China.
Open AccessFast Dual Simulation Processing of Graph Database Queries (Supplement)
Graph database query languages feature expressive, yet computationally expensive pattern matching capabilities. Answering optional query clauses in SPARQL for instance renders the query evaluation problem immediately Pspace-complete. Therefore, light-weight graph pattern matching relations, such as simulation, have recently been investigated as promising alternatives to more expensive query mechanisms like, e.g., computing subgraph isomorphism. Still, graph pattern matching alone lacks expressive query capabilities: all patterns are combined by usual join constructs, where more sophisticated capabilities would be inevitable for making solutions useful to emerging applications. In this paper we bridge this gap by introducing a new dual simulation process operating on SPARQL queries. In addition to supporting the full syntactic structure of SPARQL queries, it features polynomial-time pattern matching to compute an overapproximation of query results from the database. Moreover, to achieve runtimes competing with state-of-the-art database systems, we develop a novel algorithmic solution to dual simulation graph pattern matching, based on a system of inequalities that allows for several optimization heuristics. Finally, we achieve soundness of our process for SPARQL queries including UNION, AND and OPTIONAL operators not restricted to well-designed patterns. Our experiments on synthetic and real-world graph data promise a clear gain for graph database systems when incorporating the new dual simulation techniques. In this supplement paper we present in detail all proofs, discussions of experimental results, and complexity analysis for the original paper "Fast Dual Simulation Processing of Graph Database Queries" included in the Proceedings of the 35th IEEE International Conference on Data Engineering (ICDE 2019), Macau, China.
- 31 May 2018
- Published by Springer Nature in Datenbank-Spektrum
- Vol. 18 (2) , 89-98
Using Queries as Schema-Templates for Graph Databases
- 31 May 2018
- Published by Springer Nature in Datenbank-Spektrum
- Vol. 18 (2) , 89-98
Using Queries as Schema-Templates for Graph Databases