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

afffundno abstractunlabeled
Decidability of an Xstit Logic
Gillman Payette
2013· article· en· Studia Logica· Computer Science
distilled prediction:candidate · noneconsensus · none
6
citations
affunlabeled
Belief change based on global minimisation
James P. Delgrande, Jérôme Lang, Torsten Schaub
2007· article· en· International Joint Conference on Artificial Intelligence· Computer Science
distilled prediction:candidate · metaepi_narrow+insufficient_payloadconsensus · none
6
citations
affno abstractunlabeled
Two Approaches to Merging Knowledge Bases
James P. Delgrande, Torsten Schaub
2004· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
6
citations
affunlabeled
FOND Planning for Pure-Past Linear Temporal Logic Goals
Luigi Bonassi, Giuseppe De Giacomo, Marco Favorito, Francesco Fuggitti, Alfonso Gerevini, Enrico Scala
2023· book-chapter· en· Frontiers in artificial intelligence and applications· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
6
citations
affno abstractunlabeled
GenB: A General Solver for AGM Revision
Aaron Hunter, Eric C.C. Tsang
2016· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
6
citations
affunlabeled
Epistemic Strategies and Games on Concurrent Processes
Konstantinos Chatzikokolakis, Sophia Knight, Catuscia Palamidessi, Prakash Panangaden
2012· article· en· ACM Transactions on Computational Logic· Computer Science
distilled prediction:candidate · noneconsensus · none
6
citations
affunlabeled
Belief modeling for maritime surveillance
Aaron Hunter
2009· article· en· International Conference on Information Fusion· Computer Science
distilled prediction:candidate · noneconsensus · none
6
citations
affno abstractunlabeled
Grounding Formulas with Complex Terms
Amir Aavani, Xiongnan Wu, Eugenia Ternovska, David G. M. Mitchell
2011· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
6
citations
afffundunlabeled
Planning to Avoid Side Effects
Toryn Q. Klassen, Sheila A. McIlraith, Christian Muise, Jarvis Xu
2022· article· en· Proceedings of the AAAI Conference on Artificial Intelligence· Computer Science
distilled prediction:candidate · noneconsensus · none
6
citations
affunlabeled
On Probing and Multi-Threading in PLATYPUS
Jean Gressmann, Tomi Janhunen, Robert E. Mercer, Torsten Schaub, Sven Thiele, Richard Tichy
2006· article· en· Computer Science
distilled prediction:candidate · noneconsensus · none
6
citations
affno abstractunlabeled
Challenges in Fixpoint Computation with Multisets
Nematollaah Shiri, Zhi Zheng
2004· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
5
citations
affno abstractunlabeled
Weight constraint programs with evaluable functions
Yisong Wang, Jia-Huai You, Fangzhen Lin, Li Yan Yuan, Mingyi Zhang
2010· article· en· Annals of Mathematics and Artificial Intelligence· Computer Science
distilled prediction:candidate · noneconsensus · none
5
citations
affunlabeled
Succinct Population Protocols for Presburger Arithmetic
Michael Blondin, Javier Esparza, Blaise Genest, Martin Helfrich, Stefan Jaax
2020· preprint· en· DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)· Computer Science
distilled prediction:candidate · metaepi_narrow+scholarly_communicationconsensus · none
5
citations
affno abstractunlabeled
Gricean Belief Change
James P. Delgrande, Abhaya Nayak, Maurice Pagnucco
2005· article· en· Studia Logica· Computer Science
distilled prediction:candidate · insufficient_payloadconsensus · none
5
citations
affno abstractunlabeled
Speed-Up Techniques for Negation in Grounding
Amir Aavani, Shahab Tasharrofi, Gülay Ünel, Eugenia Ternovska, David G. M. Mitchell
2010· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
5
citations
affunlabeled
A second-order theory for NL
Simon Cook, Antonina Kolokolova
2004· article· en· Computer Science
distilled prediction:candidate · noneconsensus · none
5
citations

How this was built: Screen · Findings · About