Matches in Nanopublications for { ?s ?p ?o <https://w3id.org/np/RAiyzaAhj15aaB48dhLqANMihGy8h7Z3H7fMC6x1oiwZM/assertion>. }
Showing items 1 to 17 of
17
with 100 items per page.
- arXiv.2402.11804 type Entity assertion.
- Llama2KGReasoning type Workflow assertion.
- Prolink type Workflow assertion.
- Ultra type Workflow assertion.
- Llama2KGReasoning label "Llama2 for KG Reasoning" assertion.
- Prolink label "PROLINK" assertion.
- Ultra label "ULTRA" assertion.
- Llama2KGReasoning comment "This method uses Llama2-7B as a baseline for zero-shot graph reasoning by converting KG queries and subgraphs into textual questions. The LLM attempts to infer missing facts directly from the textual representation for KG completion." assertion.
- Prolink comment "PROLINK is a novel framework designed for low-resource inductive reasoning across arbitrary KGs. It utilizes a pre-trained LLM to generate a graph-structural prompt from relation semantics. This prompt graph is then calibrated and injected into the KG's relation graph to enhance a GNN-based reasoner, thereby improving the inference of missing facts (KG completion)." assertion.
- arXiv.2402.11804 describes Prolink assertion.
- arXiv.2402.11804 discusses Llama2KGReasoning assertion.
- arXiv.2402.11804 discusses Ultra assertion.
- Llama2KGReasoning subject LLMAugmentedKGCompletion assertion.
- Prolink subject LLMAugmentedKGCompletion assertion.
- arXiv.2402.11804 title "LLM as Prompter: Low-resource Inductive Reasoning on Arbitrary Knowledge Graphs" assertion.
- Llama2KGReasoning hasTopCategory LLMAugmentedKG assertion.
- Prolink hasTopCategory LLMAugmentedKG assertion.