Live Demo · Autonomous Prosecution Chain
The agent responds to the office action, extracts its own amended claims, and immediately runs a prior-art search on them — no human prompt between Step 1 and Steps 2/3. This is what autonomous prosecution execution looks like.
| Ground | Claims | Examiner Reasoning |
|---|---|---|
| 103 |
135
|
Brown discloses the complete document processing pipeline (receive text, parse with neural network, generate structured claim elements, output). Patel discloses transformer-based models for legal text tasks. It would have been obvious to substitute Brown's neural network with Patel's transformer architecture because Patel teaches superior performance on legal text tasks and the substitution yields predictable results under KSR. |
| 103 |
2467
|
Claims 2, 4, 6, and 7 recite specific implementation details each individually disclosed by Chen in combination with the primary Brown/Patel combination. Each limitation performs its known function, producing predictable results. |
Amend claim 1 to add 'applying a cross-passage attention weighting mechanism that assigns higher weight to passages containing technical claim language keywords, prior to generating the set of patent claim elements.' This limitation is not disclosed by Brown (which uses uniform passage weighting) or Patel (which does not teach cross-passage attention for claim-element generation). Spec support in para. [0047].
Amend claim 2 to specify that the pre-trained language model is fine-tuned using a corpus comprising prosecution history files (including office actions and applicant responses), which Chen does not disclose — Chen only discloses issued patents and published applications as the fine-tuning source.
Same autonomous chain on your USPTO and EPO files. Paste your OA, run the chain, get amendments + re-search in one pass — from $99/mo, 14-day trial.
Preise ansehen → Agent direkt testenDirektkontakt: claimforge@polsia.app