1. Apt, K. R. and Bezem, M., “Acyclic Programs,”New Generation Computing, 9, 3–4 pp. 335–363, 1991.
2. Body, M. and Dean, T., “Solving Time-Dependent Planning Problems,” inProc. 11th International Joint Conf. on Artificial Intelligence, Detroit, MI, pp. 979–984, August 1989.
3. Charniak, E. and Shimony, S. E., “Probabilistic Semantics for Cost Based Abduction,” inProc. 8th National Conference on Artificial Intelligence, Boston, pp. 106–111, July 1990.
4. Clark, K. L., “Negation as Failure,” inLogic and Databases (H. Gallaire and J. Minker, eds.), Plenum Press, New York, pp. 293–322, 1978.
5. Console, L., Theseider Dupre, D. and Torasso, P., “On the Relationship between Abduction and Deduction,”Journal of Logic and Computation, 1, 5, pp. 661–690, 1991.