|
311
|
Hybrid Algorithms for the Constraint Satisfaction Problem
– Patrick Prosser
- 1993
|
|
250
|
Enhancement schemes for constraint processing: Backjumping, learning and cutset decomposition
– R Dechter
- 1990
|
|
67
|
Dead-End Driven Learning
– Daniel Frost, Rina Dechter
- 1994
|
|
323
|
GSAT and Dynamic Backtracking
– Matthew L. Ginsberg, David A. McAllester
- 1994
|
|
919
|
Consistency in networks of relations
– A K Mackworth
- 1977
|
|
412
|
Increasing Tree Search Efficiency for Constraint Satisfaction Problems
– R M Haralick, G L Elliot
- 1980
|
|
179
|
Contradicting Conventional Wisdom in Constraint Satisfaction
– Daniel Sabin, Eugene C. Freuder
- 1994
|
|
217
|
Forward reasoning and dependency-directed backtracking in a system for computer-aided circuit analysis
– R M Stallman, G J Sussman
- 1977
|
|
182
|
Using CSP look-back techniques to solve real-world SAT instances
– Roberto J. Bayardo
- 1997
|
|
620
|
A New Method for Solving Hard Satisfiability Problems
– Bart Selman, Hector Levesque, David Mitchell
- 1992
|
|
247
|
Valued constraint satisfaction problems: Hard and easy problems
– Thomas Schiex, Helene Fargier, Gerard Verfaillie
- 1995
|
|
121
|
Constraint Satisfaction Algorithms
– B A Nadel
- 1989
|
|
837
|
Constraint Networks
– Rina Dechter
- 1992
|
|
719
|
Adaptive Constraint Satisfaction
– J. E. Borrett, E. P. K. Tsang, N. R. Walsh
- 1996
|
|
43
|
Domain Filtering can Degrade Intelligent Backjumping Search
– P Prosser
- 1993
|
|
390
|
Partial Constraint Satisfaction
– Eugene C. Freuder, Richard J. Wallace
- 1992
|
|
66
|
A rearrangement search strategy for determining propositional satisfiability
– Ramin Zabih
- 1988
|
|
926
|
A computing procedure for quantification theory
– Martin Davis, Hilary Putnam
- 1960
|
|
92
|
A Davis-Putnam Based Enumeration Algorithm for Linear Pseudo-Boolean Optimization
– Peter Barth, Im Stadtwald
- 1995
|
