Robert Schrag, James M. Crawford  Home/Search
Context Related
| uoregon.edu/crawford/pa...implicates.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) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: It has been observed previously that Random 3SAT exhibits a phase transition at a critical ratio of constraints to variables, where the average frequency of satisfiability falls abruptly from near 1 to near 0. In this paper we look beyond satisfiability to implicates and prime implicates of non-zero length and show experimentally that, for any given length, these exhibit their own phase transitions. All of these phase transitions appear to share the same critical point as the well-known... (Update)
Context of citations to this paper: More
.... exact compilation it has been observed that the compiled knowledge base often occupies space exponential in the size of the initial source [19]. This undesirable effect has lead several researchers to explore the possibility of compiling the knowledge base into a family of...
.... Another area of research is to use the results obtained for SAT algorithms on related domains: computation of implicant cover[SC96] prime implicants implicates [CC96] Quantified Boolean Formulas[CGS98, Rin99] DISTANCE SAT[BM99] etc. Our work follows this idea: we...
Cited by: More
Experimental Results on the Satisfiable Core in Random 3SAT - Zeng, McIlraith (Correct)
Distributed Reasoning in a Peer-to-Peer Setting - Adjiman Chatalic Goasdou (Correct)
ADS: a unified computational framework for some consistency and.. - Le Berre (Correct)
Similar documents (at the sentence level):
61.1%: Implicates and Prime Implicates in Random 3SAT - Schrag, Crawford (1995) (Correct)
Active bibliography (related documents): More All
0.3: Compilation for Critically Constrained Knowledge Bases - Schrag, Miranker (1996) (Correct)
0.2: Some Applications Of Non Clausal Deduction - Ramesh (1995) (Correct)
0.1: Abstraction and the CSP Phase Transition Boundary - Schrag, Miranker (1995) (Correct)
Similar documents based on text: More All
0.6: Clustering at the Phase Transition - Parkes (1997) (Correct)
0.4: A Non-Deterministic Semantics for Tractable Inference - Crawford, Etherington (1998) (Correct)
0.4: Using CSP Look-Back Techniques to Solve Real-World SAT Instances - Bayardo, Schrag (1997) (Correct)
Related documents from co-citation: More All
8: Fixed-parameter tractability and Completeness I: Basic Results - Downey, Fellows - 1995
6: Knowledge compilation and theory approximation - Selman, Kautz - 1996
4: Is intractability of non-monotonic reasoning a real drawback - Cadoli, Donini et al. - 1996
BibTeX entry: (Update)
R. Schrag and J. Crawford. Implicates and prime implicates in random 3SAT. Artificial Intelligence Journal, 81:199--222, 1996. http://citeseer.ist.psu.edu/article/schrag95implicate.html More
@article{ schrag96implicates,
author = "Robert Schrag and James M. Crawford",
title = "Implicates and Prime Implicates in Random 3-{SAT}",
journal = "Artificial Intelligence",
volume = "81",
number = "1-2",
pages = "199-222",
year = "1996",
url = "citeseer.ist.psu.edu/article/schrag95implicate.html" }
Citations (may not include all citations):320 Hard and easy distributions of SAT problems - David, Bart et al. - 1992 DBLP
211 Enhancement schemes for constraint processing: Backjumping (context) - Rina - 1990
186 Constraint satisfaction (context) - Alan - 1992 ACM
166 Synthesizing constraint expressions (context) - Eugene - 1978 ACM DBLP
134 Experimental results on the crossover point in satisfiabilit.. - James, Larry - 1993 DBLP
132 An assumption-based TMS (context) - Johan - 1987 ACM DBLP
107 Foundations of assumption-based truth maintenance systems: P.. (context) - Raymond, Johan - 1987 DBLP
97 Knowledge compilation using Horn approximations - Bart, Henry - 1991 DBLP
81 Critical behavior in the satisfiability of random Boolean ex.. - Bart, Scott - 1996
81 Critical behavior in the satisfiability of random Boolean ex.. - Scott, Bart - 1994
72 Many hard examples for resolution (context) - Vasek, Endre - 1988 ACM DBLP
66 Search through systematic set enumeration (context) - Ron - 1992 DBLP
62 The hardest constraint problems: A double phase transition (context) - Tad, Colin - 1994
36 Intelligent Backtracking on Constraint Satisfaction Problems.. - Andrew - 1995
27 The satisfiability constraint gap - Ian, Toby - 1996 DBLP
23 Experimental results on the crossover point in Random 3SAT (context) - James, Larry - 1996
19 The hardest random SAT problems - Ian, Walsh - 1994 ACM DBLP
17 the number of prime implicants (context) - Ashok, George - 1978
15 An improved incremental algorithm for generating prime impli.. (context) - Johan - 1992 DBLP
10 Generalization of consensus theory and application to the mi.. (context) - Pierre - 1967
10 An empirical evaluation of knowledge compilation by theory a.. (context) - Henry, Bart - 1994 ACM DBLP
6 Exploiting the deep structure of constraint satisfaction pro.. (context) - Colin, Tad - 1994
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
Hard and Easy Distributions of SAT Problems - Mitchell, Selman, Levesque (1992) (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