MétaCan
Menu
Back to cohort
Record W4384296747 · doi:10.32920/23688738.v1

Modeling and Reasoning with Decision-Theoretic Goals

2023· preprint· en· W4384296747 on OpenAlexaff
Sotirios Liaskos, Shakil M. Khan, Mikhail Soutchanski, John Mylopoulos

Bibliographic record

Venuenot available
Typepreprint
Languageen
FieldComputer Science
TopicSoftware Engineering Techniques and Practices
Canadian institutionsToronto Metropolitan UniversityYork University
Fundersnot available
KeywordsProbabilistic logicComputer scienceStakeholderTask (project management)Goal modelingRisk analysis (engineering)Order (exchange)Management scienceOperations researchProcess managementArtificial intelligenceRequirements engineeringSystems engineeringEngineeringBusinessEconomicsFinance

Abstract

fetched live from OpenAlex

Goal models have found important applications in Requirements Engineering as models that relate stakeholder requirements with system or human tasks needed to fulfill them. Often, such task specifications constitute rather idealized plans for requirements fulfillment, where task execution always succeeds. In reality, however, there is always uncertainty as to whether a specification can/will actually be executed as planned. In this paper, we introduce the concept of decision-theoretic goals in order to represent and reason about both uncertainty and preferential utility in goal models. Thus, goal models are extended to express probabilistic effects of actions and also capture the utility of each effect with respect to stakeholder priorities. Further, using a state-of-the-art reasoning tool, analysts can find optimal courses of actions/plans for fulfilling stakeholder goals while investigating the risks of those plans. The technique is applied in a real world meeting scheduling problem, as well as the London Ambulance Service case study.

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.009
metaresearch head score (Gemma)0.019
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.009
Threshold uncertainty score0.050

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0090.019
Meta-epidemiology (narrow)0.0020.001
Meta-epidemiology (broad)0.0010.003
Bibliometrics0.0030.003
Science and technology studies0.0010.005
Scholarly communication0.0070.009
Open science0.0030.004
Research integrity0.0030.005
Insufficient payload (model declined to judge)0.0030.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.025
GPT teacher head0.282
Teacher spread0.257 · 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

Citations1
Published2023
Admission routes1
Has abstractyes

Explore more

Same topicSoftware Engineering Techniques and PracticesFrench-language works237,207