MétaCan
Menu
Back to cohort
Record W1516765212

Nonbinary Constraint Satisfaction: From the Dual to the Primal

2001· article· en· W1516765212 on OpenAlexaff
Sivakumar Nagarajan, Scott D. Goodwin, Abdul Sattar

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicConstraint Satisfaction and Optimization
Canadian institutionsUniversity of Regina
Fundersnot available
KeywordsLocal consistencyConsistency (knowledge bases)Encoding (memory)Constraint satisfaction problemComputer scienceBinary numberDual (grammatical number)Constraint (computer-aided design)Consistency modelTheoretical computer scienceMathematicsAlgorithmMathematical optimizationArithmeticArtificial intelligence
DOInot available

Abstract

fetched live from OpenAlex

Non binary constraints have recently been studied quite ex-tensively since they represent real life problems very natu-rally. Specifically, extensions to binary arc consistency into generalised arc consistency (GAC), and forward checking that incorporates a limited amount of GAC have been pro-posed, to handle non-binary constraints directly. Enforc-ing arc consistency on the dual encoding has been shown to strictly dominate nforcing GAC on the primal encoding. More recently, modifications to dual arc consistency have ex-tended these results to dual encodings that are based on the construction of compact onstraint coverings, that retain the completeness of the encodings, while using a fraction of the space. In this paper we present results that combine the en-forcement of arc consistency in these covering based dual en-codings, with performing forward checking based search in the primal encoding. We demonstrate how this new scheme can be shown to strictly dominate standard non-binary for-ward checking, while being able to efficiently enforce ex-tremely high levels of consistency.

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.011
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: Empirical · Consensus signal: none
Teacher disagreement score0.003
Threshold uncertainty score0.013

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0020.011
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0010.002
Science and technology studies0.0010.002
Scholarly communication0.0030.005
Open science0.0020.003
Research integrity0.0010.004
Insufficient payload (model declined to judge)0.0030.000

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.016
GPT teacher head0.234
Teacher spread0.218 · 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
GenreEmpirical

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

Citations0
Published2001
Admission routes1
Has abstractyes

Explore more

Same topicConstraint Satisfaction and OptimizationFrench-language works237,207