An artificial neural network satisfiability tester
From MaRDI portal
Recommendations
Cites work
- A Complexity Index for Satisfiability Problems
- A Computing Procedure for Quantification Theory
- A Way to Simplify Truth Functions
- A continuous approach to inductive inference
- A satisfiability tester for non-clausal propositional calculus
- Algorithms for testing the satisfiability of propositional formulae
- Algorithms for the maximum satisfiability problem
- Average Time Analysis of Clause Order Backtracking
- Linear-time algorithms for testing the satisfiability of propositional horn formulae
- Logic applied to integer programming and integer programming applied to logic
- Network flow and 2-satisfiability
- Neural networks and physical systems with emergent collective computational abilities
- Solving Satisfiability with Less Searching
- Solving satisfiability in less than \(2^ n\) steps
- The Problem of Simplifying Truth Functions
- The computational complexity of satisfiability of temporal Horn formulas in propositional linear-time temporal logic
Cited in
(8)- An information-based neural approach to generic constraint satisfaction.
- Solving SAT by Lagrange programming neural network with long and short term memories
- On neural network equivalence checking using SMT solvers
- An information-based neural approach to constraint satisfaction
- A neural network algorithm for digital circuits test generation
- NEURAL NETWORKS AND LINEAR PROGRAMMING FOR THE SATISFIABILITY PROBLEM
- An artificial neural network based approach for online string matching/filtering of large databases
- scientific article; zbMATH DE number 1748587 (Why is no real title available?)
This page was built for publication: An artificial neural network satisfiability tester
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4329689)
