Interpret and design bounded FIPA communicative-act exchanges using XC00037H semantics while keeping delivery, authority, and external effects separate. NOT for proving delivery, task authorization, or external effect completion.
Use this skill when a design needs to choose, interpret, or review a FIPA CAL act among autonomous agents: an assertion, question, request, proposal, conditional request, subscription, or a response such as refusal/failure/non-understanding. It is not a transport, identity, authorization, delivery, database-query, or external-effect protocol.
Source boundary
The primary source is FIPA Communicative Act Library SpecificationXC00037H, experimental, dated 2001-08-10. Its archived 44-page body was read on 2026-09-24. It models feasibility preconditions (FPs), rational effects (REs), mental attitudes, and action expressions. It does not establish an implementation's hidden state, authenticate a sender, guarantee delivery or timing, make a recipient act, or prove an external effect.
The later canonical J endpoint was unavailable in this pass. H itself contains printed normative-section and annex variants for some request-derived formulas; retain the cited form and do not assume equivalence. In the annex, PG is a persistent goal. See source access.
Working method
Name the claim. Is the desired result an attitude-level semantic interpretation, a received message, a local protocol disposition, or an independently checked effect? Keep those records separate.
Choose the source form. Use the act's H definition and preserve sender, receiver, content, embedded actor, content language, ontology, and any relevant quantifier/domain.
Assess FP assumptions. State which B, U, I, PG, Feasible, or Done facts are source-model assumptions. For a request, name whether the normative §3.19 or annex §5.4.2 form is being followed.
Observe rather than infer. Record actual act, correlation, message metadata, and time. Silence at a local deadline is an unresolved local outcome, not a CAL refusal/failure/non-understanding act.
Apply a labelled local policy. A retry, alternate recipient, cancellation request, escalation, sampling interval, or verification method belongs to the application contract. Bind it to an evidence source before making an effect claim.
flowchart TD
G[State the coordination goal] --> A{What kind of semantic content?}
A -->|assert a believed proposition| I[inform confirm or disconfirm]
A -->|ask truth or referent| Q[query-if or query-ref]
A -->|ask an autonomous agent to act| R[request]
A -->|one parameter proposal condition| C[cfp]
A -->|offer own conditional action| P[propose]
A -->|select forwarding semantics| F[proxy or propagate]
A -->|act on a condition or repeated change| W[request-when request-whenever or subscribe]
I --> E[Record observed message and evidence separately]
Q --> E
R --> E
C --> E
P --> E
F --> E
W --> E
The diagram selects a semantic family. It does not choose a wire protocol, a timeout, an authentication mechanism, or an effect verifier.
Fit and diagnostic guide
Situation
Read first
Diagnostic question
A message is being treated as proof of completion or truth.
Is CFP single-parameter? What cancels it, and what monitoring/lag policy remains local?
| You need a conditional offer or federation forwarding. | Routing and proposal acts | Who performs the embedded act, whose attitudes are required, and which sender/receiver fields change? |
Request trace: alternatives, not one continued path
Use a request trace only after choosing a source form and a local terminal/unresolved policy. agree and refuse are alternatives from the same request observation; a refusal does not continue into an agreed/completion path.
stateDiagram-v2
[*] --> request_sent
request_sent --> agreed: agree observed, branch A
request_sent --> completion_report: completion inform without prior observed agree
request_sent --> failure_report: failure without prior observed agree
request_sent --> refused: refuse observed, terminal response
request_sent --> misunderstood: not-understood observed, terminal response
request_sent --> unresolved: no response by local deadline
agreed --> completion_report: later inform reports completion
agreed --> failure_report: failure observed
agreed --> unresolved: no later report by local deadline
completion_report --> effect_checked: application verifier records target state
completion_report --> unresolved: effect cannot be checked
refused --> [*]
misunderstood --> [*]
failure_report --> [*]
effect_checked --> [*]
unresolved --> [*]
unresolved is an explicit local-policy label, not a source-defined FIPA terminal state. A completion report is distinct from a checked effect.
Review checklist
The source edition and section/annex form are named; printed variants are not silently normalized.
Each FP attitude is labelled as a source-model assumption or an application-defined, evidenced representation.
A response trace uses mutually exclusive observed branches and contains a local unresolved policy.
refuse, failure, not-understood, cancellation, and silence are not conflated.
For cfp, the proposal expression has exactly one parameter or the design explicitly leaves the H formalization's scope.
For request-when, request-whenever, and subscribe, cancellation, trigger condition, and persistent/one-time mode are stated; sampling frequency and action lag are separately negotiated if material.
A consequential truth/completion claim cites an independent evidence source.
Original-heading disposition ledger
Original substantive heading
Retained, corrected, or removed
Destination and reason
When to Use This Skill
Retained
opening defines the applicable coordination scope.
routing-and-proposal reference and sequence diagram retain proxy/propagate selection, envelope fields, strong/weak distinction and brokering correlation; drop guaranteed-delivery claims.
Error Handling Strategy Decision Tree
Corrected and retained
request trace and checklist replace fixed timeout bands and automatic recovery claims.
Failure Modes and five anti-patterns
Corrected and retained
fit table/checklist preserve command confusion, silent absence, semantic overclaim, composition, and timeout boundaries without invented thresholds or fallbacks.
Worked Examples
Corrected and retained
eight references supply bounded worked cases; the original federation, size-limit, and timeout scenarios were unsourced application designs.
Quality Gates
Corrected and retained
review checklist names evidence, variants, alternatives, and conditional limits.
This is a constructed application observation graph, not a complete FIPA Request interaction protocol. A prior observed agree is optional in this graph; the allowed wire protocol must be named separately. A failure report does not establish absence of partial external effects.
Expert in 2000s-era music visualization (Milkdrop, AVS, Geiss) and modern WebGL implementations. Specializes in Butterchurn integration, Web Audio API AnalyserNode FFT data, GLSL shaders for audio-reactive visuals, and psychedelic generative art. Activate on "Milkdrop", "music visualization", "WebGL visualizer", "Butterchurn", "audio reactive", "FFT visualization", "spectrum analyzer". NOT for simple bar charts/waveforms (use basic canvas), video editing, or non-audio visuals.
Expert legal research agent for finding and scraping expungement data state by state. Knows authoritative sources, URL patterns, Firecrawl configuration, and 2026 legal landscape.
Expert in 3D computer vision labeling tools, workflows, and AI-assisted annotation for LiDAR, point clouds, and sensor fusion. Covers SAM4D/Point-SAM, human-in-the-loop architectures, and vertical-specific training strategies. Activate on '3D labeling', 'point cloud annotation', 'LiDAR labeling', 'SAM 3D', 'SAM4D', 'sensor fusion annotation', '3D bounding box', 'semantic segmentation point cloud'. NOT for 2D image labeling (use clip-aware-embeddings), general ML training (use ml-engineer), video annotation without 3D (use computer-vision-pipeline), or VLM prompt engineering (use prompt-engineer).
Apply crisis decision-making research to agent routing, uncertainty triage, and coordination failure analysis in time-pressured systems. Use when diagnosing handoff failures, analytical paralysis, or expert judgment under incomplete information. NOT for routine coding, simple CRUD design, or static single-agent tasks with complete information.
Use for insight, reframing, contradiction, impasse, and anomaly-driven problem solving when execution effort no longer helps. NOT for routine optimization, error correction, or well-specified tasks with known solution paths.
Apply cognitive task analysis to expert work that depends on perceptual cues, branching judgment, and recurring monitoring loops. Use when decomposing expert capability into agent structure, simulation design, or validation interviews. NOT for ordinary step-by-step SOP capture or simple pipelines with no tacit cue layer.