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
44
views
0
references
Top references
cited by
1
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,745
similar
All similar
Record
: found
Abstract
: not found
Book
: not found
Theory and Applications of Satisfiability Testing - SAT 2006
other
Editor(s):
Armin Biere
,
Carla P. Gomes
Publication date
(Print):
2006
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-37206-6
ISBN (Electronic):
978-3-540-37207-3
Publication date (Print):
2006
DOI:
10.1007/11814948
SO-VID:
6aecadf4-e2e2-4648-aba1-6de83c7aead3
History
Data availability:
Comments
Comment on this book
Sign in to comment
Book chapters
pp. 22
Categorisation of Clauses in Conjunctive Normal Forms: Minimally Unsatisfiable Sub-clause-sets and the Lean Kernel
pp. 396
Solving #SAT Using Vertex Covers
pp. 102
Applications of SAT Solvers to Cryptanalysis of Hash Functions
pp. 156
On SAT Modulo Theories and Optimization Problems
pp. 170
Fast and Flexible Difference Constraint Propagation for DPLL(T)
pp. 252
On Solving the Partial MAX-SAT Problem
pp. 382
QBF Modeling: Exploiting Player Symmetry for Simplicity and Efficiency
Similar content
4,745
Super Strong ETH is False for Random \(k\)-SAT
Authors:
Nikhil Vyas
SAT-LB002 Steroid Metabolome Analysis Reveals 11-Ketotestosterone as the Most Abundant Androgen in Castration-Resistant Prostate Cancer Patients on Second-Line Therapies
Authors:
Gido Snaterse
,
Lisanne van Dessel
,
Angela Taylor
…
Koepke Machines and Satisfiability for Infinitary Propositional Languages
Authors:
Merlin Carl
,
Benedikt Löwe
,
Benjamin G. Rin
See all similar
Cited by
1
Enhancing Unsatisfiable Cores for LTL with Information on Temporal Relevance
Authors:
Viktor Schuppan
See all cited by