Pavlos Marantidis

M.Sc.

I am currently a doctoral student and scholarship holder in the DFG Research Training Group Quantitative Logics and Automata (QuantLA). I investigate Language Equations and Description Logics at the Faculty of Computer Science of TU Dresden under the supervision of Prof. Dr.-Ing. Franz Baader (TU Dresden) and Prof. Sebastian Rudolph (TU Dresden).

I received my Bachelor’s and Master’s degree from the Department of Mathematics of the Aristotle University of Thessaloniki.

Contact Details

• Email: pavlos dot marantidis at tu-dresden.de
• Office: APB/Room 3030 TU Dresden
  Nöthnitzer Str. 46
  01187 Dresden

Publications

• Approximate Unification in the Description Logic FL0, with F. Baader and A. Okhotin, Proc. of the 15th Eur. Conf. on Logics in Artificial Intelligence (JELIA 2016), Larnaca, Cyprus, November 9-11, 2016
• Approximation in Description Logics: How Weighted Tree Automata Can Help to Define the Required Concept Comparison Measures in FL0, with F. Baader and O. Fernandez Gil, Proc. of Language and Automata Theory and Applications (LATA 2017), Umea, Sweden, March 6-9, 2017
• The Data Complexity of Answering Instance Queries in FL0, with F. Baader and M. Pensel, Proc. of the Reasoning on Data Workshop at the Web Conference 2018 (RoD at WWW'18), Lyon, France, April 24, 2018.
• Matching in the Description Logic FL0 with respect to General TBoxes, with F. Baader and O. Fernandez Gil, Proc. of the 22nd International Conference on Logic for Programming, Artificial Intelligence and Reasoning (LPAR-22), Awassa, Ethiopia, November 17-21, 2018.

Talks-Presentations

• Quantitative Versions of the Chomsky-Schützenberger Theorem, Seminar of Knowledge-Based Systems group of the International Center for Computation Logic, TU Dresden, link
• Approximate Unification in Description Logics, Seminar on Theoretical Computer Science and Discrete Mathematics, Department of Mathematics, Aristotle University of Thessaloniki, link
• Current Research, Gemeinsamer Workshop der Graduiertenkollegs 2016, Dagstuhl, link
• Description Logics (in greek), 8th Int. Week Dedicated to Maths 2016, link
• Approximately Solving Set Equations, UNIF 2016, Porto, link
• Approximate Unification in the Description Logic FL0, JELIA 2016, Larnaca, link
• Weighted tree automata in Approximate Description Logics, Seminar on Theoretical Computer Science and Discrete Mathematics, Department of Mathematics, Aristotle University of Thessaloniki, link
• Approximate Unification in the Description Logic FL0, DL 2017, Montpellier, link
• Tutorial for Term Rewriting Systems, Hilbert-Bernays Summer School on Logic and Computation 2017, Göttingen, link
• Language equations for approximate matching in the Description Logic FL0, UNIF 2017, Oxford, link
• Functional models and Data Complexity for FL0, Seminar of Computational Logic group of the International Center for Computation Logic, TU Dresden, link
• Language Equations (in greek), 10th Int. Week Dedicated to Maths 2018, link
• Approximate Unification in the Description Logic FL0, FCGM 2018, Athens, link
• ACUI unification modulo Ground Theories, UNIF 2018, Oxford, link
• Extending Matching in Description Logics, Seminar of Computational Logic and Knowledge-Based Systems group of the International Center for Computation Logic, TU Dresden, link
• Matching in the Description Logic FL0 with respect to General TBoxes, LPAR-22, Awassa, Ethiopia, link

Master Thesis

Weighted Context-Free Grammars and the Chomsky-Schützenberger Theorem (pdf in greek)