MétaCan
Menu
Back to cohort
Record W60262200

An Explanation Oriented Dialogue Approach for Solving Wicked Planning Problems.

2005· article· en· W60262200 on OpenAlexaff
Gengshen Du, Michael M. Richter, Günther Ruhe

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicConstraint Satisfaction and Optimization
Canadian institutionsUniversity of Calgary
Fundersnot available
KeywordsPlan (archaeology)Computer scienceParsingPrincipal (computer security)Ideal (ethics)Measure (data warehouse)Similarity (geometry)Order (exchange)Subject (documents)Management scienceArtificial intelligenceData miningEngineering
DOInot available

Abstract

fetched live from OpenAlex

In this paper we discuss support for solving complex “wicked ” planning problems by dialogues and explanations. Wicked problems are essentially imprecisely formulated problems, i.e. those that do not have a clear goal, well defined methods, and are subject to personal opinions of involved stakeholders that may be changeable. The method contains the following steps: (1) Reducing the complexity of the problem by the selecting a specific concern; (2) Obtaining a user defined ideal plan, called a prototype; (3) Comparing the actually generated plan and the prototype by a similarity measure. This will be aided by an explanation oriented dialogue. A major problem for the explanation is that we need to explain the result of an optimization procedure which excludes classical parsing oriented methods. The approach is generic and was instantiated in release planning, investment, and urban planning. We have simplified the original problems significantly in order to illustrate the principal approach. 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: Simulation or modeling · Consensus signal: Simulation or modeling
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.528
Threshold uncertainty score0.307

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.026
GPT teacher head0.264
Teacher spread0.238 · 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
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

Citations4
Published2005
Admission routes1
Has abstractyes

Explore more

Same topicConstraint Satisfaction and OptimizationFrench-language works237,207