@string{ai = "Artificial Intelligence"}
@string{jair = "Journal of Artificial Intelligence Research"}
@string{aaai88="Proceedings of the Seventh National Conference on Artificial
  Intelligence"}
@string{aaai90="Proceedings of the Eighth National Conference on Artificial
  Intelligence"}
@string{aaai91="Proceedings of the Ninth National Conference on Artificial
  Intelligence"}
@string{aaai92="Proceedings of the Tenth National Conference on Artificial
  Intelligence"}
@string{aaai93="Proceedings of the Eleventh National Conference on Artificial
  Intelligence"}
@string{aaai94="Proceedings of the Twelfth National Conference on
				  Artificial  Intelligence"} 
@string{aaai96="Proceedings of the Thirteenth National Conference on Artificial
  Intelligence"}
@string{kr96="Principles of Knowledge Representation and Reasoning:
  Proceedings of the Fifth International Conference (KR '96)"}


% *** AAAAAAAAAAAA ***************************************************


@Book{apt,
  author = 		 "K. R. Apt and J.W. de Bakker and J. J. M. M. Rutten
				  (ed.)",
  title = 		 "Logic Programming Languages Constraints, Functions
				  and, Objects",
  publisher = 	 "MIT Press",
  year = 		 1993,
  address =		 "Cambridge, MA"
}

% *** BBBBBBBBBBBB ***************************************************

@PhdThesis{baker,
  author = 		 "Andrew B. Baker",
  title = 		 "Intelligent Backtracking on Constraint Satisfaction
				  Problems: Experimental and Theoretical Results",
  school = 		 "University of Oregon",
  year = 		 1995
}

@TechReport{baluja1995,
  author = 		 "Shumeet Baluja",
  title = 		 "An Empirical Comparison of Seven Iterative and Evolutionary Function Optimization Heuristics",
  institution =  "Carnegie Mellon University",
  year = 		 1995,
  number =		 "CMU-CS-95-193"
}

@InProceedings{baptiste,
  author = 		 "Philippe Babtiste and Claude {Le Pape} and Wim
				  Nuijten",
  title = 		 "Incorporating Efficient Operations Research
				  Algorithms in Constraint-Based Scheduling",
  booktitle =	 "Proceedings of the First International Joint
				  Workshop on Artificial Intelligence and Operations
				  Research",
  year =		 1995,
  address =		 "Timberline Lodge, OR"
}

@InProceedings{bayardo,
  author = 		 "Roberto J. {Bayardo~Jr.} and Daniel P. Miranker",
  title = 		 "A Complexity Analysis of Space-Bounded Learning
				  Algorithms for the Constraint Satisfaction Problem",
  pages =		 "298-304",
  booktitle =	 aaai96,
  year =		 1996
}



@InProceedings{bayardo97,
  author = 		 {Roberto J. Bayardo~Jr. and Robert Schrag},
  title = 		 {Using CSP Look-Back Techniques to Solve Real-World SAT Instances},
  booktitle = 	 {ijcai97},
  year =		 1997
}

@TechReport{bonner,
  author = 		 "A. J. Bonner and M. Kifer",
  title = 		 "Transaction Logic Programming (A Logic of Procedural
				  and Declarative Knowledge)",
  institution =  "Computer Systems Research Institute, University of
				  Toronto",
  year = 		 1995,
  number =		 "CSRI-323"
}

@InProceedings{bresina1996,
  author = 		 "John Bresina",
  title = 		 "Heuristic-Biased Stochastic Sampling",
  booktitle = 	 aaai96,
  year =		 1996
}

@TechReport{burg,
  author = 		 "Jennifer Burg and C. E. Hughes and J. M. Moshell and
				  S-D. Lang",
  title = 		 "Constraint-Based Programming: A Survey",
  institution =  "Department of Computer Science",
  year = 		 1990,
  number =		 "CS-TR-91-16",
  address =		 "University of Central Florida"
}

@Article{bylander,
  author = 		 "Tom Bylander",
  title = 		 "The Computational Complexity of Propositional
				  {STRIPS} Planning",
  journal =		 ai,
  year =		 1994,
  volume =		 69,
  pages =		 "165-204"
}



% *** CCCCCCCCCCCC ***************************************************

@Article{carlier,
  author = 		 "J. Carlier and E. Pinson",
  title = 		 "A Practical Use of Jackson's Preemptive Schedule for
				  Solving the Job Shop Problem",
  journal =		 "Annals Of Operations Research",
  year =		 1990,
  volume =		 26,
  pages =		 "269-87"
}

@TechReport{chang,
  author = 		 "J-H. Chang",
  title = 		 "High Performance Execution of Prolog Programs Based
				  on A Static Data Dependency Analysis",
  institution =  "Computer Science Department, University of
				  California Berkeley",
  year = 		 1985
}

@InProceedings{cheeseman,
  author = 		 "Peter Cheeseman and Bob Kanefsky and William M. Taylor",
  title = 		 "Where the really hard problems are",
  pages =		 "331-337",
  booktitle =	 aaai91,
  year =		 1991
}

@InProceedings{Chien2000,
author = "S. Chien and G. Rabideau and R. Knight and  R. Sherwood and  B. Engelhardt and  D. Mutz and  T. Estlin and  B. Smith and  F. Fisher and  T. Barrett and  G. Stebbins and  D. Tran", 
title = "ASPEN - Automating Space Mission Operations using Automated Planning and Scheduling", booktitle = "SpaceOps 2000, Toulouse, France, June 2000",
year = 2000
}

@InProceedings{crawford93,
  author = 		 "James M. Crawford and Larry D. Auton",
  title = 		 "Experimental Results on the Crossover Point in
				  Satisfiability Problems",
  pages =		 "21-27",
  booktitle =	 aaai93,
  year =		 1993
}

@InProceedings{crawford94,
  author = 		 "James M. Crawford and Andrew B. Baker",
  title = 		 "Experimental Results on the Application of
				  Satisfiability Algorithms to Scheduling Problems",
  booktitle =	 aaai94,
  year =		 1994
}

@InProceedings{crawford96,
  author = 		 "James M. Crawford and Matthew L. Ginsberg and
				  Eugene M. Luks and Amithaba Roy",
  title = 		 "Symmetry Breaking Predicates for Search Problems",
  booktitle =	 "Principles of Knowledge Representation and Reasoning:
				  Proceedings of the Fifth International Conference (KR `96)",
  year =		 1996
}

@InProceedings{crawford96a,
  author = 		 "James M. Crawford",
  title = 		 "An Approach to Resource Constrained Project Scheduling",
  editor =		 "G.F. Luger",
  booktitle =	 "Proceedings of the 1996 Artificial Intelligence and
				  Manufacturing Research Planning Workshop",
  year =		 1996
}

@InProceedings{cheng,
  author = 		 "Cheng-Chung Cheng and Stephen F. Smith",
  title = 		 "Generating Feasible Schedules under Complex Metric
				  Constraints",
  pages =		 "1086-91",
  booktitle =	 "Proceedings of AAAI-94",
  year =		 1994
}



% *** DDDDDDDDDDDD ***************************************************


@Article{davis,
  author = 		 "M. Davis and H. Putman",
  title = 		 "A Computing Procedure for Quantification Theory",
  journal =		 "Journal of the ACM",
  year =		 1960,
  volume =		 7,
  pages =		 "201-215"
}

@Article{david,
  author = 		 "Philippe David",
  title = 		 "Using Pivot Consistency to Decompose and Solve
				  Funtional CSPs",
  journal =		 "Journal of Artificial Intelligence Research",
  year =		 1995,
  volume =		 2,
  pages =		 "447-474"
}

@InProceedings{dechter87,
  author = 		 "Rina Dechter and Judea Pearl",
  title = 		 "The cycle-cutset method for improving search
				  performance in AI applications",
  pages =		 "224-230",
  booktitle =	 "Proceedings of the 3rd conference on AI applications",
  year =		 1987
}

@InCollection{dechter88a,
  author = 		 "Rina Dechter and Judea Pearl",
  title = 		 "Network-based Heuristics for constraint satisfaction
				  problems",
  booktitle =	 "Search in Artificial Intelligence",
  publisher =	 "Springer-Verlag",
  year =		 1988,
  editor =		 "Laveen N. Kanal and Vipin Kumar"
}

@article{dechter88b,
   author = {Dechter, R. \& Dechter, A},
   journal = {Proceedings of the Seventh National Conference on Artificial
  Intelligence},
   title = {Belief maintenance in dynamic constraint networks},
   year = {1988},
   publisher = {Morgan Kaufmann},                
   pages = {37-42}               
}

@Article{dechter90,
  author = 		 "Rina Dechter",
  title = 		 "Enhancement Schemes for Constraint Processing:
				  Backjumping, Learning and Cutset",
  journal =		 ai,
  year =		 1990,
  volume =		 41,
  number =		 3,
  pages =		 "273-312"
}

@Article{dechter91,
  author = 		 "Rina Dechter and Itay Meiri and Judea Pearl",
  title = 		 "Temporal Constraint Networks",
  journal =		 ai,
  year =		 1991,
  volume =		 49,
  pages =		 "61-95"
}

% *** FFFFFFFFFFFF ***************************************************

@InProceedings{Frank2001,
  author = 		 "Jeremy Frank and  Ari Jonsson and Robert Morris and David Smith",
  title = 		 "Planning and Scheduling for Fleets of Earth Observing Satellites",
  booktitle =	 "Proceedings of the 6th International Symposium on Artificial
Intelligence, Robotics, Automation and Space 2001",
  year =		 2001
}

@TechReport{ford56,
  author = 		 "Lestor R. {Ford Jr.}",
  title = 		 "Network Flow Theory",
  institution =  "Rand Corporation",
  year = 		 1956
}

@Book{ford62,
  author = 		 "Lestor R. {Ford Jr.} and D. R. Fulkerson",
  title = 		 "Flows in Networks",
  publisher = 	 "Princeton University Press",
  year = 		 1962
}

@Article{freuder82,
  author = 		 "Eugene C. Freuder",
  title = 		 "A sufficient condition for backtrac-free search",
  journal =		 "Journal of the ACM",
  year =		 1982,
  volume =		 29,
  number =		 1,
  pages =		 "24-32"
}


@InCollection{freuder88,
  author = 		 "Eugene C. Freuder",
  title = 		 "Backtrack-free and backtrack-bounded search",
  booktitle =	 "Search in Artificial Intelligence",
  publisher =	 "Springer-Verlag",
  year =		 1988,
  editor =		 "Laveen N. Kanal and Vipin Kumar"
}

@InCollection{freuder95,
  author = 		 "Eugene C. Freuder and Pauld D. Hubbe",
  title = 		 "A Disjunctive Decomposition Conrtrol Schema for
				  Constraint Satisfaction",
  booktitle =	 "Principles and Practice of Constraint Programming",
  publisher =	 "The MIT Press",
  year =		 1995,
  editor =		 "Vijay Saraswat and Pascal {Van Hentenryck}",
  pages =		 "319-335",
  address =		 "Cambridge, MA"
}

@InProceedings{fruhwirth,
  author = 		 "Thom Fr{\"{u}}hwirth and Alexander Herold and Volker
				  K{\"{u}}chenhoff and Thierry {Le Provost} and Pierre
				  Lim and Eric Monfroy and Mark Wallace",
  title = 		 "Constraint Logic Programming: An Informal Introduction",
  editor =		 "G. Comyn and N. E. Fuchs and M. J. Ratcliffe",
  series =		 "LNCS 636",
  pages =		 "3-35",
  booktitle =	 "Logic Programming in Action",
  year =		 1992,
  publisher =	 "Springer Verlag"
}

% *** GGGGGGGGGGGG ***************************************************

@Book{garey,
  author = 		 "M. R. Garey and D. S. Johnson",
  title = 		 "Computers and Intractability:  A Guide to the Theory
				  of NP-Completeness",
  publisher = 	 "W.H. Freeman and Company",
  year = 		 1979,
  address =		 "New York, NY"
}

@TechReport{gaschnig,
  author = 		 "John Gaschnig",
  title = 		 "Performance Measurement and Analysis of Certain
				  Search Algorithms",
  institution =  "Cargengie-Mellon University",
  year = 		 1979,
  number =		 "CMU-CS-79-124"
}



@Article{ginsberg92,
  author = 		 "Mathhew L. Ginsberg and William D. Harvey",
  title = 		 "Iterative Broadening",
  journal =		 "Artificial Intelligence",
  year =		 1992,
  volume =		 55,
  pages =		 "367-383"
}

@Article{ginsberg93,
  author = 		 "Matthew L. Ginsberg",
  title = 		 "Dynamic Backtracking",
  journal =		 jair,
  year =		 1993,
  volume =		 1,
  pages =		 "25-46"
}

@InProceedings{ginsberg94,
  author = 		 "Matthew L. Ginsberg and David A. McAllester",
  title = 		 "GSAT and Dynamic Backtracking",
  booktitle =	 "Principles of Knowledge Representation and Reasoning:
				  Proceedings of the Fourth International Conference (KR `94)",
  year =		 1994
}

@Article{ginsberg95,
  author = 		 "Matthew L. Ginsberg",
  title = 		 "Approximate Planning",
  journal =		 ai,
  year =		 1995,
  volume =		 76,
  pages =		 "89-123"
}

@InProceedings{ginsberg96,
  author = 		 "Matthew L. Ginsberg",
  title = 		 "A New Algorithm for Generative Planning",
  pages =		 "186-197",
  booktitle =	 kr96,
  year =		 1996
}

@InProceedings{Globus2002schedule,
  author = 		 "Al Globus and James Crawford and Jason Lohn and Robert Morris",
  title = 		 "Scheduling Earth Observing Fleets Using Evolutionary Algorithms: Problem Description and Approach",
  booktitle =	 "Proceedings of the 3rd International NASA Workshop on Planning and Scheduling for Space",
  year =		 2002
}

@InProceedings{Globus2003SMCIT,
  author = 		 "Al Globus and James Crawford and Jason Lohn and Anna Pryor",
  title = 		 "Scheduling Earth Observing Satellites with Evolutionary Algorithms",
  booktitle =	 "Conference on Space Mission Challenges for Information Technology  (SMC-IT)",
  year =		 2003
}

@Book{gondran,
  author = 		 "M. Gondran and M. Minoux",
  title = 		 "Graphs and Algorithms",
  publisher = 	 "John Wiley and Sons",
  year = 		 1984
}

@PhdThesis{green,
  author = 		 "C. C. Green",
  title = 		 "The application of theorem proving to question
				  answering systems",
  school = 		 "Stanford University",
  year = 		 1969,
  address =		 "Stanford, CA"
}

% *** HHHHHHHHHHHH ***************************************************

@PhdThesis{harvey,
  author = 		 "William D. Harvey",
  title = 		 "Nonsystematic Backtracking Search",
  school = 		 "Stanford University",
  year = 		 1995,
  address =		 "Stanford, CA"
}

@Book{hentenryck89,
  author = 		 "P. {Van Hentenryck}",
  title = 		 "Constraint Satisfaction in Logic Programming",
  publisher = 	 "MIT Press",
  year = 		 1989,
  address =		 "Cambridge, MA"
}

@Article{hentenryck91,
  author = 		 "P. {Van Hentenryck}",
  title = 		 "Constraint satisfaction using constraint logic programming",
  journal =		 "Artificial Intelligence",
  year =		 1992,
  volume =		 58,
  number =		 "1-3",
  pages =		 "113-159",
  month =		 "Dec."
}

@TechReport{hentenryck93,
  author = 		 "Pascal {Van Hentenryck} and Vijay Saraswat and Yves Devill",
  title = 		 "Design, Implementations, and Evaluation of the
				  Constraint Language {\tt cc(FD)}",
  institution =  "Computer Science Department, Brown University",
  year = 		 1993,
  number =		 "CS-93-02"
}

@Book{hillier,
  author = 		 "Frederick S. Hillier and Gerald J. Lieberman",
  title = 		 "Introduction to Operations Research",
  publisher = 	 "Holden-Day",
  year = 		 1986,
  address =		 "Ann Arbor, MI"
}

@Book{Holland1975,
  author = 		 "J. H. Holland",
  title = 		 "Adaptation in Natural and Artificial Systems",
  publisher = 	 "University of Michigan Press",
  year = 		 1975,
  address =		 "Oakland,CA"
}
@Article{hogg,
  author = 		 "Tad Hogg and Colin P. Williams",
  title = 		 "The hardest constraint problems: A double phase transition",
  journal =		 ai,
  year =		 1994,
  volume =		 69,
  pages =		 "359-377"
}


@Article{Husbands1994,
  author = 		 "P. Husbands",
  title = 		 "Genetic Algorithms for Scheduling",
  journal =		 "AISR Quarterly",
  year =		 1994,
 number =		 "89",
 }

% *** JJJJJJJJJJJJ ***************************************************


@Article{jaffar87,
  author = 		 "J. Jaffar and J. L. Lassez",
  title = 		 "Constraint Logic Programming",
  journal =		 "Proceedings of POPL",
  year =		 1987
}

@Article{Joslin1999,
  author = 		 "D. E. Joslin and D. P. Clements",
  title = 		 "Squeaky Wheel Optimization",
  journal =		 "Journal of Artificial Intelligence Research",
  year =		 1999,
  volume =		 10,
  pages =		 "353-373"
}

@Article{jaffar94,
  author = 		 "Joxan Jaffar and Michael Maher",
  title = 		 "Constraint Logic Programming: A Survey",
  journal =		 "Journal of Logic Programming",
  year =		 1994,
  volume =		 "19/20",
  pages =		 "503--581"
}

@InProceedings{jonsson92,
  author = 		 "Ari K. J\'onsson and Matthew L. Ginsberg",
  title = 		 "Experimenting with new systematic and nonsystematic
				  search techniques",
  booktitle =	 "Proceedings of the AAAI Spring Symposium on AI and
				  NP-Hard Problems",
  year =		 1992,
  address =		 "Stanford, CA"
}

@InProceedings{jonsson96,
  author = 		 "Ari K. J\'onsson and Matthew L. Ginsberg",
  title = 		 "Procedural Reasoning in Constraint Satisfaction",
  booktitle =	 kr96,
  year =		 1996
}

@Manual{jonsson96b,
  title = 	 {The CSPC Compiler - User's Manual},
  author =	 {Ari K. J\'onsson},
  note =       {Can be downloaded from {\tt
                  http://www.cirl.uoregon.edu/jonsson/cspc}}
}

@PhdThesis{jonsson97,
  author = 		 "Ari K. J\'onsson",
  title = 		 "Procedural Reasoning in Constraint Satisfaction",
  school = 		 "Stanford University",
  year = 		 1996,
  address =		 "Stanford, CA",
}

@inproceedings{joslin,
  author =	 	 "David Joslin and Martha Pollack",
  title	=	 	 "Passive and Active Decision Postponement in Plan Generation",
  booktitle =	 "Preprints of the Proceedings of the Third European
	     	 	 Workshop on Planning", 
  year	= 	 	 1995,
  pages	= 	 	 "57-68",
}

% *** KKKKKKKKKKKK ***************************************************

@Article{kambhampati,
  author = 		 "Subbarao Kambhampati and Craig A. Knoblock and Qiang Yang",
  title = 		 "Planning as refinement search: a unified framework for 
                 evaluating design tradeoffs in partial-order planning",
  journal =		 ai,
  year =		 1995,
  volume =		 76,
  number =		 "1-2",
  pages =		 "167-238",
  month =		 "July"
}

@InProceedings{kautz92,
  author = 		 "Henry Kautz and Bart Selman",
  title = 		 "Planning as Satisfiability",
  pages =		 "359-379",
  booktitle =	 "Proceedings of the Tenth European Conference on
        	     Artificial Intelligence",
  year =		 1992
}

@InProceedings{kautz96,
  author = 		 "Henry Kautz and Bart Selman",
  title = 		 "Pushing the Envelope: Planning, Propositional Logic, and
	             Stochastic Search",
  booktitle =	 aaai96,
  year =		 1996,
}

@Article{Kirkpatrick1983,
  author = 		 "S. Kirkpatrick and C. D. Gelatt and M.P. AndVecchi",
  title = 		 "Optimization by Simulated Annealing",
  journal =		 "Science",
  year =		 1983,
  volume =		 220,
number = 4598,
month = "May",
  pages =		 "671-680"
}

@InProceedings{kondrak,
  author = 		 "Grzegorz Kondrak and Peter {van Beek}",
  title = 		 "A Theoretical Evaluation of Selected Backtracking
				  Algorithms",
  booktitle =	 ijcai95,
  year =		 1995
}

@article{korf,
  author = "Richard E. Korf",
  title = "Depth-First Iterative Deepening: {A}n Optimal Admissible Tree
  	   Search",
  journal = ai,
  year = 1985,
  volume = 27,
  pages = "97-109"}



@InProceedings{korf96,
  author = 		 "Richard E. Korf",
  title = 		 "Improved Limited Discrepancy Search",
  pages =		 "286-291",
  booktitle =	 aaai96,
  year =		 1996
}
 
@InProceedings{kramer2003,
  author = 		 "Laurence Kramer and Stephen Smith",
  title = 		 "Maximizing Flexibility: A Retraction Heuristic for Oversubscribed Scheduling Problems",
  pages =		 "286-291",
  booktitle =	 "Proceedings of the Eighteenth International Joint Conference on Artificial Intelligence",
  year =		 2003,
month = "August"
}

@Article{kumar,
  author = 		 "Vipin Kumar",
  title = 		 "Algorithms for constraint-satisfaction problems:  A
				  survey",
  journal =		 "AI Magazine",
  year =		 1992,
  volume =		 13,
  number =		 1,
  pages =		 "32-44"
}

% *** LLLLLLLLLLLL ***************************************************

@InProceedings{Lamaitre1998,
  author = 		 "M. Lamaitre and G. Verfaillie and N. Bataille",
  title = 		 "Sharing the Use of a Satellite: an Overview of Methods",
  booktitle =	 "SpaceOps 1998",
  year =		 1998
}

@Article{Bensana1999,
  author = 		 "E. Bensana and M. Lemaitre and G. Verfaillie",
  title = 		 "Earth observation satellite management",
  journal =		 "Constraints",
  year =		 1999,
  volume =		 4,
number= 3,
pages= "293-399"
}

@InProceedings{Lamaitre2000,
  author = 		 "M. Lamaitre and G. Verfaillie and J. Frank and J. Lachiver and N. Bataille",
  title = 		 "How to Manage the New Generation of Agile Earth Observation Satellites",
  booktitle =	 "Proceedings of the International Symposium on Artificial Intelligence, Robotics and Automation in Space",
  year =		 2000
}

@InProceedings{langley,
  author = 		 "Pat Langley",
  title = 		 "Systematic and Nonsystematic Search Strategies",
  pages =		 "145-52",
  booktitle =	 "Artificial Intelligence Planning Systems:
				  Proceedings of the First International Conference",
  year =		 1992,
  publisher =	 "Morgan Kaufmann"
}

% *** MMMMMMMMMMMM ***************************************************


@InCollection{maluszynski,
  author = 		 "Jan Maluszynski and Staffan Bonnier and Johan Boye and
				  Feliks Kluzniak and Andreas Kagedal and Ulf Nilsson",
  title = 		 "Logic Programs with External Procedures",
  booktitle =	 "Logic Programming Constraints, Functions, and Objects",
  publisher =	 "MIT Press",
  year =		 1993,
  editor =		 "K. R. Apt and J.W. de Bakker and J. J. M. M. Rutten",
  pages =		 "21-48",
  address =		 "Cambridge, MA"
}

@InCollection{massat,
  author = 		 "J. L. Massat",
  title = 		 "Using Local Consistency Techniques to Solve Boolean
				  Constraints",
  booktitle =	 "Constraint Logic Programming: Selected Research",
  publisher =	 "MIT Press",
  year =		 1993,
  editor =		 "F. Benhamou and A. Colmerauer",
  chapter =		 12,
  pages =		 "223-35",
  address =		 "Cambridge, MA"
}

@InProceedings{minton90,
  author = 		 "Steven Minton and Mark D. Johston and Andrew
				  B. Philips and Philip Laird",
  title = 		 "Solving Large-Scale Constraint Satisfaction and
				  Scheduling Problems using a Heuristic Repair Method",
  pages =		 "17-24",
  booktitle =	 aaai90,
  year =		 1990
}

@Article{minton94,
  author = 		 "Steven Minton and John Bresina and Mark Drummond",
  title = 		 "Total-Order and Partial Order Planning: A
				  Comparative Analysis",
  journal =		 jair,
  year =		 1994,
  volume =		 2,
  pages =		 "227-262"
}

@InProceedings{mitchell,
  author = 		 "David Mitchell and Bart Selman and Hector Levesque",
  title = 		 "Hard and easy distributions of SAT problems",
  pages =		 "459-465",
  booktitle =	 aaai92,
  year =		 1992
}

@InCollection{montanari,
  author = 		 "U. Montanari and F. Rossi",
  title = 		 "Finite Domain Constraint Solving and Constraint
				  Logic Programming",
  booktitle =	 "Constraint Logic Programming: Selected Research",
  publisher =	 "MIT Press",
  year =		 1993,
  editor =		 "F. Benhamou and A. Colmerauer",
  chapter =		 11,
  pages =		 "201-22",
  address =		 "Cambridge, MA"
}

@InProceedings{muscettola94b,
  author = 		 "Nicola Muscettola",
  title = 		 "On the Utility of Bottleneck Reasoning for Scheduling",
  pages =		 "1105-10",
  booktitle =	 aaai94,
  year =		 1994
}

@article{myers,
  author = "Karen L. Myers",
  title = "Hybrid reasoning using universal attachment",
  journal = ai,
  year = 1994,
  volume = 67,
  pages = "329-375"}




% *** PPPPPPPPPPPP ***************************************************


@Book{pearl,
  author = 		 "Judea Pearl",
  title = 		 "Heuristics:  Intelligent Search Strategies for
				  Computer Problem Solving",
  publisher = 	 "Addison-Wesley",
  year = 		 1984,
  address =		 "Reading, MA"
}

@InProceedings{Potin1998,
  author = 		 "P. Potin",
  title = 		 "End-To-End Planning Approach for Earth Observation Mission Exploitation",
  booktitle =	 "SpaceOps 1998",
  year =		 1998,
}

@InProceedings{Potter1998,
  author = 		 "W. Potter and J. Gasch",
  title = 		 "A Photo Album of Earth: Scheduling Landsat 7 Mission Daily Activities",
  booktitle =	 "SpaceOps 1998",
  year =		 1998
}

@InCollection{pravitz,
  author = 		 "D. Pravitz",
  title = 		 "An improved proof pocedure",
  booktitle =	 "Automation of Reasoning. Classical Papers on Computational Logic",
  publisher =	 "Springer Verlag",
  year =		 1983,
  editor =		 "Siekmann and Wrightson"
}




@InProceedings{prosser93a,
  author = 		 "Patrick Prosser",
  title = 		 "Domain filtering can degrade intelligent
				  backtracking search",
  pages =		 "262-267",
  booktitle =	 "Proceedings of the Thirteenth International Joint
				  Conference on Artificial Intelligence",
  year =		 1993
}

@Article{prosser93b,
  author = 		 "P. Prosser",
  title = 		 "Hybrid Algorithms for the Constraint Satisfaction Problem",
  journal =		 "Computational Intelligence",
  year =		 1993,
  volume =		 9,
  number =		 3,
  pages =		 "268-299"
}

% *** RRRRRRRRRRRR ***************************************************

@InProceedings{Rao1998,
  author = 		 "J. D. Rao and P. Soma and G. S. Padmashree",
  title = 		 "Multi-Satellite Scheduling System for LEO Satellite Operations",
  booktitle =	 "SpaceOps 1998",
  year =		 1998,
}

@TechReport{ringeissen,
  author = 		 "Christophe Ringeissen",
  title = 		 "Cooperation of Decision Procedures for the
				  Satisfiability Problem",
  institution =  "Natl Inst Res Comp \& Ctl Sci, France",
  year = 		 "??"
}

% *** SSSSSSSSSSSS ***************************************************

@InProceedings{sabin,
  author = 		 "Daniel Sabin and Eugene C. Freuder",
  title = 		 "Contradicting Conventional Wisdom in Constraint
				  Satisfaction",
  editor =		 "A. Cohn",
  booktitle =	 "Proceedings of the 11th European conference on
				  Artificial Intelligence",
  year =		 1994,
  publisher =	 "John Wiley \& Sons",
  address =		 "Chichester"
}

@InProceedings{sacerdoti,
  author = 		 "Earl Sacerdoti",
  title = 		 "The Nonlinear Nature of Plans",
  pages =		 "206-214",
  booktitle =	 "Proceedings of the Fourth International Joint
				  Conference on Artificial Intelligence",
  year =		 1975
}



@TechReport{sadeh92,
  author = 		 "Norman Sadeh",
  title = 		 "Look-Ahead Techniques for Micro-Opportunistic Job
				  Shop Scheduling",
  institution =  "School of Computer Science, Carnegie Mellon University",
  year = 		 1992,
  number =		 "CMU-CS-91-102"
}

@Article{sadeh96,
  author = 		 "Norman Sadeh and Mark S. Fox",
  title = 		 "Variable and Value Ordering Heuristics for the Job
				  Shop Scheduling Constraint Satisfaction Problem",
  journal =		 "Artificial Intelligence",
  year =		 1996,
  volume =		 86,
  pages =		 "1-41"
}

@InProceedings{schubert,
  author = 		 "Lenhart Schubert",
  title = 		 "Monotonic Solution of The Frame Problem in the
				  Situation Calculus: An efficient method for worlds
				  with fully specified actions",
  editor =		 "H. E. Kyburg, Jr. et al.",
  pages =		 "23-26",
  booktitle =	 "Knowledge Representation and Defeasible Reasoning",
  year =		 1990,
  publisher =	 "Kluwer Academic Publisher",
  address =		 "The Netherlands"
}

@InProceedings{selman93,
  author = 		 "Bart Selman and Henry A. Kautz and Bram Cohen",
  title = 		 "Local Search Strategies for Satisfiability Testing",
  booktitle =	 "Proceedings 1993 DIMACS Workshop on Maximum Clique,
				  Graph Coloring, and Satisfiability",
  year =		 1993
}



@InProceedings{selman94,
  author = 		 "Bart Selman and Henry Kautz and B. Cohen",
  title = 		 "Noise Strategies for Local Search for Satisfiability
				  Testing",
  booktitle =	 aaai94,
  year =		 1994
}


@PhdThesis{sikka,
  author = 		 "Vishal Sikka and Michael Genesereth",
  title = 		 "Integrating Specialized Procedures in Proof Systems",
  school = 		 "Stanford University",
  year = 		 "1995 (DRAFT)",
  address =		 "Stanford, CA"
}


@InProceedings{Sherwood1998,
  author = 		 "R. Sherwood and A. Govindjee and D. Yan and G. Rabideau and S. Chien and A.
Fukunaga",
  title = 		 "Using ASPEN to Automate EO-1 Activity Planning",
  booktitle =	 "Proceedings of the 1998 IEEE Aerospace Conference",
  year =		 1998
}


@InProceedings{Smith2004,
  author = 		 "David E. Smith",
  title = 		 "Choosing Objectives in Over-Subscription Planning",
  booktitle =	 "14th International Conference on Automated Planning \& Scheduling",
  year =		 2004,
note=			"Submitted"
}

@TechReport{smithd87,
  author = 		 "Douglas R. Smith",
  title = 		 "Structure and Desgin of Global Search Algorithms",
  institution =  "Kestrel Institute",
  year = 		 1987,
  number =		 "KES.U.87.12",
  month =		 "November"
}

@InCollection{smithd95,
  author = 		 "Douglas R. Smith and Stephen J. Westfold",
  title = 		 "Synthesis of Constraint Algorithms",
  booktitle =	 "Principles and Practice of Constraint Programming",
  publisher =	 "The MIT Press",
  year =		 1995,
  editor =		 "Vijay Saraswat and Pascal {Van Hentenryck}",
  pages =		 "171-182",
  address =		 "Cambridge, MA"
}

@InProceedings{smiths,
  author = 		 "Stephen F. Smith and Cheng-Chung Cheng",
  title = 		 "Slack-Based Heuristics for Constraint Satisfaction
				  Scheduling",
  pages =		 "139-44",
  booktitle =	 aaai93,
  year =		 1993
}
@InProceedings{smith2001,
author = "B. Smith and B. Engelhardt and D. Mutz",
title = "Reducing Costs of the Modified Antarctic Mapping Mission through Automated Planning", booktitle = "Fourth International Symposium on Reducing the Cost of Spacecraft Ground Systems and Operations, 2001",
year = 2001
}

@InCollection{smolka,
author  = "Gert Smolka",
title   = "The {Oz} Programming Model",
booktitle = "Computer Science Today",
editor  = "Jan van Leeuwen",
address = "Berlin",
year    = 1995,
series  = {Lecture Notes in Computer Science, vol. 1000},
publisher = "Springer-Verlag",
pages = {324--343},
filename = "volume1000.ps.Z",
directory = "ProgrammingSysLab"
}

@Article{stallman,
  author = 		 "Richard M. Stallman and Gerald J. Sussman",
  title = 		 "Forward Reasoning and Depen\-dency-Directed
				  Backtracking in a System for Computer-Aided Circuit
				  Analysis",
  journal =		 ai,
  year =		 1977,
  volume =		 9,
  pages =		 "135-96"
}

@Article{steel,
  author = 		 "S. Steel",
  title = 		 "Satisfying disjunctions of constraints by specialized 
                 resolution",
  journal =		 "Research and Development in Expert Systems IV. Proceedings of
                 Expert Systems '87, Seventh Annual Technical Conference of the
                 British Computer Society Specialist Group on Expert Systems",
  year =		 1988
}

@InProceedings{Syswerda1991,
  author = 		 "G. Syswerda and J. Palmucci",
  title = 		 "The Application of Genetic
Algorithms to Resource Scheduling",
  pages =		 "502-508",
  booktitle =	 "Proceedings of the Fourth International Conference on Genetic Algorithms",
  year =		 1991
}


% *** TTTTTTTTTTTT ***************************************************

@TechReport{tate,
  author = 		 "Austin Tate and Brian Drabble and Jeff Dalton",
  title = 		 "Reasoning with Constraints Within {O-Plan2}",
  institution =  "Artificial Intelligence Applications Institute,
				  University of Edinburgh",
  year = 		 1994,
  number =		 "ARPA-RL/O-Plan2/TP/6 Version 1"
}

@Book{tsang,
  author = 		 "Edward Tsang",
  title = 		 "Foundations of Constraint Satisfaction",
  publisher = 	 "Academic Press",
  year = 		 1993,
  address =		 "London"
}

% *** VVVVVVVVVVVV ***************************************************

@PhdThesis{veloso,
  author = 		 "Manuela Veloso",
  title = 		 "Learning by Analogical Reasoning in General Problem
				  Solving", 
  school = 		 "CMU",
  year = 		 1992,
  note =		 "CS Technical Report CMU-CS-92-174"
}

@PhdThesis{vishal,
  author = 		 "Vishal Sikka",
  title = 		 "Integrating Specialized Procedures into Proof
                          Systems", 
  school = 		 "Stanford University",
  year = 		 1997,
}

% *** WWWWWWWWWWWW ***************************************************

@inproceedings{ watson99algorithm,
    author = "Jean-Paul Watson and Laura Barbulescu and Adele E. Howe and Darrell Whitley",
    title = "Algorithm Performance and Problem Structure for Flow-shop Scheduling",
    booktitle = "{AAAI}/{IAAI}",
    pages = "688-695",
    year = "1999",
    url = "citeseer.nj.nec.com/watson99algorithm.html"
 }

@Article{weyhrauch,
  author = 		 "R. W. Weyhrauch",
  title = 		 "Prolegomena to a theory of mechanized formal reasoning",
  journal =		 "Artificial Intelligence",
  year =		 1980,
  volume =		 13,
  pages =		 "133-170"
}



@Unpublished{who,
  author = 		 {Unknown},
  title = 		 {Bib-entry to come},
  note = 		 {FIX}
}

@Article{wilk,
  author = 		 "M.R. Wilk",
  title = 		 " Equate: an object-oriented constraint solver",
  journal =		 "SIGPLAN Notices",
  year =		 1991,
  volume =		 26,
  number =		 11,
  pages =		 "286-98",
  month =		 "Nov"
}

@Article{wilkins,
  author = 		 "David Wilkins",
  title = 		 "Domain-independent Planning: Representation and Plan
				  Generation",
  journal =		 ai,
  year =		 1984,
  volume =		 22,
  pages =		 "269-301"
}

@ Article{Wolfe2000,
  author = 		 "W. J. Wolfe and S. E. Sorensen",
  title = 		 "Three Scheduling Algorithms Applied to the Earth Observing Systems Domain",
  journal =	 "Management Science",
pages= "148-168",
volume= 46,
number= 1,
  year =		 2000
}


@InProceedings{wurtz,
  author =       {J. W{\"u}rtz},
  title =        {Constraint-Based Scheduling in {Oz}},
  booktitle =    {Symposium on Operations Research},
  year =         {1997},
  publisher =    {LNCS, Springer-Verlag},
  address =      {Braunschweig, Germany},
  OPTpages =     {},
  note =         {To appear}
}