 |
|
|
|
| HAL: hal-00673603, version 1 |
| Detailed view |  Export this paper |
|
|
| Theory and Applications of Models of Computation (TAMC 2012), Beijing : Chine (2012) |
|
|
|
|
| Computing in the fractal cloud: modular generic solvers for SAT and Q-SAT variants. |
|
|
| Denys Duchier 1Jérôme Durand-Lose 1 |
|
|
| (2012-05-21) |
|
|
|
| Abstract geometrical computation can solve hard combinatorial problems efficiently: we showed previously how Q-SAT (the satisfiability problem of quantified boolean formulae) 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 machine deploies the Map/Reduce paradigm over a discrete fractal structure. Moreover our approach is modular: the machine is constructed by combining modules. In this manner, we can easily create generic machines for solving satisfiability variants, such as SAT, #SAT, MAX-SAT. |
|
|
|
|
|
|
|
|
|
|
|
| 1: | Laboratoire d'Informatique Fondamentale d'Orléans (LIFO) |
|
|
|
Université d'Orléans : EA4022 – Ecole Nationale Supérieure d'Ingénieurs de Bourges |
|
|
|
|
|
|
|
|
|
| CA GAMoC |
|
|
|
|
| Subject | : | Computer Science/Logic in Computer Science Computer Science/Computational Complexity |
|
|
| Abstract geometrical computation – Signal machine – Fractal – Satisfiability problems – Massive parallelism – Model of computation. |
|
|
|
| Attached file list to this document: | |||||
|
|||||
|
|
|
| hal-00673603, version 1 | |
| http://hal.archives-ouvertes.fr/hal-00673603 | |
| oai:hal.archives-ouvertes.fr:hal-00673603 | |
| From: Maxime Senot | |
| Submitted on: Friday, 8 June 2012 15:47:38 | |
| Updated on: Friday, 8 June 2012 16:09:39 | |
