[PS][PS] Algorithms for the satisfiability (SAT) problem: A survey.
The satis ability (SAT) problem is a core problem in mathematical logic and computing
theory. In practice, SAT is fundamental in solving many problems in automated reasoning …
theory. In practice, SAT is fundamental in solving many problems in automated reasoning …
Constraint satisfaction algorithms 1
BA Nadel - Computational Intelligence, 1989 - Wiley Online Library
Constraint satisfaction problems are ubiquitous in artificial intelligence and many algorithms
have been developed for their solution. This paper provides a unified survey of some of …
have been developed for their solution. This paper provides a unified survey of some of …
Tree search and arc consistency in constraint satisfaction algorithms
BA Nadel - Search in artificial intelligence, 1988 - Springer
Constraint satisfaction problems are ubiquitous in Artificial Intelligence and many algorithms
have been developed for their solution. This paper provides a unified introduction to some of …
have been developed for their solution. This paper provides a unified introduction to some of …
Partition search for non-binary constraint satisfaction
JR Ullmann - Information Sciences, 2007 - Elsevier
Previous algorithms for unrestricted constraint satisfaction use reduction search, which
inferentially removes values from domains in order to prune the backtrack search tree. This …
inferentially removes values from domains in order to prune the backtrack search tree. This …
[PDF][PDF] A template-based approach to the generation of distributed applications using a network of workstations
A Singh, J Schaeffer, M Green - IEEE Transactions on …, 1991 - webdocs.cs.ualberta.ca
Despite rapid growth in workstation and networking technologies, the workstation
environment continues to pose challenging problems to shared processing. In this paper, we …
environment continues to pose challenging problems to shared processing. In this paper, we …
Algorithms for the satisfiability (sat) problem
An instance of the satisfiability (SAT) problem is a Boolean formula that has three
components 102, 191: A set of n variables: x 1, x 2, xn. A set of literals. A literal is a variable …
components 102, 191: A set of n variables: x 1, x 2, xn. A set of literals. A literal is a variable …
On optimizing the satisfiability (SAT) problem
J Gu, Q Gu, D Du - Journal of Computer Science and Technology, 1999 - Springer
The satisfiability (SAT) problem is a basic problem in computing theory. Presently, an active
area of research on SAT problem is to design efficient optimization algorithms for finding a …
area of research on SAT problem is to design efficient optimization algorithms for finding a …
A parallel architecture for discrete relaxation algorithm
J Gu, W Wang, TC Henderson - IEEE transactions on pattern …, 1987 - ieeexplore.ieee.org
Discrete relaxation techniques have proven useful in solving a wide range of problems in
digital signal and digital image processing, artificial intelligence, operations research, and …
digital signal and digital image processing, artificial intelligence, operations research, and …
A novel discrete relaxation architecture
J Gu, W Wang - IEEE Transactions on Pattern Analysis & Machine …, 1992 - computer.org
The discrete relaxation algorithm (DRA) is a computational technique that enforces arc
consistency (AC) in a constraint satisfaction problem (CSP). The original sequential AC-1 …
consistency (AC) in a constraint satisfaction problem (CSP). The original sequential AC-1 …
Convergence properties of optimization algorithms for the SAT problem
J Gu, QP Gu, DZ Du - IEEE transactions on computers, 1996 - ieeexplore.ieee.org
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 …
area of research on SAT problem is to design efficient algorithms to find a solution for a …