%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%

% JOURNALS

\bibitem{AI}
{\em Artificial Intelligence},
Elsevier.

\bibitem{Acta}
{\em Acta Informatica},
Springer International.

\bibitem{AMAI}
{\em Annals of Mathematics and Artificial Intelligence},
J.C. Baltzer AG Science Publishers,
Basel Switzerland.

\bibitem{FI}
{\em Fundamenta Informaticae},
IOS Press,
Amsterdam, Washington DC, Tokyo.

\bibitem{JACM}
{\em Journal of the Association for Computing Machinery},
ACM Press.

\bibitem{JAR}
{\em Journal of Automated Reasoning},
Kluwer Academic Publishers.

\bibitem{JLC}
{\em Journal of Logic and Computation},
Oxford University Press.

\bibitem{JLP}
{\em The Journal of Logic Programming}, 
North-Holland, 
1982-present.

\bibitem{NDJFL}
{\em Notre Dame Journal of Formal Logic}.

\bibitem{NGC}
{\em New generation Computing},
Ohmsha, Ltd. - Tokyo and Springer Verlag.

\bibitem{SL}
{\em Studia Logica}.

\bibitem{TCS}
{\em Theoretical Computer Science}
Elsevier.

%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%

% BOOK SERIES

\bibitem{LNCS}
{\em Lecture Notes in Computer Science},
Springer Verlag.

\bibitem{LNAI}
{\em Lecture Notes in Artificial Intelligence},
Springer Verlag.

\bibitem{MIT-LPS}
{\em Logic Programming Series}
MIT Press.

%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%

% MATHEMATICAL LOGIC

\bibitem[Barwise77]{Barwise77}
J. Barwise (ed.), 
{\em Handbook of Mathematical Logic}, 
Studies in Logic --- vol. 90, 
North Holland, 
1977.

\bibitem[Barwise77b]{Barwise77b}
J. Barwise, 
An Introduction to First-order Logic,
in : \cite{Barwise77}
pp. 5-46.

\bibitem[Feferman52]{Feferman52}
S. Feferman,
Review of the paper: H. Rasiowa and R. Sikorski, A proof of the
completeness theorem of G\"odel,
{\em Journal of Symbolic Logic} 
17,
1952,
p. 72.

\bibitem[Fitting69]{Fitting69}
M. C. Fitting, 
{\em Intuitionistic Logic, Model Theory and Forcing}, 
North Holland, 
1969.

\bibitem[Girard87]{Girard87}
Y. Girard,
Linear Logic,
TCS 50, 1-102, 1987.

\bibitem[Goldblatt87]{Goldblatt87}
R. Goldblatt, 
{\em Logics of Time and Computation}, 
Lecture Notes No. 7,
Center for the Study of Language and Information (CSLI), 
1987.

\bibitem[Malcev61]{Malcev61}
Axiomatizable Classes of Locally Free Algebras of Various Types,
in {\em The metamathematics of Algebraic Systems: Collected Papers},
chapter 23,
pp. 262-281,
North Holland,
1971

\bibitem[Rasiowa74]{Rasiowa74}
H. Rasiowa, 
{\em Non-classical logics, An Algebraic Approach},
North Holland, 
1974.

\bibitem[RasiowaSikorski50]{RasiowaSikorski50}
H. Rasiowa and R. Sikorski, A proof of Completeness Theorem of G\"odel,
{\em Fundamenta Mathematicae 37},
1950, 
pp. 193-200.

\bibitem[RasiowaSikorski53]{RasiowaSikorski53}
H. Rasiowa and R. Sikorski, 
Algebraic treatment of the notion of satisfiability, 
{\em Fundamenta Mathematicae 40},
1953, 
pp. 62-95.

\bibitem[RasiowaSikorski63]{RasiowaSikorski63}
H. Rasiowa and R. Sikorski, 
{\em The Mathematics of Metamathematics},
PWN - Polish Scientific Publishers, Warsaw,
first edition -- 1963, 
third edition -- 1970.

\bibitem[Segerberg70]{Segerberg70}
K. Segerberg, 
{\em Classical Modal Logics},
Filosofiska Studier, 
Uppsala, Sweden,
1970.

\bibitem[Shoenfield67]{Shoenfield67}
J. R. Shoenfield, 
{\em Mathematical Logic}, 
Addison-Wesley, 
1967.

%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%

% LOGIC PROGRAMMING -- BOOKS

\bibitem[Doets94]{Doets94}
K. Doets,
{\em From Logic to Logic Programming}
MIT Press,
1994.

\bibitem[Fitting90]{Fitting90}
M. Fitting, 
{\em First-order Logic and Automated Theorem Proving},
Springer Verlag, 
New York
1990.

\bibitem[Lloyd87]{Lloyd87}
J. W. Lloyd, 
{\em Foundations of Logic Programming}, 
Second Extended Edition 1987, 
Second Extended Edition -- First Corrected Printing 1993,
Springer Verlag.

\bibitem[O'Keefe90]{O'Keefe90}
R. A. O'Keefe,
{\em The Craft of Prolog,}
MIT Press, 
1990.

\bibitem[SterlingShapiro86]{SterlingShapiro86}
L. Sterling and E. Shapiro, 
{\em The Art of Prolog}, 
MIT Press, 
1986.

%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%

% LOGIC PROGRAMMING -- HANDBOOKS, COLLECTIONS OF PAPERS

\bibitem[AbramsonRogers89]{AbramsonRogers89}
H. Abramson and M. H. Rogers,
{\em Meta-Programming in Logic Programming}
MIT Press,
1989.

