Dependency Constraint
Productivitydependency-constraintDependency 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
How to use this skill
Bring this guide into your coding agent with a prompt tailored to the tool you use.
- Open your project in Codex.
- Copy and paste the prompt below.
- Review files and risks before approving any action.
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:
| Category | Examples |
|---|---|
| Technical | Code A needs library B, model needs data |
| Sequential | Train before evaluate, design before implement |
| Resource | Same GPU needed by two tasks |
| External | API access, dataset release, paper review |
| Knowledge | Need result X to decide approach Y |
Execution Flow
-
Build Dependency Graph → call
dependency-graph-constructionSOP- Input: task list, known dependencies
- Output: DAG with typed edges
-
Identify Critical Chain → call
critical-chain-identificationSOP- Input: DAG + resource assignments
- Output: critical chain with contention points
-
Rank Sensitivity → invoke
sensitivity-rankingtactic- Determine which dependencies are most binding
-
Report → synthesize dependency assessment
- Critical path length
- Binding dependency constraints
- Parallelization opportunities
Budget Gate
| Resource | Budget | Notes |
|---|---|---|
| Subagent calls | ≤5 | 2 SOPs + synthesis |
| Iterations | ≤2 | Re-build if tasks change |
| Output size | ≤3000 tokens | Graph summary + critical chain |
Available Tactics
Optional, no fixed order; the final leaf is always a sop.
| Tactic | When to use |
|---|---|
| sensitivity-ranking | Rank 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.
| SOP | When to use |
|---|---|
| critical-chain-identification | Identify the critical chain — longest path considering resource contention |
| dependency-graph-construction | Build task dependency graph with predecessor/successor relationships |