Home
Random
Nearby
Log in
Settings
Donate
About Wikidata
Disclaimers
Search
(Q56039664)
Watch
English
Chapter 2 Satisfiability Solvers
No description defined
In more languages
default for all languages
No label defined
No description defined
edit
Statements
instance of
scholarly article
0 references
title
Chapter 2 Satisfiability Solvers
(English)
0 references
author
Bart Selman
series ordinal
4
object named as
Bart Selman
0 references
Carla Gomes
series ordinal
1
object named as
Carla P. Gomes
0 references
Henry Kautz
series ordinal
2
object named as
Henry Kautz
0 references
author name string
Ashish Sabharwal
series ordinal
3
0 references
publication date
2008
0 references
page(s)
89-134
0 references
cites work
Rigorous location of phase transitions in hard optimization problems.
1 reference
stated in
Crossref
reference URL
https://api.crossref.org/works/10.1016%2FS1574-6526%2807%2903002-7
retrieved
7 January 2021
based on heuristic
inferred from DOI database lookup
On the complexity of unsatisfiability proofs for random k-CNF formulas
1 reference
stated in
Crossref
reference URL
https://api.crossref.org/works/10.1016%2FS1574-6526%2807%2903002-7
retrieved
7 January 2021
based on heuristic
inferred from DOI database lookup
Symbolic model checking using SAT procedures instead of BDDs
1 reference
stated in
Crossref
reference URL
https://api.crossref.org/works/10.1016%2FS1574-6526%2807%2903002-7
retrieved
7 January 2021
based on heuristic
inferred from DOI database lookup
Symbolic Model Checking without BDDs
1 reference
stated in
Crossref
reference URL
https://api.crossref.org/works/10.1016%2FS1574-6526%2807%2903002-7
retrieved
7 January 2021
based on heuristic
inferred from DOI database lookup
The scaling window of the 2-SAT transition
1 reference
stated in
Crossref
reference URL
https://api.crossref.org/works/10.1016%2FS1574-6526%2807%2903002-7
retrieved
7 January 2021
based on heuristic
inferred from DOI database lookup
Optimality of size-width tradeoffs for resolution
1 reference
stated in
Crossref
reference URL
https://api.crossref.org/works/10.1016%2FS1574-6526%2807%2903002-7
retrieved
7 January 2021
based on heuristic
inferred from DOI database lookup
An Overview of the KL-ONE Knowledge Representation System*
1 reference
stated in
Crossref
reference URL
https://api.crossref.org/works/10.1016%2FS1574-6526%2807%2903002-7
retrieved
7 January 2021
based on heuristic
inferred from DOI database lookup
Mick gets some (the odds are on his side) (satisfiability)
1 reference
stated in
Crossref
reference URL
https://api.crossref.org/works/10.1016%2FS1574-6526%2807%2903002-7
retrieved
7 January 2021
based on heuristic
inferred from DOI database lookup
Many hard examples for resolution
1 reference
stated in
Crossref
reference URL
https://api.crossref.org/works/10.1016%2FS1574-6526%2807%2903002-7
retrieved
7 January 2021
based on heuristic
inferred from DOI database lookup
The complexity of theorem-proving procedures
1 reference
stated in
Crossref
reference URL
https://api.crossref.org/works/10.1016%2FS1574-6526%2807%2903002-7
retrieved
7 January 2021
based on heuristic
inferred from DOI database lookup
A machine program for theorem-proving
1 reference
stated in
Crossref
reference URL
https://api.crossref.org/works/10.1016%2FS1574-6526%2807%2903002-7
retrieved
7 January 2021
based on heuristic
inferred from DOI database lookup
Sharp thresholds of graph properties, and the k-sat problem
1 reference
stated in
Crossref
reference URL
https://api.crossref.org/works/10.1016%2FS1574-6526%2807%2903002-7
retrieved
7 January 2021
based on heuristic
inferred from DOI database lookup
Analysis of Two Simple Heuristics on a Random Instance ofk-sat
1 reference
stated in
Crossref
reference URL
https://api.crossref.org/works/10.1016%2FS1574-6526%2807%2903002-7
retrieved
7 January 2021
based on heuristic
inferred from DOI database lookup
Q57710972
1 reference
stated in
Crossref
reference URL
https://api.crossref.org/works/10.1016%2FS1574-6526%2807%2903002-7
retrieved
7 January 2021
based on heuristic
inferred from DOI database lookup
Computational science: can get satisfaction
1 reference
stated in
Crossref
reference URL
https://api.crossref.org/works/10.1016%2FS1574-6526%2807%2903002-7
retrieved
7 January 2021
based on heuristic
inferred from DOI database lookup
The intractability of resolution
1 reference
stated in
Crossref
reference URL
https://api.crossref.org/works/10.1016%2FS1574-6526%2807%2903002-7
retrieved
7 January 2021
based on heuristic
inferred from DOI database lookup
Optimization by Simulated Annealing
1 reference
stated in
Crossref
reference URL
https://api.crossref.org/works/10.1016%2FS1574-6526%2807%2903002-7
retrieved
7 January 2021
based on heuristic
inferred from DOI database lookup
Critical behavior in the satisfiability of random boolean expressions.
1 reference
stated in
Crossref
reference URL
https://api.crossref.org/works/10.1016%2FS1574-6526%2807%2903002-7
retrieved
7 January 2021
based on heuristic
inferred from DOI database lookup
Resolution for Quantified Boolean Formulas
1 reference
stated in
Crossref
reference URL
https://api.crossref.org/works/10.1016%2FS1574-6526%2807%2903002-7
retrieved
7 January 2021
based on heuristic
inferred from DOI database lookup
An Effective Heuristic Algorithm for the Traveling-Salesman Problem
1 reference
stated in
Crossref
reference URL
https://api.crossref.org/works/10.1016%2FS1574-6526%2807%2903002-7
retrieved
7 January 2021
based on heuristic
inferred from DOI database lookup
Analytic and algorithmic solution of random satisfiability problems.
1 reference
stated in
Crossref
reference URL
https://api.crossref.org/works/10.1016%2FS1574-6526%2807%2903002-7
retrieved
7 January 2021
based on heuristic
inferred from DOI database lookup
Random K-satisfiability problem: from an analytic solution to an efficient algorithm.
1 reference
stated in
Crossref
reference URL
https://api.crossref.org/works/10.1016%2FS1574-6526%2807%2903002-7
retrieved
7 January 2021
based on heuristic
inferred from DOI database lookup
Determining computational complexity from characteristic ‘phase transitions’
1 reference
stated in
Crossref
reference URL
https://api.crossref.org/works/10.1016%2FS1574-6526%2807%2903002-7
retrieved
7 January 2021
based on heuristic
inferred from DOI database lookup
Chaff
1 reference
stated in
Crossref
reference URL
https://api.crossref.org/works/10.1016%2FS1574-6526%2807%2903002-7
retrieved
7 January 2021
based on heuristic
inferred from DOI database lookup
Combinational test generation using satisfiability
1 reference
stated in
Crossref
reference URL
https://api.crossref.org/works/10.1016%2FS1574-6526%2807%2903002-7
retrieved
7 January 2021
based on heuristic
inferred from DOI database lookup
NP is as easy as detecting unique solutions
1 reference
stated in
Crossref
reference URL
https://api.crossref.org/works/10.1016%2FS1574-6526%2807%2903002-7
retrieved
7 January 2021
based on heuristic
inferred from DOI database lookup
Identifiers
DOI
10.1016/S1574-6526(07)03002-7
0 references
DBLP publication ID
reference/fai/GomesKSS08
1 reference
stated in
DBLP Dataset 2021-01-02
retrieved
28 January 2021
Sitelinks
Wikipedia
(0 entries)
edit
Wikibooks
(0 entries)
edit
Wikinews
(0 entries)
edit
Wikiquote
(0 entries)
edit
Wikisource
(0 entries)
edit
Wikiversity
(0 entries)
edit
Wikivoyage
(0 entries)
edit
Wiktionary
(0 entries)
edit
Multilingual sites
(0 entries)
edit