MétaCan
Menu
Back to cohort
Record W2735993833

EB 3 attribute definitions: Formal language and application

2005· preprint· en· W2735993833 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

Venuenot available
Typepreprint
Languageen
FieldComputer Science
TopicAdvanced Database Systems and Queries
Canadian institutionsUniversité de Sherbrooke
Fundersnot available
KeywordsComputer scienceProgramming languageFormal language
DOInot available

Abstract

fetched live from OpenAlex

eb 3 is a trace-based formal language created for the specification of information systems (IS). In this technical report, we present the eb 3 formal language for attribute definitions. Attributes, linked to entities and associations of an IS, are computed in eb 3 by recursive functions on the valid traces of the system. The syntax and the main properties of the language are introduced. Then, we aim at synthesizing imperative programs that correspond to eb 3 attribute definitions. Thus, each eb 3 action is translated into a transaction. eb 3 attribute definitions are analysed to determine the tables and the key values affected by each action. Some key values are determined from SELECT statements that correspond to first-order predicates in eb 3 attribute definitions. To avoid inconsistencies because of the sequencing of SQL statements in the transactions, temporary variables and/or tables are introduced for these key values. We show the main patterns for the SELECT statements used in the temporary variables and/or tables. The SQL statements are then ordered by table. Generation of

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: none
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.880
Threshold uncertainty score0.533

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.001
Open science0.0000.001
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.024
GPT teacher head0.269
Teacher spread0.244 · 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

Quick stats

Citations6
Published2005
Admission routes1
Has abstractyes

Explore more

Same topicAdvanced Database Systems and QueriesFrench-language works237,207