This paper deals with the challenging problem of counting the number of solutions of a CSP, denoted #CSP. Recent progress have been made using search methods, such as BTD [15], whi...
Temporal Constraint Satisfaction Problems (TCSP) is a well known approach for representing and processing temporal knowledge. Important properties of the knowledge can be inferred...
The signature of neuronal assemblies is the higher-order correlation structure of the spiking activity of the participating neurons. Due to the rapid progress in recording technol...
: In modern organisations the monolithic information systems of the past are being gradually replaced by networked systems, enabling distributed computing often based on multi-agen...
Random problem distributions have played a key role in the study and design of algorithms for constraint satisfaction and Boolean satisfiability, as well as in our understanding o...