Browse
Publications
Preprints
About
About UCL Open: Env.
Aims and Scope
Editorial Board
Indexing
APCs
How to cite
Publishing policies
Editorial policy
Peer review policy
Equality, Diversity & Inclusion
About UCL Press
Contact us
For authors
Information for authors
How it works
Benefits of publishing with us
Submit
How to submit
Preparing your manuscript
Article types
Open Data
ORCID
APCs
Contributor agreement
For reviewers
Information for reviewers
Review process
How to peer review
Peer review policy
My ScienceOpen
Sign in
Register
Dashboard
Search
Browse
Publications
Preprints
About
About UCL Open: Env.
Aims and Scope
Editorial Board
Indexing
APCs
How to cite
Publishing policies
Editorial policy
Peer review policy
Equality, Diversity & Inclusion
About UCL Press
Contact us
For authors
Information for authors
How it works
Benefits of publishing with us
Submit
How to submit
Preparing your manuscript
Article types
Open Data
ORCID
APCs
Contributor agreement
For reviewers
Information for reviewers
Review process
How to peer review
Peer review policy
My ScienceOpen
Sign in
Register
Dashboard
Search
21
views
23
references
Top references
cited by
8
Cite as...
0 reviews
Review
0
comments
Comment
0
recommends
+1
Recommend
0
collections
Add to
0
shares
Share
Twitter
Sina Weibo
Facebook
Email
5,462
similar
All similar
Record
: found
Abstract
: not found
Book Chapter
: not found
Theory and Applications of Satisfiability Testing - SAT 2011
Empirical Study of the Anatomy of Modern Sat Solvers
other
Author(s):
Hadi Katebi
,
Karem A. Sakallah
,
João P. Marques-Silva
Publication date
(Print):
2011
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
The Behavioral Economics of Music: A Framework for the Study of Music Listening, Evaluation, and Choice Behavior
Most cited references
23
Record
: found
Abstract
: not found
Article
: not found
A machine program for theorem-proving
Martin Davis
,
George Logemann
,
Donald Loveland
(1962)
0
comments
Cited
304
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
Record
: found
Abstract
: not found
Article
: not found
GRASP: a search algorithm for propositional satisfiability
J.P. Marques-Silva
,
K.A. Sakallah
(1999)
0
comments
Cited
125
times
– based on
0
reviews
Review now
Bookmark
All references
Author and book information
Book Chapter
Publication date (Print):
2011
Pages
: 343-356
DOI:
10.1007/978-3-642-21581-0_27
SO-VID:
00d73ea8-3fb9-4a90-9fb4-a7580f7e0d53
History
Data availability:
Comments
Comment on this book
Sign in to comment
Book chapters
pp. 174
Faster Extraction of High-Level Minimal Unsatisfiable Cores
pp. 371
The Order Encoding: From Tractable CSP to Tractable SAT
pp. 120
Enumerating All Solutions of a Boolean CSP by Non-decreasing Weight
pp. 159
On Improving MUS Extraction Algorithms
pp. 230
Abstraction-Based Algorithm for 2QBF
pp. 343
Empirical Study of the Anatomy of Modern Sat Solvers
Similar content
5,462
qRobot: A Quantum computing approach in mobile robot order picking and batching problem solver optimization
Authors:
Parfait Atchade-Adelomou
,
Guillermo Alonso-Linaje
,
Jordi Albo-Canals
…
ScoreWrite: A guide to preparing for the new SAT essay
Authors:
Optimization of multigrid based elliptic solver for large scale simulations in the FLASH code
Authors:
Christopher Daley
,
Marcos Vanella
,
Anshu Dubey
…
See all similar
Cited by
8
Machine Learning-Based Restart Policy for CDCL SAT Solvers
Authors:
Jia Hui Liang
,
Chanseok Oh
,
Minu Mathew
…
A SAT Approach to Clique-Width
Authors:
Stefan Szeider
,
Marijn Heule
A Time Leap Challenge for SAT-Solving
Authors:
Johannes Fichte
,
Markus Hecher
,
Stefan Szeider
See all cited by