[ { "@graph" : [ { "@id" : "https://w3id.org/np/RAiyzaAhj15aaB48dhLqANMihGy8h7Z3H7fMC6x1oiwZM", "@type" : [ "http://www.nanopub.org/nschema#Nanopublication" ], "http://www.nanopub.org/nschema#hasAssertion" : [ { "@id" : "https://w3id.org/np/RAiyzaAhj15aaB48dhLqANMihGy8h7Z3H7fMC6x1oiwZM/assertion" } ], "http://www.nanopub.org/nschema#hasProvenance" : [ { "@id" : "https://w3id.org/np/RAiyzaAhj15aaB48dhLqANMihGy8h7Z3H7fMC6x1oiwZM/provenance" } ], "http://www.nanopub.org/nschema#hasPublicationInfo" : [ { "@id" : "https://w3id.org/np/RAiyzaAhj15aaB48dhLqANMihGy8h7Z3H7fMC6x1oiwZM/pubinfo" } ] } ], "@id" : "https://w3id.org/np/RAiyzaAhj15aaB48dhLqANMihGy8h7Z3H7fMC6x1oiwZM/Head" }, { "@graph" : [ { "@id" : "https://doi.org/10.48550/arXiv.2402.11804", "@type" : [ "http://www.w3.org/ns/prov#Entity" ], "http://purl.org/dc/terms/title" : [ { "@value" : "LLM as Prompter: Low-resource Inductive Reasoning on Arbitrary Knowledge Graphs" } ], "http://purl.org/spar/cito/describes" : [ { "@id" : "https://neverblink.eu/ontologies/llm-kg/methods#Prolink" } ], "http://purl.org/spar/cito/discusses" : [ { "@id" : "https://neverblink.eu/ontologies/llm-kg/methods#Llama2KGReasoning" }, { "@id" : "https://neverblink.eu/ontologies/llm-kg/methods#Ultra" } ] }, { "@id" : "https://neverblink.eu/ontologies/llm-kg/methods#Llama2KGReasoning", "@type" : [ "http://purl.org/spar/fabio/Workflow" ], "http://purl.org/dc/terms/subject" : [ { "@id" : "https://neverblink.eu/ontologies/llm-kg/categories#LLMAugmentedKGCompletion" } ], "http://www.w3.org/2000/01/rdf-schema#comment" : [ { "@value" : "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." } ], "http://www.w3.org/2000/01/rdf-schema#label" : [ { "@value" : "Llama2 for KG Reasoning" } ], "https://neverblink.eu/ontologies/llm-kg/hasTopCategory" : [ { "@id" : "https://neverblink.eu/ontologies/llm-kg/top-categories#LLMAugmentedKG" } ] }, { "@id" : "https://neverblink.eu/ontologies/llm-kg/methods#Prolink", "@type" : [ "http://purl.org/spar/fabio/Workflow" ], "http://purl.org/dc/terms/subject" : [ { "@id" : "https://neverblink.eu/ontologies/llm-kg/categories#LLMAugmentedKGCompletion" } ], "http://www.w3.org/2000/01/rdf-schema#comment" : [ { "@value" : "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)." } ], "http://www.w3.org/2000/01/rdf-schema#label" : [ { "@value" : "PROLINK" } ], "https://neverblink.eu/ontologies/llm-kg/hasTopCategory" : [ { "@id" : "https://neverblink.eu/ontologies/llm-kg/top-categories#LLMAugmentedKG" } ] }, { "@id" : "https://neverblink.eu/ontologies/llm-kg/methods#Ultra", "@type" : [ "http://purl.org/spar/fabio/Workflow" ], "http://www.w3.org/2000/01/rdf-schema#label" : [ { "@value" : "ULTRA" } ] } ], "@id" : "https://w3id.org/np/RAiyzaAhj15aaB48dhLqANMihGy8h7Z3H7fMC6x1oiwZM/assertion" }, { "@graph" : [ { "@id" : "https://w3id.org/np/RAiyzaAhj15aaB48dhLqANMihGy8h7Z3H7fMC6x1oiwZM/assertion", "http://www.w3.org/ns/prov#wasAttributedTo" : [ { "@id" : "https://neverblink.eu/ontologies/llm-kg/agent" } ], "http://www.w3.org/ns/prov#wasDerivedFrom" : [ { "@id" : "https://doi.org/10.48550/arXiv.2402.11804" } ] } ], "@id" : "https://w3id.org/np/RAiyzaAhj15aaB48dhLqANMihGy8h7Z3H7fMC6x1oiwZM/provenance" }, { "@graph" : [ { "@id" : "https://w3id.org/np/RAiyzaAhj15aaB48dhLqANMihGy8h7Z3H7fMC6x1oiwZM", "http://purl.org/dc/terms/created" : [ { "@type" : "http://www.w3.org/2001/XMLSchema#dateTime", "@value" : "2026-02-26T15:42:35.147Z" } ], "http://purl.org/dc/terms/creator" : [ { "@id" : "https://neverblink.eu/ontologies/llm-kg/agent" } ], "http://purl.org/nanopub/x/hasNanopubType" : [ { "@id" : "https://neverblink.eu/ontologies/llm-kg/PaperAssessmentResult" } ], "http://www.w3.org/2000/01/rdf-schema#label" : [ { "@value" : "LLM-KG assessment for paper 10.48550/arXiv.2402.11804" } ] }, { "@id" : "https://w3id.org/np/RAiyzaAhj15aaB48dhLqANMihGy8h7Z3H7fMC6x1oiwZM/sig", "http://purl.org/nanopub/x/hasAlgorithm" : [ { "@value" : "RSA" } ], "http://purl.org/nanopub/x/hasPublicKey" : [ { "@value" : "MIIBIjANBgkqhkiG9w0BAQEFAAOCAQ8AMIIBCgKCAQEAwNz2QK3SEifno78S7+48zUB0xpTex3mAzW73ZimHqNcdEMU5/apslrGrTHGFAt/Chocgo++r6JQp5ygY7NyJHGWdaIqnt85pjX4PbNfLAvapyUO00qZP34fY61w4eZ9UMtleWEsmZKRtQPyJ8ODl46i/rfPuZlcJGpM9Nmy5mpGWuepqIEvF4a/t7pLVeCEDFSYXT+yaiygt6ynIK5f7TtEDhZpeUf/Q74WhMPJXm4yTU/hqOX4IW+50kWHNArGGZwUaXwzyG6M3Zd6UMModryGkLqS4H/MSE3ZA1Ylnms7BfWLEXhMWlaKi6HRV4nGRDLhxVSi9LSRi3LWKLhNIIQIDAQAB" } ], "http://purl.org/nanopub/x/hasSignature" : [ { "@value" : "rQxQQn7Th8XjDVagx61TquhuVLUI5VjH0TKSiTexUR4BSIxiZcK7aaWeTLpAaDrs/ctmIcos7xH03DRZIiLlgcQZyi7SogMl+Ik90zqKahestHmzUUj/0TKh3AB9TkK0M/Pah6fKENhT1f8QbsSabLJNktjry2+h7K4lP8OPXw4yCpFafjaIBtRTYAGNnyCf57BMjespDN10OLoXObweHqy80OGX0tEJcOeY8lme8A4EjI26S9QLnWUBM8EJjDVG+COTR/TAmZm64aKN9NQwjoU++diHaoRo62CIYm9SA9C/Q29hLm2uaQiS1txxItCkgid5uBKsD/+x9aM4E844vw==" } ], "http://purl.org/nanopub/x/hasSignatureTarget" : [ { "@id" : "https://w3id.org/np/RAiyzaAhj15aaB48dhLqANMihGy8h7Z3H7fMC6x1oiwZM" } ], "http://purl.org/nanopub/x/signedBy" : [ { "@id" : "https://neverblink.eu/ontologies/llm-kg/agent" } ] } ], "@id" : "https://w3id.org/np/RAiyzaAhj15aaB48dhLqANMihGy8h7Z3H7fMC6x1oiwZM/pubinfo" } ]