Synthesis of efficient constraint-satisfaction programs

Knowledge Engineering Review

Volumn 16, Issue 1, 2001, Pages 69-84

  Westfold, Stephen J ^a   Smith, Douglas R ^a  

^a KESTREL INSTITUTE   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

LINEAR PROGRAMMING; PROBLEM SOLVING; SCHEDULING; SET THEORY;

CONSTRAINT-SATISFACTION PROGRAMS; SOFTWARE SYNTHESIS;

CONSTRAINT THEORY;

EID: 0346276481     PISSN: 02698889     EISSN: None     Source Type: Journal    
DOI: 10.1017/S0269888901000029     Document Type: Article

References (23)

1. Applegate, D and Cook, W, 1991, "A computational study of the job-shop scheduling problem" ORSA Journal on Computing 3(2) 149-156.
2. Benhamou, F, McAllester, D and Van Hentenryck, P, 1994, "Clp(intervals) revisited" Technical Report CS-94-18, Department of Computer Science, Brown University, April 1994.
3. Blum, A and Furst, M "Fast planning through planning graph analysis" Artificial Intelligence 90(1) 281-300.
4. Burstein, MH and Smith, D, 1996, "ITAS: a portable interactive transportation scheduling tool using a search engine generated from formal specifications" Proceedings of the Third International Conference on Artificial Intelligence Planning System (AIPS-96) 35-44.
5. Cai, J and Paige, R, 1989, "Program derivation by fixed point computation" Science of Computer Programming 11 197-261.
6. Emerson, T and Burstein, M, 1999, "Development of a constraint-based airlift scheduler by program synthesis from formal specifications" Proceedings of the Fourteenth Automated Software Engineering Conference 267-270.
7. Fox, MS, Sadeh, N and Baykan, C, 1989, "Constrained heuristic search" Proceedings of the Eleventh International Joint Conference on Artificial Intelligence 309-315.
8. Fox, MS and Smith, SF, 1984, "ISIS - a knowledge-based system for factory scheduling" Expert Systems 1(1) 25-49.
9. Hyvönen, E, 1992, "Constraint reasoning based on interval arithmetic: the tolerance propagation approach Artificial Intelligence 58 71-112; also in: E Freuder and A Mackworth (eds) Constraint-Based Reasoning MIT Press.
10. Hyvönen, E, 1992, "Constraint reasoning based on interval arithmetic: the tolerance propagation approach Artificial Intelligence 58 71-112; also in: E Freuder and A Mackworth (eds) Constraint-Based Reasoning MIT Press.
11. Kambhampati, S, Lambrecht, E and Parker, E, 1997, "Understanding and extending graphplan" Proceedings of the 4th European Conference on Planning 260-272.
12. Luenberger, DG, 1989, Linear and Nonlinear Programming Addison-Wesley Publishing Company, Inc.
13. Mackworth, AK, 1992, "The logic of constraint satisfaction" Artificial Intelligence 58 3-20.
14. Nemhauser, GL and Wolsey, LA, 1988, Integer and Combinatorial Optimization John Wiley & Sons, Inc.
15. Rehof, J and Mogenson, T, 1999, "Tractable constraints in finite semi-lattices" Science of Computer Programming 35 191-221.
16. Smith, DR, 1987, "Structure and design of global search algorithms" Technical Report KES.U.87.12, Kestrel Institute.
17. Smith, DR, Parra, EA and Westfold, SJ, 1996, "Synthesis of planning and scheduling software" in A Tate (ed.) Advanced Planning Technology AAAI Press.
18. Smith, DR and Westfold, SJ, 1995, "Synthesis of constraint algorithms" in V Saraswat and P Van Hentenryck (eds) Principles and Practice of Constraint Programming The MIT Press.
19. Smith, SF, 1989, "The OPIS framework for modeling manufacturing systems" Technical Report CMU-RI-TR-89-30, The Robotics Institute, Carnegie-Mellon University.
20. Smith, SF, Fox, MS and Ow, PS, 1986, "Constructing and maintaining detailed production plans: investigations into the development of knowledge-based factory scheduling systems" AI Magazine 7(4) 45-61.
21. Srivastiva, B and Kambhampati, S, 1998, "Synthesizing customizable planners from specifications" Journal of A.I. Research 8 93-128; http://www.cs.washington.edu/research/jair/volume8/srivastava98a.ps.
22. Van Hentenryck, P, 1989, Constraint Satisfaction in Logic Programming Massachusetts Institute of Technology.
23. Van Hentenryck, P, McAllester, D and Kapur, D, 1995, "Solving polynomial systems using a branch and prune approach" SIAM Journal of Numerical Analysis 797-827.