%0 Journal Article %1 Nayyeri2019-an %A Nayyeri, Mojtaba %A Xu, Chengjin %A Lehmann, Jens %A Yazdi, Hamed Shariat %D 2019 %I arXiv %K %T LogicENN: A neural based knowledge graphs embedding model with logical rules %X Knowledge graph embedding models have gained significant attention in AI research. Recent works have shown that the inclusion of background knowledge, such as logical rules, can improve the performance of embeddings in downstream machine learning tasks. However, so far, most existing models do not allow the inclusion of rules. We address the challenge of including rules and present a new neural based embedding model (LogicENN). We prove that LogicENN can learn every ground truth of encoded rules in a knowledge graph. To the best of our knowledge, this has not been proved so far for the neural based family of embedding models. Moreover, we derive formulae for the inclusion of various rules, including (anti-)symmetric, inverse, irreflexive and transitive, implication, composition, equivalence and negation. Our formulation allows to avoid grounding for implication and equivalence relations. Our experiments show that LogicENN outperforms the state-of-the-art models in link prediction.

@article{Nayyeri2019-an, abstract = {Knowledge graph embedding models have gained significant attention in AI research. Recent works have shown that the inclusion of background knowledge, such as logical rules, can improve the performance of embeddings in downstream machine learning tasks. However, so far, most existing models do not allow the inclusion of rules. We address the challenge of including rules and present a new neural based embedding model (LogicENN). We prove that LogicENN can learn every ground truth of encoded rules in a knowledge graph. To the best of our knowledge, this has not been proved so far for the neural based family of embedding models. Moreover, we derive formulae for the inclusion of various rules, including (anti-)symmetric, inverse, irreflexive and transitive, implication, composition, equivalence and negation. Our formulation allows to avoid grounding for implication and equivalence relations. Our experiments show that LogicENN outperforms the state-of-the-art models in link prediction.}, added-at = {2024-09-10T11:56:37.000+0200}, author = {Nayyeri, Mojtaba and Xu, Chengjin and Lehmann, Jens and Yazdi, Hamed Shariat}, biburl = {https://puma.scadsai.uni-leipzig.de/bibtex/2290d99e4dd2ab1e7b754975bc4058fd5/scadsfct}, interhash = {48a1d0a980964c0762827e1962bbca49}, intrahash = {290d99e4dd2ab1e7b754975bc4058fd5}, keywords = {}, publisher = {arXiv}, timestamp = {2024-09-10T15:15:57.000+0200}, title = {{LogicENN}: A neural based knowledge graphs embedding model with logical rules}, year = 2019 }