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
32
views
10
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
5,478
similar
All similar
Record
: found
Abstract
: not found
Book Chapter
: not found
Theory and Applications of Satisfiability Testing – SAT 2010
A Non-prenex, Non-clausal QBF Solver with Game-State Learning
other
Author(s):
William Klieber
,
Samir Sapra
,
Sicun Gao
,
Edmund Clarke
Publication date
(Print):
2010
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
Computer Vision, Deep Learning, Deep Reinforcement Learning, IoT
Most cited references
10
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
Book Chapter
: not found
QBF Modeling: Exploiting Player Symmetry for Simplicity and Efficiency
Ashish Sabharwal
,
Carlos Ansótegui
,
Carla Gomes
…
(2006)
0
comments
Cited
9
times
– based on
0
reviews
Bookmark
Record
: found
Abstract
: not found
Book Chapter
: not found
Nenofex: Expanding NNF for QBF Solving
Florian Lonsing
,
Armin Biere
(2008)
0
comments
Cited
9
times
– based on
0
reviews
Bookmark
All references
Author and book information
Book Chapter
Publication date (Print):
2010
Pages
: 128-142
DOI:
10.1007/978-3-642-14186-7_12
SO-VID:
e18947b8-f6eb-455a-9f7f-9e30beff3bfc
History
Data availability:
Comments
Comment on this book
Sign in to comment
Book chapters
pp. 388
Zero-One Designs Produce Small Hard SAT Instances
pp. 44
Automated Testing and Debugging of SAT and QBF Solvers
pp. 85
sQueezeBF: An Effective Preprocessor for QBFs Based on Equivalence Reasoning
pp. 113
Symmetry and Satisfiability: An Update
pp. 128
A Non-prenex, Non-clausal QBF Solver with Game-State Learning
pp. 158
Integrating Dependency Schemes in Search-Based QBF Solvers
pp. 181
Improving Unsatisfiability-Based Algorithms for Boolean Optimization
pp. 326
Minimising Deterministic Büchi Automata Precisely Using SAT Solving
Similar content
5,478
Clausal intuitionistic logic II. tableau proof procedures
Authors:
L.Thorne McCarty
Academic Writing Development at the University Level: Phrasal and Clausal Complexity Across Level of Study, Discipline, and Genre
Authors:
Shelley Staples
A Clausal Genetic Representation and its Evolutionary Procedures for Satisfiability Problems
Authors:
Jin-Kao Hao
See all similar
Cited by
20
Solving QBF with Counterexample Guided Refinement
Authors:
Mikoláš Janota
,
William Klieber
,
Joao Marques-Silva
…
Incremental Determinization
Authors:
Markus N. Rabe
,
Sanjit Seshia
Contributions to the Theory of Practical Quantified Boolean Formula Solving
Authors:
Allen Van Gelder
See all cited by