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 3 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
Goal change
Steven Shapiro, Yves Lespérance, Hector J. Levesque
2005· article· en· International Joint Conference on Artificial Intelligence· Computer Science
distilled prediction:candidate · insufficient_payloadconsensus · insufficient_payload
30
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
distilled prediction:candidate · noneconsensus · none
30
citations
affno abstractunlabeled
Dynamic Epistemic Temporal Logic
Bryan Renne, Joshua Sack, Audrey Yap
2009· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrow+open_scienceconsensus · none
29
citations
affno abstractunlabeled
A description logic based situation calculus
Yilan Gu, Mikhail Soutchanski
2010· article· en· Annals of Mathematics and Artificial Intelligence· Computer Science
distilled prediction:candidate · noneconsensus · none
28
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
distilled prediction:candidate · insufficient_payloadconsensus · none
28
citations
affno abstractunlabeled
A Complete and Compact Propositional Deontic Logic
Pablo F. Castro, T. S. E. Maibaum
2007· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
26
citations
affno abstractunlabeled
Abductive reasoning in neural-symbolic systems
Artur d’Avila Garcez, Dov M. Gabbay, Oliver Ray, John Woods
2007· article· en· Topoi· Computer Science
distilled prediction:candidate · noneconsensus · none
26
citations
affunlabeled
Towards an Ontology of Approximate Reason
James F. Peters, Andrzej Skowron, Jarosław Stepaniuk, Sheela Ramanna
2002· article· en· Fundamenta Informaticae· Computer Science
distilled prediction:candidate · noneconsensus · none
25
citations
affunlabeled
Iterated belief change: a transition system approach
Aaron Hunter, James P. Delgrande
2005· article· en· International Joint Conference on Artificial Intelligence· Computer Science
distilled prediction:candidate · metaepi_narrow+insufficient_payloadconsensus · none
24
citations
affno abstractunlabeled
Merging Logic Programs under Answer Set Semantics
James P. Delgrande, Torsten Schaub, Hans Tompits, Stefan Woltran
2009· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrow+scholarly_communicationconsensus · none
24
citations
affno abstractunlabeled
Iterated Belief Change and the Recovery Axiom
Samir Chopra, Aditya Ghose, Thomas Meyer, Ka-Shu Wong
2008· article· en· Journal of Philosophical Logic· Computer Science
distilled prediction:candidate · noneconsensus · none
24
citations
affunlabeled
Train Scheduling with Hybrid Answer Set Programming
Dirk Abels, Julian Jordi, Max Ostrowski, Torsten Schaub, Ambra Toletti, Philipp Wanko
2020· article· en· Theory and Practice of Logic Programming· Computer Science
distilled prediction:candidate · noneconsensus · none
23
citations
affunlabeled
Efficient Reasoning in Multiagent Epistemic Logics
Gerhard Lakemeyer
2012· book-chapter· en· Frontiers in artificial intelligence and applications· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
23
citations
affno abstractunlabeled
The modal logic of the countable random frame
Valentin Goranko, Bruce M. Kapron
2003· article· en· Archive for Mathematical Logic· Computer Science
distilled prediction:candidate · noneconsensus · none
22
citations
venueno affunlabeled
Programmation bayésienne des robots
Olivier Lebeltel, Pierre Bessìère, Julien Diard, Emmanuel Mazer
2004· article· fr· Revue d intelligence artificielle· Computer Science
distilled prediction:candidate · metaepi_narrow+insufficient_payloadconsensus · none
22
citations
affno abstractunlabeled
General Terms as Rigid Designators
Bernard Linsky
2006· article· en· Philosophical Studies· Computer Science
distilled prediction:candidate · noneconsensus · none
21
citations
affunlabeled
A logical theory of coordination and joint ability
Hojjat Ghaderi, Hector J. Levesque, Yves Lespérance
2007· article· en· National Conference on Artificial Intelligence· Computer Science
distilled prediction:candidate · noneconsensus · none
21
citations
affno abstractunlabeled
On Computing Solutions to Belief Change Scenarios
James P. Delgrande, Torsten Schaub, Hans Tompits, Stefan Woltran
2001· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
21
citations
affunlabeled
Forgetting in action
David Rajaratnam, Hector J. Levesque, Maurice Pagnucco, Michael Thielscher
2014· article· en· Principles of Knowledge Representation and Reasoning· Computer Science
distilled prediction:candidate · noneconsensus · none
20
citations

How this was built: Screen · Findings · About