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
41
views
0
references
Top references
cited by
0
Cite as...
0 reviews
Review
0
comments
Comment
0
recommends
+1
Recommend
0
collections
Add to
0
shares
Share
Twitter
Sina Weibo
Facebook
Email
3,185
similar
All similar
Record
: found
Abstract
: not found
Book
: not found
Theory and Applications of Satisfiability Testing – SAT 2010
other
Editor(s):
Ofer Strichman
,
Stefan Szeider
Publication date
(Print):
2010
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
Cardiovascular Innovations and Applications
Author and book information
Book
ISBN (Print):
978-3-642-14185-0
ISBN (Electronic):
978-3-642-14186-7
Publication date (Print):
2010
DOI:
10.1007/978-3-642-14186-7
SO-VID:
c5f73d99-2e68-4320-b238-93b22f90246b
License:
http://www.springer.com/tdm
History
Data availability:
Comments
Comment on this book
Sign in to comment
Book chapters
pp. 388
Zero-One Designs Produce Small Hard SAT Instances
pp. 44
Automated Testing and Debugging of SAT and QBF Solvers
pp. 85
sQueezeBF: An Effective Preprocessor for QBFs Based on Equivalence Reasoning
pp. 113
Symmetry and Satisfiability: An Update
pp. 128
A Non-prenex, Non-clausal QBF Solver with Game-State Learning
pp. 158
Integrating Dependency Schemes in Search-Based QBF Solvers
pp. 181
Improving Unsatisfiability-Based Algorithms for Boolean Optimization
pp. 326
Minimising Deterministic Büchi Automata Precisely Using SAT Solving
Similar content
3,185
Satisfiability for MTL and TPTL over Non-monotonic Data Words
Authors:
Claudia Carapelle
,
S Feng
,
O. Gil
…
From Total Assignment Enumeration to Modern SAT Solver
Authors:
Alexander Nadel
,
Nachum Dershowitz
\(\mathsf {SC}^\mathsf{2} \) : Satisfiability Checking Meets Symbolic Computation
Authors:
Erika Ábrahám
,
John Abbott
,
Bernd Becker
…
See all similar