Timed Soft Concurrent Constraint Programs: An Interleaved and a Parallel Approach

24 Feb 2014Stefano BistarelliMaurizio GabbrielliMaria Chiara MeoFrancesco Santini

We propose a timed and soft extension of Concurrent Constraint Programming. The time extension is based on the hypothesis of bounded asynchrony: the computation takes a bounded period of time and is measured by a discrete global clock... (read more)

PDF Abstract


No code implementations yet. Submit your code now


Results from the Paper

  Submit results from this paper to get state-of-the-art GitHub badges and help the community compare results to other papers.