## Ten challenges in propositional reasoning and search (1997)

### Cached

### Download Links

- [dli.iiit.ac.in]
- [ijcai.org]
- [ijcai.org]
- [www.cs.cornell.edu]
- [ftp.research.att.com]
- DBLP

### Other Repositories/Bibliography

Citations: | 83 - 3 self |

### BibTeX

@INPROCEEDINGS{Selman97tenchallenges,

author = {Bart Selman and Henry Kautz and David Mcallester},

title = {Ten challenges in propositional reasoning and search},

booktitle = {},

year = {1997},

pages = {50--54},

publisher = {Morgan Kaufmann}

}

### Years of Citing Articles

### OpenURL

### Abstract

The past several years have seen much progress in the area of propositional reasoning and satisfiability testing. There is a growing consensus by researchers on the key technical challenges that need to be addressed in order to maintain this momentum. This paper outlines concrete technical challenges in the core areas of systematic search, stochastic search, problem encodings, and criteria for evaluating progress in this area. 1

### Citations

1092 | A computing procedure for quantification theory - Davis, Putnam - 1960 |

980 | Fast planning through planning graph analysis
- Blum, Furst
- 1995
(Show Context)
Citation Context ...find suitable SAT encodings of real-world problems. As discussed in the introduction, there has been significant recent progress along this front. Examples include classical constraintbased planning (=-=Blum and Furst 1995-=-; Kautz and Selman 1996), problems in finite algebra (Fujita et al. 1993), verification of hardware and software, scheduling (Crawford and Baker 1994), circuit synthesis and diagnosis (Larrabee 1992),... |

690 | A new method for solving hard satisfiability problems - Selman, Levesque, et al. - 1992 |

532 | Pushing the envelope: Planning, propositional logic, and stochastic search
- Kautz, Selman
- 1996
(Show Context)
Citation Context ...n solve the original (i.e., unencoded) problem instances. In such a comparison it is usually not possible to outperform the specialized algorithms (although it is sometimes possible, see for example (=-=Kautz and Selman 1996-=-)), but one should provide evidence that solving the encoded problem with general purpose Boolean satisfiability procedures is at least competitive. Whenever possible, comparisons should also be made ... |

269 |
The intractability of resolution
- Haken
- 1985
(Show Context)
Citation Context ...ariable-ordering and value selection, all in order to the reduce size of the tree. However, there are known fundamental limitations on the size of the shortest resolution proofs for certain problems (=-=Haken 1985; Chvatal -=-and Szemeredi 1988). For example, "pigeon hole" problems (showing that n pigeons cannot fit in n \Gamma 1 holes) are intuitively easy, but shortest resolution refutation proofs are of expone... |

221 | Hard and easy distributions of SAT problem
- Mitchell, Selman, et al.
- 1992
(Show Context)
Citation Context ...e first is to develop a way to prove that unsatisfiable 700 variable 3-CNF formulas, randomly generated in the "hard" region where the ratio of variables to clauses is 4.3, are in fact unsat=-=isfiable (Mitchell et al. 1992-=-; Crawford and Auton 1993). Randomly-generated satisfiable formulas of this size are regularly solved by stochastic search algorithms such as GSAT, but they are unable to prove unsatisfiability; and n... |

216 |
Many hard examples for resolution
- Chvátal, Szemerédi
- 1988
(Show Context)
Citation Context ...ring and value selection, all in order to the reduce size of the tree. However, there are known fundamental limitations on the size of the shortest resolution proofs for certain problems (Haken 1985; =-=Chvatal and Szemeredi 1988). For exa-=-mple, "pigeon hole" problems (showing that n pigeons cannot fit in n \Gamma 1 holes) are intuitively easy, but shortest resolution refutation proofs are of exponential length. Shorter proofs... |

200 | Experimental results on the cross-over point in satisfiability problems - Crawford, Auton - 1993 |

116 | Finding hard instances of the satisfiability problem: A survey - Cook, Mitchell - 1997 |

57 | Noise strategies for local search - Selman, Kautz, et al. - 1994 |

51 |
Resolution vs. cutting plane solution of inference problems: Some computational experience
- Hooker
- 1988
(Show Context)
Citation Context ...satisfiability testing. Our next challenge is the use of integer programming techniques in solving SAT problems. It is straightforward to translate SAT problems into 0-1 integer programming problems (=-=Hooker 1988-=-), and thus it has been argued that integer programming techniques should be useful for propositional reasoning. In fact, however, this has not been shown to be the case. For example, one of the main ... |

41 | Eficient Generation of Test Patterns Using Boolean Satisfiabiliy
- Larrabee
- 1990
(Show Context)
Citation Context ... and Furst 1995; Kautz and Selman 1996), problems in finite algebra (Fujita et al. 1993), verification of hardware and software, scheduling (Crawford and Baker 1994), circuit synthesis and diagnosis (=-=Larrabee 1992), and man-=-y other domains. Experience has shown that different encodings of the same problem can have vastly different computational properties. For example, in planning, "causal" encodings appear to ... |

40 | Boosting complete techniques thanks to local search methods. Annals of mathematics and artificial intelligence - Mazure, Saïs, et al. - 1998 |

13 |
Cliques, coloring, and satisfiability
- Johnson, Trick, et al.
- 1996
(Show Context)
Citation Context ...al Joint Conference on Artificial Intelligence. Progress has been spurred by the interaction of researchers in AI, operations research, and theory, in making available benchmark problems (DIMACS, see =-=Trick and Johnson 1996-=-), holding joint workshops (Ginsberg 1995), and sharing algorithms and code. There is a growing consensus, however, that certain key technical challenges must be addressed in order to continue to incr... |

7 |
Aspects probabilistes et algorithmiques du problème de satisfaisabilité
- Boufkhad
- 1996
(Show Context)
Citation Context ...parallel. But is there a more powerful way of combining the two? Recently there has been some intriguing work on using local search to implement the variable ordering heuristic for systematic search (=-=Boufkhad 1996-=-; Mazure et al. 1996). These methods and other ways of combining systematic and stochastic search need to be further developed and compared with previous approaches on a range of benchmark problems. C... |

7 | Automatic Generation of Some Results - Fujita, Slaney, et al. - 1993 |

2 | 21--27. (Ext. version in Artif. Intel - Crawford, Baker - 1993 |

1 | On the complexity fo extending ground resolution with symmetry rules - Tour, T, et al. - 1995 |

1 |
Experimental Analysis of Algorithms: The
- Johnson
- 1996
(Show Context)
Citation Context ...onference on Artificial Intelligence. Progress has been spurred by the interaction of researchers in AI, operations research, and theory, in making available benchmark problems (DIMACS, see Trick and =-=Johnson 1996-=-), holding joint workshops (Ginsberg 1995), and sharing algorithms and code. There is a growing consensus, however, that certain key technical challenges must be addressed in order to continue to incr... |