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
47
views
13
references
Top references
cited by
24
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,762
similar
All similar
Record
: found
Abstract
: not found
Book Chapter
: not found
Theory and Applications of Satisfiability Testing – SAT 2014
DRAT-trim: Efficient Checking and Trimming Using Expressive Clausal Proofs
other
Author(s):
Nathan Wetzler
,
Marijn J. H. Heule
,
Warren A. Hunt
Publication date
(Print):
2014
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
Book Chapter
: not found
On the Complexity of Derivation in Propositional Calculus
G. S. Tseitin
(1983)
0
comments
Cited
39
times
– based on
0
reviews
Bookmark
Record
: found
Abstract
: not found
Article
: not found
On a generalization of extended resolution
O. Kullmann
(1999)
0
comments
Cited
30
times
– based on
0
reviews
Review now
Bookmark
Record
: found
Abstract
: not found
Article
: not found
Partial-Match Retrieval Algorithms
Ronald L. Rivest
(1976)
0
comments
Cited
28
times
– based on
0
reviews
Review now
Bookmark
All references
Author and book information
Book Chapter
Publication date (Print):
2014
Pages
: 422-429
DOI:
10.1007/978-3-319-09284-3_31
SO-VID:
09fb8b1f-1839-49cb-bb6b-56e955bc7af8
History
Data availability:
Comments
Comment on this book
Sign in to comment
Book chapters
pp. 48
MUS Extraction Using Clausal Proofs
pp. 206
Ultimately Incremental SAT
pp. 154
QBF Resolution Systems and Their Proof Complexities
pp. 197
Lazy Clause Exchange Policy for Parallel SAT Solvers
pp. 252
Impact of Community Structure on SAT Solver Performance
pp. 422
DRAT-trim: Efficient Checking and Trimming Using Expressive Clausal Proofs
pp. 438
Open-WBO: A Modular MaxSAT Solver,
Similar content
5,762
Clausal intuitionistic logic II. tableau proof procedures
Authors:
L.Thorne McCarty
A Clausal Genetic Representation and its Evolutionary Procedures for Satisfiability Problems
Authors:
Jin-Kao Hao
Controlled Use of Clausal Lemmas in Connection Tableau Calculi
Authors:
MARC FUCHS
See all similar
Cited by
24
Combining SAT Solvers with Computer Algebra Systems to Verify Combinatorial Conjectures
Authors:
Edward Zulkoski
,
Curtis Bright
,
Albert Heinle
…
Efficient Verified (UN)SAT Certificate Checking
Authors:
Peter Lammich
Efficient Certified RAT Verification
Authors:
Luís Cruz-Filipe
,
Marijn Heule
,
Warren A. Hunt
…
See all cited by