We revise soft constraint automata, wherein transitions are weighted and each action has an associated preference value. We first relax the underlying algebraic structure to allow bipolar preferences. We then equip automata with memory locations, that is, with an internal state to remember and update information from transition to transition. We furthermore revise automata operators, such as composition and hiding, providing examples on how such memory locations interact with preferences. We finally apply our framework to encode context-sensitive behaviour.

中文翻译：

---

带存储器的软约束自动机

我们修改了软约束自动机，其中对过渡进行加权，并且每个动作都具有关联的偏好值。我们首先放松基础的代数结构，以允许双极性偏好。然后，我们为自动机配备了内存位置，即具有一个内部状态，可以记住和更新过渡之间的信息。我们还修改了自动机运算符，例如合成和隐藏，提供了有关此类存储位置如何与首选项交互的示例。最后，我们将框架应用于对上下文相关的行为进行编码。