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
34
views
30
references
Top references
cited by
9
Cite as...
0 reviews
Review
0
comments
Comment
0
recommends
+1
Recommend
0
collections
Add to
0
shares
Share
Twitter
Sina Weibo
Facebook
Email
1,275
similar
All similar
Record
: found
Abstract
: not found
Book Chapter
: not found
Theory and Applications of Satisfiability Testing – SAT 2008
Nenofex: Expanding NNF for QBF Solving
other
Author(s):
Florian Lonsing
,
Armin Biere
Publication date
(Print):
2008
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
ScienceOpen Research
Most cited references
30
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
A Computing Procedure for Quantification Theory
Martin Davis
,
Hilary Putnam
(1960)
0
comments
Cited
222
times
– based on
0
reviews
Review now
Bookmark
Record
: found
Abstract
: not found
Book Chapter
: not found
Symbolic Model Checking without BDDs
Armin Biere
,
Alessandro Cimatti
,
Edmund Clarke
…
(1999)
0
comments
Cited
132
times
– based on
0
reviews
Bookmark
All references
Author and book information
Book Chapter
Pages
: 196-210
DOI:
10.1007/978-3-540-79719-7_19
SO-VID:
ce21a7b4-9725-483e-b56a-9e7943aa3613
History
Data availability:
Comments
Comment on this book
Sign in to comment
Book chapters
pp. 21
A Generalized Framework for Conflict Analysis
pp. 28
Adaptive Restart Strategies for Conflict Driven SAT Solvers
pp. 182
Searching for Autarkies to Trim Unsatisfiable Clause Sets
pp. 196
Nenofex: Expanding NNF for QBF Solving
pp. 225
Towards More Effective Unsatisfiability-Based Maximum Satisfiability Algorithms
Similar content
1,275
TAK-1/p38/nNF B signaling inhibits myoblast differentiation by increasing levels of Activin A
Authors:
AU Trendelenburg
,
U. Meyer
,
C Jacobi
TAK-1/p38/nNF B signaling inhibits myoblast differentiation by increasing levels of Activin A
Authors:
AU Trendelenburg
,
U. Meyer
,
C Jacobi
QBF-Based Formal Verification: Experience and Perspectives
Authors:
Marco Benedetti
,
Hratch Mangassarian
,
Benedetti Marco
…
See all similar
Cited by
9
Blocked Clause Elimination for QBF
Authors:
Armin Biere
,
Florian Lonsing
,
Martina Seidl
A Non-prenex, Non-clausal QBF Solver with Game-State Learning
Authors:
William Klieber
,
Samir Sapra
,
Sicun Gao
…
Solving QBF with Counterexample Guided Refinement
Authors:
Mikoláš Janota
,
William Klieber
,
Joao Marques-Silva
…
See all cited by