Constraint Proccessing:

 Introduction
 A. Mackworth Constraint Satisfaction S. Shapiro, Encyclopedia of
Artificial Intelligence, Wiley & Sons inc. December 1991
 R. Dechter Constraint Networks S. Shapiro, Encyclopedia of Artificial
Intelligence Wiley and Sons, December, 1991
 "Some Applications of the Constraint Satisfaction Problem", Nadel,
Bernard A., Computer Science Dept., Wayne State University, Detroit, MI,
June, 1990.
 Local consistency algorithms
 D.E. Waltz, "Understanding Line Drawing of Scenes with Shadows", in
P.H. Winston, ed., The Psychology of Computer Vision, McGrawHill Book, Co.,
Inc., New York 1975.
 U. Montanari, "Networks of constraints: Fundamental properties and
applications to picture processing", Information Science, Vol. 7 1974, pp.
95132
 A. K. Mackworth, "Consistency in networks of relations", Artificial
Intelligence, Vol 8, 1977 pp 6573.
 A.K. Mackworth, E.C. Freuder, "The complexity of some polynomial network
consistency algorithms for constraint satisfaction problems", Artificial Intelligence,
Vol. 25, No. 1, 1984
 Mohr, R. and Henderson T.C. "Arc and path consistency revisited"
Artificial Intelligence 28(2) (1986) 225233
 Dechter R. "From local to global consistency" Artificial intelligence,1992.
 van Beek, P. Dechter R., "On the minimality and Decomposability of
