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
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,655
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
Multimodal Learning Material
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,655
Evaluating QBF Solvers: Quantifier Alternations Matter
Authors:
Florian Lonsing
,
Uwe Egly
QBF as an Alternative to Courcelle’s Theorem
Authors:
Michael Lampis
,
Stefan Mengel
,
Valia Mitsou
Enhancing Search-Based QBF Solving by Dynamic Blocked Clause Elimination
Authors:
Florian Lonsing
,
Fahiem Bacchus
,
Armin Biere
…
See all similar
Cited by
6
Evaluating QBF Solvers: Quantifier Alternations Matter
Authors:
Florian Lonsing
,
Uwe Egly
Symmetries of Quantified Boolean Formulas
Authors:
Martina Seidl
,
Manuel Kauers
PrideMM: A Solver for Relaxed Memory Models
Authors:
Simon Cooksey
,
Sarah Harris
,
Mark Batty
…
See all cited by