Soft concurrent constraint programming
From MaRDI portal
Publication:5277756
DOI10.1145/1149114.1149118zbMath1367.68315arXivcs/0208008OpenAlexW3122941067MaRDI QIDQ5277756
Ugo Montanari, Stefano Bistarelli, Francesca Rossi
Publication date: 12 July 2017
Published in: ACM Transactions on Computational Logic (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/cs/0208008
Reasoning under uncertainty in the context of artificial intelligence (68T37) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Related Items
A Proof Theoretic Study of Soft Concurrent Constraint Programming ⋮ Observational and behavioural equivalences for soft concurrent constraint programming ⋮ On subexponentials, focusing and modalities in concurrent systems ⋮ Timed soft concurrent constraint programs: An interleaved and a parallel approach ⋮ What Do Semantics Matter When the Meat Is Overcooked? ⋮ Subexponential concurrent constraint programming ⋮ A survey of constraint-based programming paradigms ⋮ Which Soft Constraints do you Prefer? ⋮ From Marriages to Coalitions: A Soft CSP Approach ⋮ Soft constraint automata with memory ⋮ A Soft Approach to Multi-objective Optimization ⋮ Programming Autonomic Systems with Multiple Constraint Stores ⋮ Models and emerging trends of concurrent constraint programming ⋮ Modelling Multicast QoS Routing by using Best-Tree Search in And-or Graphs and Soft Constraint Logic Programming
