2011/01/31 by Andrea Roli, Michela Milano · 1 citation
Computer Science · Physics and Astronomy · #cs.AI #cs.NE #nlin.CG
published as In Evelina Lamma and Paola Mello (eds.), AI*IA99: Advances in Artificial Intelligence, LNAI series, vol. 1792, pp. 72-83, Springer, 2000 · 12 pages, 6 figures, 2 tables
arxiv created 2011/01/31 · arxiv updated 2011/02/01
In this paper we present a new approach to solve the satisfiability problem (SAT), based on boolean networks (BN). We define a mapping between a SAT instance and a BN, and we solve SAT problem by simulating the BN dynamics. We prove that BN fixed points correspond to the SAT solutions. The mapping presented allows to develop a new class of algorithms to solve SAT. Moreover, this new approach suggests new ways to combine symbolic and connectionist computation and provides a general framework for local search algorithms.