MétaCan
Menu
Back to cohort
Record W1997128923 · doi:10.1142/s0218001403002654

Extending Dual Arc Consistency

2003· article· en· W1997128923 on OpenAlexaff
Sivakumar Nagarajan, Scott D. Goodwin, Abdul Sattar

Bibliographic record

VenueInternational Journal of Pattern Recognition and Artificial Intelligence · 2003
Typearticle
Languageen
FieldComputer Science
TopicConstraint Satisfaction and Optimization
Canadian institutionsUniversity of Windsor
Fundersnot available
KeywordsLocal consistencyConstraint satisfaction problemConstraint (computer-aided design)Consistency (knowledge bases)MathematicsDual (grammatical number)Binary numberEncoding (memory)Compatibility (geochemistry)Representation (politics)Constraint satisfactionTransformation (genetics)Binary constraintAlgorithmComputer scienceTheoretical computer scienceArtificial intelligenceDiscrete mathematicsArithmetic

Abstract

fetched live from OpenAlex

Many extensions to existing binary constraint satisfaction algorithms have been proposed that directly deal with nonbinary constraints. Another choice is to perform a structural transformation of the representation of the problem, so that the resulting problem is a binary CSP except that now the original constraints which were nonbinary are replaced by binary compatibility constraints between relations. A lot of recent work has focussed on comparing different levels of local consistency enforceable in the nonbinary representation with the dual representation. In this paper we present extensions to the standard dual encoding that can compactly represent the given CSP using an equivalent dual encoding that contains all the original solutions to the CSP, using constraint coverings. We show how enforcing arc consistency in these constraint covering based encodings, strictly dominates enforcement of generalized arc consistency (GAC) on the primal nonbinary encoding.

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.003
metaresearch head score (Gemma)0.013
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.005
Threshold uncertainty score0.016

Distilled classifier scores by category (both heads)

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

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.081
GPT teacher head0.305
Teacher spread0.224 · 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

Citations5
Published2003
Admission routes1
Has abstractyes

Explore more

Same venueInternational Journal of Pattern Recognition and Artificial IntelligenceSame topicConstraint Satisfaction and OptimizationFrench-language works237,207