Ten Challenges in Propositional Reasoning and Search
暂无分享,去创建一个
[1] Hilary Putnam,et al. A Computing Procedure for Quantification Theory , 1960, JACM.
[2] Armin Haken,et al. The Intractability of Resolution , 1985, Theor. Comput. Sci..
[3] Endre Szemerédi,et al. Many hard examples for resolution , 1988, JACM.
[4] T. Larrabee. Efficient generation of test patterns using Boolean satisfiability , 1990 .
[5] Hector J. Levesque,et al. A New Method for Solving Hard Satisfiability Problems , 1992, AAAI.
[6] Bart Selman,et al. Planning as Satisfiability , 1992, ECAI.
[7] Hector J. Levesque,et al. Hard and Easy Distributions of SAT Problems , 1992, AAAI.
[8] Bart Selman,et al. Noise Strategies for Improving Local Search , 1994, AAAI.
[9] James M. Crawford,et al. Experimental Results on the Application of Satisfiability Algorithms to Scheduling Problems , 1994, AAAI.
[10] Stéphane Demri,et al. On the Complexity of Extending Ground Resolution with Symmetry Rules , 1995, IJCAI.
[11] Avrim Blum,et al. Fast Planning Through Planning Graph Analysis , 1995, IJCAI.
[12] Bart Selman,et al. Pushing the Envelope: Planning, Propositional Logic and Stochastic Search , 1996, AAAI/IAAI, Vol. 2.
[13] David S. Johnson,et al. Cliques, Coloring, and Satisfiability , 1996 .
[14] James M. Crawford,et al. Experimental Results on the Crossover Point in Random 3-SAT , 1996, Artif. Intell..
[15] P. Pandurang Nayak,et al. A Model-Based Approach to Reactive Self-Configuring Systems , 1996, AAAI/IAAI, Vol. 2.
[16] David G. Mitchell,et al. Finding hard instances of the satisfiability problem: A survey , 1996, Satisfiability Problem: Theory and Applications.