\bibitem[Banerji90]{Banerji90}
R. B. Banerji (ed.)
{\em Formal Techniques in Artificial Intelligence, A Sourcebook},
North Holland,
1990.

\bibitem{DeGrootLindstrom86}
D. DeGroot and G. Lindstrom (eds.), 
{\em Logic Programming, Functions, Relations and Equations}, 
Prentice-Hall, 
1986.

\bibitem[GabbayHoggerRobinson95]{GabbayHoggerRobinson95}
D.M. Gabbay, C. J. Hogger and J. A. Robinson (eds.)
{\em Handbook of Logic in Artificial Intelligence and Logic Programming},
Oxford University Press, 
volumes 1-3,
1995.

\bibitem[GallaireMinker78]{GallaireMinker78}
H. Gallaire and J. Minker,
{\em Logic and Databases}
Plenum Press, 
New York and London
1978.

\bibitem[LassezPlotkin91]{LassezPlotkin91}
J-L. Lassez and G. Plotkin,
{\em Computational Logic, Essays in Honor of Alan Robinson},
MIT Press,
1991.

\bibitem[Minker87]{Minker87}
J. Minker (ed.), 
{\em Foundations of Deductive Databases and Logic Programming}, 
Morgan Kaufmann, 
1988.

\bibitem[PartridgeWilks90]{PartridgeWilks90}
D. Partridge and Y. Wilks (eds.),
{\em The Foundations of Artificial Intelligence. A Sourcebook},
Cambridge University Press,
London, 
1990.

%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%

% PROCEEDINGS -- LOGIC PROGRAMMING (by year)

\bibitem[LPconf84]{LPconf84}
S. T\"{a}rnlund (ed.),
{\em Proceedings of the Second International Logic Programming Conference},
Uppsala University,
Ord \& Form, 
Uppsala, Sweden,
1984.

\bibitem[LPconf86]{LPconf86}
E. Shapiro (ed.)
{\em Proceedings of the Third International Conference on Logic Programming},
Springer Verlag,
LNCS 225,
1986.

\bibitem[LPsymp87]{LPsymp87}
{\em Proceedings of the 1987 Symposium on Logic Programming},
San Francisco, 
IEEE Computer Society Press,
1987.

\bibitem[LPconf87]{LPconf87}
J-L. Lassez (ed.), 
{\em Logic Programming, 
Proceedings of the Fourth International Conference}, 
MIT Press, 
1987.

\bibitem[LPconf88]{LPconf88}
R. A. Kowalski and K. A. Bowen (eds.), 
{\em Logic Programming, 
Proceedings of the Fifth International Conference and Symposium}, 
MIT Press, 
1988.

\bibitem[LPconfNA89]{LPconfNA89}
E. L. Lusk and R. A. Overbeek (eds.), 
{\em Logic Programming, 
Proceedings of the North American Conference 1989}, 
MIT Press, 
1989.

\bibitem[LPconf89]{LPconf89}
G. Levi and M. Martelli (eds.), 
{\em Logic Programming, 
Proceedings of the Sixth International Conference}, 
MIT Press, 
1989.

\bibitem[LPconfNA90]{LPconfNA90}
S. Debray and M. Hermenegildo (eds.), 
{\em Logic Programming, 
Proceedings of the 1990 North American Conference}, 
MIT Press, 
1990.

\bibitem[LPconf90]{LPconf90}
D. H. D. Warren and P. Szeredi (eds.), 
{\em Logic Programming, 
Proceedings of the Seventh International Conference}, 
MIT Press, 
1990.

\bibitem[LPNMR91]{LPNMR91}
A. Nerode, W. Marek and V. S. Subrahmanian (eds.), 
{\em Logic Programming and Non-monotonic Reasoning, 
Proceedings of the First International Workshop}, 
MIT Press, 
1991.

\bibitem[LPsymp91]{LPsymp91}
V. Saraswat and K. Ueda (eds.), 
{\em Logic Programming, 
Proceedings of the 1991 International Symposium}, 
MIT Press, 
1991.

\bibitem[LPconf91]{LPconf91}
Furukawa (ed.), 
{\em Logic Programming, 
Proceedings of the Eighth International Conference}, 
MIT Press, 
1991.

\bibitem[LPconf92]{LPconf92}
K. Apt (ed.), 
{\em Logic Programming,
Proceedings of the Joint International Conference and Symposium on
Logic Programming}, 
MIT Press, 
1992.

\bibitem[LPNMR92]{LPNMR92}
L. M. Pereira and A. Nerode (eds.), 
{\em Logic Programming and Non-monotonic Reasoning, 
Proceedings of the Second International Workshop}, 
MIT Press, 
1993.

\bibitem[LPsymp93]{LPsymp93}
M. Miller (ed.), 
{\em Logic Programming,
Proceedings of the 1993 International Symposium}, 
MIT Press, 
1993.

\bibitem[LPconf93]{LPconf93}
D. S. Warren (ed.), 
{\em Logic Programming,
Proceedings of the Tenth International Conference on Logic Programming}, 
MIT Press, 
1993.

\bibitem[LPsymp94]{LPsymp94}
M. Bruynooghe (ed.), 
{\em Logic Programming,
Proceedings of the 1994 International Symposium}, 
MIT Press, 
1994.

\bibitem[LPconf94]{LPconf94}
P. VanHentenryck (ed.), 
{\em Logic Programming,
Proceedings of the Eleventh International Conference on Logic Programming}, 
MIT Press, 
1994.

%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%

% PROCEEDINGS -- OTHER {by year}

