Results 1  10
of
75
A Runtime Reconfigurable Implementation of the GSAT Algorithm
 In Int'l Workshop on Field Programmable Logic and Applications
, 1999
"... . Boolean satisfiability (SAT) problems are an important subset of constraint satisfaction problems (CSPs) which have application in such areas as computer aided design, computer vision, planning, resource allocation and temporal reasoning. In this paper we describe an implementation of an incomplet ..."
Abstract
 Add to MetaCart
of an incomplete heuristic search algorithm called GSAT to solve 3SAT problems. In contrast to other approaches, our design is runtime configurable. The input to this system is a 3SAT problem from which a software program directly generates a problemspecific configuration which can be directly downloaded
GSAT and Dynamic Backtracking
 Journal of Artificial Intelligence Research
, 1994
"... There has been substantial recent interest in two new families of search techniques. One family consists of nonsystematic methods such as gsat; the other contains systematic approaches that use a polynomial amount of justification information to prune the search space. This paper introduces a new te ..."
Abstract

Cited by 386 (15 self)
 Add to MetaCart
There has been substantial recent interest in two new families of search techniques. One family consists of nonsystematic methods such as gsat; the other contains systematic approaches that use a polynomial amount of justification information to prune the search space. This paper introduces a new
DomainIndependent Extensions to GSAT: Solving Large Structured Satisfiability Problems
 PROC. IJCAI93
, 1993
"... GSAT is a randomized local search procedure for solving propositional satisfiability problems (Selman et al. 1992). GSAT can solve hard, randomly generated problems that are an order of magnitude larger than those that can be handled by more traditional approaches such as the DavisPutnam proc ..."
Abstract

Cited by 227 (10 self)
 Add to MetaCart
improve GSAT's performance on such formulas. These strategies, in effect, manage to uncover hidden structure in the formula under considerations, thereby significantly extending the applicability of the GSAT algorithm.
On the Accuracy and Running Time of GSAT
, 1999
"... Randomized algorithms for deciding satisfiability were shown to be effective in solving problems with thousands of variables. However, these algorithms are not complete. That is, they provide no guarantee that a satisfying assignment, if one exists, will be found. Thus, when studying randomized ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
of the running time for randomized algorithms is not welldefined. In this paper, we introduce a formal notion of accuracy. We use it to define a concept of the running time. We use both notions to study the random walk strategy GSAT algorithm. We investigate the dependence of accuracy on properties of input
An Empirical Analysis of Search in GSAT
 Journal of Artificial Intelligence Research
, 1993
"... We describe an extensive study of search in GSAT, an approximation procedure for propositional satisfiability. GSAT performs greedy hillclimbing on the number of satisfied clauses in a truth assignment. Our experiments provide a more complete picture of GSAT's search than previous accounts. ..."
Abstract

Cited by 53 (10 self)
 Add to MetaCart
We describe an extensive study of search in GSAT, an approximation procedure for propositional satisfiability. GSAT performs greedy hillclimbing on the number of satisfied clauses in a truth assignment. Our experiments provide a more complete picture of GSAT's search than previous accounts
GSAT versus Simulated Annealing
 Proceedings of the European Conference on Artificial Intelligence
, 1994
"... . The question of satisfiability for a given propositional formula arises in many areas of AI. Especially finding a model for a satisfiable formula is very important though known to be NPcomplete. There exist complete algorithms for satisfiability testing like the DavisPutnamAlgorithm, but they o ..."
Abstract

Cited by 15 (5 self)
 Add to MetaCart
, but they often do not construct a satisfying assignment for the formula, are not practically applicable for more than 400 or 500 variable problems, or in practice take too much time to find a solution. Recently, a (in practice) very fast, though incomplete, procedure, the model generating algorithm GSAT, has
GSAT and Simulated Annealing  a comparison
, 1994
"... The question of satisfiability for a given propositional formula arises in many areas of AI. Especially finding a model for a satisfiable formula is very important though known to be NPcomplete. There exist complete algorithms for satisfiability testing like the DavisPutnamAlgorithm, but they oft ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
, the model generating algorithm GSAT, has been introduced and several refined variants were created. Another method is Simulated Annealing (SA). Both approaches have already been compared with different results. We clarify these differences and do a more elaborate comparison using identical problems for both
DomainIndependent Extensions to GSAT: Solving Large Structured Satisfiability Problems
"... GSAT is a randomized local search procedure for solving propositional satisfiability problems (Selman et al. 1992). GSAT can solve hard, randomly generated problems that are an order of magnitude larger than those that can be handled by more traditional approaches such as the DavisPutnam procedure. ..."
Abstract
 Add to MetaCart
's performance on such formulas. These strategies, in effect, manage to uncover hidden structure in the formula under considerations, thereby significantly extending the applicability of the GSAT algorithm. 1
GSAT Enhanced with Learning Automata and Multilevel Paradigm
"... A large number of problems that occur in knowledgerepresentation, learning, very large scale integration technology (VLSIdesign), and other areas of artificial intelligence, are essentially satisfiability problems. The satisfiability problem refers to the task of finding a satisfying assignment tha ..."
Abstract
 Add to MetaCart
Algorithm (GSAT). We present a detailed comparative analysis of the new approaches using a benchmark set containing randomized and practical engineering applications from various domains.
The GSAT/SAFamiliy  Relating greedy satisifability testing to simulated annealing
, 1994
"... In this paper, we investigate and relate various variants of the greedy satisfiability tester GSAT. We present these algorithms as members of a whole family of algorithms for finding a model for satisfiable propositional logic formulas. In particular, all algorithms can be formulated as instances of ..."
Abstract

Cited by 6 (6 self)
 Add to MetaCart
In this paper, we investigate and relate various variants of the greedy satisfiability tester GSAT. We present these algorithms as members of a whole family of algorithms for finding a model for satisfiable propositional logic formulas. In particular, all algorithms can be formulated as instances
Results 1  10
of
75