MétaCan
Menu
Back to cohort
Record W2294820799

A formal account of nondeterministic and failed actions

2013· article· en· W2294820799 on OpenAlexaff
James P. Delgrande, Hector J. Levesque

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicLogic, Reasoning, and Knowledge
Canadian institutionsUniversity of TorontoSimon Fraser University
Fundersnot available
KeywordsNondeterministic algorithmComputer scienceAction (physics)Probabilistic logicObject (grammar)PhenomenonExtension (predicate logic)Set (abstract data type)EpistemologyEpistemic modal logicCategorical variableTheoretical computer scienceMathematical economicsArtificial intelligenceMathematicsMachine learningMultimodal logicProgramming languagePhilosophyDescription logic
DOInot available

Abstract

fetched live from OpenAlex

Nondeterminism is pervasive in all but the simplest action domains: an agent may flip a coin or pick up a different object than intended, or an action may fail and may fail in different ways. In this paper we provide a qualitative theory of nondeter-minism. The account is based on an epistemic ex-tension to the situation calculus that accommodates sensing actions. Our position is that nondetermin-ism is an epistemic phenomenon, and that the world is most usefully regarded as deterministic. Nonde-terminism arises from an agent’s limited awareness and perception. The account offers several advan-tages: an agent has a set of categorical (as opposed to probabilistic) beliefs, yet can deal with equally-likely outcomes (such as in flipping a fair coin) or with outcomes of differing plausibility (such as an action that may on rare occasion fail). 1

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.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: Empirical · Consensus signal: none
Teacher disagreement score0.724
Threshold uncertainty score0.166

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.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.018
GPT teacher head0.241
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 teacher head, not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designTheoretical or conceptual
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

Citations8
Published2013
Admission routes1
Has abstractyes

Explore more

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