Neural networks and linear programming for the satisfiability problem.
First a Linear Programming formulation is considered for the satisfiability problem, in particular for the satisfaction of a Conjunctive Normal Form in the Propositional Calculus and the Simplex algorithm for solving the optimization problem. The use of Recurrent Neural Networks is then described for choosing the best pivot positions and greatly improving the algorithm performance. The result of hard cases testing is reported and shows that the technique can be useful even if it requires a huge amount of size for the constraint array and Neural Network Data Input.
Monfroglio
A
A
angelomonfroglio@mclink.it
D000465:Algorithms; D016014:Linear Models; D008962:Models, Theoretical; D016571:Neural Networks, Computer; D012984:Software