home *** CD-ROM | disk | FTP | other *** search
- Path: sparky!uunet!zaphod.mps.ohio-state.edu!pacific.mps.ohio-state.edu!linac!att!att!ulysses!allegra!selman
- From: selman@allegra.att.com (Bart Selman)
- Newsgroups: comp.theory
- Subject: Re: SAT
- Message-ID: <SELMAN.92Sep4154655@hunny.tempo.nj.att.com>
- Date: 4 Sep 92 19:46:55 GMT
- References: <1992Sep1.183853.5844@news.cs.indiana.edu>
- Sender: netnews@ulysses.att.com
- Reply-To: selman@allegra.att.com
- Organization: AT&T Bell Laboratories
- Lines: 31
- In-reply-to: pwp@moose.cs.indiana.edu's message of 1 Sep 92 18:38:36 GMT
-
- Following up on Purdom's question about satisfiability
- algorithms, below are two other references that might be of
- interest. The first paper describes how to generate
- random formulas that are very hard for the Davis-Putnam
- procedure, and the second paper describes how a local search
- method substantially outperforms the Davis-Putnam procedure on such
- formulas. (I briefly reported on this work on the net before.)
-
- Bart Selman
- AT&T Bell Laboratories
-
- =====================================================
- Hard and Easy Distributions of SAT Problems
- David Mitchell, Bart Selman, and Hector Levesque
- Proc. of the Tenth National Conference on Artificial Intelligence
- (AAAI-92), San Jose, CA, July 1992, 459--465.
-
- A New Method for Solving Hard Satisfiability Problems
- Bart Selman, Hector Levesque, and David Mitchell,
- Proc. of the Tenth National Conference on Artificial
- Intelligence (AAAI-92), San Jose, CA, July 1992, 440--446.
-
- Papers are available via anonymous ftp:
- ftp research.att.com
- login: anonymous
- password: [optional]
- cd dist/ai
- get hsat.ps.Z % compressed postcript file
- get gsat.ps.Z %
- Let me (selman@research.att.com) know if you encounter any
- problems in printing the postscript file(s).
-