\begin{thebibliography}{McC88b}

\bibitem[Acz77]{Acz77}
Peter Aczel.
\newblock An introduction to inductive definitions.
\newblock In J.~Barwise, editor, {\em Handbook of Mathematical Logic},
  volume~90 of {\em Studies in Logic and the Foundations of Mathematics},
  chapter C.7, pages 739--782. North-Holland, Amsterdam, 1977.

\bibitem[AMP91]{Aronson91}
Hallnass~L. Aronson~M., Eriksson L-H. and Kreuger P.
\newblock A survey of gcla: a definitional approach to logic programming.
\newblock In Peter Schroeder-Heister, editor, {\em Proceedings of the First
  International Workshop on Extensions of Logic Programming}, volume 1050 of
  {\em 475}, pages 19--34, Berlin, March28--30~ 1991. Springer.

\bibitem[BM90]{Bonner90}
Anthony~J. Bonner and L.~Thorne McCarty.
\newblock Adding negation-as-failure to intuitionistic logic programming.
\newblock In Saumya~Hermenegildo Manuel~Debray, editor, {\em Proceedings of the
  1990 North American Conference on Logic Programming}, pages 671--693, Austin,
  TX, October 1990. MIT Press.

\bibitem[BMV89]{Bonner89}
A.~J. Bonner, L.~T. McCarty, and K.~Vadaparty.
\newblock Expressing {D}atabase {Q}ueries with {I}ntuitionistic {L}ogic.
\newblock In Ewing~L. Lusk and Ross~A. Overbeek, editors, {\em Proceedings of
  the North American Conference on Logic Programming}, pages 831--850,
  Cleveland, Ohio, USA, 1989.

\bibitem[Bon91]{Bonner91phd}
A.J. Bonner.
\newblock {\em Hypothetical Reasoning in Deductive Databases}.
\newblock PhD thesis, Rutgers University, October 1991.

\bibitem[Bon94]{Bonner94}
A.J. Bonner.
\newblock Hypothetical reasoning with intuitionistic logic.
\newblock In R.~Demolombe and T.~Imielinski, editors, {\em Non-Standard Queries
  and Answers}, volume 306 of {\em Studies in Logic and Computation}, pages
  187--219. Oxford University Press, 1994.

\bibitem[Cla78]{Cla78}
K.~L. Clark.
\newblock Negation as failure.
\newblock In H.~Gallaire and J.~Minker, editors, {\em Logic and Databases},
  pages 293--322, New York, 1978. Plenum Press.

\bibitem[Dun92]{Dung92}
P.~M. Dung.
\newblock Declarative semantics of hypothetical logic programming with negation
  as failure.
\newblock In E.~Lamma and P.~Mello, editors, {\em Proceedings of the Third
  International Workshop on Extensions of Logic Programming ({ELP} '92)},
  volume 660 of {\em LNAI}, pages 45--58, Bologna, Italy, February 1992.
  Springer Verlag.

\bibitem[Eri93]{Eriksson93phd}
Lars-Henrik Eriksson.
\newblock {\em Finitary Partial Inductive Definitions and General Logic}.
\newblock PhD thesis, Department of Computer and System Sciences, Royal
  Institute of Technology, Stockholm, 1993.

\bibitem[Gab85]{Gab85}
Dov~M. Gabbay.
\newblock N-prolog: An extension of prolog with hypothetical implications
  ii---logical foundations, and negation as failure.
\newblock {\em Journal of Logic Programming}, 2(4):251--283, December 1985.

\bibitem[GL90]{Gelfond90}
Michael Gelfond and Vladimir Lifschitz.
\newblock Logic programs with classical negation.
\newblock In David H.D.~Szerdei Peter~Warren, editor, {\em Proceedings of the
  7th International Conference on Logic Programming (ICLP '90)}, pages
  579--597, Jerusalem, June 1990. MIT Press.

\bibitem[GO98]{Giordano98}
Laura Giordano and Nicola Olivetti.
\newblock Negation as failure and embedded implication.
\newblock {\em Journal of Logic Programming}, to appear, 1998.

\bibitem[GR84]{Gabbay84}
Dov~M. Gabbay and U.~Reyle.
\newblock N-prolog: An extension of prolog with hypothetical implications i.
\newblock {\em Journal of Logic Programming}, 1(4):319--355, December 1984.

\bibitem[Hal91]{Halnass91}
L.~Hallnas.
\newblock Partial inductive definitions.
\newblock {\em Theoretical Computer Science}, 87(1):115--147, July 1991.

\bibitem[Har91]{Harland91phd}
James Harland.
\newblock {\em On Hereditary Harrop Formulae as a Basis for Logic Programming}.
\newblock PhD thesis, Edinburgh, January 1991.

\bibitem[Har93]{Har93}
James Harland.
\newblock Success and failure for hereditary {Harrop} formulae.
\newblock {\em Journal of Logic Programming}, 17(1):1--29, October 1993.

\bibitem[HSH90]{Halnass90}
L.~Hallnas and P.~Schroeder-Heister.
\newblock A proof-theoretic approach to logic programming: Clauses as rules.
\newblock {\em Journal of Logic and Computation}, 1(2):635\--660, October 1990.

\bibitem[HSH91]{Halnass91jlp}
L.~Hallnas and P.~Schroeder-Heister.
\newblock A proof-theoretic approach to logic programming: Programs as
  definitions.
\newblock {\em Journal of Logic and Computation}, 1(5):261\--283, October 1991.

\bibitem[Kre92]{Kreuger92}
Per Kreuger.
\newblock Gcla ii. a definitional approach to control.
\newblock Technical Report R92:09, SICS, 1992.

\bibitem[McC88a]{Mc88a}
L.~Thorne McCarty.
\newblock Clausal intuistionistic logic: {I}. fixed point semantics.
\newblock {\em Journal of Logic Programming}, 5(1):1--31, March 1988.

\bibitem[McC88b]{Mc88b}
L.~Thorne McCarty.
\newblock Clausal intuitionistic logic {II}. tableau proof procedure.
\newblock {\em Journal of Logic Programming}, 5:93--132, 1988.

\bibitem[Mil89]{Miller89jlp}
Dale Miller.
\newblock A logical analysis of modules in logic programming.
\newblock {\em Journal of Logic Programming}, 6(1-2):79--108, January 1989.

\bibitem[MMP88]{Mancarella88}
Paolo Mancarella, Simone Martini, and Dino Pedreschi.
\newblock {C}omplete logic {P}rograms with domain-closure {A}xiom.
\newblock {\em Journal of Logic Programming}, 5:263--276, 1988.

\bibitem[NL92]{Olivetti92}
Olivetti N. and Terracini L.
\newblock N-prolog and the equivalence o flogic program.
\newblock {\em Journal of Logic Language and Information}, 5:253\--3392, 1992.

\bibitem[SH93]{SchroederHeister93lics}
Peter Schroeder-Heister.
\newblock Rules of definitional reflection.
\newblock In M.~Vardi, editor, {\em Proceedings of the Eighth Annual {IEEE}
  Symposium on Logic in Computer Science}, pages 222--232, Montreal, Canada,
  June 1993.

\end{thebibliography}
