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
39
views
17
references
Top references
cited by
7
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,275
similar
All similar
Record
: found
Abstract
: not found
Book Chapter
: not found
Logic for Programming, Artificial Intelligence, and Reasoning
Enhancing Search-Based QBF Solving by Dynamic Blocked Clause Elimination
other
Author(s):
Florian Lonsing
,
Fahiem Bacchus
,
Armin Biere
,
Uwe Egly
,
Martina Seidl
Publication date
(Online):
November 22 2015
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
The Dynamic Brain
Most cited references
17
Record
: found
Abstract
: not found
Article
: not found
A machine program for theorem-proving
Martin Davis
,
George Logemann
,
Donald Loveland
(1962)
0
comments
Cited
305
times
– based on
0
reviews
Review now
Bookmark
Record
: found
Abstract
: not found
Article
: not found
GRASP: a search algorithm for propositional satisfiability
J.P. Marques-Silva
,
K.A. Sakallah
(1999)
0
comments
Cited
125
times
– based on
0
reviews
Review now
Bookmark
Record
: found
Abstract
: not found
Conference Proceedings
: not found
Conflict driven learning in a quantified Boolean Satisfiability solver
Lintao Zhang
,
Sharad Malik
(2002)
0
comments
Cited
32
times
– based on
0
reviews
Bookmark
All references
Author and book information
Book Chapter
Publication date (Print):
2015
Publication date (Online):
November 22 2015
Pages
: 418-433
DOI:
10.1007/978-3-662-48899-7_29
SO-VID:
65f786f2-3135-43a7-b1e6-58ecbd452149
History
Data availability:
Comments
Comment on this book
Sign in to comment
Book chapters
pp. 146
An Adequate Compositional Encoding of Bigraph Structure in Linear Logic with Subexponentials
pp. 162
Controller Synthesis for MDPs and Frequency LTL $$_{\setminus \mathbf{G}\mathbf U}$$
pp. 187
A Labelled Sequent Calculus for Intuitionistic Public Announcement Logic
pp. 387
Relational Reasoning via Probabilistic Coupling
pp. 402
A Contextual Logical Framework
pp. 418
Enhancing Search-Based QBF Solving by Dynamic Blocked Clause Elimination
pp. 434
Reasoning About Loops Using Vampire in KeY
pp. 444
Compositional Propositional Proofs
pp. 460
ELPI: Fast, Embeddable, $$\lambda $$ Prolog Interpreter
pp. 469
Normalisation by Completeness with Heyting Algebras
pp. 483
Using Program Synthesis for Program Analysis
pp. 499
Finding Inconsistencies in Programs with Loops
pp. 515
Modular Multiset Rewriting
pp. 532
Modelling Moral Reasoning and Ethical Responsibility with Logic Programming
pp. 549
Constrained Term Rewriting tooL
pp. 558
Proof Search in Nested Sequent Calculi
pp. 575
Tableau-Based Revision over $$\mathcal {SHIQ}$$ TBoxes
pp. 591
Gamifying Program Analysis
pp. 606
Automated Discovery of Simulation Between Programs
pp. 622
SAT Modulo Intuitionistic Implications
Similar content
4,275
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
7
Dependency Learning for QBF
Authors:
Tomáš Peitl
,
Friedrich Slivovsky
,
Stefan Szeider
Q-Resolution with Generalized Axioms
Authors:
,
,
Long-Distance Q-Resolution with Dependency Schemes
Authors:
Tomáš Peitl
,
Friedrich Slivovsky
,
Stefan Szeider
See all cited by