Soft constraint automata with memory
In this paper, we revise the notion of Soft Constraint Automata, where automata transitions are weighted and consequently each action is associated with a preference value. We first relax the underlying algebraic structure that models preferences, with the purpose to use bipolar preferences (i.e., both positive and negative ones). Then, we equip automata with memory cells, that is, with an internal state to remember and update information from transition to transition. Finally, we revise automata operators, as join and hiding.
|Constraint automata with memory, Soft constraints|
|F.S. de Boer (Frank) , M.M. Bonsangue (Marcello) , J.J.M.M. Rutten (Jan)|
|Lecture Notes in Computer Science/Lecture Notes in Artificial Intelligence|
|Organisation||Centrum Wiskunde & Informatica, Amsterdam, The Netherlands|
Dokter, K.P.C, Gadducci, F, & Santini, F. (2018). Soft constraint automata with memory. In F.S de Boer, M.M Bonsangue, & J.J.M.M Rutten (Eds.), It's All About Coordination. Essays to Celebrate the Lifelong Scientific Achievements of Farhad Arbab (pp. 70–85). doi:10.1007/978-3-319-90089-6_6