Interactive synthesis of temporal specifications from examples and natural language
Ivan Gavran, Eva Darulova, Rupak Majumdar
摘要
Motivated by applications in robotics, we consider the task of synthesizing linear temporal logic (LTL) specifications based on examples and natural language descriptions. While LTL is a flexible, expressive, and unambiguous language to describe robotic tasks, it is often challenging for non-expert users. In this paper, we present an interactive method for synthesizing LTL specifications from a single example trace and a natural language description. The interaction is limited to showing a small number of behavioral examples to the user who decides whether or not they exhibit the original intent. Our approach generates candidate LTL specifications and distinguishing examples using an encoding into optimization modulo theories problems. Additionally, we use a grammar extension mechanism and a semantic parser to generalize synthesized specifications to parametric task descriptions for subsequent use. Our implementation in the tool LtlTalk starts with a domain-specific language that maps to a fragment of LTL and expands it through example-based user interactions, thus enabling natural language-like robot programming, while maintaining the expressive power and precision of a formal language. Our experiments show that the synthesis method is precise, quick, and asks only a few questions to the users, and we demonstrate in a case study how LtlTalk generalizes from the synthesized tasks to other, yet unseen, tasks.
CCS Concepts: • Software and its engineering → Designing software; • Human-centered computing → Interactive systems and tools.
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了每一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
引用它的顶会 Paper5
- Exploring the Learnability of Program Synthesizers by Novice ProgrammersDhanya Jayagopal, Justin Lubin, Sarah E. ChasinsUIST 2022 · 被引用 40 次
- Web question answering with neurosymbolic program synthesisQiaochu Chen, Aaron Lamoreaux, Xinyu Wang, Greg Durrett 等PLDI 2021 · 被引用 25 次
- CrypFormBench: Benchmarking Formal Analysis Capability of Large Language Models for Cryptographic SchemesZhaoxuan Li, Qionglu Zhang, Hengyuan Liu, Xiaoyan Gu 等FSE 2026 · 被引用 1 次
- Automating Requirements Formalization: Using LLMs and Low-Complexity Distinguishing Traces for Semantic ValidationDaniel Mendoza, Anastasia Mavridou, Andreas Katis, Caroline TrippelICSE 2026
- Choose, Don't Label: Multiple-Choice Query Synthesis for Program DisambiguationCeleste Barnaby, Danny Ding, Osbert Bastani, Isil DilligPLDI 2026
它引用的顶会 Paper2
相关 Paper
- Multi-modal Sketch-Based Behavior Tree SynthesisWenmeng Zhang, Zhenbang Chen, Weijiang HongOOPSLA 2025
- Constrained LTL Specification Learning from ExamplesChangjian Zhang, Parv Kapoor, Ian Dardik, Leyi Cui 等ICSE 2025 · 被引用 4 次
- Incremental Program Synthesis from Event LogsJinwoo Kim, Victor Nicolet, Joey Dodds, Loris D'AntoniOOPSLA 2026
- LTL2Action: Generalizing LTL Instructions for Multi-Task RLPashootan Vaezipoor, Andrew C. Li, Rodrigo Toro Icarte, Sheila A. McIlraithICML 2021 · 被引用 106 次
- Policy Optimization with Linear Temporal Logic ConstraintsCameron Voloshin, Hoang Minh Le, Swarat Chaudhuri, Yisong YueNeurIPS 2022 · 被引用 28 次
