James M. Crawford, Larry D. Auton  Home/Search
Context Related
| uoregon.edu/crawford/papers...aaai93.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: uoregon.edu/crawford/papers/ (more) Homepages: J.Crawford |
Rate this article:      (best)Comment on this article |
Abstract: Determining whether a propositional theory is satisfiable is a prototypical example of an NPcomplete problem. Further, a large number of problems that occur in knowledge representation, learning, planning, and other areas of AI are essentially satisfiability problems. This paper reports on a series of experiments to determine the location of the crossover point --- the point at which half the randomly generated propositional theories with a given number of variables and given number of clauses... (Update)
Cited by: More
An Experimental Study on the Complexity of Left-Deep.. - König-Ries, Helmer.. (1995) (Correct)
Experimental Results on the Satisfiable Core in Random 3SAT - Zeng, McIlraith (Correct)
Probing-Based Preprocessing Techniques for Propositional.. - Lynce, Marques-Silva (Correct)
Similar documents (at the sentence level):
8.3%: Experimental Results on the Crossover Point in Random 3sat - Crawford, Auton (1996) (Correct)
Active bibliography (related documents): More All
0.5: Mirlog:a Logic For Multimedia Informa Tion Retrieva - Carlo Meghini Fabrizio (1998) (Correct)
0.0: Clustering at the Phase Transition - Parkes (1997) (Correct)
0.0: Exploiting a Theory of Phase Transitions in.. - Pennock, Stout (1996) (Correct)
Similar documents based on text: More All
0.1: Solving Satisfiability Problems Using a Combination of.. - Crawford (1996) (Correct)
0.1: Experimental Results on the Application of Satisfiability.. - Crawford, Baker (1994) (Correct)
0.1: A Non-Deterministic Semantics for Tractable Inference - Crawford, Etherington (1998) (Correct)
Related documents from co-citation: More All
53: Hard and easy distributions of sat problems - Mitchell, Selman et al. - 1992
49: A New Method for Solving Hard Satisfiability Problems - Selman, Levesque et al. - 1992
40: A computing procedure for quantification theory (context) - Davis, Putnam - 1960
BibTeX entry: (Update)
Crawford, J., & Auton, L. (1993). Experimental results on the crossover point in satisfiability problems. Proceedings of the 11th National Conference on Artificial Intelligence, 21--27. http://citeseer.ist.psu.edu/crawford93experimental.html More
@inproceedings{ crawford93experimental,
author = "James M. Crawford and L. D. Anton",
title = "Experimental Results on the Crossover Point in Satisfiability Problems",
booktitle = "Proceedings of the Eleventh National Conference on Artificial Intelligence",
publisher = "AAAI Press",
address = "Menlo Park, California",
editor = "Richard Fikes and Wendy Lehnert",
pages = "21--27",
year = "1993",
url = "citeseer.ist.psu.edu/crawford93experimental.html" }
Citations (may not include all citations):572 Computers and Intractability (context) - Garey, Johnson - 1979
329 Where the really hard problems are - Cheeseman, Kanefsky et al. - 1991
191 Linear-time algorithms for testing the satisfiability of pro.. (context) - Dowling, Gallier - 1984
135 Solving large-scale constraint-satisfaction and scheduling p.. (context) - Minton, Johnson et al. - 1990
72 Many Hard Examples for Resolution (context) - Chv'atal, Szemer'edi - 1988
51 the Satisfiability and Maximum Satisfiability of Random 3-CN.. (context) - Broder, Frieze et al. - 1993
18 and Levesque (context) - Mitchell, Selman - 1992
2 and Loveland (context) - Davis, Logemann - 1962
1 First Order Logic (context) - pp, Smullyan - 1968
1 Pushing the edge of the satisfiability envelope (context) - Crawford, Auton - 1993
1 A new method for solving hard satisfiability problems (context) - easy, SAT et al. - 1992
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cirl.uoregon.edu/crawford/papers/): More
Negation and Proof by Contradiction in Access-Limited Logic - Crawford Kuipers (1991) (Correct)
An Approach to Resource Constrained Project Scheduling - Crawford (1996) (Correct)
Observations on Observations in Action Theories (Extended.. - Crawford, al. (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