David Mitchell, Bart Selman, Hector Levesque  Home/Search
Context Related
Links: DBLP | cs.utoronto.ca/~mitchell...ai92hsat.ps att.com/~kautz/papersftp/hsat.ps belllabs.com/orgs/ssr/people...hsat.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: sinera.iiia.csi...psci9703biblio (more) From: belllabs.com/orgs/ssr/p...README (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We report results from large-scale experiments in satisfiability testing. As has been observed by others, testing the satisfiability of random formulas often appears surprisingly easy. Here we show that by using the right distribution of instances, and appropriate parameter values, it is possible to generate random formulas that are hard, that is, for which satisfiability testing is quite difficult. Our results provide a benchmark for the evaluation of satisfiability-testing procedures.... (Update)
Cited by: More
An Experimental Study on the Complexity of Left-Deep.. - König-Ries, Helmer.. (1995) (Correct)
Towards Improving the Utilisation of University.. - Beyrouthy, Burke.. (2006) (Correct)
Learning-Assisted Multi-Step Planning - Kris Hauser Tim (2005) (Correct)
Similar documents (at the sentence level):
46.7%: Generating Hard Satisfiability Problems - Selman, Mitchell, Levesque (1995) (Correct)
Active bibliography (related documents): More All
0.7: A New Method for Solving Hard Satisfiability Problems - Selman, Levesque, Mitchell (1992) (Correct)
0.3: Phase Transitions and Stochastic Local Search in k-Term.. - Rueckert, Kramer, De.. (2002) (Correct)
0.2: A two-phase exact algorithm for MAX-SAT and weighted MAX-SAT.. - Borchers, Furman (1997) (Correct)
Similar documents based on text: More All
0.2: On the Relation between SAT and BDDs for Equivalence Checking - Reda, Drechsler, Orailoglu (2002) (Correct)
0.2: On the accuracy and running time of GSAT - East, Truszczynski (1999) (Correct)
0.2: On the Run-time Behaviour of Stochastic Local Search Algorithms.. - Hoos (1999) (Correct)
Related documents from co-citation: More All
47: Where the really hard problems are - Cheeseman, Kanefsky et al. - 1991
45: A New Method for Solving Hard Satisfiability Problems - Selman, Levesque et al. - 1992
34: A computing procedure for quantification theory (context) - Davis, Putnam - 1960
BibTeX entry: (Update)
D. Mitchell, B. Selman, and H. Levesque. Hard and easy distributions of sat problems. In Proc. 10-th National Conf. on Artificial Intelligence (AAAI-92), pages 459--465, San Jose, CA, July 12-17 1992. http://citeseer.ist.psu.edu/mitchell92hard.html More
@inproceedings{ mitchell92hard,
author = "David G. Mitchell and Bart Selman and Hector J. Levesque",
title = "Hard and Easy Distributions for {SAT} Problems",
booktitle = "Proceedings of the Tenth National Conference on Artificial Intelligence",
publisher = "AAAI Press",
address = "Menlo Park, California",
editor = "Paul Rosenbloom and Peter Szolovits",
pages = "459--465",
year = "1992",
url = "citeseer.ist.psu.edu/mitchell92hard.html" }
Citations (may not include all citations):572 Computers and Intractability (context) - Garey, Johnson - 1979 ACM
534 The complexity of theorem-proving procedures (context) - Cook - 1971 ACM DBLP
459 A computing procedure for quantification theory (context) - Davis, Putnam - 1960 ACM DBLP
416 A New Method for Solving Hard Satisfiability Problems - Selman, Levesque et al. - 1992
329 Where the Really Hard Problems Are - Peter, Bob et al. - 1991 DBLP
72 Many hard examples for resolution (context) - Chvatal, Szemeredi - 1988 ACM DBLP
65 Probabilistic analysis of the Davis Putnam procedure for sol.. (context) - Franco, Paull - 1983
53 Probabilistic Analysis of a Generalization of the Unit-Claus.. (context) - Ming-te, John - 1990
52 The intractability of resolution (context) - Haken - 1985
48 A rearrangement search strategy for determining propositiona.. - Zabih, McAllester - 1988 DBLP
43 Branch-and-cut solution of inference problems in proposition.. (context) - Hooker, Fedjki - 1989
38 Algorithms for Testing the Satisfiability of Propositional F.. (context) - Giorgio, Giampaolo - 1989 ACM DBLP
23 the complexity of regular resolution and the Davis-Putnam pr.. (context) - Zvi - 1977
9 the complexity of the satisfiability problem (context) - Goldberg - 1979
7 Probabilistic performance of a heuristic for the satisfiabil.. - Franco, Ho - 1988 ACM
6 The complexity of automated reasoning - Vellino - 1989
6 University of Toronto (context) - thesis, Philosophy - 1989
4 Resolution vs (context) - Hooker - 1988
3 and Resende (context) - Kamath, Karmarker et al. - 1990
2 Probabilistic analysis of algorithms for NP-complete problem.. (context) - Franco - 1986
1 Recently developed by Jim Crawford and Larry Auton (context) - by, Crawford et al. - 1992
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://sinera.iiia.csic.es/~ealtamir/repositorio/compsci9703-biblio.html): More
Implicates and Prime Implicates in Random 3SAT - Schrag, Crawford (1995) (Correct)
A New Method for Solving Hard Satisfiability Problems - Selman, Levesque, Mitchell (1992) (Correct)
Some Pitfalls for Experimenters with Random SAT - Mitchell, Levesque (1996) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC