mlsanityData to 7 Oct 2026

Interpretable Apprenticeship Learning with Temporal Logic Specifications

arXiv 1710.10532 ↗First posted 28 Oct 2017eess.SY cs.AI cs.LGcited by 13

Not on the map. Why?

Abstract (arXiv)

Recent work has addressed using formulas in linear temporal logic (LTL) as specifications for agents planning in Markov Decision Processes (MDPs). We consider the inverse problem: inferring an LTL specification from demonstrated behavior trajectories in MDPs. We formulate this as a multiobjective optimization problem, and describe state-based ("what actually happened") and action-based ("what the agent expected to happen") objective functions based on a notion of "violation cost". We demonstrate the efficacy of the approach by employing genetic programming to solve this problem in two simple domains.

Key facts. Cited by 13 papers in the map (data through 7 Oct 2026). First posted on arXiv 28 Oct 2017.

Builds on

No reference list yet.

Built on by

Cited by year

Citing papers per year: 2021: 6; 2022: 3; 2023: 2; 2024: 2.

13 papers.

Sort:

By area: