For atomic path queries (i.e., those with length k = 1), path QA reduces to that of knowledge graph completion introduced in Section 3.1.
it is natural to address general path QA by extending the scoring function φ(s, r, o) of KGC methods so that composite relation r 1 / .