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
Online AccessGet full text

Cover

Loading…