Local search for satisfiability (SAT) problem

10.1109/21.135698

10.1145/101340.101343

sosi?, 1988, How to search for million queens

sosi?, 1988, Quick n-queen search on VAX and Bobcat machines

10.1145/238997.239009

10.1147/rd.314.0464

10.1145/122319.122325

0

10.1109/69.317698

10.1016/0004-3702(85)90074-8

10.1145/1968.1972

waltz, 1975, The Psychology of Computer Vision, 19

10.1109/34.149596

gu, 1990, Discrete Relaxation Techniques, 111

10.1109/TPAMI.1987.4767988

0

hooker, 1989, Branch-and-cut solution of inference problems in propositional logic

10.1016/0167-6377(88)90044-2

10.1016/0167-9236(88)90097-8

10.1137/0221037

10.1109/SFCS.1991.185365

purdom, 1990, A survey of average time analyses of satisfiability algorithms, J Inform Processing, 13, 449

pehoushek, 1992, Sat problem instances and algorithms

10.1109/43.75636

gu, 1991, Average time complexities of several local search algorithms for the satisfiability problem

10.1063/1.2915086

0

selman, 1992, Private Communications

selman, 1992, A new method for solving hard satisfiability problems, Proc AAAI 92, 440

0

shensa, 1989, A computational structure for the propositional calculus, Proc IJCAI, 384

0

siegel, 1987, "Representation et utilization de la connaissances en calcul propositionel "

colmerauer, 1987, Opening the Prolog III Universe, Byte, 177

10.1214/aoms/1177729330

1992, Series in Artificial Intelligence, 1

1992, Lecture Notes in Computer Science Vol 604 IEA/AIE, 651

1992, Efficient local search for very large-scale satisfiability problem, SIGART Bull, 3, 8, 10.1145/130836.130837

0

1994, Constraint-Based Search

0

0

10.1109/TSMCA.2006.878979

10.1109/43.108614

gu, 1990, Benchmarking sat algorithms

gu, 1988, How to solve Very Large-Scale Satisfiability (VLSS) problems

nilsson, 1980, Principles of Artificial Intelligence

10.1016/0004-3702(86)90083-4

mitchell, 1992, Hard and easy distributions of SAT problems, Proc AAAI 92, 459

minion, 1990, Solving large-scale constraint satisfaction and scheduling problems using a heuristic repair method, Proc AAAI-90, 17

mcallester, 1990, Truth maintenance, Proc AAAI, 90, 1109

10.1016/0004-3702(77)90007-8

10.1002/j.1538-7305.1965.tb04146.x

10.1109/MEX.1987.4307090

10.1016/0895-7177(92)90081-U

erd�s, 1974, Probabilistic Method in Combinatorics

1990, Parallel processing for non-numeric applications, Int Conf Parallel Processing

10.1016/0166-218X(83)90017-3

garey, 1979, Computers and Intractability A Guide to the Theory of NP-Completeness

10.1016/0020-0190(82)90110-7

goldberg, 1989, Genetic Algorithms in Search Optimization and Machine Learning

lee, 1992, Private Communications

gu, 1988, Parallel algorithms and architectures for very fast search

winston, 1984, Artificial Intelligence

10.1145/321250.321253

0

purdom, 1992, Private Communications

0

williams, 1987, Linear and integer programming applied to the prepositional calculus, Systems Research and Information Sciences, 2, 81

cormen, 1990, Introduction to Algorithms

10.1145/800157.805047

10.1145/321033.321034

cemy, 1982, A thermodynamical approach to the travelling salesman problem An efficient simulation algorithm

10.1007/3-540-56393-8_13

kumar, 1991, Algorithms for Constraint Satisfaction Problems A Survey

de kleer, 1990, Exploiting locality in a TMS, Proc AAAI-90, 264

10.1109/ICCAD.1989.76956

karmarkar, 1988, Mathematical Developments Arising from Linear Programming Algorithms

kamath, 1989, Computational experience with an interior point algorithm on the satisfiability problem

kirkpatrick, 1983, Optimization by simulated annealing, Sci, 220, 671, 10.1126/science.220.4598.671

karp, 1976, Algorithms and Complexity New Directions and Recent Results, 1

10.1016/0924-0136(91)90148-8

10.1016/0167-9236(88)90128-5

10.1016/0020-0190(90)90156-R

jackson, 1991, Heuristic search algorithms for the satisfiability problem, Third IEEE TAI Conf