31 citations · 31 across the 4 of their papers we have counts for
Showing cs.AIShow all
2 papers · 1 filter
cs.AI2020★ 31 cited
Reinforced Anytime Bottom Up Rule Learning for Knowledge Graph Completion
Christian Meilicke, Melisachew Wudage Chekol, Manuel Fink +1
Most of todays work on knowledge graph completion is concerned with sub-symbolic approaches that focus on the concept of embedding a given graph in a low dimensional vector space.…
cs.AI2015
Towards Log-Linear Logics with Concrete Domains
Melisachew Wudage Chekol, Jakob Huber, Heiner Stuckenschmidt
We present (M denotes Markov logic networks) an extension of the log-linear description logics -LL with concrete domains, nominals, and inst…