Bibliography

1

Sixth International Conference on Theory and Applications of Satisfiability Testing, S. Margherita Ligure - Portofino ( Italy), May 2003.

2

Nadel Alexander.
Backtrack search algorithms for propositional satisfiability: Review and innovations.
Master's thesis, Hebrew University of Jerusalem, November 2002.
please email alikn@hotmail.com to receive an electronic copy of this work.

3

Gilles Audemard - Daniel Le Berre - Olivier Roussel - Inês Lynce - João Marques Silva.
OpenSAT: An Open Source SAT Software Project.
In Sixth International Conference on Theory and Applications of Satisfiability Testing [1].

4

Inês Lynce - João Marques Silva.
On implementing more efficient data structures.
In Sixth International Conference on Theory and Applications of Satisfiability Testing [1].

5

Luís Baptista and João P. Marques-Silva.
Using randomization and learning to solve hard real-world instances of satisfiability.
In Proceedings of the 6th International Conference on Principles and Practice of Constraint Programming (CP), September 2000.

6

P. Barth.
A Davis-Putnam Based Enumeration Algorithm for Linear pseudo-Boolean Optimization.
Technical Report MPI-I-95-2-003, Max-Planck-Institut für Informatik, 1995.

7

Roberto J. Jr. Bayardo and Robert C. Schrag.
Using CSP look-back techniques to solve real-world SAT instances.
In Proceedings of the Fourteenth National Conference on Artificial Intelligence (AAAI'97), pages 203-208, Providence, Rhode Island, 1997.

8

Martin Davis, George Logemann, and Donald Loveland.
A machine program for theorem proving.
Communications of the ACM, 5(7):394-397, July 1962.

9

Gilles Dequen and Olivier Dubois.
Renormalization as a function of clause lengths for solving random k-sat formulae.
In Proceedings of Fifth International Symposium on Theory and Applications of Satisfiability Testing, pages 130-132, 2002.

10

Olivier Dubois and Gilles Dequen.
A backbone-search heuristic for efficient solving of hard 3-sat formulae.
In Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence (IJCAI'01), Seattle, Washington, USA, August 4th-10th 2001.

11

E. Goldberg and Y. Novikov.
BerkMin: A fast and robust SAT-solver.
In Design, Automation, and Test in Europe (DATE '02), pages 142-149, March 2002.

12

Carla P. Gomes, Bart Selman, and Henry Kautz.
Boosting combinatorial search through randomization.
In Proceedings of the Fifteenth National Conference on Artificial Intelligence (AAAI'98), pages 431-437, Madison, Wisconsin, 1998.

13

E. A. Hirsch and A. Kojevnikov.
UnitWalk: A new SAT solver that uses local search guided by unit clause elimination.
PDMI preprint 9/2001, Steklov Institute of Mathematics at St.Petersburg, 2001.
A journal version is submitted to this issue.

14

O. Kullmann.
Heuristics for SAT algorithms: Searching for some foundations, September 1998.
23 pages, updated September 1999 w.r.t. running times, url = http://cs-svr1.swan.ac.uk/ csoliver/heur2letter.ps.gz.

15

K. Leyton-Brown, E. Nudelman, G. Andrew, J. McFadden, and Y. Shoham.
A portfolio approach to algorithm selection.
In Proceedings of IJCAI'03, 2003.
A full version of this paper is available from http://robotics.stanford.edu/ kevinlb/boosting.pdf, and is under review.

16

K. Leyton-Brown, E. Nudelman, and Y.Shoham.
Learning the empirical hardness of optimization problems: The case of combinatorial auctions.
In Proceedings of CP'02, 2002.

17

X. Y. Li, M.F. Stallmann, and F. Brglez.
QingTing: A Fast SAT Solver Using Local Search and Efficient Unit Propagation.
In Sixth International Conference on Theory and Applications of Satisfiability Testing [1].
See also http://www.cbl.ncsu.edu/publications/, and http://www.cbl.ncsu.edu/OpenExperiments/SAT/ .

18

Joao P. Marques-Silva and Karem A. Sakallah.
GRASP - A New Search Algorithm for Satisfiability.
In Proceedings of IEEE/ACM International Conference on Computer-Aided Design, pages 220-227, November 1996.

19

J.P. Marques-Silva and K.A. Sakallah.
GRASP: A Search Algorithm for Propositional Satisfiability.
IEEE Transactions on Computers, 48:506-521, 1999.

20

M. W. Moskewicz, C. F. Madigan, Y. Zhao, L. Zhang, and S. Malik.
Chaff: Engineering an efficient SAT solver.
In Proceedings of the 38th Design Automation Conference (DAC'01), pages 530-535, June 2001.

21

R. Ostrowski, E. Grégoire, B. Mazure, and L. Sais.
Recovering and exploiting structural knowledge from cnf formulas.
In Proc. of the Eighth International Conference on Principles and Practice of Constraint Programming (CP'2002), LNCS, pages 185-199, Ithaca (N.Y.), September 2002. Springer.

22

R. Paturi, P. Pudlák, and F. Zane.
Satisfiability coding lemma.
In Proceedings of the 38th Annual IEEE Symposium on Foundations of Computer Science, FOCS'97, pages 566-574, 1997.

23

S. D. Prestwich.
Randomised backtracking for linear pseudo-boolean constraint problems.
In Proceedings of Fourth International Workshop on Integration of AI and OR techniques in Constraint Programming for Combinatorial Optimisation Problems, 2002.

24

Bart Selman, Henry A. Kautz, and Bram Cohen.
Noise strategies for improving local search.
In Proceedings of the Twelfth National Conference on Artificial Intelligence (AAAI'94), pages 337-343, Seattle, 1994.

25

Laurent Simon, Daniel Le Berre, and Edward E. Hirsch.
The sat2002 competition report.
Annals of Mathematics and Artificial Intelligence, 2003.
Special issue for SAT2002, to appear.

26

Allen Van Gelder.
Generalizations of watched literals for backtracking search.
In Seventh Int'l Symposium on AI and Mathematics, Ft. Lauderdale, FL, 2002.

27

J. Whittemore, J. Kim, and K. Sakallah.
SATIRE: a new incremental satisfiability engine.
In Proc. of the 38th Conference on Design Automation, pages 542-545, 2001.

28

Hantao Zhang.
SATO: an efficient propositional prover.
In Proceedings of the International Conference on Automated Deduction (CADE'97), volume 1249 of LNAI, pages 272-275, 1997.

29

L. Zhang, C. F. Madigan, M. W. Moskewicz, and S. Malik.
Efficient conflict driven learning in a Boolean satisfiability solver.
In International Conference on Computer-Aided Design (ICCAD'01), pages 279-285, November 2001.

30

L. Zheng and P. J. Stuckey.
Improving SAT using 2SAT.
In Michael J. Oudshoorn, editor, Proceedings of the Twenty-Fifth Australasian Computer Science Conference (ACSC2002), Melbourne, Australia, 2002. ACS.