137 search results - page 15 / 28 » Heuristic Backtracking Algorithms for SAT |
118
click to vote
CP
2004
Springer
15 years 7 months ago
2004
Springer
Abstract. The paper presents a new look-ahead scheme for backtracking search for solving constraint satisfaction problems. This look-ahead scheme computes a heuristic for value ord...
AUSAI
2004
Springer
15 years 7 months ago
2004
Springer
In this paper we introduce an Ant Colony Optimisation (ACO) algorithm to find solutions for the well-known Knight’s Tour problem. The algorithm utilizes the implicit parallelism ...
114
click to vote
AUSAI
2007
Springer
15 years 6 months ago
2007
Springer
In this paper we describe a stochastic local search (SLS) procedure for finding satisfying models of satisfiable propositional formulae. This new algorithm, gNovelty+ , draws on th...
134
click to vote
ICCAD
2002
IEEE
15 years 10 months ago
2002
IEEE
In this survey, we outline basic SAT- and ATPGprocedures as well as their applications in formal hardware verification. We attempt to give the reader a trace trough literature and...
DATE
2008
IEEE
15 years 8 months ago
2008
IEEE
We present an improved algorithm for concretization of abstract eres in abstraction refinement-based invariant checking. The algorithm maps each transition of the abstract error ...