Soft constraint automata with memory
From MaRDI portal
Publication:5918138
DOI10.1016/j.jlamp.2020.100615zbMath1455.68087MaRDI QIDQ5918138
Fabio Gadducci, Kasper Dokter, Benjamin Lion, Francesco Santini
Publication date: 26 February 2021
Published in: Journal of Logical and Algebraic Methods in Programming (Search for Journal in Brave)
Full work available at URL: https://ir.cwi.nl/pub/27752
68Q45: Formal languages and automata
Related Items
Residuation for soft constraints: lexicographic orders and approximation techniques, Distributivity and residuation for lexicographic orders
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Residuation for bipolar preferences in soft constraints
- A model of context-dependent component connectors
- Cylindric set algebras. Cylindric set algebras and related structures. By L. Henkin, J. D. Monk, and A. Tarski. On cylindric-relativized set algebras. By H. Andreka and I. Nemeti
- Maude: specification and programming in rewriting logic
- It's all about coordination. Essays to celebrate the lifelong scientific achievements of Farhad Arbab
- A compositional model to reason about end-to-end QoS in stochastic Reo connectors
- Connector colouring. I: Synchronisation and context dependency
- Observational and behavioural equivalences for soft concurrent constraint programming
- Modeling component connectors in Reo by constraint automata
- Nonerasing stack automata
- Actin Automata with Memory
- Intentional Automata: A Context-Dependent Model for Component Connectors
- QoS-Driven Service Selection and Composition Using Quantitative Constraint Automata
- Semiring-based constraint satisfaction and optimization
- Reo: a channel-based coordination model for component composition
- Soft concurrent constraint programming
- Recent Trends in Algebraic Development Techniques
- Soft constraint automata with memory