We consider soft constraint problems where some of the preferences may be unspecified. This models, for example, situations with several agents providing the data, or with possibl...
Mirco Gelain, Maria Silvia Pini, Francesca Rossi, ...
We present a novel approach to parallel Boolean satisfiability (SAT) checking. A distinctive feature of our parallel SAT checker is that it incorporates all essential heuristics ...
Wolfgang Blochinger, Carsten Sinz, Wolfgang Kü...
Abstract. In the world of living creatures, "simple minded" animals often cooperate to achieve common goals with amazing performance. One can consider this idea in the co...
Israel A. Wagner, Yaniv Altshuler, Vladimir Yanovs...
The huge demand for ad-hoc and situational enterprise-class applications led to a new kind of Web-based applications, known as enterprise mashups. End users from the business units...
Florian Gilles, Volker Hoyer, Till Janner, Katarin...
Constraint satisfaction has been applied with great success in closed-world scenarios, where all options and constraints are known from the beginning and fixed. With the internet,...