Refutational theorem proving using term-rewriting systems
Artificial Intelligence
Arc and path consistence revisited
Artificial Intelligence
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
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
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
Introduction to algorithms
Counting the number of solutions for instances of satisfiability
Theoretical Computer Science
Probabilistic approach to the satisfiability problem
Theoretical Computer Science
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
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
On the satisfiability and maximum satisfiability of random 3-CNF formulas
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
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
Genetic Algorithms in Search, Optimization and Machine Learning
Genetic Algorithms in Search, Optimization and Machine Learning
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
Efficient Local Search with Conflict Minimization: A Case Study of the n-Queens Problem
IEEE Transactions on Knowledge and Data Engineering
Design Efficient Local Search Algorithms
IEA/AIE '92 Proceedings of the 5th international conference on Industrial and engineering applications of artificial intelligence and expert systems
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
Constraint-Based Searching: Algorithms and Architectures
Constraint-Based Searching: Algorithms and Architectures
Automated theorem proving: A logical basis (Fundamental studies in computer science)
Automated theorem proving: A logical basis (Fundamental studies in computer science)
A modular partitioning approach for asynchronous circuit synthesis
DAC '94 Proceedings of the 31st annual Design Automation Conference
The Unison algorithm: fast evaluation of Boolean expressions
ACM Transactions on Design Automation of Electronic Systems (TODAES)
A divide-and-conquer approach for asynchronous interface synthesis
ISSS '94 Proceedings of the 7th international symposium on High-level synthesis
The Propositional Formula Checker HeerHugo
Journal of Automated Reasoning
Guided Local Search for Solving SAT and Weighted MAX-SAT Problems
Journal of Automated Reasoning
Trace-Based Methods for Solving Nonlinear Global Optimization and Satisfiability Problems
Journal of Global Optimization
A Discrete Lagrangian-Based Global-SearchMethod for Solving Satisfiability Problems
Journal of Global Optimization
Convergence Properties of Optimization Algorithms for the SAT Problem
IEEE Transactions on Computers
Heuristics for Improving the Non-oblivious Local Search for MaxSAT
IBERAMIA '98 Proceedings of the 6th Ibero-American Conference on AI: Progress in Artificial Intelligence
An Investigation of Variable Relationships in 3-SAT Problems
AI '02 Proceedings of the 15th Australian Joint Conference on Artificial Intelligence: Advances in Artificial Intelligence
PRICAI '02 Proceedings of the 7th Pacific Rim International Conference on Artificial Intelligence: Trends in Artificial Intelligence
A global search algorithm for attributes reduction
AI'04 Proceedings of the 17th Australian joint conference on Advances in Artificial Intelligence
Gases Brownian Motion Optimization: an Algorithm for Optimization (GBMO)
Applied Soft Computing
| Hi-index | 0.00 |
The satisfiability (SAT) problem is a fundamental problem in mathematical logic, inference, automated reasoning, VLSI engineering, and computing theory. Following CNF and DNF local search methods, we introduce the Universal SAT problem model, UniSAT, which transforms the discrete SAT problem on Boolean space {0, 1}/sup m/ into an unconstrained global optimization problem on real space E/sup m/. A direct correspondence between the solution of the SAT problem and the global minimum point of the UniSAT objective function is established. Many existing global optimization algorithms can be used to solve the UniSAT problems. Combined with backtracking/resolution procedures, a global optimization algorithm is able to verify satisfiability as well as unsatisfiability. This approach achieves significant performance improvements for certain classes of conjunctive normal form (CNF) formulas. It offers a complementary approach to the existing SAT algorithms.