Home
Publishing
DrugRxiv
Drug Repurposing
Network Medicine
About
REPO4EU
Meet the team
Drug Repurposing Research Collection
Conference
Blog
My ScienceOpen
Sign in
Register
Dashboard
Search
Home
Publishing
DrugRxiv
Drug Repurposing
Network Medicine
About
REPO4EU
Meet the team
Drug Repurposing Research Collection
Conference
My ScienceOpen
Sign in
Register
Dashboard
Search
31
views
15
references
Top references
cited by
13
Cite as...
0 reviews
Review
0
comments
Comment
0
recommends
+1
Recommend
0
collections
Add to
0
shares
Share
Twitter
Sina Weibo
Facebook
Email
1,563
similar
All similar
Record
: found
Abstract
: not found
Book Chapter
: not found
Theory and Applications of Satisfiability Testing
Zchaff2004: An Efficient SAT Solver
other
Author(s):
Yogesh S. Mahajan
,
Zhaohui Fu
,
Sharad Malik
Publication date
(Print):
2005
Publisher:
Springer Berlin Heidelberg
Read this book at
Publisher
Buy book
Review
Review book
Invite someone to review
Bookmark
Cite as...
There is no author summary for this book yet. Authors can add summaries to their books on ScienceOpen to make them more accessible to a non-specialist audience.
Related collections
ScienceOpen Research
Most cited references
15
Record
: found
Abstract
: not found
Conference Proceedings
: not found
The complexity of theorem-proving procedures
Stephen Cook
(1971)
0
comments
Cited
409
times
– based on
0
reviews
Bookmark
Record
: found
Abstract
: not found
Article
: not found
A machine program for theorem-proving
Martin Davis
,
George Logemann
,
Donald Loveland
(1962)
0
comments
Cited
305
times
– based on
0
reviews
Review now
Bookmark
Record
: found
Abstract
: not found
Article
: not found
A Computing Procedure for Quantification Theory
Martin Davis
,
Hilary Putnam
(1960)
0
comments
Cited
222
times
– based on
0
reviews
Review now
Bookmark
All references
Author and book information
Book Chapter
Publication date (Print):
2005
Pages
: 360-375
DOI:
10.1007/11527695_27
SO-VID:
3ea97e4f-dba0-4372-b634-15c0633c44b0
History
Data availability:
Comments
Comment on this book
Sign in to comment
Book chapters
pp. 1
Mapping Problems with Finite-Domain Variables to Problems with Boolean Variables
pp. 376
The Second QBF Solvers Comparative Evaluation
pp. 59
Resolve and Expand
pp. 183
Clause Form Conversions for Boolean Circuits
pp. 276
NiVER: Non-increasing Variable Elimination Resolution for Preprocessing SAT Instances
pp. 306
UBCSAT: An Implementation and Experimentation Environment for SLS Algorithms for SAT and MAX-SAT
pp. 360
Zchaff2004: An Efficient SAT Solver
Similar content
1,563
Mental subtraction in high- and lower skilled arithmetic problem solvers: verbal report versus operand-recognition paradigms.
Authors:
Michel Fayol
,
Muriel Fanget
,
Caroline Castel
…
Minimal Gain Marching Schemes: Searching for Unstable Steadystates with Unsteady Solvers
Authors:
R. de S. Teixeira
,
L. S. de B. Alves
pARMS: a parallel version of the algebraic recursive multilevel solver
Authors:
Masha Sosonkina
,
Zhongze Li
,
Yousef Saad
See all similar
Cited by
12
On the power of clause-learning SAT solvers as resolution engines
Authors:
Knot Pipatsrisawat
,
Adnan Darwiche
Automatic Model Generation Strategies for Model Transformation Testing
Authors:
Sagar Sen
,
Benoit Baudry
,
Jean-Marie Mottu
SATzilla-07: The Design and Analysis of an Algorithm Portfolio for SAT
Authors:
Lin Xu
,
Frank Hutter
,
Holger Hoos
…
See all cited by