Search from the table of contents of 2.5 million books
Advanced Search (Beta)
Home > Principles and Practice of Constraint Programming - CP' 96: Second International Conference, CP ' 96, Cambridge, MA, USA, August 19 - 22, 1996. Proceedings > Using CSP look-back techniques to solve exceptionally hard SAT instances
Principles and Practice of Constraint Programming - CP' 96: Second International Conference, CP ' 96, Cambridge, MA, USA, August 19 - 22, 1996. Proceedings |
Eugene C. Freuder
Springer Berlin Heidelberg
Principles and Practice of Constraint Programming - CP' 96: Second International Conference, CP ' 96, Cambridge, MA, USA, August 19 - 22, 1996. Proceedings
Using CSP look-back techniques to solve exceptionally hard SAT instances
Authors

Roberto J. Bayardo Jr.; Robert Schrag

ARI Id

1664342271927_1291924

Access

Not Available Free

Pages

46-60

DOI

10.1007/3-540-61551-2_65

Chapter URL

https://rd.springer.com/chapter/10.1007/3-540-61551-2_65

Table of Contents of Book
Showing 1 to 20 of 63 entries
Chapters/HeadingsAuthor(s)PagesInfo
Front Matter
On confluence of Constraint Handling Rules
Slim Abdennadher; Thom Frühwirth; Holger Meuss
1-15
A labelling arc consistency method for functional constraints
M. S. Affane; H. Bennaceur
16-30
Constraint satisfaction in optical routing for passive wavelength-routed networks
Dhritiman Banerjee; Jeremy Frank
31-45
Using CSP look-back techniques to solve exceptionally hard SAT instances
Roberto J. Bayardo Jr.; Robert Schrag
46-60
MAC and combined heuristics: Two reasons to forsake FC (and CBJ?) on hard problems
Christian Bessière; Jean-Charles Régin
61-75
The independence property of a class of set constraints
Witold Charatonik; Andreas Podelski
76-90
Speeding up constraint propagation by redundant modeling
B. M. W. Cheng; J. H. M. Lee; J. C. K. Wu
91-103
A constraint-based interactive train rescheduling tool
C. K. Chiu; C. M. Chou; J. H. M. Lee; H. F. Leung; Y. W. Leung
104-118
Local search and the number of solutions
David A. Clark; Jeremy Frank; Ian P. Gent; Ewan MacIntyre; Neven Tomov; Toby Walsh
119-133
Derivation of constraints and database relations
David Cohen; Marc Gyssens; Peter Jeavons
134-148
Constraint programming: an efficient and practical approach to solving the job-shop problem
Yves Colombani
149-163
An instance of adaptive constraint propagation
Hani El Sakkout; Mark G. Wallace; E. Barry Richards
164-178
An empirical study of dynamic variable ordering heuristics for the constraint satisfaction problem
Ian P. Gent; Ewan MacIntyre; Patrick Presser; Barbara M. Smith; Toby Walsh
179-193
Empirical studies of heuristic local search for constraint solving
Jin-Kao Hao; Raphaël Dorne
194-208
Defeasibility in CLP( \(\mathcal{Q}\) ) through generalized slack variables
Christian Holzbaur; Francisco Menezes; Pedro Barahona
209-223
Inference duality as a basis for sensitivity analysis
J. N. Hooker
224-236
Generalized local propagation: A framework for solving constraint hierarchies
Hiroshi Hosobe; Satoshi Matsuoka; Akinori Yonezawa
237-251
Transformations between HCLP and PCSP
Michael Jampel; Jean-Marie Jacquet; David Gilbert; Sebastian Hunt
252-266
A test for tractability
Peter Jeavons; David Cohen; Marc Gyssens
267-281
Chapters/HeadingsAuthor(s)PagesInfo
Showing 1 to 20 of 63 entries
Similar Books
Similar Chapters
Similar Thesis

Similar News

Similar Articles
Similar Article Headings