NEURAL NETWORKS AND LINEAR PROGRAMMING FOR THE SATISFIABILITY PROBLEM

DOI10.1142/S0129065799000034MaRDI QIDQ4791685zbMATH OpenOpenAlexWikidataFDO

Authors Angelo Monfroglio

Publication date 1999

Published in International Journal of Neural Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/s0129065799000034

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Linear programming (90C05)

Recommendations

• Connectionist networks for pivot selection in linear programming
• scientific article; zbMATH DE number 69384
• Connectionist networks for constraint satisfaction
• Solving SAT by Lagrange programming neural network with long and short term memories
• An artificial neural network satisfiability tester

Cites work

• scientific article; zbMATH DE number 757650 (Why is no real title available?)
• A Computing Procedure for Quantification Theory
• Connectionist networks for constraint satisfaction
• Linear programs for constraint satisfaction problems
• Neural logic constraint solving
• Testing heuristics: We have it all wrong

Cited in

(8)

• Solving SAT by Lagrange programming neural network with long and short term memories
• SOLVING LINEAR INTEGER PROGRAMMING PROBLEMS BY A NOVEL NEURAL MODEL
• Connectionist networks for constraint satisfaction
• Lagrange programming neural networks
• scientific article; zbMATH DE number 7314124 (Why is no real title available?)
• An artificial neural network satisfiability tester
• scientific article; zbMATH DE number 1748587 (Why is no real title available?)
• scientific article; zbMATH DE number 4066656 (Why is no real title available?)

This page was built for publication: NEURAL NETWORKS AND LINEAR PROGRAMMING FOR THE SATISFIABILITY PROBLEM

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4791685)