Statecharts: A visual formalism for complex systems
Science of Computer Programming
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
The ESTEREL synchronous programming language: design, semantics, implementation
Science of Computer Programming
Timed default concurrent constraint programming
Journal of Symbolic Computation - Special issue: executable temporal logics
Semiring-based constraint satisfaction and optimization
Journal of the ACM (JACM)
A model and proof system for asynchronous networks
Proceedings of the fourth annual ACM symposium on Principles of distributed computing
A timed concurrent constraint language
Information and Computation
Probabilistic Concurrent Constraint Programming: Towards a Fully Abstract Model
MFCS '98 Proceedings of the 23rd International Symposium on Mathematical Foundations of Computer Science
A Temporal Concurrent Constraint Programming Calculus
CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
Temporal concurrent constraint programming: applications and behavior
Formal and natural computing
Concurrent constraint programming languages
Concurrent constraint programming languages
Semirings for Soft Constraint Solving and Programming (LECTURE NOTES IN COMPUTER SCIENCE)
Semirings for Soft Constraint Solving and Programming (LECTURE NOTES IN COMPUTER SCIENCE)
Soft concurrent constraint programming
ACM Transactions on Computational Logic (TOCL)
A Timed Linda Language and its Denotational Semantics
Fundamenta Informaticae
Managing Quality of Service with Soft Constraints
ICLP '08 Proceedings of the 24th International Conference on Logic Programming
A Nonmonotonic Soft Concurrent Constraint Language for SLA Negotiation
Electronic Notes in Theoretical Computer Science (ENTCS)
Managing quality of service with soft constraints
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 3
A 25-year perspective on logic programming
Concurrent and reactive constraint programming
A 25-year perspective on logic programming
A Nonmonotonic Soft Concurrent Constraint Language to Model the Negotiation Process
Fundamenta Informaticae
| Hi-index | 0.00 |
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. Action prefixing is then considered as the syntactic marker which distinguishes a time instant from the next one. Supported by soft constraints instead of crisp ones, tell and ask agents are now equipped with a preference (or consistency) threshold which is used to determine their success or suspension. In the paper we provide a language to describe the agents behavior, together with its operational and denotational semantics, for which we also prove the compositionality and correctness properties. Agents negotiating Quality of Service can benefit from this new language, by coordinating among themselves and mediating their preferences.