\bibitem[FGCS84]{FGCS84}
{\em Fifth Generation Computer Systems 1984,
Proceedings of the International Conference on
Fifth Generation Computer Systems 1984},
OHM and North Holland,
1984

\bibitem[TAPSOFT87]{TAPSOFT87}
E. Ehrig, R. Kowalski, G. Levi and U. Montanari (eds.)
{\em TAPSOFT '87, 
Proceedings of the International Joint Conference
on Theory and Practice of Software Development, 
Pisa, Italy, March 1987,}
Springer Verlag,
LNCS 250,
1987

\bibitem[CSL89]{CSL89}
E. B\"{o}rger, H. Kleine B\"{u}ning and M. M. Richter (eds.),
{\em CSL '89, Third Workshop on Computer Science Logic}
Springer Verlag,
LNCS 440
1989.

%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%

% LOGIC PROGRAMMING -- SURVEY PAPERS

\bibitem[Apt89]{Apt89}
K. R. Apt, 
Introduction to Logic Programming, 
in: {\em Handbook of Theoretical Computer Science}, 
edited by J. Van Leeuwen,
MIT Press and Elsevier, 
1989, 
vol. 1, 
pp. 493-574.

\bibitem[AptBol94]{AptBol94}
K. R. Apt and R. N. Bol,
Logic Programming And Negation: A Survey,
{\em Journal of Logic Programming} 
Vol.19/20,
pp. 9-71,
1994.

\bibitem[Bidoit91]{Bidoit91}
N. Bidoit,
Negation in rule-based database languages: a survey,
TCS
78,
1991,
3-83.

\bibitem[Clark91]{Clark91}
K. Clark,
Logic-programming schemes and their implementation,
in \cite{LassezPlotkin91},
pp. 487-541.

\bibitem[Dix93]{Dix93}
J. Dix,
Semantics of logic programs: Their intuitions and formal properties, An overview,
in: A. Fuhrmann and H. Rott (eds.),
{\em Logic, Action and Information. 
Proceedings of the Konstanx Colloquium in Logic and Information (LogIn '92)},
deGruyter,
Berlin,
1993.

\bibitem[JaffarMaher94]{JaffarMaher94}
J. Jaffar and M.J. Maher,
Constraint Logic Programming: A Survey,
{\em Journal of Logic Programming} 
Vol.19/20,
pp. 503-582,
1994.

\bibitem[Przymusi\'{n}skaPrzymusi\'{n}ski90]{PrzymusinskaPrzymusinski90}
H. Przymusi\'{n}ska and T. Przymusi\'{n}ski,
Semantic issues in deductive databases and logic programs,
in \cite{Banerji90},
pp. 321-367.

\bibitem[Shepherdson87]{Shepherdson87}
J. C. Shepherdson, 
Negation in Logic Programming, 
in \cite{Minker87}, 
pp. 19-88.

\bibitem[Shepherdson91]{Shepherdson91}
J. C. Shepherdson, 
{\em Negation in Logic Programming}
ICLP'91 Tutorial.

%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%

% LOGIC PROGRAMMING -- PAPERS

\bibitem[AlferesPereira92]{AlferesPereira92}
J. J. Alferes and L. M. Pereira,
On logic program semantics with two kinds of negation,
in \cite{LPconf92},
pp. 574-589.

\bibitem[AptBezem91]{AptBezem91}
K. R. Apt and M. Bezem,
Acyclic Programs,
NGC
9,
1991,
335-363.

\bibitem[AptBlairWalker88]{AptBlairWalker88}
K. R. Apt, H. A. Blair and A. Walker, 
Towards a Theory of Declarative Knowledge, 
in \cite{Minker87}, 
pp. 89-148. 

\bibitem[AptDoets94]{AptDoet94}
K.R.Apt and H.C. Doets,
A New definition of SLDNF-resolution,
{\em Journal of Logic Programming} 
Vol.18,
pp. 177-190,
1994.

\bibitem[AptVanEmden82]{AptVanEmden82}
K. R. Apt and M. H. van Emden,  
Contributions to the Theory of Logic Programming, 
{\em J. ACM} 
July 1982,
vol. 29, no. 3,  
pp. 841-862.

\bibitem[Balbiani90]{Balbiani90}
P. Balbiani,
{\em Stratified Programs and Their Modal Completion},
Institut de Recherche en Informatique de Toulouse,
report IRIT/90-46/R,
decembre 1990.

\bibitem[Balbiani91]{Balbiani91}
P. Balbiani,
Modal Logic and Negation as Failure
{\em Journal of Logic and Computation},
1 (3),
1991,
pp. 331-356.

\bibitem[BarbutiEtAl87]{BarbutiEtAl87}
R. Barbuti, P. Mancarella, D. Pedreschi and F. Turini,
Intensional Negation of Logic Programs: Examples and Implementation Techniques,
in: \cite{TAPSOFT87},
pp 96-110.

\bibitem[BarbutiEtAl90]{BarbutiEtAl90}
R. Barbuti, P. Mancarella, D. Pedreschi and F. Turini,
A Transformational Approach to Negation in Logic Programming,
{\em Journal of Logic Programming}
vol. 8,
pp. 201-228,
1990.

\bibitem{Belnap77}
N. D. Belnap, Jr.,
A useful four-valued logic,
in: J. M. Dunn and G. Epstein (eds.),
{\em Modern Uses of Multiple-Valued Logic,}
published by Reidel,
1977,
pp. 8-37.

\bibitem[BleuzenGuernalecGil8?]{BleuzenGuernalecGil8?}
N. Bleuzen-Guernalec and B. Gil, 
{\em A Semantical Approach of an Internal Rendering of the Negation 
in General Logic Programs,}
draft 
198?.

\bibitem[BruffaertsHenin89]{BruffaertsHenin89}
A. Bruffaerts and E. Henin, 
Negation as Failure: Proofs, Inference Rules and Meta-interpreters, 
in: \cite{AbramsonRogers89}, 
pp. 169-190.

\bibitem[Cavedon89]{Cavedon89}
L. Cavedon, 
Continuity, Consistency, and Completeness Properties for Logic Programs,
in \cite{LPconf89}, 
pp. 571-584.

\bibitem[Cavedon91]{Cavedon91}
L. Cavedon, 
Acyclic logic programs and the completeness of SLDNF-resolution,
TCS
86,
1991,
81-92.

\bibitem[CavedonLloyd89]{CavedonLloyd89}
L. Cavedon and J. W. Lloyd, 
A Completeness Theorem for SLDNF Resolution, 
{\em Journal of Logic Programming}, 
1989, 
vol. 7, no. 3, 
pp. 177-192.

\bibitem[Chan88]{Chan88}
D. Chan, 
Constructive Negation Based on Completed Database, 
in \cite{LPconf88}, 
pp. 111-125.

\bibitem[Chan89]{Chan89}
D. Chan, 
An extension of constructive negation and its application in corouting,
in \cite{LPconf89},
pp. 477-493.

\bibitem[Clark78]{Clark78}
K. L. Clark, 
Negation as Failure, 
in {\em Logic and Databases}, 
edited by H. Gallaire and J. Minker, 
Plenum Press, New York, 
1978, 
pp. 193-322.

\bibitem[Clark79]{Clark79}
K. L. Clark, 
Predicate Logic as a Computational Formalism, 
{\em Research Report DOC 79/59}, 
Dept. of Computing, Imperial College, 
1979.

\bibitem[ColmerauerEtAl73]{ColmerauerEtAl73}
A. Colmerauer, H. Kanoui, R. Pasero, P. Roussel, 
{\em Un Systeme de Communication Homme-Machine an Francais},
Technical Report, 
Groupe de Intelligence Artificielle Universitae de Aix-Marseille II, 
Marseille,
1973.
 
\bibitem[DebrayMishra88]{DebrayMishra88}
S. K. Debray and P. Mishra, 
Denotational and Operational Semantics for Prolog, 
{\em Journal of Logic Programming}, 
1988, 
vol. 5, No 1, 
pp. 61-91.

\bibitem[DeckerCavedon89]{DeckerCavedon89}
H. Decker and L. Cavedon,
generalizing allowedness while retaining completeness of SLDNF resolution,
in \cite{CSL89},
pp. 98-125.

\bibitem[Dix91]{Dix91}
J. Dix,
Classifying semantics of logic programs,
in \cite{LPNMR91},
pp. 166-180.

\bibitem[Dix92]{Dix92}
J. Dix,
Classifying semantics of disjunctive logic programs,
in \cite{LPconf92},
pp. 798-???.

\bibitem[Dix92b]{Dix92b}
J. Dix,
A framework for representing and characterizing semantics of logic programs,
in: B. Nebel, C. Rich and W, Swartout (eds.),
{\em Principles of Knowledge Representation and Reasoning:
Proceedings of the Third International Conference (KR92), San Mateo, CA}
Morgan Kaufman,
Los Altos, CA, 
1992.

\bibitem[Dix95]{Dix95}
J. Dix,
A classification-theory  of semantics of normal logic programs:
I. Strong Principles, II. Weak Principles,
{\em Fundamenta Informaticae} 
1995.

\bibitem[Doets93]{Doets93}
H. C. Doets,
Levationis laus,
{\em Journal of Logic and Computation} 3 (5), 487-516, 1993.

\bibitem[Drabent92]{Drabent92}
W. Drabent,
{\em Extension of the well-founded semantics},
draft,
1992.

\bibitem[Drabent94]{Drabent94}
W. Drabent,
{\em A Floyd-Hoare method for Prolog},
draft,
1994

\bibitem[Drabent95]{Drabent95}
W. Drabent,
What is Failure? An Approach to Constructive Negation,
{\em Acta Informatica},
to appear in 1995.

\bibitem[Drabent95b]{Drabent95b}
W. Drabent,
{\em Completeness of SLDNF-Resolution for Non-Floundering Queries},
draft,
1995.

\bibitem[DrabentMartelli91]{DrabentMartelli91}
W. Drabent and M. Martelli,
Strict Completion of Logic Programs,
{\em New Generation Computing} 
9,
pp. 69-79,
1991.

\bibitem[Drabent95]{Drabent95}
What is Failure? An Approach to Constructive Negation,
{\em Acta Informatica},
to appear.

\bibitem[DungKanchanasut89]{DungKanchanasut89}
P. M. Dung and K. Kanchanasut, 
On the Generalized Predicate Completion of Non-Horn Programs, 
in \cite{LPconfNA89}, 
pp. 587-603.

\bibitem[DungKanchanasut89b]{DungKanchanasut89b}
P. M. Dung and K. Kanchanasut, 
A Fixpoint Approach to Declarative Semantics of Logic Programs, 
in \cite{LPconf89b}, 
pp. 604-625.

\bibitem[FalaschiEtAl88]{FalsschiEtAl88}
M. Falaschi, G. Levi, M. Martelli, C. Palamidessi, 
A New Declarative Semantics for Logic Languages, 
in \cite{LPconf88}, 
pp. 993-1005.

\bibitem[Fitting85]{Fitting85}
M. Fitting, 
A Deterministic Prolog Fixpoint Semantics, 
{\em Journal of Logic Programming}, 
No 2, 
1985, 
pp. 11-118. 

\bibitem[Fitting85]{Fitting85}
M. Fitting, 
A Kripke-Kleene Semantics for Logic Programs, 
{\em Journal of Logic Programming},  
no. 4, 
1985,
pp 295-312.

\bibitem[Fitting86]{Fitting86}
M. Fitting, Partial Models and Logic Programming, 
{\em Journal of Theoretical Computer Science} 
vol. 48,
1986, 
pp. 229-255. 

\bibitem[Fitting86b]{Fitting86b}
M. Fitting, 
Logic Programming Using A Compact Data Structure, 
{\em Proc. of the ASM SIGART International Symposium on Methodologies for
Intelligent Systems - ISMIS '86}, 
ACM Press,
1986, 
pp. 247-255.

\bibitem[Fitting89]{Fitting89}
M. Fitting, 
Negation as Refutation, Extended Abstract, 
{\em Proceedings of the $4^{th}$ Annual Symposium on 
Logic in Computer Science - LICS'89}, 
IEEE Computer Society Press, 
1989, 
pp. 63-70. 

\bibitem[Fitting90]{Fitting90}
M. Fitting, 
Bilattices in Logic Programming, 
{\em Proceedings of the 
$20^{th}$ International Symposium on Multiple-valued Logic},  
IEEE Computer Society Press, 
1990,
pp. 238-246.

\bibitem{Fitting91}
Melvin C. Fitting,
Bilattices in the Semantics of Logic Programming,
{\em Journal of Logic Programming},
vol. 11,
1991,
pp. 91-116.

\bibitem[Fitting94]{Fitting94}
M. Fitting,
Kleene's Three Valued Logics and Their Children,
{\em Fundamenta Informaticae}
20,
1994,
113-131.

\bibitem[FittingBenJacob88]{FittingBenJacob88}
M. Fitting and M. Ben Jacob, 
Stratified and Three-valued Logic Programming Semantics, 
in \cite{LPconf88}, 
pp. 1054-1069. 

\bibitem[Gabbay89]{Gabbay89}
D. Gabbay, 
Modal Provability Foundations for Negation as Failure I,
4th draft, 
February 1989, 
unpublished.

\bibitem[GardnerShepherdson91]{GardnerShepherdson91}
P. A. Gardner and J. C. Shepherdson,
Unfold/Fold Transformations of logic Programs,
in \cite{LassezPlotkin91},
pp. 565-583.

\bibitem[GelfondLifschitz88]{GelfondLifschitz88}
M. Gelfond and V. Lifschitz, 
The Stable Model Semantics for Logic Programming, 
in \cite{LPconf88}, 
pp. 1070-1080.

\bibitem[GelfondLifschitz90]{GelfondLifschitz90}
M. Gelfond and V. Lifschitz, 
Logic Programs with Classical Negation,
\cite{LPconf90},
pp. 579-597.

\bibitem[GelfondLifschitz91]{GelfondLifschitz91}
M. Gelfond and V. Lifschitz, 
Classical Negation in Logic Programs and Disjunctive Databases,
NGC
9,
1991,
365-385.

\bibitem[Harland89]{Harland89}
J. Harland, 
A Kripke-like Model for Negation as Failure, 
in \cite{LPconfNA89}, 
pp. 626-644.

\bibitem[Hickey87]{Hickey87}
T. Hickey, 
{\em Negation by Constraint Failure}, 
draft 
1987.

\bibitem[JaffarEtAl83]{JaffarEtAl83}
J. Jaffar, J.-L. Lassez and J. W. Lloyd, 
Completeness of the negation as failure rule, 
in {\em IJCAI-83}, 
Karlsruhe, 
1983, 
pp. 500-506.

\bibitem[JaffarEtAl86]{JaffarEtAl86}
J. Jaffar, J.-L. Lassez and M. J. Maher, 
A Logic Programming Language Scheme, 
in \cite{DeGrootLindstrom86}, 
pp. 441-468.

\bibitem[KanachanasutStuckey92]{KanachanasutStuckey92}
K. Kanchanasut and P. J. Stuckey,
Transforming normal logic programs to constraint logic programs,
{\em Theoretical Computer Science}
105,
1992,
pp. 27-56.

\bibitem[Kowalski74]{Kowalski74}
R. A. Kowalski, 
Predicate Logic as a Programming Language, 
in {\em Information Processing '74}, Stockholm, 
North Holland, 
1974, 
pp. 569-574.

\bibitem[Kowalski85]{Kowalski85}
R. A. Kowalski, 
The Relation Between Logic Programming and Logic Specification, 
in {\em Mathematical Logic and Programming Languages},
edited by C. A. R. Hoare and J. C. Shepherdson, 
Prentice Hall, Englewood Cliffs, N.J. 
1985, 
pp. 11-27.

\bibitem[Kowalski79]{Kowalski79}
R. A. Kowalski, 
Algorithm = Logic + Control, 
in {\em Communications of the ACM} 
July 1979,
vol. 22, no. 7,
pp. 424-436.

\bibitem[Kunen87]{Kunen87}
K. Kunen, 
Negation in Logic Programming, 
in {\em Journal of Logic Programming} 
1987, 
No 4, 
pp 289-308.

\bibitem[Kunen87b]{Kunen87b}
K. Kunen, 
Answer Sets and Negation as Failure, 
in \cite{LPconf87},
pp. 217-228.

\bibitem[Kunen88]{Kunen88}
K. Kunen, 
Some Remarks on the Completed Database, 
in \cite{LPconf88},
pp. 978-992. 

\bibitem[Kunen89]{Kunen89}
K. Kunen, 
Signed Data Dependencies in Logic Programs, 
{\em Journal of Logic Programming},
1989, 
vol. 7, no. 3, 
pp.231-247.

\bibitem[Kunen89b]{Kunen89b}
K. Kunen,
{\em Declarative Semantics of Logic Programming},
revised version of the notes for a tutorial given at the 
North American Conference on Logic Programming,
October, 1989.

\bibitem[LassezEtAL82]{LassezEtAL82}
J.-L. Lassez, V. L. Nguyen and E. A. Sonnenberg,
Fixed Point Theorems and Semantics: A Folk Tale, 
{\em Inf. Proc. Letters} 
14, 3,
1982, 
pp. 112-116.

\bibitem[Lifschitz87]{Lifschitz87}
V. Lifschitz, 
On the Declarative Semantics of Logic Programs with Negation, 
in \cite{Minker87}, 
pp. 177-192.

\bibitem[Lifschitz94]{Lifschitz94}
V. Lifschitz,
{\em SLDNF, Constructive Negation and Grounding},
draft,
Oct. 28, 1994.

\bibitem[LloydTopor84]{LloydTopor84}
J. W. Lloyd and R. W. Topor,
Making Prolog More Expresive,
{\em The Journal of Logic Programming},
vol. 2, no. 3, 
1984,
pp. 225-240.

\bibitem[LloydTopor86]{LloydTopor86}
J. W. Lloyd and R. W. Topor,
A basis for Deductive Database Systems,
{\em The Journal of Logic Programming},
part I:  1985:2  93-109,
part II: 1985:1, 55-67.

\bibitem[LoboEtAl88]{LoboEtAl88}
J. Lobo, J. Minker and A. Rajasekar, 
Weak Completion Theory for Non-Horn Programs, 
in \cite{LPconf88}, 
pp. 828-842.

\bibitem[LoboEtAl89]{LoboEtAl89}
J. Lobo, J. Minker and A. Rajasekar, 
Extending the Semantics of Logic Programs to Disjunctive Logic Programs, 
in \cite{LPconf89}, 
pp. 255.

\bibitem[Lugiez89]{Lugiez89}
D. Lugiez,
A deduction procedure for first order programs,
in: \cite{LPconf89},
pp. 595-599.

\bibitem[Maher88]{Maher88}
M. J. Maher,
Complete Axiomatizations of the Algebras of Finite, Rational and Infinite Trees,
full version: {\em Research Report, IBM -- T.J. Watson Research Center},
abbreviated version: {\em LICS'88 Proceedings},
1988.

\bibitem[Maluszy\{'}nskiN\"{a}slund89]{MaluszynskiNaslund89}
J. Maluszy\'{n}ski, T. N\"{a}slund, 
Fail Substitutions for Negation as Failure, 
in \cite{LPconfNA89}, 
pp. 461-476.

\bibitem[McCarty88]{McCarty88}
L. T. McCarty, 
Clausal Intuitionistic Logic, 
Part I: Fixed-Point Semantics,
Part II: Tableau Proof Procedures, 
{\em Journal of Logic Programming}, 
vol. 5, No 1: pp. 1-31, 
No 2: pp. 93-132,
1988.

\bibitem[Mancarella88]{Mancarella88}
P. Mancarella,
{\em Intensional Negation of Logic Programs},
Ph.D. Thesis, in Italian,
Dip. di Informatica,
Univ. di Pisa, 1988.

\bibitem[MancarellaEtAl88]{MancarellaEtAl88}
P. Mancarella, S. Martini, D. Pedreschi, 
Complete Logic Programs with Domain-Closure Axiom, 
{\em Journal of Logic Programming}, 
1988, 
vol. 5, No 3, 
pp.263-276. 

\bibitem[MancarellaEtAl90]{MancarellaEtAl90}
P. Mancarella, D. Pedreschi, M. Rondinelli and M. Tagliatti,
Algebraic Properties of a Class of Logic Programs,
in \cite{LPconfNA90}
pp. 23-39.

\bibitem[Minker88]{Minker88}
J. Minker, Perspectives in Deductive Databases, 
{\em Journal of Logic Programming},  
vol. 5, No 1, 
1988,
pp. 33-60.

\bibitem[MinkerRuiz94]{MinkerRuiz94}
J. Minker and C. Ruiz,
Semantics for Disjunctive Logic Programs with Explicit and Default Negation,
{\em Fundamenta Informaticae}
20,
1994,
145-192.

\bibitem[Naish86]{Naish86}
L. Naish,
Negation and quantifiers in NU-Prolog,
\cite{LPconf86},
pp. 624-634.

\bibitem[PearceWagner89]{PearceWagner89}
D. Pearce and G. Wagner, 
Reasoning with Negative Information I: Strong Negation in Logic Programs, 
draft,
1989.

\bibitem[Plaza90cuny]{Plaza90cuny}
J. A. Plaza,
{\em Fully Declarative Programming with Logic -- Mathematical Foundations},
Ph.D. Dissertation, 
City University of New York, 
July 1990.

\bibitem[Plaza91ismis]{Plaza91ismis}
J. A. Plaza,
Completeness for Propositional Logic Programs with Negation,
in: Z. W. Ras and M. Zemankova (eds.),
{Methodologies for Intelligent Systems},
Springer Verlag, LNAI vol. 542,
1991,
pp. 600-609.

\bibitem[Plaza92plilp]{Plaza92plilp}
J. A. Plaza,
Fully Declarative Logic Programming, 
in: M. Bruynooghe and M. Wirsing (eds.),
{\em Programming Language Implementation and Logic Programming},
Springer Verlag, LNCS vol. 631,
1992,
pp. 415-427.

\bibitem[Plaza92lfcs]{Plaza92lfcs}
J. A. Plaza,
Operators on Lattices of $\omega$-Herbrand Interpretations,
in: A. Nerode and M. Taitslin (eds.)
{\em Logical Foundations of Computer Science -- Tver '92}
Springer Verlag, LNCS vol. 620,
1992,
pp. 358-369.

\bibitem[Plaza93aismc]{Plaza93aismc}
J. A. Plaza,
Gentzen-style Characterizations of Negation as Failure,
in: J. Calmet and J. A. Campbell (eds.),
{Artificial Intelligence and Symbolic Mathematical Computing},
Springer Verlag, LNCS vol. 737,
1993.

\bibitem[Plaza94wis]{Plaza94wis}
J. A. Plaza,
True Equality Constraints over an Open Universe of Terms,
in: {\em Intelligent Information Systems, 
Proceedings of the Workshop held in Wigry, Poland, 6-10 June, 1994},
Institute of the Foundations of Computer Science 
of the Polish Academy of Sciences, IPI PAN,
1994,
ISBN 83-900820-3-9,
pp. 25-39

\bibitem[MurrellPlaza96wis]{MurrellPlaza96wis}
J. A. Plaza and S. Murrell,
Programming in Logos,
in: {em Intelligent Information Systems}, 
Proceedings of the Workshop held in Deblin, Poland,
Polish Academy of Sciences, 1996, ISBN 83-900820-6-3.

\bibitem[Plaza96aismc]{Plaza96aismc}
J. A. Plaza,
Soundness and Completeness versus Lifting Property,
in: J. Calmet, J.A. Campbell and J. Pfalzgraf (eds.), 
{\em Artificial Intelligence and Symbolic Mathematical Computation,} 
Springer Verlag, LNCS vol. 1138, 1996, pp. 354-364.

\bibitem[Plaza97ijfcs]{Plaza97ijfcs}
J. A. Plaza,
On the Propositional SLDNF-resolution,
to appear in {\em International Journal of Foundations of Computer Science}.

\bibitem[Plaza97fi]{Plaza97fi}
J. A. Plaza,
Logic Programming from the Perspective of Algebraic Semantics,
to appear in {\em Fundamenta Informaticae}.

\bibitem[PlazaMurrell96f]{PlazaMurrell96f}
J. A. Plaza and S. Murrell,
{\em Fix-point Semantics of Logic Programs over an Open Universe of Terms,}
submitted for publication.

\bibitem[PlazaMurrell95e]{PlazaMurrell95e}
J. A. Plaza and S. Murrell,
{\em On the Foundations of Logic Programming} 
submitted for publication.

\bibitem[Przymusi\'{n}skaPrzymusi\'{n}ski88]{PrzymusinskaPrzymusinski88}
H. Przymusi\'{n}ska and T. Przymusi\'{n}ski, 
Weakly Perfect Model Semantics for Logic Programs, 
in \cite{LPconf88}, 
pp. 1106-1123.

\bibitem[Przymusi\'{n}ski87]{Przymusinski87}
T. C. Przymusi\'{n}ski, 
On the Declarative Semantics of Deductive Databases and Logic Programs, 
in \cite{Minker87}, 
pp. 193-216.

\bibitem[Przymusi\'{n}ski89]{Przymusinski89}
T. C. Przymusi\'{n}ski, 
On Constructive Negation in Logic Programming, 
in \cite{LPconfNA89}, addendum. 

\bibitem[Przymusi\'{n}ski89]{Przymusinski89}
T. C. Przymusi\'{n}ski, 
On the Declarative and Procedural Semantics of Logic Programs, 
{\em Journal of Automated Reasoning}
5,
1989,
167-205.

\bibitem[Przymusi\'{n}ski89b]{Przymusinski89b}
T. C. Przymusi\'{n}ski,
Every logic program has a natural stratification and an iterated fix point model,
in: {\em Proceedings of the 8th Symposium on Principles of Database Systems,
ACM SIGACT-SIGMOD},
ACM Press, New York, 
1989,
pp. 11-21.

\bibitem[Przymusi\'{n}ski90]{Przymusinski90}
T. C. Przymusi\'{n}ski,
Non-monotonic reasoning vs-logic programming: A new perspective,
in \cite{PartridgeWilks90},
pp. 49-71.

\bibitem[RajasekarMinker89]{RajasekarMinker89}
A. Rajasekar and J. Minker, 
A Stratification Semantics for General Disjunctive programs, 
in \cite{LPconfNA89}, 
pp. 573-586.

\bibitem[Reiter78]{Reiter78}
On Closed World Databases,
in {GallaireMinker78},
pp. 55-76.

\bibitem[Robinson65]{Robinson65}
J. A. Robinson,
A machine-oriented logic based on the resolution principle,
{\em J. ACM} 12,
1965,
pp. 23-41.

\bibitem[Sato90]{Sato90}
T. Sato,
Completed Logic Programs and Their Consistency,
{\em Journal of Logic Programming}
vol. 9,
1990,
pp. 33-44.

\bibitem[Sato92]{Sato92}
T. Sato,
Equivalence-preserving first-order unfold/fold transformation systems,
{\em Theoretical Computer Science},
105,
1992,
pp. 57-84

\bibitem[SatoMotoyoshi91]{SatoMotoyoshi91}
T. Sato and F. Motoyoshi,
A complete top-down interpreter for first order logic programs,
in: \cite{LPsymp91},
pp. 35-53.

\bibitem[SatoTamaki84]{SatoTamaki84}
T. Sato and H. Tamaki,
Transformational logic program synthesis,
in: {\em Proceedings of the International Conference on 
Fifth Generation Computing},
pp. 195-201,
1984.

\bibitem[Shepherdson88]{Shepherdson88}
J. C. Shepherdson,
Negation in logic programming for general logic programs,
\cite{Minker88},
pp. 19-88.

\bibitem[Shepherdson89]{Shepherdson89}
J. C. Shepherdson,
A Sound and Complete Semantics for a Version of Negation as Failure,
{\em Theoretical Computer Science}
65,
1989,
pp. 343-371.

\bibitem[Shepherdson91]{Shepherdson91}
J. C. Shepherdson,
Correct answers to allowed queries are ground,
{\em The Journal of Logic Programming} 11 (3&4), 1991, 359-362.

\bibitem[Shepherdson91b]{Shepherdson91b}
J. C. Shepherdson,
{\em Language and equality Theory in Logic Programming},
Report No. PM-91-02,
University of Bristol, School of Mathematics,
England,
1991.

\bibitem[Shepherdson92]{Shepherdson92}
J. C. Shepherdson,
SLDNF-Resolution with Equality,
{\em Journal of Automated Reasoning}
8,
1992,
297-306.

\bibitem[Shepherdson95]{Shepherdson95}
J. C. Shepherdson,
Negation as failure, completion and stratification,
\cite{GabbayHoggerRobinson95}.

\bibitem[St\"{a}rk91]{Stark91}
R. F. St\"{a}rk,
A complete axiomatization of the three-valued completion of logic programs,
{\em Journal of Logic and Computation} 1(6), 1991, 811-834.

\bibitem[St\"{a}rk93]{Stark93}
R. F. St\"{a}rk,
From Logic Programs to Inductive Definitions,
in: W.A. Hodges (ed).,
{\em Logic Colloquium '93},
Oxford University Press.

\bibitem[St\"{a}rk94]{Stark94}
R. F. St\"{a}rk,
Input/Output dependencies of normal logic programs,
{\em Journal of Logic and Computation} 
vol 4, no. 3, pp. 249-262, 1994.

\bibitem[St\"{a}rk94]{Stark94}
R. F. St\"{a}rk,
The Declarative Semantics of the Prolog Selection Rule,
{\em  Proceedings of the Ninth Annual IEEE Symposium on 
Logic in Computer Science, 
Paris, France, 1994},
to appear.

\bibitem[Stuckey91]{Stuckey91}
Constructive negation for constraint logic programming,
in: {\em 6th Annual IEEE Symposium on Logic In Computer Science (LICS'91),}
July 1991.

\bibitem[TamakiSato84]{TamakiSato84}
H. Tamaki and T. Sato,
Unfold/Fold Transformation of Logic Programs,
in in \cite{LPconf84},
pp. 127-138.

\bibitem[TamakiSato86]{TamakiSato86}
H. Tamaki and T. Sato,
OLD Resolution with Tabulation,
in \cite{LPconf86},
pp. 84-98.

\bibitem[Wagner89]{Wagner89}
G. Wagner, 
{\em Algebraic Semantics of Propositional Logic Programs}, 
draft,
1989.

\bibitem[Wagner90]{Wagner90}
G. Wagner, 
{\em Vivid Reasoning with Negative Information}, 
draft,
1990.

\bibitem[Wagner91]{Wagner91}
G. Wagner, 
Logic Programming with Strong Negation and Inexact Predicates, 
{\em Journal of Logic and Computation},
1 (6),
1991,
pp. 835-859.

\bibitem[Walinsky89]{Walinsky89}
C. Walinsky, 
{\em The semantics of logic programs that employ constructive negation}, 
draft,
1989.

\bibitem[Wallace87]{Wallace87}
M. Wallace,
Negation by constraints: 
A sound and efficient implementation of negation in deductive databases,
in \cite{LPsymp87}
pp. 253-263.

\bibitem[Wallace89]{Wallace89}
M. Wallace, 
A Computable Semantics for General Logic Programs,
{\em Journal of Logic Programming},
vol. 6, no. 3, 
1989, 
pp. 269-297. 

\bibitem[vanEmdenKowalski76]{vanEmdenKowalski76}
M. H. van Emden and R. A. Kowalski,
The Semantics of Predicate Logic as a Programming Language,
{\em J. ACM} 
23, 4 
(Oct. 1976), 
pp. 733-742.

\bibitem[VanGelder89]{VanGelder89}
A. Van Gelder, 
Negation as Failure Using Tight Derivations for General Logic Programs, 
{\em Journal of Logic Programming},  
vol. 6, no. 1 \& 2, 
1989,
pp. 109-133.

\bibitem[VanGelderSchlipf93]{VanGelderSchlipf93}
A. Van Gelder and J. S. Schlipf,
Commonsense axiomatization for logic programs,
{\em Journal of Logic Programming},
vol. 17, nos. 2,3,4,
1993,
pp. 161-195.

\bibitem[Wallace93]{Wallace93}
M. Wallace,
Tight, consistent, and computable completions for unrestricted logic programs,
{\em The Journal of Logic Programming} 15, 1993, 243-273.

\bibitem[Weijland8?]{Weijland8?} 
W. P. Weijland, 
Semantics for Logic Programs without Occur Check, 
draft,
198?. 

\bibitem[WolframEtAl84]{WolframEtAl84}
D. A. Wolfram, M. J. Maher and J.-L. Lassez, 
A Unified Treatment of Resolution Strategies for Logic Programs, 
in \cite{LPconf84},
pp. 263-276. 
