القائمة
Delete specific memories or clear memory categories. Use with caution - forgotten memories cannot be recovered.
التثبيت باستخدام Codex أو Claude انسخ هذا Prompt والصقه في Codex أو Claude أو مساعد آخر ليراجع صفحة Skill ويثبّتها لك.
استنادا إلى تصنيف SOC المهني
| name | memory-forget |
| description | Delete specific memories or clear memory categories. Use with caution - forgotten memories cannot be recovered. |
| user-invocable | true |
| argument-hint | <memory-uuid or 'search query'> |
Remove specific memories from the Plugged.in memory system.
$ARGUMENTS looks like a UUID, confirm deletion of that specific memory$ARGUMENTS is a search query, search for matching memories and present themDeleted memories are permanently removed from both the database and the vector index. The natural decay system (full -> compressed -> summary -> essence -> forgotten) is usually preferred over manual deletion.
Record a cross-reference when new functionality touches an existing system — ensures future work on the existing system considers the new dependency. Use after adding X to Y.
Record completion of a step from a written implementation plan into fresh memory. Use after marking a plan item done — maintains task continuity across context compaction.
Capture a numbered implementation algorithm into procedures memory after completing a feature end-to-end. Use when a new feature/system was built — records the exact steps so the next similar build starts from this algorithm.
Record a critical failure — data loss, production incident, security breach, or cascade failure — into permanent shock memory. Shocks never decay and are always surfaced in memory-resume briefs.
Capture a hard-won solution into long-term memory after trial-and-error resolution. Use when a problem was solved after ≥1 failed attempts — records what failed, what worked, and why.
Reconstruct task context after session start or context compaction. Uses 3-layer progressive disclosure: compact index → timeline → full details. Outputs a structured brief: where was I, what algorithms exist, what pitfalls to avoid.