MétaCan
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.

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 12 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
Three Semantics for Modular Systems
Shahab Tasharrofi, Eugenia Ternovska
2014· preprint· en· arXiv (Cornell University)· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
1
citations
affno abstractunlabeled
Considerations on Compositional Update Operators
Matthew Suderman, James P. Delgrande
2000· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
1
citations
affunlabeled
Probabilistic programming semantics for name generation
Marcin Sabok, Sam Staton, Dario Stein, Michael Wolman
2021· preprint· en· Proceedings of the ACM on Programming Languages· Computer Science
distilled prediction:candidate · metaepi_narrow+scholarly_communicationconsensus · none
1
citations
affno abstractunlabeled
Approximate Reasoning
Vilém Novák
2009· book-chapter· en· Encyclopedia of Database Systems· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
1
citations
affno abstractunlabeled
Introduction
Dav M. Gabbay, John Woods
2005· book-chapter· en· ˜A œpractical logic of cognitive systems· Computer Science
distilled prediction:candidate · metaepi_narrow+insufficient_payloadconsensus · none
1
citations
affunlabeled
Some Remarks on Relations between Proofs and Games
Didier Galmiche, Dominique Larchey-Wendling, Joseph Vidal-Rosset
2010· preprint· en· HAL (Le Centre pour la Communication Scientifique Directe)· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
1
citations
affno abstractunlabeled
A “Logical Intuition” Based on Semantic Associations
Can Mekik, Olivier Vivier, Henry Markovits
2024· preprint· en· SSRN Electronic Journal· Computer Science
distilled prediction:candidate · metaepi_narrow+research_integrityconsensus · none
1
citations
affunlabeled
Synchronous Games in the Situation Calculus
Giuseppe De Giacomo, Yves Lespérance, Adrian R. Pearce
2015· article· en· IRIS Research product catalog (Sapienza University of Rome)· Computer Science
distilled prediction:candidate · noneconsensus · none
1
citations
affunlabeled
From slot mereology to a mereology of slots
Cédric Tarbouriech, Laure Vieu, Jean‐François Éthier
2024· article· en· Applied Ontology· Computer Science
distilled prediction:candidate · insufficient_payloadconsensus · none
1
citations
affno abstractunlabeled
Testing Minimax for Rational Ignorant Agents
Marc‐Kevin Daoust, David Montminy
2017· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrow+scholarly_communicationconsensus · none
1
citations
affunlabeled
KNOWBEL: a hybrid expert system building tool
John Mylopoulos, H. Wang, André Kushniruk
2002· article· en· [1990] Proceedings of the 2nd International IEEE Conference on Tools for Artificial Intelligence· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
1
citations
afffundunlabeled
Stative versus Eventive Predicates and vP-internal Structure
Jozina Vander Klok, Rose‐Marie Déchaine
2014· article· en· Proceedings of the Annual Meeting of the Berkeley Linguistics Society· Computer Science
distilled prediction:candidate · metaresearchconsensus · none
1
citations
affunlabeled
Agent Architectures and Hierarchical Control
David Poole, Alan K. Mackworth
2010· book-chapter· en· Cambridge University Press eBooks· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
1
citations
affno abstractunlabeled
Logic as a Description of a Logical Agent
Dov M. Gabbay, John Woods
2003· book-chapter· en· ˜A œpractical logic of cognitive systems· Computer Science
distilled prediction:candidate · metaepi_narrow+insufficient_payloadconsensus · none
1
citations
venueno affunlabeled
Dialectical Logic and Boolean Algebra
Yaozhi Jiang
2019· article· en· Journal of Mathematics Research· Computer Science
distilled prediction:candidate · noneconsensus · none
1
citations
affunlabeled
The Limits of Morality in Strategic Games
Rui Cao, Pavel Naumov
2022· article· en· Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence· Computer Science
distilled prediction:candidate · noneconsensus · none
1
citations
affunlabeled
On the dependencies of logical rules
Marc Bagnol, Amina Doumane, Alexis Saurin
2015· preprint· en· Computer Science
distilled prediction:candidate · noneconsensus · none
1
citations
affunlabeled
Finite Model Computation via Answer Set Programming
Martin Gebser, Orkunt Sabuncu, Torsten Schaub
2011· article· en· Griffith Research Online (Griffith University, Queensland, Australia)· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
1
citations
affunlabeled
A logical theory of robot localization
Vaishak Belle, Hector J. Levesque
2014· article· en· Adaptive Agents and Multi-Agents Systems· Computer Science
distilled prediction:candidate · noneconsensus · none
1
citations
affunlabeled
From Actions to Programs as Abstract Actual Causes
Bita Banihashemi, Shakil M. Khan, Mikhail Soutchanski
2022· article· en· Proceedings of the AAAI Conference on Artificial Intelligence· Computer Science
distilled prediction:candidate · noneconsensus · none
1
citations
affno abstractunlabeled
Null Values
Leopoldo Bertossi
2009· book-chapter· pt· Encyclopedia of Database Systems· Computer Science
distilled prediction:candidate · metaepi_narrow+insufficient_payloadconsensus · metaepi_narrow
1
citations
affunlabeled
Hybrid Temporal Situation Calculus
Vitaliy Batusov, Giuseppe De Giacomo, Mikhail Soutchanski
2023· preprint· en· Computer Science
distilled prediction:candidate · insufficient_payloadconsensus · none
1
citations
affunlabeled
Excluded Middle versus Choice in a topos
Bernhard Banaschewski
2005· article· en· Mathematical logic quarterly· Computer Science
distilled prediction:candidate · insufficient_payloadconsensus · none
1
citations
affno abstractunlabeled
Optimality Theory through Default Logic
Philippe Besnard, Robert E. Mercer, Torsten Schaub
2003· article· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · noneconsensus · none
1
citations
venueno affunlabeled
Arguing About Arguing with Arguments
Harvey Siegel
2025· article· fr· Informal Logic· Computer Science
distilled prediction:candidate · metaepi_narrow+insufficient_payloadconsensus · none
1
citations
affno abstractunlabeled
Entailment, Mingle and Binary Accessibility
Katalin Bimbó, J. Michael Dunn
2024· book-chapter· en· Outstanding contributions to logic· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
1
citations
venueno affunlabeled
A classification of incompleteness statements
Henry Towsner, James Igoe Walsh
2025· article· en· Canadian Mathematical Bulletin· Computer Science
distilled prediction:candidate · insufficient_payloadconsensus · none
1
citations

How this was built: Screen · Findings · About