MétaCan
Menu
Back to cohort
Record W4382866729 · doi:10.1609/icaps.v33i1.27221

Generalizing Action Justification and Causal Links to Policies

2023· article· en· W4382866729 on OpenAlexafffund
Sarath Sreedharan, Christian Muise, Subbarao Kambhampati

Bibliographic record

VenueProceedings of the International Conference on Automated Planning and Scheduling · 2023
Typearticle
Languageen
FieldComputer Science
TopicAI-based Problem Solving and Planning
Canadian institutionsQueen's University
FundersAir Force Office of Scientific ResearchOffice of Naval ResearchNatural Sciences and Engineering Research Council of CanadaDefense Advanced Research Projects Agency
KeywordsGeneralizationAction (physics)Context (archaeology)Computer scienceObservableState (computer science)Causal theory of referenceManagement scienceEpistemologyMathematical economicsTheoretical computer scienceArtificial intelligenceMathematicsEconomicsAlgorithm

Abstract

fetched live from OpenAlex

We revisit two concepts popularly used within the context of classical planning, namely action justification and causal links. While these concepts have come to underpin some of the most popular notions of explanations in classical planning, these notions are restricted to sequential plans. To address this shortcoming, we propose a generalization of these concepts that is applicable to state-action policies. We introduce algorithms that can identify justified actions and causal links contributed by such actions for policies generated for Fully Observable Non-Deterministic (FOND) planning problems. We also present an empirical evaluation that demonstrates the computational characteristics of these algorithms on standard FOND benchmarks.

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.005
metaresearch head score (Gemma)0.052
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: Methods · Consensus signal: Methods
Teacher disagreement score0.008
Threshold uncertainty score0.027

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0050.052
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0030.002
Science and technology studies0.0010.004
Scholarly communication0.0030.008
Open science0.0020.004
Research integrity0.0020.003
Insufficient payload (model declined to judge)0.0070.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.094
GPT teacher head0.337
Teacher spread0.243 · 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
GenreMethods

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
Published2023
Admission routes2
Has abstractyes

Explore more

Same venueProceedings of the International Conference on Automated Planning and SchedulingSame topicAI-based Problem Solving and PlanningFrench-language works237,207