Solving the Satisfiability Problem Through Boolean Networks

01/31/2011
by   Andrea Roli, et al.
0

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.

READ FULL TEXT
research
07/30/2020

Improving probability selecting based weights for Satisfiability Problem

The Boolean Satisfiability problem (SAT) is important on artificial inte...
research
09/11/2022

Nearly all k-SAT functions are unate

We prove that 1-o(1) fraction of all k-SAT functions on n Boolean variab...
research
03/02/2022

Machine Learning Methods in Solving the Boolean Satisfiability Problem

This paper reviews the recent literature on solving the Boolean satisfia...
research
05/24/2021

GraphSAT – a decision problem connecting satisfiability and graph theory

Satisfiability of boolean formulae (SAT) has been a topic of research in...
research
10/25/2015

An Efficient Implementation for WalkSAT

Stochastic local search (SLS) algorithms have exhibited great effectiven...
research
11/07/2022

NSNet: A General Neural Probabilistic Framework for Satisfiability Problems

We present the Neural Satisfiability Network (NSNet), a general neural f...
research
02/13/2018

REAS: Combining Numerical Optimization with SAT Solving

In this paper, we present ReaS, a technique that combines numerical opti...

Please sign up or login with your details

Forgot password? Click here to reset