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
31
views
20
references
Top references
cited by
6
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,545
similar
All similar
Record
: found
Abstract
: not found
Book Chapter
: not found
Theory and Applications of Satisfiability Testing – SAT 2017
Dependency Learning for QBF
other
Author(s):
Tomáš Peitl
,
Friedrich Slivovsky
,
Stefan Szeider
Publication date
(Online):
August 09 2017
Publisher:
Springer International Publishing
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
Teaching and learning evolution
Most cited references
20
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
Record
: found
Abstract
: not found
Article
: not found
Unified QBF certification and its applications
Jie-Hong Jiang
,
Valeriy Balabanov
(2012)
0
comments
Cited
21
times
– based on
0
reviews
Review now
Bookmark
Record
: found
Abstract
: not found
Book Chapter
: not found
Blocked Clause Elimination for QBF
Armin Biere
,
Florian Lonsing
,
Martina Seidl
(2011)
0
comments
Cited
20
times
– based on
0
reviews
Bookmark
All references
Author and book information
Book Chapter
Publication date (Print):
2017
Publication date (Online):
August 09 2017
Pages
: 298-313
DOI:
10.1007/978-3-319-66263-3_19
SO-VID:
81071921-e141-4299-969f-6985c9a20cec
License:
http://www.springer.com/tdm
History
Data availability:
Comments
Comment on this book
Sign in to comment
Book chapters
pp. 263
Shortening QBF Proofs with Dependency Schemes
pp. 298
Dependency Learning for QBF
Similar content
2,545
QBF as an Alternative to Courcelle’s Theorem
Authors:
Michael Lampis
,
Stefan Mengel
,
Valia Mitsou
Dynamically Partitioning for Solving QBF
Authors:
Horst Samulowitz
,
Fahiem Bacchus
On Propositional QBF Expansions and Q-Resolution
Authors:
Mikoláš Janota
,
Joao Marques-Silva
See all similar
Cited by
6
PrideMM: A Solver for Relaxed Memory Models
Authors:
Simon Cooksey
,
Sarah Harris
,
Mark Batty
…
Symmetries of Quantified Boolean Formulas
Authors:
Martina Seidl
,
Manuel Kauers
Evaluating QBF Solvers: Quantifier Alternations Matter
Authors:
Florian Lonsing
,
Uwe Egly
See all cited by