Abstract 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 …

We introduce a DeGroot-based model for opinion dynamics in social networks. A community
of agents is represented as a weighted directed graph whose edges indicate how much …

The notion of constraint system (cs) is central to declarative formalisms from concurrency
theory such as process calculi for concurrent constraint programming (ccp). Constraint …

Timed Concurrent Constraint Programming (tcc) is a declarative model for concurrency
offering a logic for specifying reactive systems, ie, systems that continuously interact with the …

The timed concurrent constraint language (tccp in short) is a concurrent logic language
based on the simple but powerful concurrent constraint paradigm of Saraswat. In this …

Automatic techniques for program verification usually suffer the well-known state explosion
problem. Most of the classical approaches are based on browsing the structure of some form …

Timed Concurrent Constraint Programming (tcc) is a declarative model for concurrency
offering a logic for specifying reactive systems, ie systems that continuously interact with the …

Spatial constraint systems are algebraic structures from concurrent constraint programming
to specify spatial and epistemic behavior in multi-agent systems. We shall use spatial …

Abstract Concurrent Constraint Programming (CCP) is a declarative model for concurrency
where agents interact by telling and asking constraints (pieces of information) in a shared …

Concurrent Constraint Programming (CCP) is a formalism for concurrency in which agents
(processes) interact with one another by telling (adding) and asking (reading) information …