In this article we extend previous work on the development of logical foundations for the specification of the dynamics of databases. In particular, we deal with two problems. Firstly, the derivation of active rules that ...

The parallel machines scheduling problem (PMSP) comprises the allocation of jobs on the resources of the systems, i.e., a group of machines in parallel. The basic model consists of m identical machines and n jobs. The jobs ...

In this work, a Frame is posed which allows to define global search heuristics in an efficient and declarative way, which interacts with a specific computational implementation of a problem. An overview of different ways ...

In this paper we study when the minimal number of roots of the so-called convenient maps horn two-dimensional CW complexes into closed surfaces is zero We present several necessary and sufficient conditions for such a map ...

Radiotherapy scheduling problems are hard constrained problems that involve many resources including doctors, patients and machines. These problems are different according to the country, and can even vary among institutions ...

In this survey, we presented the general idea and main results from what we understand that are the most important contributions to contractual solutions to the holdup problem literature. The aim of this paper is to push ...