Boolean satisfiability (SAT) solvers are currently very effective in practice. However, there
are still many challenging problems for SAT solvers. Nowadays, extra computational power …

In this paper, ManySAT a new portfolio-based parallel SAT solver is thoroughly described.
The design of ManySAT benefits from the main weaknesses of modern SAT solvers: their …

Abstract We propose the Embarrassingly Parallel Search, a simple and efficient method for
solving constraint programming problems in parallel. We split the initial problem into a huge …

Constraint-based applications attempt to identify a solution that meets all defined user
requirements. If the requirements are inconsistent with the underlying constraint set …

Software verifiers have different strengths and weaknesses, depending on properties of the
verification task. It is well-known that combinations of verifiers via portfolio and selection …

As multi-core computing is now standard, it seems irresponsible for constraints researchers
to ignore the implications of it. Researchers need to address a number of issues to exploit …

For many practical problems, there is more than one algorithm or approach to solve them.
Such algorithms often have complementary performance–where one fails, another performs …

We introduce an Embarrassingly Parallel Search (EPS) method for solving constraint
problems in parallel, and we show that this method matches or even outperforms state-of-the …

We describe the application of assumption-based argumentation (ABA) to a domain of
medical knowledge derived from clinical trials of drugs for breast cancer. We adapt an …

Constraint programming (CP) is an efficient technique for solving combinatorial optimization
problems. In CP a problem is defined over variables that take values in domains and …