MétaCan
Menu
Back to cohort
Record W2099698375 · doi:10.1109/re.2007.18

Consistency Checking of Conceptual Models via Model Merging

2007· article· en· W2099698375 on OpenAlexaff
Mehrdad Sabetzadeh, Shiva Nejati, Sotirios Liaskos, Steve Easterbrook, Marsha Chećhik

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicModel-Driven Software Engineering Techniques
Canadian institutionsUniversity of Toronto
Fundersnot available
KeywordsConsistency (knowledge bases)Consistency modelComputer scienceMerge (version control)Weak consistencyCausal consistencyModel checkingSet (abstract data type)Sequential consistencyTraceabilityData miningTheoretical computer scienceConceptual modelStrong consistencyData consistencyProgramming languageArtificial intelligenceMathematicsInformation retrievalDistributed computingSoftware engineering

Abstract

fetched live from OpenAlex

Requirements elicitation involves the construction of large sets of conceptual models. An important step in the analysis of these models is checking their consistency. Existing research largely focuses on checking consistency of individual models and of relationships between pairs of models. However, such strategy does not guarantee global consistency. In this paper, we propose a consistency checking approach that addresses this problem for homogeneous models. Given a set of models and a set of relationships between them, our approach works by first constructing a merged model and then verifying this model against the consistency constraints of interest. By keeping proper traceability information, consistency diagnostics obtained over the merge are projected back to the original models and their relationships. The paper also presents a set of reusable expressions for defining consistency constraints in conceptual modelling. We demonstrate the use of the developed expressions in the specification of consistency rules for class and ER diagrams, and i* goal models.

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.028
metaresearch head score (Gemma)0.081
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.028
Threshold uncertainty score0.148

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0280.081
Meta-epidemiology (narrow)0.0010.002
Meta-epidemiology (broad)0.0020.005
Bibliometrics0.0040.003
Science and technology studies0.0020.004
Scholarly communication0.0050.009
Open science0.0050.008
Research integrity0.0020.004
Insufficient payload (model declined to judge)0.0020.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.031
GPT teacher head0.253
Teacher spread0.222 · 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 designSimulation or modeling
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

Citations86
Published2007
Admission routes1
Has abstractyes

Explore more

Same topicModel-Driven Software Engineering TechniquesFrench-language works237,207