Solving the Satisfiability Problem through Boolean Networks

Authors:
Michela Milano;Andrea Roli
Affiliations:
-;-
Venue:
AI*IA '99 Proceedings of the 6th Congress of the Italian Association for Artificial Intelligence on Advances in Artificial Intelligence
Year:
1999

Citing 4
Cited 4

On the run-time behaviour of stochastic local search algorithms for SAT

AAAI '99/IAAI '99 Proceedings of the sixteenth national conference on Artificial intelligence and the eleventh Innovative applications of artificial intelligence conference innovative applications of artificial intelligence
A Computing Procedure for Quantification Theory

Journal of the ACM (JACM)
Complexity: Metaphors, Models, and Reality

Complexity: Metaphors, Models, and Reality
Evidence for invariants in local search

AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence

Algorithms for Inference, Analysis and Control of Boolean Networks

AB '08 Proceedings of the 3rd international conference on Algebraic Biology
An Improved Algorithm for Detecting a Singleton Attractor in a Boolean Network Consisting of AND/OR Nodes

AB '08 Proceedings of the 3rd international conference on Algebraic Biology
Logic programming for Boolean networks

IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Two
An O(1.787n)-time algorithm for detecting a singleton attractor in a Boolean network consisting of AND/OR nodes

FCT'07 Proceedings of the 16th international conference on Fundamentals of Computation Theory

Quantified Score

Hi-index	0.00

Visualization

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.