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
16
views
20
references
Top references
cited by
10
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,939
similar
All similar
Record
: found
Abstract
: not found
Book Chapter
: not found
Theory and Applications of Satisfiability Testing – SAT 2010
Integrating Dependency Schemes in Search-Based QBF Solvers
other
Author(s):
Florian Lonsing
,
Armin Biere
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
Value-based Healthcare
Most cited references
20
Record
: found
Abstract
: not found
Article
: not found
Resolution for Quantified Boolean Formulas
M. Karpinski
,
H.K. Buning
,
A. Flogel
(1995)
0
comments
Cited
15
times
– based on
0
reviews
Review now
Bookmark
Record
: found
Abstract
: not found
Book Chapter
: not found
Resolve and Expand
Armin Biere
(2005)
0
comments
Cited
11
times
– based on
0
reviews
Bookmark
Record
: found
Abstract
: not found
Book Chapter
: not found
Lemma and Model Caching in Decision Procedures for Quantified Boolean Formulas
Reinhold Letz
(2002)
0
comments
Cited
11
times
– based on
0
reviews
Bookmark
All references
Author and book information
Book Chapter
Publication date (Print):
2010
Pages
: 158-171
DOI:
10.1007/978-3-642-14186-7_14
SO-VID:
c001fd11-d808-429c-8bc0-9642195b3e31
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
5,939
QBF-Based Formal Verification: Experience and Perspectives
Authors:
Marco Benedetti
,
Hratch Mangassarian
,
Benedetti Marco
…
Proving QBF-hardness in Bounded Model Checking for Incomplete Designs
Authors:
Christian Miller
,
Christoph Scholl
,
Bernd Becker
Using SAT in QBF
Authors:
Horst Samulowitz
,
Fahiem Bacchus
See all similar
Cited by
10
Contributions to the Theory of Practical Quantified Boolean Formula Solving
Authors:
Allen Van Gelder
Resolution-Based Certificate Extraction for QBF
Authors:
Aina Niemetz
,
Mathias Preiner
,
Florian Lonsing
…
Dependency Learning for QBF
Authors:
Tomáš Peitl
,
Friedrich Slivovsky
,
Stefan Szeider
See all cited by