Refutational theorem proving using term-rewriting systems
Artificial Intelligence
Parallel Computer Architectures and Problem Solving Strategies for the Consistent Labeling Problem
IEEE Transactions on Computers
Graph-Based Algorithms for Boolean Function Manipulation
IEEE Transactions on Computers
Some results and experiments in programming techniques for propositional logic
Computers and Operations Research - Special issue: Applications of integer programming
Parallel execution of logic programs
Parallel execution of logic programs
A parallel approach for theorem proving in propositional logic
Information Sciences: an International Journal
Artificial intelligence (2nd ed.)
Artificial intelligence (2nd ed.)
Principles of artificial intelligence
Principles of artificial intelligence
Combinatorial optimization: algorithms and complexity
Combinatorial optimization: algorithms and complexity
Logical foundations of artificial intelligence
Logical foundations of artificial intelligence
A Parallel Architecture for Discrete Relaxation Algorithm
IEEE Transactions on Pattern Analysis and Machine Intelligence
A quantitative approach to logical inference
Decision Support Systems
Computation-oriented reductions of predicate to propositional logic
Decision Support Systems
A satisfiability tester for non-clausal propositional calculus
Information and Computation
Parallel consistent labeling algorithms
International Journal of Parallel Programming
A parallel implementation of logic programs
A parallel implementation of logic programs
CNF satisfiability test by counting and polynomial average time
SIAM Journal on Computing
A neural network approach to the 3-satisfiability problem
Journal of Parallel and Distributed Computing - Neural Computing
Generalized resolution and cutting planes
Annals of Operations Research
A survey of average time analyses of satisfiability algorithms
Journal of Information Processing
Computational experience with an interior point algorithm on the satisfiability problem
Annals of Operations Research
Elimination of infrequent variables improves average case performance of satisfiability algorithms
SIAM Journal on Computing
On selecting a satisfying truth assignment (extended abstract)
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Efficient local search for very large-scale satisfiability problems
ACM SIGART Bulletin
On the greedy algorithm for satisfiability
Information Processing Letters
A Novel Discrete Relaxation Architecture
IEEE Transactions on Pattern Analysis and Machine Intelligence
Boolean satisfiability and equivalence checking using general Binary Decision Diagrams
Integration, the VLSI Journal
A quantitative solution to constraint satisfaction problem (CSP)
New Generation Computing
A Computing Procedure for Quantification Theory
Journal of the ACM (JACM)
A Machine-Oriented Logic Based on the Resolution Principle
Journal of the ACM (JACM)
Backtrack programming techniques
Communications of the ACM
A machine program for theorem-proving
Communications of the ACM
Computers for Artificial Intelligence Applications
Computers for Artificial Intelligence Applications
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Neural Net and Boolean Satisfiability Models of Logic Circuits
IEEE Design & Test
IEEE Transactions on Knowledge and Data Engineering
Global Optimization for Satisfiability (SAT) Problem
IEEE Transactions on Knowledge and Data Engineering
Efficient Local Search with Conflict Minimization: A Case Study of the n-Queens Problem
IEEE Transactions on Knowledge and Data Engineering
The complexity of satisfiability problems
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
The complexity of theorem-proving procedures
STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
Generating Semantic Descriptions From Drawings of Scenes With Shadows
Generating Semantic Descriptions From Drawings of Scenes With Shadows
Automated theorem proving: A logical basis (Fundamental studies in computer science)
Automated theorem proving: A logical basis (Fundamental studies in computer science)
| Hi-index | 14.98 |
The satisfiability (SAT) problem is a basic problem in computing theory. Presently, an active area of research on SAT problem is to design efficient algorithms to find a solution for a satisfiable conjunctive normal form (CNF) formula. A new formulation, the Universal SAT problem model, which transforms the SAT problem on Boolean space into an optimization problem on real space has been developed [27], [28], [30]. Many optimization techniques, such as the steepest descent method, Newton's method, and the coordinate descent method, can be used to solve the Universal SAT problem. In this paper, we prove that, when the initial solution is sufficiently close to the optimal solution, the steepest descent method has a linear convergence ratio β