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 …

The tcc model is a formalism for reactive concurrent constraint programming. We present a
model of temporal concurrent constraint programming which adds to tcc the capability of …

The language Timed Concurrent Constraint (tccp) is the extension over time of the
Concurrent Constraint Programming (cc) paradigm that allows us to specify concurrent …

The tcc model is a formalism for reactive concurrent constraint programming. In this paper
we propose a model of temporal concurrent constraint programming which adds to tcc the …

The tcc paradigm is a formalism for timed concurrent constraint programming. Several tcc
languages differing in their way of expressing infinite behavior have been proposed in the …

Abstract Constraint Logic Programming (CLP) is one of the most successful branches of
Logic Programming; it attracts the interest of theoreticians and practitioners, and it is …

Argumentation Theory oers formalisms for the study of reasoning processes taking place
between intelligent entities. In this context, time is a crucial factor: in a real-world …

Although very simple and elegant, Linda-style coordination models lack the notion of time,
and are therefore not able to precisely model real-life coordination applications, featuring …

The timed concurrent language for argumentation (tcla) is a framework to model concurrent
interactions between communicating agents that reason and take decisions through …

Time is a crucial factor in modelling dynamic behaviours of intelligent agents: in a real-world
environment, activities have a determined temporal duration and the behaviour of agents is …