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
Author
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 15 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.

affunlabeled
Planning with Certainty
David Poole, Alan K. Mackworth
2010· book-chapter· en· Cambridge University Press eBooks· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
0
citations
affno abstractunlabeled
Qualitative Uncertainty Reasoning in AgentSpeak
Michael Vezina, Babak Esfandiari, Sandra Morley, François Schwarzentruber
2023· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
0
citations
affunlabeled
A Tool for Reasoning about Trust and Belief
Aaron Hunter, Alberto Iglesias
2024· article· en· EPiC series in computing· Computer Science
distilled prediction:candidate · noneconsensus · none
0
citations
aboutno affunlabeled
RECOMMENDATIONS
2008· article· en· Computer Science
distilled prediction:candidate · insufficient_payloadconsensus · none
0
citations
afffundunlabeled
Heuristic Planning in Adversarial Dynamic Domains
Simon Chamberland, Froduald Kabanza
2011· article· en· Proceedings of the AAAI Conference on Artificial Intelligence· Computer Science
distilled prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
The Truth about Defaults
Hector J. Levesque, Gerhard Lakemeyer
2012· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrow+scholarly_communication+open_scienceconsensus · none
0
citations
fundno affno abstractunlabeled
Logics in Artificial Intelligence
2025· book· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrow+open_scienceconsensus · none
0
citations
affunlabeled
Toulmin’s “Analytic Arguments”
Benjamin Hamby
2011· article· de· DOAJ (DOAJ: Directory of Open Access Journals)· Computer Science
distilled prediction:candidate · metaepi_narrow+scholarly_communication+open_science+insufficient_payloadconsensus · insufficient_payload
0
citations
aboutno affunlabeled
Preface
Wolfram Kahl, David Lorge Parnas, G. Schmidt
2003· article· en· Electronic Notes in Theoretical Computer Science· Computer Science
distilled prediction:candidate · noneconsensus · none
0
citations
fundno affunlabeled
NOTICES
Phokion G. Kolaitis, Santa Cruz, Christina Brech, Bahareh Afshari
2022· article· en· Bulletin of Symbolic Logic· Computer Science
distilled prediction:candidate · insufficient_payloadconsensus · none
0
citations
aboutno affunlabeled
Editorial
Sergei Artëmov, Anil Nerode
2020· editorial· en· Journal of Logic and Computation· Computer Science
distilled prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
What Next for ASP? (A Not-Entirely-Well-Informed Opinion)
James P. Delgrande
2009· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrow+scholarly_communication+open_scienceconsensus · none
0
citations
affunlabeled
Models of CL
J. Roger Hindley, Jonathan P. Seldin
2012· book-chapter· en· Cambridge University Press eBooks· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
0
citations
affno abstractunlabeled
Strong Connectedness Revisited
James F. Peters
2016· book-chapter· en· Intelligent systems reference library· Computer Science
distilled prediction:candidate · metaepi_narrow+insufficient_payloadconsensus · insufficient_payload
0
citations
affno abstractunlabeled
Guest Editors’ Introduction
James P. Delgrande, Jérôme Lang
2014· article· en· Journal of Philosophical Logic· Computer Science
distilled prediction:candidate · noneconsensus · none
0
citations
affunlabeled
Convex Functions in ACL2(r)
Carl Kwan, Mark R. Greenstreet
2018· article· en· arXiv (Cornell University)· Computer Science
distilled prediction:candidate · insufficient_payloadconsensus · none
0
citations
affno abstractunlabeled
Models and Formal Representations
John Woods
2018· book-chapter· en· Synthese Library/Synthese library· Computer Science
distilled prediction:candidate · metaepi_narrow+scholarly_communication+insufficient_payloadconsensus · scholarly_communication+insufficient_payload
0
citations
fundno affunlabeled
Reasoning Models Can Be Effective Without Thinking
Wenjie Ma, Jingxuan He, Charlie Snell, Tyler Griggs, Sewon Min, Matei Zaharia
2025· preprint· en· ArXiv.org· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
0
citations
affunlabeled
STRIP: Structural sharing and intuitionistic proof-search
Didier Galmiche, Dominique Larchey-Wendling, Daniel Méry
2000· article· en· HAL (Le Centre pour la Communication Scientifique Directe)· Computer Science
distilled prediction:candidate · noneconsensus · none
0
citations
affunlabeled
Bounded Situation Calculus Action Theories
Giuseppe De Giacomo, Yves Lespérance, Fabio Patrizi
2015· preprint· en· arXiv (Cornell University)· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
0
citations
venueno affunlabeled
La logique modale des modèles d’équilibre
Luis Farina del Cerro, Andreas Herzig
2012· article· fr· Revue d intelligence artificielle· Computer Science
distilled prediction:candidate · metaepi_narrow+insufficient_payloadconsensus · insufficient_payload
0
citations
affunlabeled
Reductions and NP-Completeness
2024· book-chapter· en· Cambridge University Press eBooks· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
0
citations
venueno affunlabeled
Right Delocalization of Model Categories
Bruce R. Corrigan-Salter
2016· article· en· Theory and applications of categories· Computer Science
distilled prediction:candidate · noneconsensus · none
0
citations
affunlabeled
Proof Theory
Alasdair Urquhart
2010· book-chapter· en· Cambridge University Press eBooks· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
0
citations
affunlabeled
Extensional Higher-Order Logic Programming
Angelos Charalambidis, Konstantinos Handjopoulos, Panos Rondogiannis, William W. Wadge
2011· preprint· en· arXiv (Cornell University)· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
0
citations
← previousnext →

How this was built: Screen · Findings · About