MétaCan
Menu
Back to cohort
Record W1652372935 · doi:10.48550/arxiv.1109.1317

Lifted Unit Propagation for Effective Grounding

2011· preprint· en· W1652372935 on OpenAlexaff
Pashootan Vaezipoor, David G. M. Mitchell, Maarten Mariën

Bibliographic record

VenuearXiv (Cornell University) · 2011
Typepreprint
Languageen
FieldComputer Science
TopicLogic, Reasoning, and Knowledge
Canadian institutionsSimon Fraser University
Fundersnot available
KeywordsGroundKey (lock)Computer scienceDomain (mathematical analysis)Unit (ring theory)AlgorithmCalculus (dental)Mathematical optimizationMathematicsEngineeringElectrical engineeringMathematical analysis

Abstract

fetched live from OpenAlex

A grounding of a formula $ϕ$ over a given finite domain is a ground formula which is equivalent to $ϕ$ on that domain. Very effective propositional solvers have made grounding-based methods for problem solving increasingly important, however for realistic problem domains and instances, the size of groundings is often problematic. A key technique in ground (e.g., SAT) solvers is unit propagation, which often significantly reduces ground formula size even before search begins. We define a "lifted" version of unit propagation which may be carried out prior to grounding, and describe integration of the resulting technique into grounding algorithms. We describe an implementation of the method in a bottom-up grounder, and an experimental study of its performance.

Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.

How this classification was reachedexpand

Full frame machine prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.

metaresearch head score (Codex)0.002
metaresearch head score (Gemma)0.012
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Theoretical or conceptual · Consensus signal: Theoretical or conceptual
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.015
Threshold uncertainty score0.050

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0020.012
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0010.003
Bibliometrics0.0020.002
Science and technology studies0.0010.003
Scholarly communication0.0030.007
Open science0.0030.007
Research integrity0.0020.005
Insufficient payload (model declined to judge)0.0150.003

Machine scores (provisional)

The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.

Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.

Opus teacher head0.098
GPT teacher head0.202
Teacher spread0.104 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designTheoretical or conceptual
Domainnot available
GenreMethods

How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".

Quick stats

Citations9
Published2011
Admission routes1
Has abstractyes

Explore more

Same venuearXiv (Cornell University)Same topicLogic, Reasoning, and KnowledgeFrench-language works237,207