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

affno abstractunlabeled
Inductive situation calculus
Marc Denecker, Eugenia Ternovska
2007· article· en· Artificial Intelligence· Computer Science
machine prediction:candidate · noneconsensus · none
60
citations
affno abstractunlabeled
Introduction to Inconsistency Tolerance
Leopoldo Bertossi, Anthony Hunter, Torsten Schaub
2005· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
59
citations
affunlabeled
An exercise in "anhomomorphic logic"
Rafael D. Sorkin
2007· article· en· Journal of Physics Conference Series· Computer Science
machine prediction:candidate · noneconsensus · none
56
citations
affno abstractunlabeled
Knowability and intuitionistic logic
David De Vidi, Graham Solomon
2001· article· en· Philosophia· Computer Science
machine prediction:candidate · noneconsensus · none
54
citations
afffundno abstractunlabeled
Belief revision in Horn theories
James P. Delgrande, Pavlos Peppas
2014· article· en· Artificial Intelligence· Computer Science
machine prediction:candidate · noneconsensus · none
51
citations
affno abstractunlabeled
Synonymous Logics
Francis Jeffry Pelletier, Alasdair Urquhart
2003· article· en· Journal of Philosophical Logic· Computer Science
machine prediction:candidate · noneconsensus · none
47
citations
affno abstractunlabeled
Reorienting the Logic of Abduction
John Woods
2017· book-chapter· en· Computer Science
machine prediction:candidate · noneconsensus · none
46
citations
afffundunlabeled
A Knowledge Level Account of Forgetting
James P. Delgrande
2017· article· en· Journal of Artificial Intelligence Research· Computer Science
machine prediction:candidate · noneconsensus · none
41
citations
affunlabeled
Situations, Si! situation terms, No!
Gerhard Lakemeyer, Hector J. Levesque
2004· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
40
citations
affunlabeled
Quantum Proofs
Thomas Vidick, John Watrous
2016· article· en· Foundations and Trends® in Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
39
citations
affno abstractunlabeled
2 -Way vs.d -Way Branching for CSP
Joey Hwang, David G. M. Mitchell
2005· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
38
citations
venueno affunlabeled
Revisiting Deep Disagreement
Dale Turner, Larry Wright
2005· article· en· Informal Logic· Computer Science
machine prediction:candidate · noneconsensus · none
37
citations
affno abstractunlabeled
Platypus: A Platform for Distributed Answer Set Solving
Jean Gressmann, Tomi Janhunen, Robert E. Mercer, Torsten Schaub, Sven Thiele, Richard Tichy
2005· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
36
citations
affno abstractunlabeled
Why Play Logical Games?
Mathieu Marion
2009· book-chapter· en· Computer Science
machine prediction:candidate · noneconsensus · none
35
citations
affno abstractunlabeled
Bounded situation calculus action theories
Giuseppe De Giacomo, Yves Lespérance, Fabio Patrizi
2016· article· en· Artificial Intelligence· Computer Science
machine prediction:candidate · noneconsensus · none
35
citations
affunlabeled
Knowledge Equivalence in Combined Action Theories.
Ronald P. A. Petrick, Hector J. Levesque
2002· article· en· Edinburgh Research Explorer (University of Edinburgh)· Computer Science
machine prediction:candidate · noneconsensus · none
35
citations
affunlabeled
aspeed: Solver scheduling via answer set programming
Holger H. Hoos, Roland Kaminski, Marius Lindauer, Torsten Schaub
2014· article· en· Theory and Practice of Logic Programming· Computer Science
machine prediction:candidate · noneconsensus · none
34
citations
affno abstractunlabeled
Relational and algebraic methods in computer science
Peter Höfner, Peter Jipsen, Wolfram Kahl, Martin Müller
2016· article· en· Journal of Logical and Algebraic Methods in Programming· Computer Science
machine prediction:candidate · noneconsensus · none
34
citations
affno abstractunlabeled
Algorithmic Learning Theory
2004· book· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
33
citations
affunlabeled
Actions and resources in epistemic logic
Mehrnoosh Sadrzadeh
2006· dissertation· en· ePrints Soton (University of Southampton)· Computer Science
machine prediction:candidate · noneconsensus · none
31
citations
afffundunlabeled
Horn Clause Contraction Functions
James P. Delgrande, Renata Wassermann
2013· article· en· Journal of Artificial Intelligence Research· Computer Science
machine prediction:candidate · noneconsensus · none
31
citations
affunlabeled
Algebra and Sequent Calculus for Epistemic Actions
Alexandru Baltag, Bob Coecke, Mehrnoosh Sadrzadeh
2005· article· en· Electronic Notes in Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
31
citations
afffundno abstractunlabeled
Recursively defined metric spaces without contraction
Franck van Breugel, Claudio Hermida, Michael Makkai, James Worrell
2007· article· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
31
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
← previousnext →

How this was built: Screen · Findings · About