MétaCan
Menu
Back to cohort
Record W2249954593 · doi:10.1109/kse.2015.64

Analyzing Belief Re-revision by Consideration of Reliability Change in Legal Case

2015· article· en· W2249954593 on OpenAlexaboutno aff
Pimolluck Jirakunkanok, Katsuhiko Sano, Satoshi Tojo

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicLogic, Reasoning, and Knowledge
Canadian institutionsnot available
Fundersnot available
KeywordsDowngradeReliability (semiconductor)Belief revisionOperator (biology)Belief structureComputer scienceMulti-agent systemPermissionReliability theoryOrder (exchange)Artificial intelligenceReliability engineeringComputer securityEngineeringLawPower (physics)

Abstract

fetched live from OpenAlex

The connection between belief change and reliability change is an important aspect of agent communication. That is, an agent can change his/her belief when he/she considers that the received information is unreliable. In order to capture both belief change and reliability change, several dynamic operators were proposed in terms of dynamic epistemic logic. Belief change can be handled by commitment and permission. The first operator is used to remove some beliefs, while the second operator is used to restore the former beliefs. For analyzing reliability change, this study introduces a joint downgrade operator to allow an agent to downgrade the agents in a specific group to be equally reliable and less reliable than the other agents. Based on these dynamic operators, this study proposes to analyze an agent's belief re-revision based on a consideration of reliability change in a legal case from Canada.

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 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.001
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: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: Empirical
Teacher disagreement score0.873
Threshold uncertainty score0.408

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.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.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.052
GPT teacher head0.302
Teacher spread0.250 · 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 teacher head, 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

Citations2
Published2015
Admission routes1
Has abstractyes

Explore more

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