A fully abstract model for concurrent constraint programming
TAPSOFT '91 Proceedings of the international joint conference on theory and practice of software development on Colloquium on trees in algebra and programming (CAAP '91): vol 1
Partial constraint satisfaction
Artificial Intelligence - Special volume on constraint-based reasoning
Possibilistic constraint satisfaction problems or “how to handle soft constraints?”
UAI '92 Proceedings of the eighth conference on Uncertainty in Artificial Intelligence
Concurrent constraint programming
Concurrent constraint programming
Semiring-based constraint satisfaction and optimization
Journal of the ACM (JACM)
Semiring-based constraint logic programming: syntax and semantics
ACM Transactions on Programming Languages and Systems (TOPLAS)
Soft Constraints for Security Protocol Analysis: Confidentiality
PADL '01 Proceedings of the Third International Symposium on Practical Aspects of Declarative Languages
Uncertainty in Constraint Satisfaction Problems: a Probalistic Approach
ECSQARU '93 Proceedings of the European Conference on Symbolic and Quantitative Approaches to Reasoning and Uncertainty
Distributed QoS Routing with Imprecise State Information
IC3N '98 Proceedings of the International Conference on Computer Communications and Networks
Constraint solving over semirings
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
Valued constraint satisfaction problems: hard and easy problems
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
Soft constraint programming to analysing security protocols
Theory and Practice of Logic Programming
A logic of soft constraints based on partially ordered preferences
Journal of Heuristics
ACM Transactions on Autonomous and Adaptive Systems (TAAS)
Concurrency, Graphs and Models
Semiring-Based Soft Constraints
Concurrency, Graphs and Models
Decision diagrams for the computation of semiring valuations
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Electronic Notes in Theoretical Computer Science (ENTCS)
Interchangeability in soft CSPs
ERCIM'02/CologNet'02 Proceedings of the 2002 Joint ERCIM/CologNet international conference on Constraint solving and constraint logic programming
A 25-year perspective on logic programming
Implementing semiring-based constraints using mozart
MOZ'04 Proceedings of the Second international conference on Multiparadigm Programming in Mozart/Oz
Actors, roles and coordinators — a coordination model for open distributed and embedded systems
COORDINATION'06 Proceedings of the 8th international conference on Coordination Models and Languages
Interchangeability with thresholds and degradation factors for Soft CSPs
Annals of Mathematics and Artificial Intelligence
| Hi-index | 0.00 |
Soft constraints extend classical constraints to represent multiple consistency levels, and thus provide a way to express preferences, fuzziness, and uncertainty. While there are many soft constraint solving algorithms, even distributed ones, by now there seems to be no concurrent programming framework where soft constraints can be handled. In this paper we show how the classical concurrent constraint (cc) programming framework can work with soft constraints, and we also propose an extension of cc languages which can use soft constraints to prune and direct the search for a solution. We believe that this new programming paradigm, called soft cc (scc), can be very useful in many webrelated scenarios. In fact, the language level allows web agents to express their interaction and negotiation protocols, and also to post their requests in terms of preferences, and the underlying soft constraint solver can find an agreement among the agents even if their requests are incompatible.