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 6 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
Planning for Temporally Extended Goals in Pure-Past Linear Temporal Logic
Luigi Bonassi, Giuseppe De Giacomo, Marco Favorito, Francesco Fuggitti, Alfonso Gerevini, Enrico Scala
2023· article· en· Proceedings of the International Conference on Automated Planning and Scheduling· Computer Science
distilled prediction:candidate · noneconsensus · none
9
citations
aboutno affunlabeled
Non-deterministic Semantics in Polynomial Format
Walter Carnielli, Mariana Matulovic
2014· article· en· Electronic Notes in Theoretical Computer Science· Computer Science
distilled prediction:candidate · noneconsensus · none
9
citations
affunlabeled
Only-knowing meets nonmonotonic modal logic
Gerhard Lakemeyer, Hector J. Levesque
2012· article· en· Principles of Knowledge Representation and Reasoning· Computer Science
distilled prediction:candidate · noneconsensus · none
9
citations
afffundunlabeled
The Mereological Structure of Informational Entities
Adrien Barton, Fumiaki Toyoshima, Laure Vieu, Paul Fabry, Jean‐François Éthier
2020· book-chapter· en· Frontiers in artificial intelligence and applications· Computer Science
distilled prediction:candidate · noneconsensus · none
9
citations
affunlabeled
Lifted Unit Propagation for Effective Grounding
Pashootan Vaezipoor, David G. M. Mitchell, Maarten Mariën
2011· preprint· en· arXiv (Cornell University)· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
9
citations
affvenueunlabeled
Pollock on Practical Reasoning
David Hitchcock
2001· article· en· Informal Logic· Computer Science
distilled prediction:candidate · insufficient_payloadconsensus · none
9
citations
affunlabeled
Towards Tractable Inference for Resource-Bounded Agents
Toryn Q. Klassen, Sheila A. McIlraith, Hector J. Levesque
2015· article· en· National Conference on Artificial Intelligence· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
9
citations
fundno affno abstractunlabeled
Gelfond–Zhang aggregates as propositional formulas
Pedro Cabalar, Jorge Fandinno, Torsten Schaub, Sebastian Schellhorn
2019· article· en· Artificial Intelligence· Computer Science
distilled prediction:candidate · insufficient_payloadconsensus · none
8
citations
afffundno abstractunlabeled
Arc-Consistency + Unit Propagation = Lookahead
Jia-Huai You, Guiwen Hou
2004· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
8
citations
affno abstractunlabeled
A Logical Theory of Localization
Vaishak Belle, Hector J. Levesque
2015· article· en· Studia Logica· Computer Science
distilled prediction:candidate · noneconsensus · none
8
citations
affunlabeled
Multiagent Only Knowing in Dynamic Systems
Vaishak Belle, Gerhard Lakemeyer
2014· article· en· Journal of Artificial Intelligence Research· Computer Science
distilled prediction:candidate · noneconsensus · none
8
citations
affno abstractunlabeled
Probabilistic sentence satisfiability: An approach to PSAT
Tom Henderson, Robert F. Simmons, Bernard Serbinowski, Martin J. Cline, David Sacharny, Xiuyi Fan +1 more
2019· article· en· Artificial Intelligence· Computer Science
distilled prediction:candidate · insufficient_payloadconsensus · none
8
citations
affno abstractunlabeled
Flexible Approximators for Approximating Fixpoint Theory
Fangfang Liu, Yi Bi, Md Solimul Chowdhury, Jia-Huai You, Zhiyong Feng
2016· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
7
citations
affunlabeled
Logics of Ignorance and Being Wrong
David Gilbert, Ekaterina Kubyshkina, Mattia Petrolo, Giorgio Venturi
2021· article· en· Logic Journal of IGPL· Computer Science
distilled prediction:candidate · noneconsensus · none
7
citations
affno abstractunlabeled
Agent Abstraction via Forgetting in the Situation Calculus
Kailun Luo, Yongmei Liu, Yves Lespérance, Ziliang Lin
2020· book-chapter· en· Frontiers in artificial intelligence and applications· Computer Science
distilled prediction:candidate · noneconsensus · none
7
citations
affunlabeled
Belief Revision I: The AGM Theory
Franz Huber
2013· article· en· Philosophy Compass· Computer Science
distilled prediction:candidate · insufficient_payloadconsensus · none
7
citations
affunlabeled
Modular systems with preferences
Alireza Ensan, Eugenia Ternovska
2015· article· en· International Conference on Artificial Intelligence· Computer Science
distilled prediction:candidate · insufficient_payloadconsensus · none
7
citations
venueno affunlabeled
The Irrelevance of Relevance
David Botting
2013· article· en· Informal Logic· Computer Science
distilled prediction:candidate · insufficient_payloadconsensus · none
7
citations
affaboutunlabeled
Categorical quantum computation
Eric Paquette
2008· dissertation· en· Papyrus : Institutional Repository (Université de Montréal)· Computer Science
distilled prediction:candidate · metaepi_narrow+stsconsensus · none
7
citations
affunlabeled
Relevance Logic: Problems Open and Closed
Alasdair Urquhart
2016· article· en· The Australasian Journal of Logic· Computer Science
distilled prediction:candidate · noneconsensus · none
7
citations
affno abstractunlabeled
Towards Dynamic Answer Set Programming over Finite Traces
Pedro Cabalar, Martín Diéguez, Torsten Schaub
2019· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrow+scholarly_communicationconsensus · none
7
citations
fundno affno abstractunlabeled
Inferring probability comparisons
Matthew Harrison‐Trainor, Wesley H. Holliday, Thomas Icard
2017· article· en· Mathematical Social Sciences· Computer Science
distilled prediction:candidate · sts+scholarly_communicationconsensus · none
7
citations
venueno affunlabeled
Ambiguity in a Dialectical Perspective
Jan Albert van Laar
2001· article· en· Informal Logic· Computer Science
distilled prediction:candidate · noneconsensus · none
7
citations

How this was built: Screen · Findings · About