Bibliography

AP90

Apt K.R. e Pedreschi D., ``Studies in Pure Prolog: Termination", in: Proceedings of the Symposium on Computational Logic, Lloyd J. W. (ed), Brussels, Springer-Verlag, 1990, pp. 150-176.

AP91

Apt K.R. e Pedreschi D., ``Proving Termination of general Prolog programs", in: Proceedings of the International Conference on Theoretical Aspect of Computer Software, Sendai, Japan, 1991.

BS91

Bal Wang e Shyamasundar R.K., ``Methodology for proving termination of logic programs", in: Proceedings STACS '91, Jantzen M. (ed), Lecture Notes in Computer Science 480, Springer-Verlag, Berlin, 1991, pp. 214-227.

BaMPT90

Barbuti R., Mancarella P., Pedreschi D. e Turini F., ``A Trasformational Approach to Negation in Logic Programming", Journal of Logic Programing, 8, 1990, pp. 201-208.

Bez89

Bezem M., ``Characterizing termination of logic programs with level mappings", in: Proceedings of North American Conference of Logic Programming, Lusk E.L. e Overbeek R.A. (ed), The MIT Press, 1989, pp. 69-80.

BCF91

Bossi A., Cocco N. e Fabris M., ``Termination of Logic Programs by Exploiting Term Properties", in: Proceedings CCPSD-TAPSOFT '91, Lecture Notes in Computer Science 494, Springer-Verlag, Berlin, 1991, pp.153-180.

BK82

Bowen K.A. e Kowalski R.A., ``Amalgamating Language and Metalanguage in Logic Programming", in: Logic Programming, Clark K.L. e Tarnlund S.A. (ed), Academic Press, 1982, pp. 153-172.

BMPT90

Brogi A.,Mancarella P., Pedreschi D., Turini F., ``Composition Operators for Logic Theories", in: Proceedings of the Symposium on Computational Logic, Lloyd J. W. (ed), Brussels, Springer-Verlag, 1990, pp. 117-134.

Chan88

Chan D., ``Constructive Negation based on the Completed Database", in: Proceedings of Fifth International Conference and Symposium on Logic Programming, Kowalski R.A. e Bowen K. (ed.) Seattle, MIT Press, 1988

Chan89

Chan D., ``An Extension of Constructive Negation and its Application in Coroutining", in: Proceedings of North American Conference of Logic Programming, Cleveland, Ohio, 1989.

Clark78

Clark K.L., ``Negation as Failure", in: Logic and Data Bases, Gallaire H. e Minker J. (ed), Plenum Press, New York, 1978, pp. 293-322.

Colm90

Colmerauer A., ``An introduction to Prolog III'', in: Proceedings of the Symposium on Computational Logic, LLoyd J.W. (ed), Brussels, Springer-Verlag, 1990, pp. 37-79.

DHSA88

Dincbas M., e altri, ``The constraint logic programming language CHIP'', in: Proceedings of the International Conference on Fifth Generation Computer Systems, Tokyo, 1988, pp.693-702.

HB88

Haridi S. e Brand P., ``Andorra Prolog: an integration of Prolog and committed choice languages'', in: Proceedings of the International Conference on Fifth Generation Computer System, Tokyo, 1988, pp. 745-754.

HL91

Hill P.M. e Lloyd J.W., The Gödel Report, TR-91-02, Computer Science Department, University of Bristol, September 1991.

Kow90

Kowalski R. A., ``Problems and promises of Computational Logic", in: Proceedings of the Symposium on Computational Logic, Lloyd J. W. (ed), Brussels, Springer-Verlag, 1990, pp. 1-36.

JL87

Jaffar J. e Lassez J.L., ``Constraint logic programming'', in: Fourteenth Annual ACM Symp. on Principles of Programming Languages, Munich, 1987, pp. 111-119.

Llo87

Lloyd J.W., Foundations of Logic Programming, (seconda edizione), Berlin, Springer-Verlag, 1987

Man88

Mancarella P., Negazione intensionale di programmi logici, tesi di dottorato, Dip. di Informatica, Univ. di Pisa, 1988.

MPRT90

Mancarella P., Pedreschi D., Rondinelli M., Tagliatti M., ``Algebraic Properties of a Class of Logic Programs", in: Symposium of Logic Programming, Seattle, 1988, pp. 1006-1023

Plü90

Plümer L., Termination Proofs for Logic Programs, Lecture Notes in Artificial Intelligence 446, Springer-Verlag, Berlin, 1990.

Plü91

Plümer L., ``Automatic Termination Proofs for Prolog programs Operating on Nonground Terms", in: Proceedings of the International Logic Programming Symposium, San Diego, California, Oct. 28-31, 1991, pp. 503-517.

UvG88

Ullman J.D. e van Gelder A., Efficient tests for top-down termination of logical rules, J. ACM, 35(2)345-373, 1988.

vEK76

van Emden M.H. e Kowalski R.A., ``The Semantics of Predicate Logic as a Programming Language''. Journal of the ACM 23, 733-742, 1976.

VP86

Vasak T. e Potter J., ``Characterization of terminating logic programs", in: Proceedings of the 1986 IEEE Symposium on Logic Programming, 1986.

VDS91

Verschaetse K. e De Schreye D., ``Deriving Termination Proofs for Logic Programs, using Abstract Procedures", in: Proceedings ICLP '91, K. Furukawa (ed), The MIT Press,1991, pp.301-315.