Bibliography

Badros and Borning1998

Greg J. Badros and Alan Borning.
The Cassowary Linear Arithmetic Constraint Solving Algorithm: Interface and Implementation.
Technical Report 98-06-04, University of Washington, Department of Computer Science and Engineering, June 1998.

Bayardo and Schrag1997

R. Bayardo and R. Schrag.
Using CSP look-back techniques to solve real-world SAT instances.
In Proceedings of the Fourteenth National Conference on Artificial Intelligence, pages 203-208, Providence, R.I., July 1997. Menlo Park, Calif.: AAAI Press.

Blum and Furst1995

A. Blum and M. Furst.
Fast planning through planning graph analysis.
In Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence, pages 1636-1642. San Francisco, Calif.: Morgan Kaufmann, 1995.

Borning et al.1997

Alan Borning, Kim Marriott, Peter Stuckey, and Yi Xiao.
Solving linear arithmetic constraints for user interface applications.
In Proceedings of the 1997 ACM Symposium on User Interface Software and Technology, October 1997.

Cook and Mitchell1997

S. Cook and D. Mitchell.
Finding hard instances of the satisfiability problem: A survey.
Proceedings of the DIMACS Workshop on Satisfiability Problems, pages 11-13, 1997.

Crawford and Auton1993

J. Crawford and L. Auton.
Experimental results on the cross-over point in satisfiability problems.
In Proceedings of the Eleventh National Conference on Artificial Intelligence, pages 21-27. Menlo Park, Calif.: AAAI Press, 1993.

Currie and Tate1991

K. Currie and A. Tate.
O-plan: the open planning architecture.
Artificial Intelligence, 52(1):49-86, November 1991.

Ernst et al.1997

M. Ernst, T. Millstein, and D. Weld.
Automatic SAT-compilation of planning problems.
In Proceedings of the Fifteenth International Joint Conference on Artificial Intelligence, pages 1169-1176. San Francisco, Calif.: Morgan Kaufmann, 1997.

Falkenhainer and Forbus1988

B. Falkenhainer and K. Forbus.
Setting up large scale qualitative models.
In Proceedings of the Seventh National Conference on Artificial Intelligence, pages 301-306. Menlo Park, Calif.: AAAI Press, August 1988.

Gomes et al.1998

C.P. Gomes, B. Selman, and H. Kautz.
Boosting combinatorial search through randomization.
In Proceedings of the Fifteenth National Conference on Artificial Intelligence, pages 431-437, Madison, WI, July 1998. Menlo Park, Calif.: AAAI Press.

Hooker et al.1999

J.N. Hooker, G. Ottosson, E.S. Thorsteinsson, and H. Kim.
On integrating constraint propagation and linear programming for combinatorial optimization.
In Proceedings of the Sixteenth National Conference on Artificial Intelligence, Orlando, Florida, July 1999. Menlo Park, Calif.: AAAI Press.

Jaffar et al.1992

Joxan Jaffar, Spiro Michaylov, Peter Stuckey, and Roland Yap.
The CLP($\cal R$) Language and System.
ACM Transactions on Programming Languages and Systems, 14(3):339-395, July 1992.

Karloff1991

H. Karloff.
Linear Programming.
Birkhäuser, Boston, 1991.

Kautz and Selman1996

H. Kautz and B. Selman.
Pushing the envelope: Planning, propositional logic, and stochastic search.
In Proceedings of the Thirteenth National Conference on Artificial Intelligence, pages 1194-1201. Menlo Park, Calif.: AAAI Press, 1996.

Kautz and Selman1998

H. Kautz and B. Selman.
Blackbox: A new approach to the application of theorem proving to problem solving.
In AIPS98 Workshop on Planning as Combinatorial Search, pages 58-60. Pittsburgh, Penn.: Carnegie Mellon University, June 1998.

Kautz and Walser1999

H. Kautz and J.P. Walser.
State-space planning by integer optimization.
In Proceedings of the Sixteenth National Conference on Artificial Intelligence, Orlando, Florida, July 1999. Menlo Park, Calif.: AAAI Press.

Koehler et al.1997

J. Koehler, B. Nebel, J. Hoffmann, and Y Dimopoulos.
Extending planning graphs to an ADL subset.
In Proceedings of the Fourth European Conference on Planning, pages 273-285. Berlin, Germany: Springer-Verlag, Sept 1997.

Koehler1998

J. Koehler.
Planning under resource constraints.
In Proceedings of the Thirteenth European Conference on Artificial Intelligence, pages 489-493. Chichester, UK: John Wiley & Sons, 1998.

Li and Anbulagan1997

C. Li and Anbulagan.
Heuristics based on unit propagation for satisfiability problems.
In Proceedings of the Fifteenth International Joint Conference on Artificial Intelligence, pages 366-371. San Francisco, Calif.: Morgan Kaufmann, August 1997.

Majercik and Littman1998

S. M. Majercik and M. L. Littman.
MAXPLAN: a new approach to probabilistic planning.
In Proceedings of the Fourth International Conference on Artificial Intelligence Planning Systems, pages 86-93. Menlo Park, Calif.: AAAI Press, June 1998.

McDermott1998

Drew McDermott.
PDDL -- The Planning Domain Definition Language.
AIPS-98 Competition Committee, draft 1.6 edition, June 1998.

Nelson and Oppen1979

Greg Nelson and Derek C. Oppen.
Simplification by cooperating decision procedures.
ACM Transactions on Programming Languages and Systems, 1(2):245-257, October 1979.

Penberthy and Weld1994

J.S. Penberthy and D. Weld.
Temporal planning with continuous change.
In Proceedings of the Twelfth National Conference on Artificial Intelligence. Menlo Park, Calif.: AAAI Press, July 1994.

Saraswat1989

Vijay A. Saraswat.
Concurrent Constraint Programming Languages.
PhD thesis, Carnegie-Mellon University, Computer Science Department, January 1989.

Selman et al.1996

B. Selman, H. Kautz, and B. Cohen.
Local search strategies for satisfiability testing.
DIMACS Series in Discrete Mathematics and Theoretical Computer Science, 26:521-532, 1996.

Selman et al.1997

Bart Selman, Henry Kautz, and David McAllester.
Computational challenges in propositional reasoning and search.
In Proceedings of the Fifteenth International Joint Conference on Artificial Intelligence, pages 50-54. San Francisco, Calif.: Morgan Kaufmann, 1997.

Van Hentenryck1989

Pascal Van Hentenryck.
Constraint Satisfaction in Logic Programming.
MIT Press, Cambridge, MA, 1989.

Van Hentenryck1997

P. Van Hentenryck.
Numerica: A modeling language for global optimization.
In Proceedings of the Fifteenth International Joint Conference on Artificial Intelligence, 1997.

Vossen et al.1999

T. Vossen, M. Ball, A. Lotem, and D. Nau.
On the use of integer programming models in ai planning.
In Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence, Stockholm, Sweden, Aug 1999. San Francisco, Calif.: Morgan Kaufmann.

Wilkins1990

D. Wilkins.
Can AI planners solve practical problems?
Computational Intelligence, 6(4):232-246, November 1990.

Wolfman and Weld1999

S. Wolfman and D. Weld.
The LPSAT system and its Application to Resource Planning.
Technical Report 99-04-04, University of Washington, Department of Computer Science and Engineering, April 1999.