Papers › Differentiable Reasoning on Large Knowledge Bases and Natural Language
Differentiable Reasoning on Large Knowledge Bases and Natural Language
Pasquale Minervini, Matko Bošnjak, Tim Rocktäschel, Sebastian Riedel, Edward Grefenstette
Reasoning with knowledge expressed in natural language and Knowledge Bases (KBs) is a major challenge for Artificial Intelligence, with applications in machine reading, dialogue, and question answering. General neural architectures that jointly learn representations and transformations of text are very data-inefficient, and it is hard to analyse their reasoning process. These issues are addressed by end-to-end differentiable reasoning systems such as Neural Theorem Provers (NTPs), although they can only be used with small-scale symbolic KBs. In this paper we first propose Greedy NTPs (GNTPs), an extension to NTPs addressing their complexity and scalability limitations, thus making them applicable to real-world datasets. This result is achieved by dynamically constructing the computation graph of NTPs and including only the most promising proof paths during inference, thus obtaining orders of magnitude more efficient models. Then, we propose a novel approach for jointly reasoning over KBs and textual mentions, by embedding logic facts and natural language sentences in a shared embedding space. We show that GNTPs perform on par with NTPs at a fraction of their cost while achieving competitive link prediction results on large datasets, providing explanations for predictions, and inducing interpretable models. Source code, datasets, and supplementary material are available online at https://github.com/uclnlp/gntp.
In Syntology View this paper on Syntology, its page in Syntology's graph. That page adds which of its functions are also present in other papers' code Syntology holds, with dates, and its dated run record as JSON and a README badge. It also lists the repositories linked to the paper, the abstract and the calls for agents.
Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.
For agents, on Syntology's MCP service (how to connect):
get_harvested_code_for_paper(arxiv_id="1912.10824")get_code(code_sha256="…")with a sample'scode_sha256from the list belowget_citation_path(paper_1="1912.10824", paper_2="…")with another paper's arXiv id or titleget_concepts_for_paper(arxiv_id="1912.10824")
Code
Syntology 26 code samples harvested from 2 repositories linked to this paper: 15 ran (of which 0 constructed an object rather than computing a result; 15 with no instrument failure: 0 honoured, 0 violated, 15 with no contract checked; 0 where Syntology's instrument failed) · 11 unverified. “Where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code; here there are none.
By repository: official repository: 26 samples from 2 repositories, 15 ran (15 with no instrument failure; 0 where Syntology's instrument failed). The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.
No sample is linked to this paper from 1 of its repositories that Syntology harvested for other papers:
- uclnlp/ctp, official repository: harvested for another paper, listed under the repository
Levels written on 2026-09-25 (UTC): the dates Syntology's graph wrote each sample's verification level, not when the code executed.
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
A paper named beside a repository with no sample linked to this paper is shown with that paper's own run record, not this paper's: “ran” means executed on a synthesized input, not that the code is correct, and “where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code. Papers are listed in arXiv-id order, at most three per repository.
Code Syntology ran Syntology
26 samples harvested: 15 ran (of which 0 constructed an object rather than computing a result; 15 with no instrument failure: 0 honoured, 0 violated, 15 with no contract checked; 0 where Syntology's instrument failed) · 11 unverified. “Where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code. Syntology's record for this page has not changed since , the first build that kept a record date for it; when this build read Syntology's graph is in the build record. That date is not when the samples ran.
Licence: 0 of the 26 samples are pointer only, meaning Syntology does not serve that copy's text. This page shows no code text for any sample; each one links to its file in the repository.
Harvested from 2 repositories linked to this paper, official or community; the list below is grouped by repository, each group headed by its name and what it is to the paper. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. A line beginning “fixture:” under a sample that ran gives the arguments Syntology's fixture called the sample with, each as name:type/rank/element kind (? where none was recorded), and the type of what the fixture's run returned, exactly as the harness recorded them; the arguments and the returned type were recorded by two separate runs of the same fixture. No output value is shown, and a returned type says nothing about whether the output was right. “Level recorded” gives the UTC date when Syntology's graph wrote the sample's verification level, not when the code executed; where the level was written before Syntology's graph kept that date, the row says “level recorded, date not recorded”. For 1 sample that ran, the graph records a signature this page does not show: an argument's recorded type or element kind is a printout of an object in Syntology's harness (such as a mock object, a class or a pandas printout), not the type of an input, so it does not describe the call's shape. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself. “Our draft was wrong” and “the contract check could not run” are failures of Syntology's instrument, not of the code: the sample ran on Syntology's synthesized input, and then the drafted contract did not describe it, or the check itself raised an error (RAISES), lacked a dependency (DEP_MISSING) or ran out of time (TIMEOUT); hover the label for which. A metamorphic tier, where shown, is evidence of the output's shape, not that the sample implements the method.
Each sample ends with its code_sha256. A sample's code_sha256 is Syntology's identity for that exact code. It is printed in full (16 hexadecimal characters for every sample in this build), and get_code(code_sha256="…") takes it exactly as printed. An agent calls it on Syntology's MCP service (how to connect); click an identity to copy that call.
Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted. community: Not in the archive's code links for this paper; a community repository Syntology harvested. Samples are grouped by repository: a repository marked official first, then by how directly the repository is tied to the paper, then in the archive's order; never by how many ran. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of six reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar); this paper's copy was not located, so its licence is not recorded; or this paper's copy is cleared, but the stored copy of the same code that Syntology serves is not. Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.
A function or class name links to its page when the name occurs in the harvested code of at least 5 papers; the name is a string, not an identity. A census tag appears when Syntology's census ran implementations with that name on one shared input per bucket: it gives how many were compared, from how many papers, and how many distinct outputs they produced, and names this sample's bucket when this sample was one of them.
census: 11 implementations from 10 papers, 7 distinct outputs across 5 buckets, one shared input per bucket gntp/attention.py ran MIT (permissive) ·
8ff6535b5f8688aa · report
fixture: signature logits:EagerTensor/2/float, mask:EagerTensor/2/float · returned EagerTensor · level recorded 2026-09-25 6ff9dbea90d5710f · report
fixture: signature _checkpoint_path:str/0/str · returned bool · level recorded 2026-09-25 504b918b060a4ed7 · report
fixture: signature x:EagerTensor/2/float, epsilon:float/0/float · returned SymbolicTensor · level recorded 2026-09-25 bd0230f569a312c8 · report
fixture: signature mask_indices:EagerTensor/1/int, mask_shape:TensorShape/0/?, indices:NoneType/0/? · returned EagerTensor · level recorded 2026-09-25 b0f8f95117e6f32b · report
fixture: signature _checkpoint_path:str/0/str · returned dict · level recorded 2026-09-25 fd3cdc689950a17a · report
fixture: signature path:str/0/str · returned list · level recorded 2026-09-25 842678021f43c382 · report
fixture: signature atom:Atom/0/? · returned str · level recorded 2026-09-25 137ebc202f3a3a6e · report
fixture: signature scores:ndarray/2/float, k:int/0/int · returned tuple · level recorded 2026-09-25 b6dbe45fcd29ec5e · report
fixture: signature data:dict/0/?, order:tuple/1/str, structure:tuple/1/int · returned tuple · level recorded 2026-09-25 08da9620aade33aa · report
fixture: signature arg:Atom/1/str · returned bool · level recorded 2026-09-25 86a13149d6073483 · report
fixture: signature arg:EagerTensor/2/float · returned bool · level recorded 2026-09-25 35f3db77164bbce5 · report
fixture: signature arg:str/0/str · returned bool · level recorded 2026-09-25 7aff3f773673f361 · report
fixture: signature kb_ids:dict/0/? · returned set · level recorded 2026-09-25 1d05c029e1a88874 · report
fixture: returned str · level recorded 2026-09-25 b6b34a3aaa5bb4e9 · report
fixture: signature string:str/0/str · returned str · level recorded 2026-09-25 9a713eefc8e66051 · report
19db131ea10b3837 · report
a3b949dcebbfa464 · report
Tasks
Results from the paper archive 2025-07-28
| Task | Dataset | Model | Metric | Value | Rank at snapshot | Leaderboard | Report |
|---|---|---|---|---|---|---|---|
| Link Prediction | FB122 | GNTPs | HITS@3 | 69.2 | #3 of 5 | Archive leaderboard | report |
| Link Prediction | FB122 | GNTPs | Hits@10 | 73.2 | #3 of 5 | Archive leaderboard | report |
| Link Prediction | FB122 | GNTPs | Hits@5 | 71.1 | #3 of 5 | Archive leaderboard | report |
| Link Prediction | FB122 | GNTPs | MRR | 67.8 | #3 of 5 | Archive leaderboard | report |
Ranks are positions in the archive's leaderboards as they stood at the 2025-07-28 snapshot. Results published since then are not among these rows, so a rank here is not a current standing.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections