Pavlos Marantidis

Orcid: 0000-0002-1934-5741

According to our database1, Pavlos Marantidis authored at least 10 papers between 2016 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Towards Extending the Description Logic FL0 with Threshold Concepts Using Weighted Tree Automatas.
Proceedings of the 36th International Workshop on Description Logics (DL 2023) co-located with the 20th International Conference on Principles of Knowledge Representation and Reasoning and the 21st International Workshop on Non-Monotonic Reasoning (KR 2023 and NMR 2023)., 2023

2020
Extensions of unification modulo ACUI.
Math. Struct. Comput. Sci., 2020

Quantitative Variants of Language Equations and their Applications to Description Logics.
Künstliche Intell., 2020

2019
Quantitative variants of language equations and their applications to description logics.
PhD thesis, 2019

Matching in the Description Logic FL0 with respect to General TBoxes (Extended abstract).
Proceedings of the 32nd International Workshop on Description Logics, 2019

2018
The Data Complexity of Answering Instance Queries in <i>FL0</i>.
Proceedings of the Companion of the The Web Conference 2018 on The Web Conference 2018, 2018

Matching in the Description Logic FL0 with respect to General TBoxes.
Proceedings of the LPAR-22. 22nd International Conference on Logic for Programming, 2018

2017
Approximation in Description Logics: How Weighted Tree Automata Can Help to Define the Required Concept Comparison Measures in <i>FL</i>_0.
Proceedings of the Language and Automata Theory and Applications, 2017

2016
Approximately Solving Set Equations.
Proceedings of the 30th International Workshop on Unification, 2016

Approximate Unification in the Description Logic <i>FL</i>_0.
Proceedings of the Logics in Artificial Intelligence - 15th European Conference, 2016


  Loading...