Solving the Satisfiability Problem Through Boolean Networks
Artificial Intelligence
2011-02-01 v1 Neural and Evolutionary Computing
Cellular Automata and Lattice Gases
Abstract
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.
Cite
@article{arxiv.1101.6009,
title = {Solving the Satisfiability Problem Through Boolean Networks},
author = {Andrea Roli and Michela Milano},
journal= {arXiv preprint arXiv:1101.6009},
year = {2011}
}
Comments
12 pages, 6 figures, 2 tables