The satisfiability (SAT) problem is a core, problem in mathematical logic and computing theory. In practice, SAT is fundamental in solving many problems in automated reasoning, computer-aided design,â€¦ (More)

Interest in Satisfiability is expanding for a variety of reasons, not in the least because nowadays more problems are being solved faster by SAT solvers than other means. This is probably becauseâ€¦ (More)

An algorithm for the Satis ability problem is presented and its probabilistic behavior is analysed when combined with two other algorithms studied earlier. The analysis is based on an instanceâ€¦ (More)

We describe an error in earlier probabilistic analyses of the pure literal heuristic as a procedure for solving k-SAT. All probabilistic analyses are in the constant degree model in which a randomâ€¦ (More)

For solving problems of robot navigation over unknown and changing terrain, many algorithms have been invented. For example, D* Lite, which is a dynamic, incremental search algorithm, is the mostâ€¦ (More)

Robot navigation has been of great importance especially under unknown or keep-changing environment. In order to solve this kind of problems, many algorithms have been brought up. D* Lite isâ€¦ (More)