We present two different methods for estimating the cost of solving SAT problems. The methods focus on the online behaviour of the backtracking solver, as well as the structure of the problem. Modern SAT solvers present several challenges to estimate search cost including coping with nonchronological backtracking, learning and restarts. Our first method adapt an existing algorithm for estimatin...

A multi search process version of the sequential assignment, distributed Conflict based BackJumping algorithm is presented. Multi-CBJ benefits greatly from sharing of Nogoods among search processes. It also improves when the multi-search process is dynamic, generating CBJ processes during search with a dynamic heuristic that controls load balancing. The resulting algorithm, Cooperative Dynamic ...

Distributed constraint satisfaction problems (DisCSPs) with asymmetric constraints reflect the fact that agents may wish to retain their constraints private. The set of valid pairs of values of every binary constraint is split between the two constrained agents. An asynchronous backtracking algorithm for asymmetric DisCSPs is presented. The new algorithm is based on asynchronous backtracking (A...

Empirical evidence indicates that the most successful backtracking algorithms for solving constraint satisfaction problems do some level of forward constraint propagation. That is they check constraints against the as yet uninstantiated variables in the search tree. Two popular examples are the forward checking and maintaining arc-consistency algorithms. Although there is a growing body of empi...

A method of volunteering information during asynchronous search on DisCSPs is presented. The meeting scheduling problem (MSP) is formulated as a distributed search problem. In order to implement asynchronous backtracking (ABT) for the MSP, a multi-variable version of ABT is described. Agents participate in multiple meetings, where each meeting is represented by a variable that needs to be assig...

One of the key issues of object-oriented modeling is inheritance. It allows for the definition of a subclass that inherits features from some superclass. When considering the dynamic behavior of objects, as captured by their life cycles, there is no general agreement on the meaning of inheritance. Basten and Van der Aalst introduced the notion of life-cycle inheritance for this purpose. Unfortu...