Hypertree decomposition approach to planning problems for reduced computational complexity
日本語の概要は準備中です。原文の説明を表示しています。
4 件 ・ 関連度順
概要と使いどころ
Hypertree decomposition approach to planning problems for reduced computational complexity
日本語の概要は準備中です。原文の説明を表示しています。
license: Apache-2.0 NOT for unrelated tasks outside this domain.
日本語の概要は準備中です。原文の説明を表示しています。
Designs, reconciles, and reviews an end-to-end Drydock program for safely staging agent runtimes: immutable worktree provenance, disposable VM containment, typed effect brokerage, global body accounting, resurrection, subscription-capacity economics, context compaction, operator control, evidence, and promotion. Use when several Drydock contracts must compose into one architecture, implementation hypertree, diagram set, or release plan. NOT for launching Port Daddy, running an untrusted subject, replacing focused containment/resurrection/capacity audits, or treating a design packet as runtime authority.
日本語の概要は準備中です。原文の説明を表示しています。
Implement an executable BDI agent cycle with events, context-guarded plans, intention stacks, selection functions, and belief revision. Use when designing or debugging AgentSpeak-style runtimes or concrete BDI program semantics. NOT for high-level BDI adoption, organizational modeling, norms, or hypertree team planning.
日本語の概要は準備中です。原文の説明を表示しています。