Soft constraint automata with memory

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 updat...

Full description

Saved in:
Bibliographic Details
Published inJournal of logical and algebraic methods in programming Vol. 118; p. 100615
Main Authors Dokter, Kasper, Gadducci, Fabio, Lion, Benjamin, Santini, Francesco
Format Journal Article
LanguageEnglish
Published Elsevier Inc 01.01.2021
Subjects
Automata with memory
Constraint automata
Reo language
Soft constraints
Soft constraints
Reo language
Constraint automata
Automata with memory
Online AccessGet full text

Cover

More Information
Summary: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.
ISSN:2352-2208
DOI:10.1016/j.jlamp.2020.100615