45 citations · 60 across the 13 of their papers we have counts for
Showing cs.PLShow all
2 papers · 1 filter
cs.PL2014★ 4 cited
Timed Soft Concurrent Constraint Programs: An Interleaved and a Parallel Approach
Stefano Bistarelli, Maurizio Gabbrielli, Maria Chiara Meo +1
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 per…
cs.PL2002★ 45 cited
Soft Concurrent Constraint Programming
S. Bistarelli, U. Montanari, F. Rossi
Soft constraints extend classical constraints to represent multiple consistency levels, and thus provide a way to express preferences, fuzziness, and uncertainty. While there are m…