4 accepted papers
Complex Query Answering over incomplete knowledge graphs is a fundamental yet challenging task. Existing methods based on a pretrained knowledge graph embedding model have achieved good performance. However, they ignore logical rules. Logical rules, as part of the conceptual layer in knowledge graph…
The connections between symbolic rules and neural networks have been explored in various directions, including rule mining through neural networks and rule-based explanation for neural networks. These approaches allow symbolic rules to be extracted from neural network models, which offers explainabi…
The relation classification is to identify semantic relations between two entities in a given text. While existing models perform well for classifying inverse relations with large datasets, their performance is significantly reduced for few-shot learning. In this paper, we propose a function words a…
Existential rules are an expressive ontology formalism for ontology-mediated query answering and thus query answering is of high complexity, while several tractable fragments have been identified. Existing systems based on first-order rewriting methods can lead to queries too large for DBMS to handl…