rowconvex constraint networks". Journal of the ACM, Vol 42, No. 3, May 1995,
pp. 543{561.
 R. Dechter and P. van Beek "Local and global relational consistency"
Journal of Theoretical Computer Science, Vol 173(1), PP. 283308, 1997.
 van Beek P., Dechter R., "Constraint tightness and looseness versus
local and global consistency" Journal of ACM, VOL 44, NO. 4, JolY 1997, PP.
549566.
 Backtracking schemes
 Davis, M. and Putnam, H. "A computing procedure for quantification
theory J. Assoc. Comput. Mach", 7, 1960, 2012015.
 M. Davis, G. Logemann and D. Loveland, "A machine program for theorem
proving" Communication of the ACM, 5, 1962, pp. 394397.
 D. McAllester, "Boolean Constraint Propagation and Dependency directed
Backtracking", MIT report
 J. Gaschnig "Experimental case studies of backtrack vs. Waltz type
new algorithms for satisfying assignment problems", In the scnd Biennial Conference
of the Canadian Society of Computational Studies of Intelligence. Toronto,
1977.
 J. Gaschnig "A general backtrack algorithm that eliminates most redundant
tests", IJCAI1977, Menlo Park, CA. pp. 457
 R. M. Haralick and G. L. Elliott, "Increasing treesearch efficiency
for constraint satisfaction problems Artificial Intelligence, Vol. 14 1980,
pp 263313
 R. Dechter, "Enhancement schemes for constraint processing: backjumping,
learning, and cutset decomposition Artificial Intelligence, Vol. 41, No. 3,
January 1990 pp. 273312
 P. W. Purdom, "Search rearrangement backtracking and polynomial average
time Artificial Intelligence", Vol. 21, 1983 pp.117133
 P. W. Purdom and Brown C., "An average time analysis of backtracking",
SIAM journal of computing 10(3): 583593.
 R. Dechter and D. Frost "Backtracking algorithms for constraint satisfaction
problems  a survey"
 Kondrak and van Beek "A Theoretical evaluation of selected backtracking
algorithms" IN AIJ 1997.
 Networkbased Algorithms
 E.C. Freuder, "A suficient condition for backtrackfree search", Journal
of the ACM, Vol. 29, No. 1 January 1982 pp. 2432.
 R. Dechter and J. Pearl, "Networkbased heuristics for constraintsatisfaction
problems", Artificial Intelligence, Vol. 34 No. 1 December, 1987 pp. 138
 R. Dechter and J. Pearl, "Treeclustering Schemes for Constraint Net
works", Artificial Intelligence, 38 (1989), pp. 353366.
 R. Dechter, A. Dechter, J. Pearl. "Optimization in constraintnetworks",
In Influence Diagrams, Belief Nets and Decision Analysis, Edited by R.M. Oliver
and J.Q. Smith, 1990, John Wiley.
 R. Dechter "Bucket elimination: a unifying framework for processing
hard and soft constraints" CONSTRAINT: An International Journal, 2,5155
(1997).
 Tractable classes
 van Beek, P. Dechter R., "On the minimality and Decomposability of
rowconvex constraint networks". Journal of the ACM, Vol 42, No. 3, May 1995,
pp. 543{561.
 R. Dechter and P. van Beek "Local and global relational consistency"
Journal of Theoretical Computer Science, Vol 173(1), PP. 283308, 1997.
 van Beek P., Dechter R., "Constraint tightness and looseness versus
local and global consistency" Journal of ACM, VOL 44, NO. 4, JolY 1997, PP.
549566.
 Temporal Constraint Networks
 J.F Allen. "Maintaining knowledge about temporal intervals", Communications
of the ACM, Vol. 26 No. 11 November, 1983 pp. 832843
 M. Vilain and H. Kautz. "Constraint propagation algorithms for temporal
reasoning", Proceedings AAAI86 Phila, PA 1986 pp 377382
 R. Dechter, I. Meiri and J. Pearl. "Temporal Constraint Networks", Artifi
cial Intelligence, 49 (1991) pp. 6195.
 P. vanBeek and R. Cohen. "Approximation algorithms for temporal reasoning",
Proceedings IJCAI89 Detroit, Michigan 1989
 I. Meiri. "Combining Qualitative and Quantitative Constraints in Temporal
Reasoning", Artificial Intelligence, 1996.
 M. C. Golumbic and R. Shamir. "Algorithms and complexity for reasoning
about time", In AAAI92, San Jose, CA. pp. 741747
 M. C. Golumbic. "Survey on Temporal reaasoning".
 Local Search and Annealing
 Selman, B. Levesque, H. J., and Mitchell, D.G. (1992) "A new method
for solving hard satisfiability problems", Proceedings AAAI92, San Jose, CA,
1992.
 S. Minton, Johnston. M. D., Philips, A. B., and Laird, P. (1990) "Solving
largescale constraint satisfaction using a heuristic repair method", Proceedings
AAAI90, 1990, 1724.
 Hinton, Sejnowsky, Ackley, Boltzmann. "Machines: Constraint Satisfaction
Networks that Learn", CMU Report, 1984.
 Kirpatrick, Gelatt and Vecchi. "Optimization by Simolated Annealing",
Science 1983.
 Languages for applications
 D. McAllester. "Truth Maintenance", Proceedings AAAI90 Boston, MA Joly,
1990 11091115
 R. Dechter and A. Dechter. "Belief maintenance in dynamic constraint
networks", Proceedings AAAI88, St. Paol, Minnesota: August, 1988
 J. de Kleer. "A comparison of ATMS and CSP techniques", In Ijcai89,
Detroit Michigen, pp. 290296.
 Constraint Logic Programming
 Jaffar, J. and Lassez, J.L. "Constraint Logic Programming", Proceeding
of the 14th ACM Conference on Principles of Programming Languages, 111119.
 Borning A., Maher, M. et al. "Constraint Hierarchies and Logic Programming",
Proceeding of the 6th Logic Programming Conference, pp. 149164, 1988.
 Van Hentenryck etal., "The Constraint Logic Programming Language CHIP",
Proceedings of Intern. Conference on Fith Generation Computer Systems, Japan 1988.
 Others
 An Algorithm for Optimal Winner Determination in Combinatorial Auctions
 Algorithm for Optimizing Leveled Commitment Contracts
 New Algoritms for Golomb Ruler Derviation and Proof of the 19 Mark Ruler
 Mining the Genome
 Bandwidth Allocation Planning in Communication Networks
