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
30
views
14
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
4,863
similar
All similar
Record
: found
Abstract
: not found
Book Chapter
: not found
Principles and Practice of Constraint Programming — CP96
Using CSP look-back techniques to solve exceptionally hard SAT instances
other
Author(s):
Roberto J. Bayardo
,
Robert Schrag
Publication date
(Online):
June 1 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
14
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
Article
: not found
Forward reasoning and dependency-directed backtracking in a system for computer-aided circuit analysis
Richard Stallman
,
Gerald Sussman
(1977)
0
comments
Cited
49
times
– based on
0
reviews
Review now
Bookmark
All references
Author and book information
Book Chapter
Publication date (Print):
1996
Publication date (Online):
June 1 2005
Pages
: 46-60
DOI:
10.1007/3-540-61551-2_65
SO-VID:
96373fb6-7bec-4465-a3ed-6e8e92bec381
History
Data availability:
Comments
Comment on this book
Sign in to comment
Book chapters
pp. 46
Using CSP look-back techniques to solve exceptionally hard SAT instances
pp. 61
MAC and combined heuristics: Two reasons to forsake FC (and CBJ?) on hard problems
pp. 353
A view of local search in constraint programming
Similar content
4,863
Hybrid Annealing Method Based on subQUBO Model Extraction With Multiple Solution Instances
Authors:
Yuta Atobe
,
Masashi Tawada
,
Nozomu Togawa
Medical diagnostic by data bagging for various instances of neural network
Authors:
Z. KHAN
,
MUT Alvi
,
MA Tahir
…
SAT-057-Proton pump inhibitors as a risk factor for hepatic encephalopathy and infections in cirrhotic patients: A clinical evidence
Authors:
Mafalda João
,
jorge mendes
,
emília louro
…
See all similar
Cited by
18
A Scalable Approximate Model Counter
Authors:
Supratik Chakraborty
,
Kuldeep Meel
,
Moshe Vardi
The Impact of Branching Heuristics in Propositional Satisfiability Algorithms
Authors:
Joao Marques-Silva
Zchaff2004: An Efficient SAT Solver
Authors:
Yogesh Mahajan
,
Zhaohui Fu
,
Sharad Malik
See all cited by