Ten challenges redux: Recent progress in propositional reasoning and search

Ten challenges redux: Recent progress in propositional reasoning and search (2003)

Cached

Download Links

[www.cs.rochester.edu]
[www.cs.rochester.edu]

Other Repositories/Bibliography

DBLP

by Henry Kautz , Bart Selman

Venue:	In Proceedings of CP ’03
Citations:	14 - 0 self

BibTeX

@INPROCEEDINGS{Kautz03tenchallenges,
    author = {Henry Kautz and Bart Selman},
    title = {Ten challenges redux: Recent progress in propositional reasoning and search},
    booktitle = {In Proceedings of CP ’03},
    year = {2003},
    pages = {1--18}
}

Years of Citing Articles

Bookmark

OpenURL

Abstract

Abstract. In 1997 we presented ten challenges for research on satisfiability testing [1]. In this paper we review recent progress towards each of these challenges, including our own work on the power of clause learning and randomized restart policies. 1

Citations

1207	Symbolic Model Checking - McMillan - 1993
926	A computing procedure for quantification theory - Davis, Putnam - 1960
909	Chaff: Engineering an efficient SAT solver - Moskewicz, Madigan, et al. - 2001
636	A machine program for theorem proving - Davis, Logemann, et al. - 1962
620	A New Method for Solving Hard Satisfiability Problems - Selman, Levesque, et al. - 1992
591	Y.: Symbolic model checking without BDDs - Biere, Cimatti, et al. - 1999
568	Diagnosing multiple faults - Kleer, Williams
488	L.J.: Symbolic model checking: 10 20 states and beyond - Burch, Clarke, et al. - 1992
463	Pushing the envelope: Planning, propositional logic, and stochastic search - KAUTZ, SELMAN - 1996
287	GRASP – a new search algorithm for satisfiability - Silva, Sakallah - 1997
285	The Relative Efficiency of Propositional Proof Systems - Cook, Reckhow - 1979
269	Boosting combinatorial search through randomization - Gomes, Selman, et al. - 1998
266	and Easy Distributions for SAT Problems - Hard - 1992
244	Efficient conflict driven learning in a boolean satisfiability solver - ZHANG, MADIGAN, et al. - 2001
242	The Intractability of Resolution - Haken - 1985
224	B: Local search strategies for satisfiability testing - Selman, Kautz, et al.
221	Unifying sat-based and graph-based planning - Kautz, Selman - 1999
217	Forward reasoning and dependency-directed backtracking in a system for computer-aided circuit analysis - Stallman, Sussman - 1977
214	Diagnostic reasoning based on structure and behavior - Davis - 1984
194	Many hard examples for resolution - Chvátal, Szemerédi - 1988
178	The breakout method for escaping from local minima - Morris - 1992
145	Determining computational complexity from characteristic ’phase transition - Monasson, Zecchina, et al. - 1999
141	Sharp Thresholds of Graph Properties, and the k-Sat Problem - Friedgut - 1999
135	Symmetry-breaking Predicates for Search Problems - Crawford, Ginsberg, et al. - 1996
134	Encoding plans in propositional logic - Kautz, McAllester, et al. - 1996
125	Heavy-tailed phenomena in satisfiability and constraint satisfaction problems - Gomes, Selman, et al. - 2002
113	Automatic SAT-compilation of planning problems - Ernst, Millstein - 1997
107	Analytic and Algorithmic Solution of Random Satisfiability Problems - Mézard, Parisi, et al. - 2002
103	Bounded model checking using satisfiability solving - Clarke, Bierea, et al.
101	Finding hard instances of the satisfiability problem: A survey - Cook, Mitchell - 1997
96	An empirical study of greedy local search for satisfiability testing - Selman, Kautz - 1993
94	An efficient propositional prover - SATO - 1997
86	Optimal speedup of Las Vegas algorithms - Luby, Sinclair, et al. - 1993
79	Search in a small world - Walsh - 1999
77	On the run-time behaviour of stochastic local search algorithms for SAT - Hoos - 1999
75	Easy Problems are Sometimes Hard - Gent, Walsh - 1994
74	Integrating equivalency reasoning into Davis-Putnam procedure - Li - 2000
73	Ten challenges in propositional reasoning and search - Selman, Kautz, et al. - 1997
72	Backdoors to typical case complexity - Williams, Gomes, et al. - 2003
71	Generating satisfiable problem instances - Achlioptas, Gomes, et al. - 2000
69	Effective Use of Boolean Satisfiability Procedures in the Formal Verification of Superscalar and VLIW - Velev, Bryant - 2003
67	B.: Problem structure in the presence of perturbations - Gomes, Selman - 1997
61	Generic ILP versus specialized 0-1 ILP: An update - Aloul, Ramani, et al. - 2002
60	M.: A Bayesian approach to tackling hard computational problems - Horvitz, Ruan, et al. - 2001
58	When gravity fails: Local search topology - Frank, Cheeseman, et al. - 1997
58	F.: Satisfiability coding lemma - Paturi, Pudlák, et al. - 1999
56	A.W.: Learning evaluation functions for global optimization and boolean satisfability - Boyan, Moore - 1998
55	Finding bugs in an Alpha microprocessor using satisfiability solvers - Bjesse, Leonard, et al. - 2001
55	Stochastic Local Search - Methods, Models, Applications - Hoos - 1998
54	UnitWalk: A new SAT solver that uses local search guided by unit clause elimination - Hirsch, Kojevnikov - 2005