Pragmatic Mode

Plan

Generate a sequence of actions to achieve a goal condition.

Concept

The Plan pragmatic finds a path from the current state to a goal state using defined Action Blocks. It uses a Breadth-First Search (BFS) to find the shortest sequence of actions.

Syntax

Plan to achieve <Goal Condition>.

Example

Plan to achieve Package_A is delivered.

Action Blocks

Actions are defined in the source text. In Plan v1, actions must be ground (no variables).

Action: deliver package.
Agent: a robot.
Precondition: Robot_1 carries Package_A.
Effect: Package_A is delivered.

Action/Agent: Unique identifiers for the action.
Precondition: Must be true in the current state for the action to apply.
Effect: Adds facts to the state (Plan v1 supports additions only).

Execution Model (v1)

Strategy: Bounded Breadth-First Search (BFS).
Limits: Depth limit of 6, Node limit of 200.
Output: An ordered list of steps (e.g., "deliver package") and a ProofTrace demonstrating success.

Reference

Defined in DS19 - Planning.