Maximilian Marx
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Maximilian Marx has a total of 8 co-authors. Here are the top co-authors by number of shared publications:
- Markus Krötzsch
TU Dresden
3 shared publications - Alex Ivliev
TU Dresden
2 shared publications - Ana Ozaki
University of Oslo
2 shared publications - Gerd Stumme
University of Kassel
2 shared publications Markus Krötzsch
Center for Advancing Electronics Dresden (cfaed), TU Dresden, Dresden, Germany
2 shared publications- Tom Hanika
University of Hildesheim
2 shared publications
Latest Publications
- 23 October 2026
- Published by Springer Nature
- p. 197-217
Recovering Explanations from Transformed Rule-Based Ontologies
- 23 October 2026
- Published by Springer Nature
- p. 197-217
Recovering Explanations from Transformed Rule-Based Ontologies
- 7 May 2026
- Published by Springer Nature
- p. 518-536
SPARQLing Datalog for Rule-Based Reasoning over Large Knowledge Graphs
- 7 May 2026
- Published by Springer Nature
- p. 518-536
SPARQLing Datalog for Rule-Based Reasoning over Large Knowledge Graphs
- Open Access
Discovering Implicational Knowledge in Wikidata
Knowledge graphs have recently become the state-of-the-art tool for representing the diverse and complex knowledge of the world. Examples include the proprietary knowledge graphs of companies such as Google, Facebook, IBM, or Microsoft, but also freely available ones such as YAGO, DBpedia, and Wikidata. A distinguishing feature of Wikidata is that the knowledge is collaboratively edited and curated. While this greatly enhances the scope of Wikidata, it also makes it impossible for a single individual to grasp complex connections between properties or understand the global impact of edits in the graph. We apply Formal Concept Analysis to efficiently identify comprehensible implications that are implicitly present in the data. Although the complex structure of data modelling in Wikidata is not amenable to a direct approach, we overcome this limitation by extracting contextual representations of parts of Wikidata in a systematic fashion. We demonstrate the practical feasibility of our approach through several experiments and show that the results may lead to the discovery of interesting implicational knowledge. Besides providing a method for obtaining large real-world data sets for FCA, we sketch potential applications in offering semantic assistance for editing and curating Wikidata.
Open AccessDiscovering Implicational Knowledge in Wikidata
Knowledge graphs have recently become the state-of-the-art tool for representing the diverse and complex knowledge of the world. Examples include the proprietary knowledge graphs of companies such as Google, Facebook, IBM, or Microsoft, but also freely available ones such as YAGO, DBpedia, and Wikidata. A distinguishing feature of Wikidata is that the knowledge is collaboratively edited and curated. While this greatly enhances the scope of Wikidata, it also makes it impossible for a single individual to grasp complex connections between properties or understand the global impact of edits in the graph. We apply Formal Concept Analysis to efficiently identify comprehensible implications that are implicitly present in the data. Although the complex structure of data modelling in Wikidata is not amenable to a direct approach, we overcome this limitation by extracting contextual representations of parts of Wikidata in a systematic fashion. We demonstrate the practical feasibility of our approach through several experiments and show that the results may lead to the discovery of interesting implicational knowledge. Besides providing a method for obtaining large real-world data sets for FCA, we sketch potential applications in offering semantic assistance for editing and curating Wikidata.
- 1 July 2018
- Published by International Joint Conferences on Artificial Intelligence
- p. 5309-5313
Attributed Description Logics: Reasoning on Knowledge Graphs
In modelling real-world knowledge, there often arises a need to represent and reason with meta-knowledge. To equip description logics (DLs) for dealing with such ontologies, we enrich DL concepts and roles with finite sets of attribute–value pairs, called annotations, and allow concept inclusions to express constraints on annotations. We investigate a range of DLs starting from the lightweight description logic EL, covering the prototypical ALCH, and extending to the very expressive SROIQ, the DL underlying OWL 2 DL.
- 1 July 2018
- Published by International Joint Conferences on Artificial Intelligence
- p. 5309-5313
Attributed Description Logics: Reasoning on Knowledge Graphs
In modelling real-world knowledge, there often arises a need to represent and reason with meta-knowledge. To equip description logics (DLs) for dealing with such ontologies, we enrich DL concepts and roles with finite sets of attribute–value pairs, called annotations, and allow concept inclusions to express constraints on annotations. We investigate a range of DLs starting from the lightweight description logic EL, covering the prototypical ALCH, and extending to the very expressive SROIQ, the DL underlying OWL 2 DL.
- 4 October 2017
- Published by Springer Nature
- p. 418-435
Attributed Description Logics: Ontologies for Knowledge Graphs
- 4 October 2017
- Published by Springer Nature
- p. 418-435
Attributed Description Logics: Ontologies for Knowledge Graphs
- 1 August 2017
- Published by International Joint Conferences on Artificial Intelligence
- p. 1188-1194
Logic on MARS: Ontologies for Generalised Property Graphs
Graph-structured data is used to represent large information collections, called knowledge graphs, in many applications. Their exact format may vary, but they often share the concept that edges can be annotated with additional information, such as validity time or provenance information. Property Graph is a popular graph database format that also provides this feature. We give a formalisation of a generalised notion of Property Graphs, called multi-attributed relational structures (MARS), and introduce a matching knowledge representation formalism, multi-attributed predicate logic (MAPL). We analyse the expressive power of MAPL and suggest a simpler, rule-based fragment of MAPL that can be used for ontological reasoning on Property Graphs. To the best of our knowledge, this is the first approach to making Property Graphs and related data structures accessible to symbolic AI.
- 1 August 2017
- Published by International Joint Conferences on Artificial Intelligence
- p. 1188-1194
Logic on MARS: Ontologies for Generalised Property Graphs
Graph-structured data is used to represent large information collections, called knowledge graphs, in many applications. Their exact format may vary, but they often share the concept that edges can be annotated with additional information, such as validity time or provenance information. Property Graph is a popular graph database format that also provides this feature. We give a formalisation of a generalised notion of Property Graphs, called multi-attributed relational structures (MARS), and introduce a matching knowledge representation formalism, multi-attributed predicate logic (MAPL). We analyse the expressive power of MAPL and suggest a simpler, rule-based fragment of MAPL that can be used for ontological reasoning on Property Graphs. To the best of our knowledge, this is the first approach to making Property Graphs and related data structures accessible to symbolic AI.