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
24
views
13
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
2,946
similar
All similar
Record
: found
Abstract
: not found
Book Chapter
: not found
Theory and Applications of Satisfiability Testing – SAT 2016
Non-prenex QBF Solving Using Abstraction
other
Author(s):
Leander Tentrup
Publication date
(Online):
June 11 2016
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
Genome Engineering using CRISPR
Most cited references
13
Record
: found
Abstract
: not found
Article
: not found
Bounded synthesis
Sven Schewe
,
Bernd Finkbeiner
(2013)
0
comments
Cited
38
times
– based on
0
reviews
Review now
Bookmark
Record
: found
Abstract
: not found
Book Chapter
: not found
Acacia+, a Tool for LTL Synthesis
Aaron Bohy
,
Veronique Bruyere
,
Emmanuel Filiot
…
(2012)
0
comments
Cited
24
times
– based on
0
reviews
Bookmark
Record
: found
Abstract
: not found
Book Chapter
: not found
A Non-prenex, Non-clausal QBF Solver with Game-State Learning
William Klieber
,
Samir Sapra
,
Sicun Gao
…
(2010)
0
comments
Cited
20
times
– based on
0
reviews
Bookmark
All references
Author and book information
Book Chapter
Publication date (Print):
2016
Publication date (Online):
June 11 2016
Pages
: 393-401
DOI:
10.1007/978-3-319-40970-2_24
SO-VID:
636bb827-fe47-4533-a4aa-490ec13b9a8e
History
Data availability:
Comments
Comment on this book
Sign in to comment
Book chapters
pp. 104
Improved Static Symmetry Breaking for SAT
pp. 375
Incremental Determinization
pp. 393
Non-prenex QBF Solving Using Abstraction
pp. 539
LMHS: A SAT-IP Hybrid MaxSAT Solver
Similar content
2,946
A note on the size of prenex normal forms
Authors:
Frederik Harwath
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
See all similar
Cited by
7
Dependency Learning for QBF
Authors:
Tomáš Peitl
,
Friedrich Slivovsky
,
Stefan Szeider
Symmetries of Quantified Boolean Formulas
Authors:
Martina Seidl
,
Manuel Kauers
Expansion-Based QBF Solving Without Recursion
Authors:
Martina Seidl
,
Roderick Bloem
,
Nicolas Braud-Santoni
…
See all cited by