MétaCan
Menu
Back to cohort
Record W2290071815

The mysteries of goal decomposition

2011· article· en· W2290071815 on OpenAlex

Why this work is in the frame

A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.

Bibliographic record

VenueiStar · 2011
Typearticle
Languageen
FieldComputer Science
TopicAdvanced Software Engineering Methodologies
Canadian institutionsUniversity of VictoriaYork University
Fundersnot available
KeywordsDecompositionProcess (computing)Computer scienceOrder (exchange)Field (mathematics)Work (physics)Position (finance)Management scienceArtificial intelligenceEngineeringMathematicsEconomicsEcologyProgramming language
DOInot available

Abstract

fetched live from OpenAlex

Goal decomposition structures lie at the heart of goal model- ing languages such as i* . High-level goals of stakeholders are recursively decomposed into lower level ones and eventually into leaf level tasks to be performed by agents. The decomposition structure can also develop through a bottom up approach whereby higher-level goals are introduced as justifications for existing low-level ones. The very concept of decom- position, however, both as process and as artefact is rarely questioned in requirements engineering. In this paper, we argue that it may be of value to give a closer look into goal decomposition and clarify what we actually know about it and what is yet to be understood. We report on an on-going effort to identify empirical work on decomposition coming from various research fields, hoping to find such evidence. We then pose some research questions that we believe need to be pursued in order to improve our understanding of goal decomposition.

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.

Full frame distilled prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation 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.374
Threshold uncertainty score0.118

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0000.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.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.044
GPT teacher head0.286
Teacher spread0.241 · 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