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 1 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
Knowledge, action, and the frame problem
Richard B. Scherl, Hector J. Levesque
2003· article· en· Artificial Intelligence· Computer Science
machine prediction:candidate · noneconsensus · none
276
citations
affunlabeled
Logical Foundations of Proof Complexity
Stephen Cook, Phuong Nguyen
2010· book· en· Cambridge University Press eBooks· Computer Science
machine prediction:candidate · noneconsensus · none
189
citations
afffundno abstractunlabeled
Program theory evaluation: Logic analysis
Astrid Brousselle, François Champagne
2010· article· en· Evaluation and Program Planning· Computer Science
machine prediction:candidate · noneconsensus · none
155
citations
affno abstractunlabeled
Scalar aggregation in inconsistent databases
Marcelo Arenas, Leopoldo Bertossi, Jan Chomicki, Xin He, Vijay Raghavan, Jeremy Spinrad
2003· article· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
144
citations
affunlabeled
ILP turns 20
Stephen Muggleton, Luc De Raedt, David Poole, Ivan Bratko, Peter Flach, Katsumi Inoue +1 more
2011· article· en· Machine Learning· Computer Science
machine prediction:candidate · noneconsensus · none
128
citations
affno abstractunlabeled
On the Ternary Relation and Conditionality
Jc Beall, Ross T. Brady, J. Michael Dunn, Allen Hazen, Edwin Mares, Robert K. Meyer +5 more
2011· article· en· Journal of Philosophical Logic· Computer Science
machine prediction:candidate · noneconsensus · none
121
citations
affunlabeled
EFFICIENT DEFEASIBLE REASONING SYSTEMS
Michael J. Maher, Andrew Rock, Grigoris Antoniou, David P. Billington, Tristan Miller
2001· article· en· International Journal of Artificial Intelligence Tools· Computer Science
machine prediction:candidate · noneconsensus · none
120
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
affno abstractunlabeled
On our best behaviour
Hector J. Levesque
2014· article· en· Artificial Intelligence· Computer Science
machine prediction:candidate · noneconsensus · none
103
citations
afffundunlabeled
asprin: Customizing Answer Set Preferences without a Headache
Gerhard Brewka, James P. Delgrande, Javier Romero, Torsten Schaub
2015· article· en· Proceedings of the AAAI Conference on Artificial Intelligence· Computer Science
machine prediction:candidate · noneconsensus · none
98
citations
affno abstractunlabeled
Argumentation Schemes and Enthymemes
Douglas Walton, Chris Reed
2005· article· en· Synthese· Computer Science
machine prediction:candidate · noneconsensus · none
97
citations
afffundno abstractunlabeled
Bisimulation and cocongruence for probabilistic systems
Vincent Danos, Josée Desharnais, François Laviolette, Prakash Panangaden
2006· article· en· Information and Computation· Computer Science
machine prediction:candidate · noneconsensus · none
85
citations
affunlabeled
Iterated revision as prioritized merging
James P. Delgrande, Didier Dubois, Jérôme Lang
2006· preprint· en· Computer Science
machine prediction:candidate · noneconsensus · none
84
citations
affno abstractunlabeled
Iterated belief change in the situation calculus
Steven Shapiro, Maurice Pagnucco, Yves Lespérance, Hector J. Levesque
2010· article· en· Artificial Intelligence· Computer Science
machine prediction:candidate · noneconsensus · none
75
citations
affunlabeled
Symmetry in Structure Building
Peter Hallman
2004· article· en· Syntax· Computer Science
machine prediction:candidate · noneconsensus · none
75
citations
affno abstractunlabeled
Dynamic topological logic
Philip Kremer, Grigori Mint︠s︡
2004· article· en· Annals of Pure and Applied Logic· Computer Science
machine prediction:candidate · noneconsensus · none
75
citations
affunlabeled
Logics with aggregate operators
Lauri Hella, Leonid Libkin, Juha Nurmonen, Limsoon Wong
2001· article· en· Journal of the ACM· Computer Science
machine prediction:candidate · noneconsensus · none
74
citations
affunlabeled
Iterated Belief Change in the Situation Calculus
Steven Shapiro, Maurice Pagnucco, Yves Lespérance, Hector J. Levesque
2000· article· en· RMIT Research Repository (RMIT University Library)· Computer Science
machine prediction:candidate · noneconsensus · none
70
citations
affno abstractunlabeled
Expressing preferences in default logic
James P. Delgrande, Torsten Schaub
2000· article· en· Artificial Intelligence· Computer Science
machine prediction:candidate · noneconsensus · none
69
citations
fundno affunlabeled
Abstract gringo
Martin Gebser, Amelia Harrison, Roland Kaminski, Vladimir Lifschitz, Torsten Schaub
2015· article· en· Theory and Practice of Logic Programming· Computer Science
machine prediction:candidate · noneconsensus · none
69
citations
affno abstractunlabeled
Ability and Knowing How in the Situation Calculus
Yves Lespérance, Hector J. Levesque, Fangzhen Lin, Richard B. Scherl
2000· article· en· Studia Logica· Computer Science
machine prediction:candidate · noneconsensus · none
66
citations
afffundno abstractunlabeled
Inferring Phylogenetic Trees Using Answer Set Programming
Daniel R. Brooks, Esra Erdem, Selim T. Erdoğan, James W. Minett, Don Ringe
2007· article· en· Journal of Automated Reasoning· Computer Science
machine prediction:candidate · noneconsensus · none
65
citations
affno abstractunlabeled
A consistency-based approach for belief change
James P. Delgrande, Torsten Schaub
2003· article· en· Artificial Intelligence· Computer Science
machine prediction:candidate · noneconsensus · none
64
citations
affno abstractunlabeled
Inductive situation calculus
Marc Denecker, Eugenia Ternovska
2007· article· en· Artificial Intelligence· Computer Science
machine prediction:candidate · noneconsensus · none
60
citations

How this was built: Screen · Findings · About