Research Problems
- Automatically building ontologies with complex relations
- Given a dataset (text, tables, excel sheets), competency questions, and list of ODPs, can we (auto/semi-automatically) build ontologies that can answer the competency questions?
- Automatic refactoring of ontologies with ODPs
- Rebuild large (bulky) ontologies with ODPs
- Can we make the bulky ontologies more modular by replacing pieces of the ontology with ODPs?
- The "intent" or the behaviour of the modular ontology should be the same as the original ontology
- The modular ontology should answer the same competency questions as the original one
- Extracting ODPs from large ontologies
- There are several large ontologies that may have similar patterns and can be extracted to form an ODP
- Ontologies have to be analyzed and common structures have to be identified
- Evaluation of Property Graphs and RDF Graphs
- Property graph: key value pairs (attributes/properties) can be associated with nodes and edges
- RDF graph: It is a directed labelled graph
- Can property and RDF graphs be converted to one another seamlessly?
- What are use-cases were property (RDF) graphs are good fit when compared to RDF (property) graphs?
- Are existing triple stores efficient in handling property graphs?
- How can we reason (for a specific profile such as RDFS) over property graphs without converting them to RDF graphs?