Mimicking Behaviors in Separated Domains
Not on the map. Why?
Abstract (arXiv)
Devising a strategy to make a system mimicking behaviors from another system is a problem that naturally arises in many areas of Computer Science. In this work, we interpret this problem in the context of intelligent agents, from the perspective of LTLf, a formalism commonly used in AI for expressing finite-trace properties. Our model consists of two separated dynamic domains, D_A and D_B, and an LTLf specification that formalizes the notion of mimicking by mapping properties on behaviors (traces) of D_A into properties on behaviors of D_B. The goal is to synthesize a strategy that step-by-step maps every behavior of D_A into a behavior of D_B so that the specification is met. We consider several forms of mapping specifications, ranging from simple ones to full LTLf, and for each we study synthesis algorithms and computational properties.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 6 of its 36 references that are in the map. First posted on arXiv 18 May 2022.
Builds on
6 of 36 references.
References · 6
- 2018Foundations for Restraining Bolts: Reinforcement Learning with LTLf/LDLf restraining specificationscited by 69
- 2020Simultaneous Translation Policies: From Fixed to Adaptivecited by 42
- 2017Symbolic LTLf Synthesiscited by 21
- 2019Hybrid Compositional Reasoning for Reactive Synthesis from Finite-Horizon Specificationscited by 16
- 2021Embedding Symbolic Temporal Knowledge into Deep Sequential Modelscited by 11
- 2020LTLf Synthesis on Probabilistic Systemscited by 5
Built on by
Not cited yet.