SAT2000. Highlights of satisfiability research in the year 2000. 3rd international workshop, September 1998 (Q2703800)

The articles of this volume will be reviewed individually.NEWLINENEWLINEIndexed articles:NEWLINENEWLINE\textit{Gomes, Carla P.; Selman, Bart; Crato, Nuno; Kautz, Henry}, Heavy-tailed phenomena and satisfiability and constraint satisfaction problems, 15-41 [Zbl 0979.68049]NEWLINENEWLINE\textit{Hoos, Holger H.; Stützle, Thomas}, Local search algorithms for SAT: an empirical evaluation, 43-88 [Zbl 0979.68030]NEWLINENEWLINE\textit{Mills, Patrick; Tsang, Edward}, Guided local search for solving SAT and weighted MAX-SAT problems, 89-106 [Zbl 0979.68031]NEWLINENEWLINE\textit{Richards, E. Thomas; Richards, Barry}, Non-systematic search and no-good learning, 107-151 [Zbl 0980.68032]NEWLINENEWLINE\textit{Hirsch, Edward A.}, SAT local search algorithms: Worst-case study, 153-166 [Zbl 0979.68032]NEWLINENEWLINE\textit{Hirsch, Edward A.}, New worst-case upper bounds for SAT, 167-187 [Zbl 0980.68057]NEWLINENEWLINE\textit{de Klerk, Etienne; van Maaren, Hans; Warners, Joost P.}, Relaxations of the satisfiability problem using semidefinite programming, 189-213 [Zbl 0979.68050]NEWLINENEWLINE\textit{Rish, Irina; Dechter, Rina}, Resolution versus search: Two strategies for SAT, 215-259 [Zbl 0979.68051]NEWLINENEWLINE\textit{Groote, Jan Friso; Warners, Joost P.}, The propositional formula checker HeerHugo, 261-281 [Zbl 0979.68088]NEWLINENEWLINE\textit{Hoos, Holger H.; Stützle, Thomas}, SATLIB: An online resource for research on SAT, 283-292 [Zbl 0979.68128]NEWLINENEWLINE\textit{Motoki, Mitsuo; Uehara, Ryuhei}, Unique solution instance generation for the 3-satisfiability (3SAT) problem, 293-307 [Zbl 0979.68052]NEWLINENEWLINE\textit{Zhang, Hantao; Stickel, Mark E.}, Implementing the Davis-Putnam method, 309-326 [Zbl 0979.03012]NEWLINENEWLINE\textit{Küchlin, Wolfgang; Sinz, Carsten}, Proving consistency assertions for automotive product data management, 327-342 [Zbl 0979.68061]NEWLINENEWLINE\textit{Massacci, Fabio; Marraro, Laura}, Logical cryptanalysis as a SAT problem, 343-375 [Zbl 0979.68044]NEWLINENEWLINE\textit{Abramovici, Miron; De Sousa, Jose T.}, A SAT solver using reconfigurable hardware and virtual logic, 377-402 [Zbl 0979.68089]NEWLINENEWLINE\textit{Giunchiglia, Enrico; Giunchiglia, Fausto; Tacchella, Armando}, SAT-based decision procedures for classical modal logics, 403-426 [Zbl 0980.03010]NEWLINENEWLINE\textit{Horrocks, Ian; Patel-Schneider, Peter F.}, Evaluating optimised decision procedures for propositional modal \({\mathbf K}_{({\mathbf m})}\) satisfiability, 427-457 [Zbl 0980.03011]NEWLINENEWLINE\textit{Hustadt, Ullrich; Schmidt, Renate A.}, Using resolution for testing modal satisfiability and building models, 459-483 [Zbl 0984.03012]NEWLINENEWLINE\textit{Cadoli, Marco; Schaerf, Marco; Giovanardi, Andrea; Giovanardi, Massimo}, An algorithm to evaluate quantified Boolean formulae and its experimental evaluation, 485-521 [Zbl 0979.68124]NEWLINENEWLINE\textit{Littman, Michael L.; Majercik, Stephen M.; Pitassi, Toniann}, Stochastic Boolean satisfiability, 523-560 [Zbl 0979.68068]