Ten challenges in propositional reasoning and search
Bart Selman, Henry Kautz, David McAllester · 1997
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 Introduction Propositional reasoning is a core problem in many areas of artificial intelligence. In recent years this area has seen growing interest and activity, due to advances in our ability to solve large problem instances, including ones that encode real-world problems such as planning and diagnosis. Contributions to the area of propositional deduction and satisfiability testing have come from research communities in artificial intelligence, operations research, and theoretical computer science. A set of key technical challenges have begun to emerge from ...