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
17
views
18
references
Top references
cited by
8
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,004
similar
All similar
Record
: found
Abstract
: not found
Book Chapter
: not found
Principles and Practice of Constraint Programming - CP 2005
Using SAT in QBF
other
Author(s):
Horst Samulowitz
,
Fahiem Bacchus
Publication date
(Print):
2005
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
Genome Engineering using CRISPR
Most cited references
18
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
Conference Proceedings
: not found
Word problems requiring exponential time(Preliminary Report)
L. J. Stockmeyer
,
A. R. Meyer
(1973)
0
comments
Cited
85
times
– based on
0
reviews
Bookmark
All references
Author and book information
Book Chapter
Publication date (Print):
2005
Pages
: 578-592
DOI:
10.1007/11564751_43
SO-VID:
81e12212-d1a1-41b1-aa77-a26f59f67e7c
History
Data availability:
Comments
Comment on this book
Sign in to comment
Book chapters
pp. 812
Beyond Finite Domains: The All Different and Global Cardinality Constraints
pp. 137
A Linear-Logic Semantics for Constraint Handling Rules
pp. 167
Beyond Hypertree Width: Decomposition Methods Without Decompositions
pp. 211
CP(Graph): Introducing a Graph Computation Domain in Constraint Programming
pp. 256
Conditional Symmetry Breaking
pp. 314
Planning and Scheduling to Minimize Tardiness
pp. 403
Exploiting Unit Propagation to Compute Lower Bounds in Branch and Bound Max-SAT Solvers
pp. 475
Automatic Detection of Variable and Value Symmetries
pp. 578
Using SAT in QBF
pp. 622
Eplex: Harnessing Mathematical Programming Solvers for Constraint Logic Programming
pp. 817
Views and Iterators for Generic Constraint Implementations
Similar content
2,004
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
The QBF Gallery Behind the scenes
Authors:
Florian Lonsing
,
Martina Seidl
,
Allen Van Gelder
See all similar
Cited by
8
Solving QBF with Counterexample Guided Refinement
Authors:
Mikoláš Janota
,
William Klieber
,
Joao Marques-Silva
…
Automated Testing and Debugging of SAT and QBF Solvers
Authors:
Robert Brummayer
,
Florian Lonsing
,
Armin Biere
Preprocessing QBF
Authors:
Horst Samulowitz
,
Jessica Katharine Davies
,
Fahiem Bacchus
See all cited by