Matching in the Description Logic FL0 with respect to General TBoxes F Baader, OF Gil, P Marantidis LPAR, 76-94, 2018 | 14 | 2018 |

Approximate Unification in the Description Logic F Baader, P Marantidis, A Okhotin European Conference on Logics in Artificial Intelligence, 49-63, 2016 | 11 | 2016 |

The Data Complexity of Answering Instance Queries in *FL0*F Baader, P Marantidis, M Pensel Companion Proceedings of the The Web Conference 2018, 1603-1607, 2018 | 7 | 2018 |

Extensions of unification modulo ACUI F Baader, P Marantidis, A Mottet, A Okhotin Mathematical Structures in Computer Science, 1-30, 2019 | 5 | 2019 |

Approximation in Description Logics: How Weighted Tree Automata Can Help to Define the Required Concept Comparison Measures in F Baader, O Fernández Gil, P Marantidis International Conference on Language and Automata Theory and Applications, 3-26, 2017 | 4 | 2017 |

ACUI unification modulo ground theories F Baader, P Marantidis, A Mottet Proceedings of the 32th International Workshop on Unification (UNIF 2018), 37-41, 2018 | 3 | 2018 |

Approximately solving set equations F Baader, P Marantidis, A Okhotin Proceedings of the 30th International Workshop on Unification (UNIF’16), 37-41, 2016 | 2 | 2016 |

Quantitative variants of language equations and their applications to description logics P Marantidis | 1 | 2019 |

Language equations for approximate matching in the Description Logic FL0 F Baader, P Marantidis Proceedings of the 31st International Workshop on Unification (UNIF’17), 9, 0 | 1 | |

Quantitative Variants of Language Equations and their Applications to Description Logics P Marantidis KI-Künstliche Intelligenz 34 (3), 405-409, 2020 | | 2020 |

Approximate Unification in the Description Logic FL0 P Marantidis | | |