First, I express my gratitude to my supervisor Joxan Ja ar for his introducing me to constraint programming which involves typical computer science and interesting mathe-matics, for valuable discussions and for his help during my study in NUS. As for research, Roland Yap is an incredible information resource for me. I beni t a lot from discussions with Roland Yap and Liu Bing. I also thank the other members of the Programming Language and System Group for their creating a stimulating enviorenment. Finally, I thank my wife and parents for their support in the past years.
|
877
|
Consistency in networks of relations
– Mackworth
- 1977
|
|
739
|
Constraint Networks
– Dechter
- 1992
|
|
731
|
Integer and Combinatorial Optimization
– Nemhauser, Wolsey
- 1988
|
|
544
|
A Relational Model of Data for Large Shared Data Banks
– Codd
- 1970
|
|
544
|
Interval Analysis
– Moore
- 1966
|
|
474
|
Linear Programming and Extensions
– Dantzig
- 1963
|
|
357
|
Constraint Satisfaction in Logic Programming
– Hentenryck
- 1989
|
|
354
|
Networks of constraints: Fundamental properties and applications to picture processing
– Montanari
- 1974
|
|
347
|
Global Optimization Using Interval Analysis
– HANSEN, WALSTER
- 2004
|
|
340
|
Network-based heuristics for constraint-satisfaction problems
– Dechter, Pearl
- 1988
|
|
300
|
Algorithms for Constraint Satisfaction Problems: a Survey
– Kumar
- 1992
|
|
291
|
The CLP(R) Language and System
– Jaffar, Michaylov, et al.
- 1992
|
|
271
|
Understanding line drawings of scenes with shadows
– Waltz
- 1975
|
|
260
|
The complexity of some polynomial network consistency algorithms for constraint satisfaction problems
– Mackworth, Freuder
- 1985
|
|
247
|
The Complexity of Satisfiability Problems
– Schaefer
- 1978
|
|
243
|
Constraint Satisfaction
– Mackworth
- 1987
|
|
239
|
Enhancement schemes for constraint processing: backjumping, learning, and cutset decomposition
– Dechter
- 1990
|
|
233
|
Synthesizing constraint expressions
– Freuder
- 1978
|
|
213
|
Tree clustering for constraint networks
– Dechter, Pearl
- 1989
|
|
207
|
Forward reasoning and dependency-directed backtracking in a system for computer-aided circuit analysis
– Stallman, Sussman
- 1977
|
|
190
|
Constraint propagation with interval labels
– Davis
- 1987
|
|
179
|
Database Management Systems
– Ramakrishnan, Gehrke
- 2003
|
|
177
|
Arc and path consistency revisited
– Mohr, Henderson
- 1986
|
|
170
|
A generic arc-consistency algorithm and its specializations
– hentenryck, Deville, et al.
- 1992
|
|
169
|
Bucket elimination: A unifying framework for reasoning
– Dechter
- 1999
|
|
155
|
Applying interval arithmetic to real, integer, and Boolean constraints
– Benhamou, Older
- 1997
|
|
150
|
Performance measurement and analysis of certain search algorithms
– Gaschnig
- 1979
|
|
149
|
Compiling constraints in CLP(FD
– Codognet, Diaz
- 1996
|
|
148
|
Consistency techniques for numeric CSPs
– Lhomme
- 1993
|
|
137
|
Design, implementation, and evaluation of the constraint language CC(FD
– Hentenryck, Saraswat, et al.
- 1998
|
|
125
|
Numerica: A Modeling Language for Global Optimization
– Hentenryck, Michel, et al.
- 1997
|
|
123
|
A sufficient condition for backtrack-bounded search
– Freuder
- 1985
|
|
114
|
Constraint logic programming
– Jaar, Lassez
- 1987
|
|
111
|
Arc-consistency and arc-consistency again
– Bessière
- 1994
|
|
108
|
Generating semantic descriptions from drawings of scenes with shadows. In The Psychology of Computer Vision. McGraw-Hill, Chapter 3. Preliminary version as MIT research report (MAC-AI-TR-271
– Waltz
- 1975
|
|
106
|
Hentenryck. CLP(Intervals) revisited
– Benhamou, McAllister, et al.
- 1994
|
|
106
|
Generalized arc consistency for global cardinality constraint
– Régin
- 1996
|
|
104
|
Computers and Intractability: A Guide to NP-Completeness
– Garey, Johnson
- 1979
|
|
102
|
Fourier-Motzkin elimination and its dual
– Dantzig, Eaves
- 1973
|
|
100
|
From local to global consistency
– Dechter
- 1992
|
|
91
|
Arc consistency for general constraint networks: Preliminary results
– Bessière, Régin
- 1997
|
|
91
|
Constraint reasoning based on interval arithmetic
– Hyvönen
- 1989
|
|
87
|
Good old discrete relaxation
– Mohr, Masini
- 1988
|
|
73
|
Closure properties of constraints
– Jeavons, Cohen, et al.
- 1997
|
|
72
|
Constraint Arithmetic on Real Intervals
– Older, Vellino
- 1993
|
|
71
|
Experimental case studies of backtrack vs. Waltz-type vs. new algorithms for satisficing assignment problems
– Gaschnig
- 1978
|
|
70
|
On the conversion between non-binary and binary constraint satisfaction problems
– Bacchus, Beek
- 1998
|
|
70
|
On the equivalence of constraint satisfaction problems
– Rossi, Petrie, et al.
- 1990
|
|
68
|
A language and a program for stating and solving combinatorial problems
– Lauriere
- 1978
|
|
67
|
combined heuristics: Two reasons to forsake FC (and CBJ?) on hard problems
– MAC
- 1996
|
