Solving the Satisfiability Problem Through Boolean Networks

Details Solving the Satisfiability Problem Through Boolean Networks Solving the Satisfiability Problem Through Boolean Networks

2011-01-31

arxiv.org/abs/1101.6009v1

In Evelina Lamma and Paola Mello (eds.), AI*IA99: Advances in Artificial Intelligence, LNAI series, vol. 1792, pp. 72-83, Spri

Computer Science

Artificial Intelligence

12 pages, 6 figures, 2 tables

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Solving the Satisfiability Problem Through Boolean Networks does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Solving the Satisfiability Problem Through Boolean Networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Solving the Satisfiability Problem Through Boolean Networks will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-648393