https://w3id.org/np/RAeliv0lalW2iVqlCMmNeGZgmsfNpGsBeW46bD3PLjGUc/Head https://w3id.org/np/RAeliv0lalW2iVqlCMmNeGZgmsfNpGsBeW46bD3PLjGUc http://www.nanopub.org/nschema#hasAssertion https://w3id.org/np/RAeliv0lalW2iVqlCMmNeGZgmsfNpGsBeW46bD3PLjGUc/assertion https://w3id.org/np/RAeliv0lalW2iVqlCMmNeGZgmsfNpGsBeW46bD3PLjGUc http://www.nanopub.org/nschema#hasProvenance https://w3id.org/np/RAeliv0lalW2iVqlCMmNeGZgmsfNpGsBeW46bD3PLjGUc/provenance https://w3id.org/np/RAeliv0lalW2iVqlCMmNeGZgmsfNpGsBeW46bD3PLjGUc http://www.nanopub.org/nschema#hasPublicationInfo https://w3id.org/np/RAeliv0lalW2iVqlCMmNeGZgmsfNpGsBeW46bD3PLjGUc/pubinfo https://w3id.org/np/RAeliv0lalW2iVqlCMmNeGZgmsfNpGsBeW46bD3PLjGUc http://www.w3.org/1999/02/22-rdf-syntax-ns#type http://www.nanopub.org/nschema#Nanopublication https://w3id.org/np/RAeliv0lalW2iVqlCMmNeGZgmsfNpGsBeW46bD3PLjGUc/assertion https://doi.org/10.48550/arXiv.2410.13080 http://purl.org/dc/terms/title Graph-constrained Reasoning: Faithful Reasoning on Knowledge Graphs with Large Language Models https://doi.org/10.48550/arXiv.2410.13080 http://purl.org/spar/cito/describes https://neverblink.eu/ontologies/llm-kg/methods#graphConstrainedReasoning https://doi.org/10.48550/arXiv.2410.13080 http://purl.org/spar/cito/discusses https://neverblink.eu/ontologies/llm-kg/methods#debateOnGraph https://doi.org/10.48550/arXiv.2410.13080 http://purl.org/spar/cito/discusses https://neverblink.eu/ontologies/llm-kg/methods#effiQA https://doi.org/10.48550/arXiv.2410.13080 http://purl.org/spar/cito/discusses https://neverblink.eu/ontologies/llm-kg/methods#ewekQA https://doi.org/10.48550/arXiv.2410.13080 http://purl.org/spar/cito/discusses https://neverblink.eu/ontologies/llm-kg/methods#gfmRag https://doi.org/10.48550/arXiv.2410.13080 http://purl.org/spar/cito/discusses https://neverblink.eu/ontologies/llm-kg/methods#gnnRag https://doi.org/10.48550/arXiv.2410.13080 http://purl.org/spar/cito/discusses https://neverblink.eu/ontologies/llm-kg/methods#gnnRagRa https://doi.org/10.48550/arXiv.2410.13080 http://purl.org/spar/cito/discusses https://neverblink.eu/ontologies/llm-kg/methods#kdCoT https://doi.org/10.48550/arXiv.2410.13080 http://purl.org/spar/cito/discusses https://neverblink.eu/ontologies/llm-kg/methods#planOnGraph https://doi.org/10.48550/arXiv.2410.13080 http://purl.org/spar/cito/discusses https://neverblink.eu/ontologies/llm-kg/methods#rog https://doi.org/10.48550/arXiv.2410.13080 http://purl.org/spar/cito/discusses https://neverblink.eu/ontologies/llm-kg/methods#structGPT https://doi.org/10.48550/arXiv.2410.13080 http://purl.org/spar/cito/discusses https://neverblink.eu/ontologies/llm-kg/methods#symAgent https://doi.org/10.48550/arXiv.2410.13080 http://purl.org/spar/cito/discusses https://neverblink.eu/ontologies/llm-kg/methods#toG https://doi.org/10.48550/arXiv.2410.13080 http://www.w3.org/1999/02/22-rdf-syntax-ns#type http://www.w3.org/ns/prov#Entity https://neverblink.eu/ontologies/llm-kg/methods#debateOnGraph http://www.w3.org/1999/02/22-rdf-syntax-ns#type http://purl.org/spar/fabio/Workflow https://neverblink.eu/ontologies/llm-kg/methods#debateOnGraph http://www.w3.org/2000/01/rdf-schema#label Debate on Graph https://neverblink.eu/ontologies/llm-kg/methods#effiQA http://www.w3.org/1999/02/22-rdf-syntax-ns#type http://purl.org/spar/fabio/Workflow https://neverblink.eu/ontologies/llm-kg/methods#effiQA http://www.w3.org/2000/01/rdf-schema#label EffiQA https://neverblink.eu/ontologies/llm-kg/methods#ewekQA http://www.w3.org/1999/02/22-rdf-syntax-ns#type http://purl.org/spar/fabio/Workflow https://neverblink.eu/ontologies/llm-kg/methods#ewekQA http://www.w3.org/2000/01/rdf-schema#label EWEK-QA https://neverblink.eu/ontologies/llm-kg/methods#gfmRag http://www.w3.org/1999/02/22-rdf-syntax-ns#type http://purl.org/spar/fabio/Workflow https://neverblink.eu/ontologies/llm-kg/methods#gfmRag http://www.w3.org/2000/01/rdf-schema#label GFM-RAG https://neverblink.eu/ontologies/llm-kg/methods#gnnRag http://www.w3.org/1999/02/22-rdf-syntax-ns#type http://purl.org/spar/fabio/Workflow https://neverblink.eu/ontologies/llm-kg/methods#gnnRag http://www.w3.org/2000/01/rdf-schema#label GNN-RAG https://neverblink.eu/ontologies/llm-kg/methods#gnnRagRa http://www.w3.org/1999/02/22-rdf-syntax-ns#type http://purl.org/spar/fabio/Workflow https://neverblink.eu/ontologies/llm-kg/methods#gnnRagRa http://www.w3.org/2000/01/rdf-schema#label GNN-RAG+RA https://neverblink.eu/ontologies/llm-kg/methods#graphConstrainedReasoning http://purl.org/dc/terms/subject https://neverblink.eu/ontologies/llm-kg/categories#SynergizedReasoning https://neverblink.eu/ontologies/llm-kg/methods#graphConstrainedReasoning http://www.w3.org/1999/02/22-rdf-syntax-ns#type http://purl.org/spar/fabio/Workflow https://neverblink.eu/ontologies/llm-kg/methods#graphConstrainedReasoning http://www.w3.org/2000/01/rdf-schema#comment 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. https://neverblink.eu/ontologies/llm-kg/methods#graphConstrainedReasoning http://www.w3.org/2000/01/rdf-schema#label Graph-constrained Reasoning (GCR) https://neverblink.eu/ontologies/llm-kg/methods#graphConstrainedReasoning https://neverblink.eu/ontologies/llm-kg/hasTopCategory https://neverblink.eu/ontologies/llm-kg/top-categories#SynergizedLLMKG https://neverblink.eu/ontologies/llm-kg/methods#kdCoT http://www.w3.org/1999/02/22-rdf-syntax-ns#type http://purl.org/spar/fabio/Workflow https://neverblink.eu/ontologies/llm-kg/methods#kdCoT http://www.w3.org/2000/01/rdf-schema#label KD-CoT https://neverblink.eu/ontologies/llm-kg/methods#planOnGraph http://www.w3.org/1999/02/22-rdf-syntax-ns#type http://purl.org/spar/fabio/Workflow https://neverblink.eu/ontologies/llm-kg/methods#planOnGraph http://www.w3.org/2000/01/rdf-schema#label Plan-on-Graph https://neverblink.eu/ontologies/llm-kg/methods#rog http://www.w3.org/1999/02/22-rdf-syntax-ns#type http://purl.org/spar/fabio/Workflow https://neverblink.eu/ontologies/llm-kg/methods#rog http://www.w3.org/2000/01/rdf-schema#label RoG https://neverblink.eu/ontologies/llm-kg/methods#structGPT http://www.w3.org/1999/02/22-rdf-syntax-ns#type http://purl.org/spar/fabio/Workflow https://neverblink.eu/ontologies/llm-kg/methods#structGPT http://www.w3.org/2000/01/rdf-schema#label StructGPT https://neverblink.eu/ontologies/llm-kg/methods#symAgent http://www.w3.org/1999/02/22-rdf-syntax-ns#type http://purl.org/spar/fabio/Workflow https://neverblink.eu/ontologies/llm-kg/methods#symAgent http://www.w3.org/2000/01/rdf-schema#label SymAgent https://neverblink.eu/ontologies/llm-kg/methods#toG http://www.w3.org/1999/02/22-rdf-syntax-ns#type http://purl.org/spar/fabio/Workflow https://neverblink.eu/ontologies/llm-kg/methods#toG http://www.w3.org/2000/01/rdf-schema#label ToG https://w3id.org/np/RAeliv0lalW2iVqlCMmNeGZgmsfNpGsBeW46bD3PLjGUc/provenance https://w3id.org/np/RAeliv0lalW2iVqlCMmNeGZgmsfNpGsBeW46bD3PLjGUc/assertion http://www.w3.org/ns/prov#wasAttributedTo https://neverblink.eu/ontologies/llm-kg/agent https://w3id.org/np/RAeliv0lalW2iVqlCMmNeGZgmsfNpGsBeW46bD3PLjGUc/assertion http://www.w3.org/ns/prov#wasDerivedFrom https://doi.org/10.48550/arXiv.2410.13080 https://w3id.org/np/RAeliv0lalW2iVqlCMmNeGZgmsfNpGsBeW46bD3PLjGUc/pubinfo https://w3id.org/np/RAeliv0lalW2iVqlCMmNeGZgmsfNpGsBeW46bD3PLjGUc http://purl.org/dc/terms/created 2026-02-26T15:39:45.569Z https://w3id.org/np/RAeliv0lalW2iVqlCMmNeGZgmsfNpGsBeW46bD3PLjGUc http://purl.org/dc/terms/creator https://neverblink.eu/ontologies/llm-kg/agent https://w3id.org/np/RAeliv0lalW2iVqlCMmNeGZgmsfNpGsBeW46bD3PLjGUc http://purl.org/nanopub/x/hasNanopubType https://neverblink.eu/ontologies/llm-kg/PaperAssessmentResult https://w3id.org/np/RAeliv0lalW2iVqlCMmNeGZgmsfNpGsBeW46bD3PLjGUc http://www.w3.org/2000/01/rdf-schema#label LLM-KG assessment for paper 10.48550/arXiv.2410.13080 https://w3id.org/np/RAeliv0lalW2iVqlCMmNeGZgmsfNpGsBeW46bD3PLjGUc/sig http://purl.org/nanopub/x/hasAlgorithm RSA https://w3id.org/np/RAeliv0lalW2iVqlCMmNeGZgmsfNpGsBeW46bD3PLjGUc/sig http://purl.org/nanopub/x/hasPublicKey MIIBIjANBgkqhkiG9w0BAQEFAAOCAQ8AMIIBCgKCAQEAwNz2QK3SEifno78S7+48zUB0xpTex3mAzW73ZimHqNcdEMU5/apslrGrTHGFAt/Chocgo++r6JQp5ygY7NyJHGWdaIqnt85pjX4PbNfLAvapyUO00qZP34fY61w4eZ9UMtleWEsmZKRtQPyJ8ODl46i/rfPuZlcJGpM9Nmy5mpGWuepqIEvF4a/t7pLVeCEDFSYXT+yaiygt6ynIK5f7TtEDhZpeUf/Q74WhMPJXm4yTU/hqOX4IW+50kWHNArGGZwUaXwzyG6M3Zd6UMModryGkLqS4H/MSE3ZA1Ylnms7BfWLEXhMWlaKi6HRV4nGRDLhxVSi9LSRi3LWKLhNIIQIDAQAB https://w3id.org/np/RAeliv0lalW2iVqlCMmNeGZgmsfNpGsBeW46bD3PLjGUc/sig http://purl.org/nanopub/x/hasSignature hRoS4keA+iPLvnPI9Ys43Lp/yZYhLDa8xANXI11TMLLZDqSy40tM7SMkkYYHwj2ojlb9JCE6KklzGm1Xl37PvRKVmQkdpiuJV6Baj6gdZ5GJdQyvfPtZXQZ+aA6tY7CZ51FwD2lxEBYcytlRzawLcLUfyEYgtB21RdXV4XIJbYkn920cuCNFys15s2jOBiDOY+Tuu6I8+mewBvpDJi03YNUJz6jrcWsfbCF4DaFSWd9h2wj079CROK7sYG6KNCFnDHv64w8EGhPKlh6n0qrclSx2413hTRM2DDpvNiLrF0w5hDJYzuKAfVpp7ghiZxDDW9ZjqXFwbyEJUFJ584Xy8A== https://w3id.org/np/RAeliv0lalW2iVqlCMmNeGZgmsfNpGsBeW46bD3PLjGUc/sig http://purl.org/nanopub/x/hasSignatureTarget https://w3id.org/np/RAeliv0lalW2iVqlCMmNeGZgmsfNpGsBeW46bD3PLjGUc https://w3id.org/np/RAeliv0lalW2iVqlCMmNeGZgmsfNpGsBeW46bD3PLjGUc/sig http://purl.org/nanopub/x/signedBy https://neverblink.eu/ontologies/llm-kg/agent