Algorithm Completeness
The priority order is changed if and only if a new nogood is found.
- The priority order can not be changed infinitely.
- If the priority order is stable, this algorithm is equivalent to the asynchronous backtracking.
The worst-case space complexity is exponential in n.
- can be restricted in practice: forgetting older nogoods
- If the number of recorded nogoods is sufficiently large, an infinite processing loop rarely occurs.