MétaCan
ENFR
Menu
Cohort builder

4,299,418 works, Canadian by any of four routes.

Every filter state is a URL; the URL is the query; the query is citable via /q/⟨hash⟩. The page, the API and the export parse the same parameters.

Export CSVExport JSONAPI query

The current cohort, streamed from the database: every work column, the machine labels, the provisional scores, and the per-row validation status. Exports are capped at 100,000 rows. Mints a permanent /q/ link for this exact query. The same filters always produce the same link, whoever asks.

Search term
Year range
→
Sort
Language
Type
Field
Venue
Topic
Logic, Reasoning, and Knowledge
Retraction
Abstract
Evidence source
Study design
Label agreement
Label status

Direct Codex and Gemma labels are unvalidated and sparse. Distilled predictions cover the full frame and are also unvalidated. Choose the evidence source explicitly; absence of a direct label is never a negative label.

affaffiliation
fundfunder
venuejournal
aboutaboutness

The four routes compose: require the funder route and exclude affiliation to get the funder-only stratum no affiliation-based frame ever sees.

835 results · 1 filter active ·
Results by year
20002025
Publication date
Categories
Machine labels · sparse coverage
Evidence
Language
Type
Citations
An unlabeled work is unknown, not a negative. Label coverage is reported on every query.
835 works in the cohort · of 4,299,418page 2 of 17

Labels cover 0 of 835 works in this cohort. The rest are unlabeled, which is not a negative label: the label table is sparse today and grows as labeling rounds land.

Distilled predictions cover 835 of 835 works in this cohort. Predictions are machine_predicted_unvalidated teacher distillation outputs. Candidate is the union; consensus is the intersection.

affno abstractunlabeled
Inductive situation calculus
2007· article· en· Artificial Intelligence· Computer Science
distilled prediction:candidate · insufficient_payloadconsensus · none
60
citations
affno abstractunlabeled
Introduction to Inconsistency Tolerance
2005· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
59
citations
affunlabeled
An exercise in "anhomomorphic logic"
2007· article· en· Journal of Physics Conference Series· Computer Science
distilled prediction:candidate · noneconsensus · none
56
citations
afffundno abstractunlabeled
Belief revision in Horn theories
2014· article· en· Artificial Intelligence· Computer Science
distilled prediction:candidate · insufficient_payloadconsensus · none
51
citations
affno abstractunlabeled
Synonymous Logics
2003· article· en· Journal of Philosophical Logic· Computer Science
distilled prediction:candidate · noneconsensus · none
47
citations
afffundunlabeled
A Knowledge Level Account of Forgetting
2017· article· en· Journal of Artificial Intelligence Research· Computer Science
distilled prediction:candidate · noneconsensus · none
41
citations
affunlabeled
Quantum Proofs
2016· article· en· Foundations and Trends® in Theoretical Computer Science· Computer Science
distilled prediction:candidate · noneconsensus · none
39
citations
affno abstractunlabeled
2 -Way vs.d -Way Branching for CSP
2005· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
38
citations
venueno affunlabeled
Revisiting Deep Disagreement
2005· article· en· Informal Logic· Computer Science
distilled prediction:candidate · insufficient_payloadconsensus · none
37
citations
affno abstractunlabeled
Why Play Logical Games?
2009· book-chapter· en· Computer Science
distilled prediction:candidate · metaepi_narrow+insufficient_payloadconsensus · insufficient_payload
35
citations
affno abstractunlabeled
Bounded situation calculus action theories
2016· article· en· Artificial Intelligence· Computer Science
distilled prediction:candidate · insufficient_payloadconsensus · none
35
citations
affunlabeled
Knowledge Equivalence in Combined Action Theories.
2002· article· en· Edinburgh Research Explorer (University of Edinburgh)· Computer Science
distilled prediction:candidate · metaepi_narrow+insufficient_payloadconsensus · none
35
citations
affno abstractunlabeled
Algorithmic Learning Theory
2004· book· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
33
citations
affunlabeled
Actions and resources in epistemic logic
2006· dissertation· en· ePrints Soton (University of Southampton)· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
31
citations
afffundunlabeled
Horn Clause Contraction Functions
2013· article· en· Journal of Artificial Intelligence Research· Computer Science
distilled prediction:candidate · insufficient_payloadconsensus · none
31
citations
← previousnext →

How this was built: Screen · Findings · About