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
23
views
0
references
Top references
cited by
2
Cite as...
0 reviews
Review
0
comments
Comment
0
recommends
+1
Recommend
0
collections
Add to
0
shares
Share
Twitter
Sina Weibo
Facebook
Email
4,378
similar
All similar
Record
: found
Abstract
: not found
Book
: not found
Theory and Applications of Satisfiability Testing
other
Editor(s):
Holger H. Hoos
,
David G. Mitchell
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
Applications of SAXS
Author and book information
Book
ISBN (Print):
978-3-540-27829-0
ISBN (Electronic):
978-3-540-31580-3
Publication date (Print):
2005
DOI:
10.1007/11527695
SO-VID:
0b9f36c9-dcf6-41c4-a61d-a7775abe3ab1
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
4,378
Are couples more satisfied when they match in sexual desire?: New insights from response surface analyses
Authors:
J.J. KIM
,
A. Muise
,
M. Barranti
…
Fast sampling of satisfying assignments from random \(k\)-SAT
Authors:
Andreas Galanis
,
Leslie Ann Goldberg
,
Heng Guo
…
Chapter 2 Satisfiability Solvers
Authors:
Carla Gomes
,
Henry Kautz
,
Ashish Sabharwal
…
See all similar
Cited by
2
MiniMaxSat: A New Weighted Max-SAT Solver
Authors:
Federico Heras
,
Javier Larrosa
,
Albert Oliveras
Variable Dependency in Local Search: Prevention Is Better Than Cure
Authors:
Steven Prestwich
See all cited by