Abstract:
The project builds upon existing research that has investigated the reasoning capabilities of PLMs, primarily using RDFS rules. I aim to extend this work by incorporating the more expressive EL++ formalism, which potentially allows for more complex reasoning tasks. EL++ is chosen because it offers a balance between expressiveness and computational tractability. EL++ allows for the representation of complex relationships while ensuring that reasoning tasks can be performed effectively.
