OpenParable
Skip to content
← Back to skills

Dependency Constraint

Productivity
dependency-constraint

Dependency Constraint is an Agent Skill for productivity published in the yogsoth-ai/de-anthropocentric-research-engine repository on GitHub: a SKILL.md instruction file an AI agent can load to do this task.

What must be completed first? — Dependency chain analysis + prerequisite graph construction

View on GitHub ↗
QUICK START

How to use this skill

Bring this guide into your coding agent with a prompt tailored to the tool you use.

  1. Open your project in Codex.
  2. Copy and paste the prompt below.
  3. Review files and risks before approving any action.
Prompt to paste
Inspect the Agent Skill at https://github.com/yogsoth-ai/de-anthropocentric-research-engine/blob/HEAD/skills/dependency-constraint/SKILL.md and all supporting files. Report provenance, permissions, scripts, dependencies, and security risks. Propose an exact installation into .agents/skills/dependency-constraint, but wait for my approval before writing files or running scripts.

Copying this prompt does not install or run the skill. Review third-party files before use.

Strategy: Dependency Constraint

Methodology

Systematic dependency analysis:

  • Task decomposition: Break experiment into atomic tasks
  • Dependency typing: Finish-to-Start, Start-to-Start, Finish-to-Finish, Start-to-Finish
  • Graph construction: Build directed acyclic graph (DAG)
  • Critical path: Longest path through the DAG
  • Critical chain: Critical path + resource contention
  • Prerequisite identification: External dependencies, approvals, data availability

Dependency categories:

CategoryExamples
TechnicalCode A needs library B, model needs data
SequentialTrain before evaluate, design before implement
ResourceSame GPU needed by two tasks
ExternalAPI access, dataset release, paper review
KnowledgeNeed result X to decide approach Y

Execution Flow

  1. Build Dependency Graph → call dependency-graph-construction SOP

    • Input: task list, known dependencies
    • Output: DAG with typed edges
  2. Identify Critical Chain → call critical-chain-identification SOP

    • Input: DAG + resource assignments
    • Output: critical chain with contention points
  3. Rank Sensitivity → invoke sensitivity-ranking tactic

    • Determine which dependencies are most binding
  4. Report → synthesize dependency assessment

    • Critical path length
    • Binding dependency constraints
    • Parallelization opportunities

Budget Gate

ResourceBudgetNotes
Subagent calls≤52 SOPs + synthesis
Iterations≤2Re-build if tasks change
Output size≤3000 tokensGraph summary + critical chain

Available Tactics

Optional, no fixed order; the final leaf is always a sop.

TacticWhen to use
sensitivity-rankingRank constraints by sensitivity — which ones most impact the outcome if they shift

Available SOPs

Optional, no fixed order; the final leaf is always a sop.

SOPWhen to use
critical-chain-identificationIdentify the critical chain — longest path considering resource contention
dependency-graph-constructionBuild task dependency graph with predecessor/successor relationships