Typing regular path queries in the context of ontologies

Student Name
Beibei Yuan
Thesis Type
Master Thesis
Thesis Status
Ongoing
Academic Year
2017 - 2018
Degree
Master in Applied Science and Engineering: Computer Science
Promoter
Jan Hidders
Supervisor(s)
Download
Description

The thesis investigates the problem of finding sound and complete typing algorithms for regular path queries for graph databases where the schemas are specified using constructs from description logics.