Pith. sign in

REVIEW 1 cited by

Pointwise-in-Time Explanation for Linear Temporal Logic Rules

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2306.13956 v4 pith:42KPTW7S submitted 2023-06-24 cs.AI

classification cs.AI
keywords rulesstatusagentbehaviorindividualpointwise-in-timeruletrajectory
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

The new field of Explainable Planning (XAIP) has produced a variety of approaches to explain and describe the behavior of autonomous agents to human observers. Many summarize agent behavior in terms of the constraints, or ''rules,'' which the agent adheres to during its trajectories. In this work, we narrow the focus from summary to specific moments in individual trajectories, offering a ''pointwise-in-time'' view. Our novel framework, which we define on Linear Temporal Logic (LTL) rules, assigns an intuitive status to any rule in order to describe the trajectory progress at individual time steps; here, a rule is classified as active, satisfied, inactive, or violated. Given a trajectory, a user may query for status of specific LTL rules at individual trajectory time steps. In this paper, we present this novel framework, named Rule Status Assessment (RSA), and provide an example of its implementation. We find that pointwise-in-time status assessment is useful as a post-hoc diagnostic, enabling a user to systematically track the agent's behavior with respect to a set of rules.

Discussion (0). Sign in to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. "What are my options?": Explaining RL Agents with Diverse Near-Optimal Alternatives (Extended)

    cs.LG 2025-06 conditional novelty 4.0 of 10

    DNA trains local Q-learning policies on corridor-shaped subproblems to produce provably epsilon-optimal, behaviorally diverse trajectory options for an RL agent.

Pith tools