GSAT with Adaptive Score Function
TL;DR: This paper considers an adaptive score function of GSAT, a modification of the well-known satisfiability search algorithm, which is based on an explicit specification of a TSP.
read more
Abstract: GSAT is a well-known satisfiability search algorithm. In this paper we consider a modification of GSAT. In particular, we consider an adaptive score function.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Figures
Citations
A System of Intelligent Algorithms for a Module of Onboard Equipment of Mobile Vehicles
TL;DR: This paper considers a model of an intelligent robot control system capable of controlling multiple robots operating together and even collaborating in dynamic and unstructured intelligent environments.
On the Valid Deterministic Localization Plan Problem
TL;DR: This paper considers an explicit polynomial reduction from the decision version of the valid deterministic localization plan problem to the 3-satisfiability problem and considers an approach to solve localization problem.
Problems of Sensor Placement for Intelligent Environments of Robotic Testbeds
TL;DR: This paper considers problems of sensor placement for intelligent environments of robotic testbeds and uses Runge Kutta neural networks for the calculation of values of virtual forces and uses artificial physics optimization for different virtual forces.
The problem of fingerprints selection for topological localization
A. Gorbenko
- 01 Jan 2013
TL;DR: One-dimensional color panoramas are considered, a method for automatic generation of fingerprints, and a genetic algorithm for solution of the center circular string problem are proposed.
The Problem of Fingerprints Selection for
Topological Localization,Anna Gorbenko +1 more
- 01 Jan 2013
TL;DR: A method for automatic generation of fingerprints, and a genetic algorithm for solution of the center circular string problem and the prediction the effectiveness of the use of special algorithm for four circular strings are considered.
References
•Proceedings Article
A new method for solving hard satisfiability problems
Bart Selman,Hector J. Levesque,David G. Mitchell +2 more
- 12 Jul 1992
TL;DR: A greedy local search procedure called GSAT is introduced for solving propositional satisfiability problems and its good performance suggests that it may be advantageous to reformulate reasoning tasks that have traditionally been viewed as theorem-proving problems as model-finding tasks.
1.4K
Task-resource scheduling problem
Anna Gorbenko,Vladimir Popov +1 more
TL;DR: This paper considers an approach to solve the task-resource scheduling problem optimally based on constructing a logical model for the problem based on the satisfiability problem (SAT) and allows for particle swarm optimization algorithms for scheduling workflows.
77
Applying GSAT to non-clausal formulas
TL;DR: This paper describes how to modify GSAT so that it can be applied to nonclausal formulas by using a particular "score" function which gives the number of clauses of the CNF conversion of a formula which are false under a given truth assignment.
•Posted Content
Applying GSAT to Non-Clausal Formulas
TL;DR: This paper describes how to modify GSAT so that it can be applied to non-clausal formulas by using a particular ``score'' function which gives the number of clauses of the CNF conversion of a formula which are false under a given truth assignment.
33
SAT Solvers for the Problem of Sensor Placement
Anna Gorbenko,Vladimir Popov +1 more
- 01 Jan 2012
TL;DR: In this paper, an approach is considered to solve the problem of sensor placement based on constructing SAT solvers for logical models of the problem.