Soft constraint automata with memory
| Autor: | Dokter, Kasper, Gadducci, Fabio, Santini, Francesco, Boer, Frank, Bonsangue, Marcello, Rutten, Jan |
|---|---|
| Přispěvatelé: | Centrum Wiskunde & Informatica, Amsterdam (CWI), The Netherlands |
| Jazyk: | angličtina |
| Rok vydání: | 2018 |
| Předmět: |
Theoretical computer science
Algebraic structure Computer science Constraint automata with memory Soft constraints Join (topology) Nonlinear Sciences::Cellular Automata and Lattice Gases Automaton Constraint (information theory) Action (philosophy) State (computer science) Value (mathematics) Preference (economics) Computer Science::Formal Languages and Automata Theory |
| Zdroj: | Lecture Notes in Computer Science ISBN: 9783319900889 It's All About Coordination |
| Popis: | 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. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|