STL: Still Tricky Logic (for System Validation, Even When Showing Your Work)
Isabelle Hurley, Rohan Paleja, Ashley Suh, Jaime Daniel Peña, Ho Chit Siu
Abstract
As learned control policies become increasingly common in autonomous systems, there is increasing need to ensure that they are interpretable and can be checked by human stakeholders. Formal specifications have been proposed as ways to produce human-interpretable policies for autonomous systems that can still be learned from examples. Previous work showed that despite claims of interpretability, humans are unable to use formal specifications presented in a variety of ways to validate even simple robot behaviors. This work uses active learning, a standard pedagogical method, to attempt to improve humans' ability to validate policies in signal temporal logic (STL). Results show that overall validation accuracy is not high, at (mean standard deviation), and that the three conditions of no active learning, active learning, and active learning with feedback do not significantly differ from each other. Our results suggest that the utility of formal specifications for human interpretability is still unsupported but point to other avenues of development which may enable improvements in system validation.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 435e8451-4032-4ef5-b7f3-d8e48284bb73Builds on2
- To Trust or to Think: Cognitive Forcing Functions Can Reduce Overreliance on AI in AI-assisted Decision-makingZana Buçinca, Maja Barbara Malaya, Krzysztof Z. GajosCSCW 2021 · 962 citations
- Interpretable and Personalized Apprenticeship Scheduling: Learning Interpretable Scheduling Policies from Heterogeneous User DemonstrationsRohan R. Paleja, Andrew Silva, Letian Chen, Matthew C. GombolayNeurIPS 2020 · 41 citations
Related papers
- Learning Branching-Time Properties in CTL and ATL via Constraint SolvingBenjamin Bordais, Daniel Neider, Rajarshi RoyFM 2024 · 4 citations
- Automaton Constrained Q-LearningAnastasios Manganaris, Vittorio Giammarino, Ahmed H. QureshiNeurIPS 2025 · 3 citations
- RESTL: Reinforcement Learning Guided by Multi-Aspect Rewards for Signal Temporal Logic TransformationYue Fang, Zhi Jin, Jie An, Hongshen Chen et al.AAAI 2026 · 1 citation
- SafeDec: Constrained Decoding for Safe Autoregressive Generalist Robot Navigation PoliciesParv Kapoor, Akila Ganlath, Michael Clifford, Changliu Liu et al.ICML 2026 · 1 citation
- Learning Reliable and Intuitive Temporal Logic Rules for Interpretable Time Series ClassificationYang Wang, Jiaqi Zhu, Miaomiao Li, Jiang Liu et al.KDD 2025
