[ { "@id": "https://w3id.org/np/RAeliv0lalW2iVqlCMmNeGZgmsfNpGsBeW46bD3PLjGUc/Head", "@graph": [ { "@id": "https://w3id.org/np/RAeliv0lalW2iVqlCMmNeGZgmsfNpGsBeW46bD3PLjGUc", "http://www.nanopub.org/nschema#hasAssertion": [ { "@id": "https://w3id.org/np/RAeliv0lalW2iVqlCMmNeGZgmsfNpGsBeW46bD3PLjGUc/assertion" } ], "http://www.nanopub.org/nschema#hasProvenance": [ { "@id": "https://w3id.org/np/RAeliv0lalW2iVqlCMmNeGZgmsfNpGsBeW46bD3PLjGUc/provenance" } ], "http://www.nanopub.org/nschema#hasPublicationInfo": [ { "@id": "https://w3id.org/np/RAeliv0lalW2iVqlCMmNeGZgmsfNpGsBeW46bD3PLjGUc/pubinfo" } ], "@type": [ "http://www.nanopub.org/nschema#Nanopublication" ] } ] }, { "@id": "https://w3id.org/np/RAeliv0lalW2iVqlCMmNeGZgmsfNpGsBeW46bD3PLjGUc/provenance", "@graph": [ { "@id": "https://w3id.org/np/RAeliv0lalW2iVqlCMmNeGZgmsfNpGsBeW46bD3PLjGUc/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.2410.13080" } ] } ] }, { "@id": "https://w3id.org/np/RAeliv0lalW2iVqlCMmNeGZgmsfNpGsBeW46bD3PLjGUc/assertion", "@graph": [ { "@id": "https://doi.org/10.48550/arXiv.2410.13080", "http://purl.org/dc/terms/title": [ { "@value": "Graph-constrained Reasoning: Faithful Reasoning on Knowledge Graphs with Large Language Models" } ], "http://purl.org/spar/cito/describes": [ { "@id": "https://neverblink.eu/ontologies/llm-kg/methods#graphConstrainedReasoning" } ], "http://purl.org/spar/cito/discusses": [ { "@id": "https://neverblink.eu/ontologies/llm-kg/methods#debateOnGraph" }, { "@id": "https://neverblink.eu/ontologies/llm-kg/methods#effiQA" }, { "@id": "https://neverblink.eu/ontologies/llm-kg/methods#ewekQA" }, { "@id": "https://neverblink.eu/ontologies/llm-kg/methods#gfmRag" }, { "@id": "https://neverblink.eu/ontologies/llm-kg/methods#gnnRag" }, { "@id": "https://neverblink.eu/ontologies/llm-kg/methods#gnnRagRa" }, { "@id": "https://neverblink.eu/ontologies/llm-kg/methods#kdCoT" }, { "@id": "https://neverblink.eu/ontologies/llm-kg/methods#planOnGraph" }, { "@id": "https://neverblink.eu/ontologies/llm-kg/methods#rog" }, { "@id": "https://neverblink.eu/ontologies/llm-kg/methods#structGPT" }, { "@id": "https://neverblink.eu/ontologies/llm-kg/methods#symAgent" }, { "@id": "https://neverblink.eu/ontologies/llm-kg/methods#toG" } ], "@type": [ "http://www.w3.org/ns/prov#Entity" ] }, { "@id": "https://neverblink.eu/ontologies/llm-kg/methods#graphConstrainedReasoning", "http://purl.org/dc/terms/subject": [ { "@id": "https://neverblink.eu/ontologies/llm-kg/categories#SynergizedReasoning" } ], "@type": [ "http://purl.org/spar/fabio/Workflow" ], "http://www.w3.org/2000/01/rdf-schema#comment": [ { "@value": "GCR is a novel framework that bridges structured knowledge in KGs with unstructured reasoning in LLMs to eliminate hallucinations and ensure faithful reasoning. It integrates KG structure into the LLM decoding process via a KG-Trie, leverages a lightweight KG-specialized LLM for graph-constrained decoding to generate paths, and a powerful general LLM for inductive reasoning over multiple generated paths. This approach deeply combines LLM and KG reasoning capabilities." } ], "http://www.w3.org/2000/01/rdf-schema#label": [ { "@value": "Graph-constrained Reasoning (GCR)" } ], "https://neverblink.eu/ontologies/llm-kg/hasTopCategory": [ { "@id": "https://neverblink.eu/ontologies/llm-kg/top-categories#SynergizedLLMKG" } ] }, { "@id": "https://neverblink.eu/ontologies/llm-kg/methods#debateOnGraph", "@type": [ "http://purl.org/spar/fabio/Workflow" ], "http://www.w3.org/2000/01/rdf-schema#label": [ { "@value": "Debate on Graph" } ] }, { "@id": "https://neverblink.eu/ontologies/llm-kg/methods#effiQA", "@type": [ "http://purl.org/spar/fabio/Workflow" ], "http://www.w3.org/2000/01/rdf-schema#label": [ { "@value": "EffiQA" } ] }, { "@id": "https://neverblink.eu/ontologies/llm-kg/methods#ewekQA", "@type": [ "http://purl.org/spar/fabio/Workflow" ], "http://www.w3.org/2000/01/rdf-schema#label": [ { "@value": "EWEK-QA" } ] }, { "@id": "https://neverblink.eu/ontologies/llm-kg/methods#gfmRag", "@type": [ "http://purl.org/spar/fabio/Workflow" ], "http://www.w3.org/2000/01/rdf-schema#label": [ { "@value": "GFM-RAG" } ] }, { "@id": "https://neverblink.eu/ontologies/llm-kg/methods#gnnRag", "@type": [ "http://purl.org/spar/fabio/Workflow" ], "http://www.w3.org/2000/01/rdf-schema#label": [ { "@value": "GNN-RAG" } ] }, { "@id": "https://neverblink.eu/ontologies/llm-kg/methods#gnnRagRa", "@type": [ "http://purl.org/spar/fabio/Workflow" ], "http://www.w3.org/2000/01/rdf-schema#label": [ { "@value": "GNN-RAG+RA" } ] }, { "@id": "https://neverblink.eu/ontologies/llm-kg/methods#kdCoT", "@type": [ "http://purl.org/spar/fabio/Workflow" ], "http://www.w3.org/2000/01/rdf-schema#label": [ { "@value": "KD-CoT" } ] }, { "@id": "https://neverblink.eu/ontologies/llm-kg/methods#planOnGraph", "@type": [ "http://purl.org/spar/fabio/Workflow" ], "http://www.w3.org/2000/01/rdf-schema#label": [ { "@value": "Plan-on-Graph" } ] }, { "@id": "https://neverblink.eu/ontologies/llm-kg/methods#rog", "@type": [ "http://purl.org/spar/fabio/Workflow" ], "http://www.w3.org/2000/01/rdf-schema#label": [ { "@value": "RoG" } ] }, { "@id": "https://neverblink.eu/ontologies/llm-kg/methods#structGPT", "@type": [ "http://purl.org/spar/fabio/Workflow" ], "http://www.w3.org/2000/01/rdf-schema#label": [ { "@value": "StructGPT" } ] }, { "@id": "https://neverblink.eu/ontologies/llm-kg/methods#symAgent", "@type": [ "http://purl.org/spar/fabio/Workflow" ], "http://www.w3.org/2000/01/rdf-schema#label": [ { "@value": "SymAgent" } ] }, { "@id": "https://neverblink.eu/ontologies/llm-kg/methods#toG", "@type": [ "http://purl.org/spar/fabio/Workflow" ], "http://www.w3.org/2000/01/rdf-schema#label": [ { "@value": "ToG" } ] } ] }, { "@id": "https://w3id.org/np/RAeliv0lalW2iVqlCMmNeGZgmsfNpGsBeW46bD3PLjGUc/pubinfo", "@graph": [ { "@id": "https://w3id.org/np/RAeliv0lalW2iVqlCMmNeGZgmsfNpGsBeW46bD3PLjGUc", "http://purl.org/dc/terms/created": [ { "@value": "2026-02-26T15:39:45.569Z", "@type": "http://www.w3.org/2001/XMLSchema#dateTime" } ], "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.2410.13080" } ] }, { "@id": "https://w3id.org/np/RAeliv0lalW2iVqlCMmNeGZgmsfNpGsBeW46bD3PLjGUc/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": "hRoS4keA+iPLvnPI9Ys43Lp/yZYhLDa8xANXI11TMLLZDqSy40tM7SMkkYYHwj2ojlb9JCE6KklzGm1Xl37PvRKVmQkdpiuJV6Baj6gdZ5GJdQyvfPtZXQZ+aA6tY7CZ51FwD2lxEBYcytlRzawLcLUfyEYgtB21RdXV4XIJbYkn920cuCNFys15s2jOBiDOY+Tuu6I8+mewBvpDJi03YNUJz6jrcWsfbCF4DaFSWd9h2wj079CROK7sYG6KNCFnDHv64w8EGhPKlh6n0qrclSx2413hTRM2DDpvNiLrF0w5hDJYzuKAfVpp7ghiZxDDW9ZjqXFwbyEJUFJ584Xy8A==" } ], "http://purl.org/nanopub/x/hasSignatureTarget": [ { "@id": "https://w3id.org/np/RAeliv0lalW2iVqlCMmNeGZgmsfNpGsBeW46bD3PLjGUc" } ], "http://purl.org/nanopub/x/signedBy": [ { "@id": "https://neverblink.eu/ontologies/llm-kg/agent" } ] } ] } ]