Computing in the fractal cloud: modular generic solvers for SAT and Q-SAT variants

Abstract. Abstract geometrical computation can solve hard combina-torial problems efficiently: we showed previously how Q-SAT can be solved in bounded space and time using instance-specific signal machines and fractal parallelization. In this article, we propose an approach for constructing a particular generic machine for the same task. This ma-chine deploies the Map/Reduce paradigm over a fractal structure. More-over our approach is modular: the machine is constructed by combining modules. In this manner, we can easily create generic machines for solv-ing satifiability variants, such as SAT, #SAT, MAX-SAT