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
ACM Transactions on Computational Logic
Topic
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.

42 results · 1 filter active ·
Results by year
20012025
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.
42 works in the cohort · of 4,299,418page 1 of 1

Labels cover 0 of 42 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 42 of 42 works in this cohort. Predictions are machine_predicted_unvalidated. The Gemma side is a direct model label for every work (title-only); the Codex side is a distilled, calibrated classifier. Candidate is the union; consensus is the intersection.

affunlabeled
Contextual modal type theory
Aleksandar Nanevski, Frank Pfenning, Brigitte Pientka
2008· article· en· ACM Transactions on Computational Logic· Computer Science
machine prediction:candidate · noneconsensus · none
263
citations
affunlabeled
Kleene algebra with domain
Jules Desharnais, Bernhard Möller, Georg Struth
2006· article· en· ACM Transactions on Computational Logic· Computer Science
machine prediction:candidate · noneconsensus · none
173
citations
affunlabeled
A logic of nonmonotone inductive definitions
Marc Denecker, Eugenia Ternovska
2008· article· en· ACM Transactions on Computational Logic· Computer Science
machine prediction:candidate · noneconsensus · none
109
citations
affunlabeled
Domain-dependent knowledge in answer set planning
Tran Cao Son, Chitta Baral, Nam Tran, Sheila A. McIlraith
2006· article· en· ACM Transactions on Computational Logic· Computer Science
machine prediction:candidate · noneconsensus · none
60
citations
afffundunlabeled
Algebra-coalgebra duality in brzozowski's minimization algorithm
Filippo Bonchi, Marcello Bonsangue, Helle Hvid Hansen, Prakash Panangaden, Jan Rutten, Alexandra Silva
2014· article· en· ACM Transactions on Computational Logic· Computer Science
machine prediction:candidate · noneconsensus · none
55
citations
affunlabeled
Incremental execution of guarded theories
Giuseppe De Giacomo, Hector J. Levesque, Sebastian Sardiña
2001· article· en· ACM Transactions on Computational Logic· Computer Science
machine prediction:candidate · noneconsensus · none
30
citations
affunlabeled
Extensional Higher-Order Logic Programming
Angelos Charalambidis, Konstantinos Handjopoulos, Panagiotis Rondogiannis, William W. Wadge
2013· article· en· ACM Transactions on Computational Logic· Computer Science
machine prediction:candidate · noneconsensus · none
28
citations
affunlabeled
The Logical View on Continuous Petri Nets
Michael Blondin, Alain Finkel, Christoph Haase, Serge Haddad
2017· article· en· ACM Transactions on Computational Logic· Computer Science
machine prediction:candidate · noneconsensus · none
26
citations
affunlabeled
Robust Vacuity for Branching Temporal Logic
Arie Gurfinkel, Marsha Chećhik
2012· article· en· ACM Transactions on Computational Logic· Computer Science
machine prediction:candidate · noneconsensus · none
25
citations
affunlabeled
Logics capturing local properties
Leonid Libkin
2001· article· en· ACM Transactions on Computational Logic· Computer Science
machine prediction:candidate · noneconsensus · none
10
citations
affunlabeled
Differential recursion
Akitoshi Kawamura
2009· article· en· ACM Transactions on Computational Logic· Computer Science
machine prediction:candidate · noneconsensus · none
7
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
machine prediction:candidate · noneconsensus · none
6
citations
affunlabeled
QCSP on Reflexive Tournaments
Benoît Larose, Barnaby Martin, Petar Marković, Daniël Paulusma, Siani Smith, Stanislav Živný
2022· article· en· ACM Transactions on Computational Logic· Computer Science
machine prediction:candidate · noneconsensus · none
2
citations
affunlabeled
Reachability Problems in Piecewise FIFO Systems
Naghmeh Ghafari, Arie Gurfinkel, Nils Klarlund, Richard Trefler
2012· article· en· ACM Transactions on Computational Logic· Computer Science
machine prediction:candidate · noneconsensus · none
2
citations
affunlabeled
Domain-dependent knowledge in answer set planning
Tran Cao Son, Chitta Baral, Nam Tran, Sheila A. McIlraith
2006· article· en· ACM Transactions on Computational Logic· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
affunlabeled
Reducible Theories and Amalgamations of Models
Bahar Aameri, Michael Grüninger
2022· article· en· ACM Transactions on Computational Logic· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
afffundunlabeled
Continuous One-counter Automata
Michael Blondin, Tim Leys, Filip Mazowiecki, Philip Offtermatt, Guillermo A. Pérez
2022· article· en· ACM Transactions on Computational Logic· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations

How this was built: Screen · Findings · About