MétaCan
Menu
Back to cohort
Record W65369927

Iterated revision as prioritized merging

2006· preprint· en· W65369927 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
TopicLogic, Reasoning, and Knowledge
Canadian institutionsSimon Fraser University
Fundersnot available
KeywordsIterated functionSequence (biology)Interpretation (philosophy)Belief revisionComputer scienceOperator (biology)PearlMathematical economicsEpistemologyArtificial intelligenceTheoretical computer scienceMathematicsPhilosophyProgramming language
DOInot available

Abstract

fetched live from OpenAlex

Standard accounts of iterated belief revision assume a static world, about which an agent receives a sequence of observations. More recent items are assumed to have priority over less recent items. We argue that there is no reason, given a static world, for giving priority to more recent items. Instead we suggest that a sequence of observations should be merged with the agent’s beliefs. Since observations may have differing reliability, arguably the appropriate belief change operator is prioritized merging. We develop this view here, suggesting postulates for prioritized merging, and examining existing merging operators with respect to these postulates. As well, we examine other suggested postulates for iterated revision, to determine how well they fit with the prioritized merging interpretation. All postulates for iterated revision that we examine, except for Darwiche and Pearl’s controversial C2, are consequences of our suggested postulates for prioritized merging.

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 categoriesMeta-epidemiology (narrow)
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Theoretical or conceptual · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.700
Threshold uncertainty score1.000

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.0010.000
Open science0.0020.002
Research integrity0.0000.001
Insufficient payload (model declined to judge)0.0000.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.016
GPT teacher head0.269
Teacher spread0.254 · 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

Citations84
Published2006
Admission routes1
Has abstractyes

Explore more

Same topicLogic, Reasoning, and KnowledgeFrench-language works237,207