Models and emerging trends of concurrent constraint programming

Concurrent Constraint Programming (CCP) has been used over the last two decades as an elegant and expressive model for concurrent systems. It models systems of agents communicating by posting and querying partial information, represented as constraints over the variables of the system. This covers a...

Full description

Saved in:
Bibliographic Details
Published in:Constraints : an international journal Vol. 18; no. 4; pp. 535 - 578
Main Authors: Olarte, Carlos, Rueda, Camilo, Valencia, Frank D.
Format: Journal Article
Language:English
Published: Boston Springer US 01.10.2013
Springer
Springer Verlag
Subjects:
Artificial Intelligence
Biological and medical sciences
Computer Science
Fundamental and applied biological sciences. Psychology
General aspects
Logic in Computer Science
Mathematics in biology. Statistical analysis. Models. Metrology. Data processing in biology (general aspects)
Operations Research/Decision Theory
Optimization
Survey
Symbolic Computation
Concurrent constraint programming
Specification
Verification
Concurrency
Cloud computing
Database query
Social network
Distributed system
Distributed computing
Modeling
Biological system
Reactive system
Multiagent system
Trend analysis
Imperfect information
Incomplete information
Concurrent Constraint Programming
ISSN:1383-7133, 1572-9354
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Concurrent Constraint Programming (CCP) has been used over the last two decades as an elegant and expressive model for concurrent systems. It models systems of agents communicating by posting and querying partial information, represented as constraints over the variables of the system. This covers a vast variety of systems as those arising in biological phenomena, reactive systems, net-centric computing and the advent of social networks and cloud computing. In this paper we survey the main applications, developments and current trends of CCP.
ISSN:1383-7133
1572-9354
DOI:10.1007/s10601-013-9145-3