Kambhampati, S. (1998). On the relations between intelligent backtracking and explanation-based learning in planning in constraint satisfaction. Artifical Intelligence, 105(1-2).

Kambhampati, S. (1999). Improving graphplan's search with ebl & ddb techniques. In *Proc. IJCAI99*.

Kambhampati, S., Katukam, S., & Qu, Y. (1997). Failure driven dynamic search control for partial order planners: An explanation-based approach. *Artificial Intelligence,* 88(1-2), 253–215.

Kambhampati, S., & Nigenda, R. (2000). Distance-based goal ordering heuristics for graphplan. In Proc. 5th International Conference on AI Planning and Scheduling.

Kambhampati, S., Parker, E., & Lambrecht, E. (1997). Understanding and extending graphplan.

In *Proceedings of 4th European Conference on Planning*. URL: rakaposhi.eas.asu.edu/ewspgraphplan.ps.

Kautz, H., & Selman, B. (1996). Pushing the envelope: Plannng, propositional logic and stochastic search. In *Proc. AAAI-96*.

Kautz, H., & Selman, B. (1999). Blackbox: Unifying sat-based and graph-based planning. In *Proc.*
IJCAI-99.

Koehler, J., Nebel, B., Hoffman, J., & Dimopoulos, Y. (1997). Extending planning graphs to an adl subset. Tech. rep. 88, Albert Ludwigs University.

Li, C., & Anbulagan (1997). Heuristics based on unit propagation for satisfiability problems. In Proc. IJCAI-97.

McDermott, D. (1998). Aips-98 planning competition results.

ftp.cs.yale.edu/pub/mcdermott/aipscomp-results.html.

McDermott, D. (1999). Using regression graphs to control search in planning. Aritificial Intelligence, 109(1-2), 111–160.

Mittal, S., & Falkenhainer, B. (1990). Dynamic constraint satisfaction problems. In *Proc. AAAI-90*.

Nguyen, X., & Kambhampati, S. (2000). Extracting effective and admissible state-space heuristics from the planning graph. Tech. rep. ASU CSE TR 00-03, Arizona State University.

Prosser, P. (1993). Domain filtering can degrade intelligent backtracking search. In *Proc. IJCAI-93*. Rymon, R. (1992). Set enumeration trees. In *Proc. KRR-92*.

Schiex, T., & Verfaillie, G. (1993). Nogood recording for static and dynamic constraint satisfaction problems. In *Proc. 5th intl. conference on tools with artificial intelligence*.

Selman, B., Levesque, H., & Mitchell, D. (1992). GSAT: a new method for solving hard satisfiability problems. In *In Proc. AAAI-92*.

Smith, D., & Weld, D. (1999). Temporal planning with mutual exclusion reasoning. In Proc.

IJCAI-99.