Follow
Oliver FernŠndez Gil
Title
Cited by
Cited by
Year
Adding threshold concepts to the description logic
F Baader, G Brewka, O FernŠndez Gil
International Symposium on Frontiers of Combining Systems, 33-48, 2015
192015
On the non-monotonic description logic alc+ tmin
O FernŠndez Gil
15TH INTERNATIONAL WORKSHOP ON NON-MONOTONIC REASONING (NMR 2014) VIENNA†…, 2014
172014
Matching in the Description Logic FL0 with respect to General TBoxes
F Baader, O FernŠndez Gil, P Marantidis
22nd International Conference on Logic for Programming Artificial†…, 2018
142018
Standard and non-standard inferences in the description logic FL0 using tree automata
F Baader, O FernŠndez Gil, M Pensel
4th Global Conference on Artificial Intelligence (GCAI 2018), 1-14, 2018
92018
Restricted unification in the description logic FL0
F Baader, O FernŠndez Gil, M Rostamigiv
Proc. of the 13th International Symposium on Frontiers of Combining Systems†…, 2021
6*2021
Satisfiability for MTL and TPTL over Non-monotonic Data Words
C Carapelle, S Feng, O FernŠndez Gil, K Quaas
International Conference on Language and Automata Theory and Applications†…, 2014
62014
Hybrid Unification in the Description Logic
F Baader, O FernŠndez Gil, B Morawska
International Symposium on Frontiers of Combining Systems, 295-310, 2013
5*2013
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
42017
Extending the description logic tel (deg) with acyclic tboxes
O Fernandez Gil, F Baader
Proceedings of the 22nd European Conference on Artificial Intelligence (ECAI†…, 2016
4*2016
Decidability and complexity of threshold description logics induced by concept similarity measures
F Baader, O FernŠndez Gil
Proceedings of the 32nd ACM SIGAPP Symposium On Applied Computing, 983-988, 2017
32017
Ehrenfeucht-Fraıssť Games for TPTL and MTL over Non-monotonic Data Words
C Carapelle, S Feng, O FernŠndez Gil, K Quaas
arXiv preprint arXiv:1311.6250, 2013
22013
On the Expressiveness of TPTL and MTL over\omega-Data Words
C Carapelle, S Feng, O FernŠndez Gil, K Quaas
arXiv preprint arXiv:1311.6250, 2013
12013
Restricted Unification in the DL PL0
F Baader, OF Gil, M Rostamigiv
Frontiers of Combining Systems, 81-97, 0
1
Answering Regular Path Queries Under Approximate Semantics in Lightweight Description Logics
O FernŠndez Gil, AY Turhan
2021
Relaxed Regular Path Queries in Lightweight DLs
OF Gil, AY Turhan
Description Logics, 2020
2020
MTL and TPTL for One-Counter Machines: Expressiveness, Model Checking, and Satisfiability
S Feng, C Carapelle, O FernŠndez Gil, K Quaas
ACM Transactions on Computational Logic (TOCL) 21 (2), 1-34, 2019
2019
Towards an Equivalence Degree of EL CQs
OF Gil, AY Turhan
Description Logics, 2019
2019
The system can't perform the operation now. Try again later.
Articles 1–17