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
182
views
16
references
Top references
cited by
19
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,371
similar
All similar
Record
: found
Abstract
: not found
Book Chapter
: not found
Solving QBF with Counterexample Guided Refinement
other
Author(s):
Mikoláš Janota
,
William Klieber
,
Joao Marques-Silva
,
Edmund Clarke
Publication date
(Print):
2012
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
16
Record
: found
Abstract
: not found
Article
: not found
Counterexample-guided abstraction refinement for symbolic model checking
Edmund Clarke
,
Orna Grumberg
,
Somesh Jha
…
(2003)
0
comments
Cited
92
times
– based on
0
reviews
Review now
Bookmark
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
Lazy Theorem Proving for Bounded Model Checking over Infinite Domains
Leonardo de Moura
,
Harald Rueß
,
Maria Sorea
(2002)
0
comments
Cited
22
times
– based on
0
reviews
Bookmark
All references
Author and book information
Book Chapter
Publication date (Print):
2012
Pages
: 114-128
DOI:
10.1007/978-3-642-31612-8_10
SO-VID:
50495291-1682-4716-8f98-b4386c971181
History
Data availability:
Comments
Comment on this book
Sign in to comment
Book chapters
pp. 114
Solving QBF with Counterexample Guided Refinement
Similar content
2,371
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
Look-back techniques and heuristics in DLV: Implementation, evaluation, and comparison to QBF solvers
Authors:
Marco Maratea
,
Francesco Ricca
,
Wolfgang Faber
…
See all similar
Cited by
19
Solving Existentially Quantified Horn Clauses
Authors:
Tewodros Beyene
,
Corneliu Popeea
,
Andrey Rybalchenko
Incremental Determinization
Authors:
Markus N. Rabe
,
Sanjit Seshia
QBF Resolution Systems and Their Proof Complexities
Authors:
Valeriy Balabanov
,
Magdalena Widl
,
Jie-Hong Jiang
See all cited by