Developing autonomic systems is a major challenge due to their distributed nature, large dimension, high dynamism, open-endedness, and need of adaptation. In this paper, we tackle this challenge by proposing a language, called ccSCEL, that combines abstractions and primitives specifically devised for programming autonomic systems by also using constraints and operations on them. We show that constraints permit addressing issues related to the programming of autonomic systems, since they are suitable means to deal with, e.g., partial knowledge, multi-criteria optimisation, preferences, uncertainty. We also present an advanced form of interaction that is particularly convenient in this setting. It allows a component of a system to access the ...
This paper describes a computer-aided constraint programming system. Traditional Constraint Programm...
In complex systems, like robot plants, applications are built on top of a set of com-ponents, or dev...
Abstract. Constraint automata (CA) are a coordination model based on finite automata on infinite wor...
Developing autonomic systems is a major challenge due to their distributed nature, large dimension, ...
We address the problem of the specification and the proof of properties of concurrent systems which ...
The autonomic computing paradigm has been proposed to cope with size, complexity, and dynamism of co...
This chapter addresses the integration of constraints and search into programming lan-guages from th...
AbstractConfiguration and diagnosis problem-solvers are commonly championed as successes of applied ...
Constraint programming (CP) is a technology in which a combinatorial problem is modelled as a conjun...
The constraint paradigm is a model of computation in which values are deduced whenever possible, u...
Constraints support a programming style featuring declarative description and effective solving of s...
The constraint paradigm is a model of computation in which values are deduced whenever possible, und...
There has been a lot of interest lately from people solving constrained optimization problems for co...
Abstract: Constraints support an efficient modeling and solution of problems in two ways: The most c...
Programming robots is a difficult task, especially for autonomous robots that must operate in an ope...
This paper describes a computer-aided constraint programming system. Traditional Constraint Programm...
In complex systems, like robot plants, applications are built on top of a set of com-ponents, or dev...
Abstract. Constraint automata (CA) are a coordination model based on finite automata on infinite wor...
Developing autonomic systems is a major challenge due to their distributed nature, large dimension, ...
We address the problem of the specification and the proof of properties of concurrent systems which ...
The autonomic computing paradigm has been proposed to cope with size, complexity, and dynamism of co...
This chapter addresses the integration of constraints and search into programming lan-guages from th...
AbstractConfiguration and diagnosis problem-solvers are commonly championed as successes of applied ...
Constraint programming (CP) is a technology in which a combinatorial problem is modelled as a conjun...
The constraint paradigm is a model of computation in which values are deduced whenever possible, u...
Constraints support a programming style featuring declarative description and effective solving of s...
The constraint paradigm is a model of computation in which values are deduced whenever possible, und...
There has been a lot of interest lately from people solving constrained optimization problems for co...
Abstract: Constraints support an efficient modeling and solution of problems in two ways: The most c...
Programming robots is a difficult task, especially for autonomous robots that must operate in an ope...
This paper describes a computer-aided constraint programming system. Traditional Constraint Programm...
In complex systems, like robot plants, applications are built on top of a set of com-ponents, or dev...
Abstract. Constraint automata (CA) are a coordination model based on finite automata on infinite wor...