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
46
views
13
references
Top references
cited by
20
Cite as...
0 reviews
Review
0
comments
Comment
0
recommends
+1
Recommend
0
collections
Add to
0
shares
Share
Twitter
Sina Weibo
Facebook
Email
2,767
similar
All similar
Record
: found
Abstract
: not found
Book Chapter
: not found
Automated Deduction – CADE-23
Blocked Clause Elimination for QBF
other
Author(s):
Armin Biere
,
Florian Lonsing
,
Martina Seidl
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
ScienceOpen Research
Most cited references
13
Record
: found
Abstract
: not found
Article
: not found
A Structure-preserving Clause Form Translation
David Plaisted
,
Steven Greenbaum
(1986)
0
comments
Cited
68
times
– based on
0
reviews
Review now
Bookmark
Record
: found
Abstract
: not found
Book Chapter
: not found
On the Complexity of Derivation in Propositional Calculus
G. S. Tseitin
(1970)
0
comments
Cited
57
times
– based on
0
reviews
Bookmark
Record
: found
Abstract
: not found
Article
: not found
On a generalization of extended resolution
O. Kullmann
(1999)
0
comments
Cited
30
times
– based on
0
reviews
Review now
Bookmark
All references
Author and book information
Book Chapter
Publication date (Print):
2011
Pages
: 101-115
DOI:
10.1007/978-3-642-22438-6_10
SO-VID:
2bccd45a-29e8-4ca4-8912-fdee5d28a41b
License:
http://www.springer.com/tdm
History
Data availability:
Comments
Comment on this book
Sign in to comment
Book chapters
pp. 162
Experimenting with Deduction Modulo
pp. 101
Blocked Clause Elimination for QBF
pp. 116
Extending Sledgehammer with SMT Solvers
pp. 131
Automated Cyclic Entailment Proofs in Separation Logic
pp. 192
Optimized Query Rewriting for OWL 2 QL
pp. 207
Sort It Out with Monotonicity
pp. 476
An Efficient Decision Procedure for Imperative Tree Data Structures
pp. 499
CSI – A Confluence Tool
Similar content
2,767
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
20
Solving QBF with Counterexample Guided Refinement
Authors:
Mikoláš Janota
,
William Klieber
,
Joao Marques-Silva
…
Encodings of Bounded Synthesis
Authors:
Peter Faymonville
,
Bernd Finkbeiner
,
Markus N. Rabe
…
Incremental Determinization
Authors:
Markus N. Rabe
,
Sanjit Seshia
See all cited by