MétaCan
Menu
Back to cohort
Record W2209861091 · doi:10.1017/cbo9780511794797.009

Planning with Certainty

2010· book-chapter· en· W2209861091 on OpenAlexaff
David Poole, Alan K. Mackworth

Bibliographic record

VenueCambridge University Press eBooks · 2010
Typebook-chapter
Languageen
FieldComputer Science
TopicLogic, Reasoning, and Knowledge
Canadian institutionsUniversity of British Columbia
Fundersnot available
KeywordsReignCertaintyThread (computing)Database transactionPlan (archaeology)MorningOperations researchOperations managementHistoryManagementEngineeringComputer sciencePolitical scienceMedicinePhilosophyLawEconomicsMechanical engineeringArchaeologyDatabaseEpistemology

Abstract

fetched live from OpenAlex

He who every morning plans the transaction of the day and follows out that plan, carries a thread that will guide him through the maze of the most busy life. But where no plan is laid, where the disposal of time is surrendered merely to the chance of incidence, chaos will soon reign . –Victor Hugo (1802–1885) Planning is about how an agent achieves its goals. To achieve anything but the simplest goals, an agent must reason about its future. Because an agent does not usually achieve its goals in one step, what it should do at any time depends on what it will do in the future. What it will do in the future depends on the state it is in, which, in turn, depends on what it has done in the past. This chapter considers how an agent can represent its actions and their effects and use these models to find a plan to achieve its goals. In particular, this chapter considers the case where the agent's actions are deterministic; that is, the agent can predict the consequences of its actions. there are no exogenous events beyond the control of the agent that change the state of the world. the world is fully observable; thus, the agent can observe the current state of the world. time progresses discretely from one state to the next. […]

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.004
metaresearch head score (Gemma)0.012
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Theoretical or conceptual · Consensus signal: Theoretical or conceptual
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.027
Threshold uncertainty score0.091

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0040.012
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0010.001
Science and technology studies0.0030.012
Scholarly communication0.0080.013
Open science0.0010.004
Research integrity0.0030.005
Insufficient payload (model declined to judge)0.0270.007

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.020
GPT teacher head0.194
Teacher spread0.174 · 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 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

Citations0
Published2010
Admission routes1
Has abstractyes

Explore more

Same venueCambridge University Press eBooksSame topicLogic, Reasoning, and KnowledgeFrench-language works237,207