Abstract
Negative programs are logic programs where negation may arise also in the head of rules and have been recently introduced to handle exceptions to general rules. In this paper we present efficient techniques for computing the intended model of stratified negative programs.
Work supported by the CNR project ”Sistemi Informatici e Calcolo Parallelo” sub-project ” Logidata+“.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
K. Apt, H. Blair, A. Walker, Towards a Theory of Declarative Knowledge, In Foundations of Deductive Databases and Logic Programming, Minker, J. (ed.), Morgan Kaufman, Los Altos, pages 88–148, 1988.
F. Bancilhon, D. Mayer, Y. Sagiv, and J.F. Ullman. Magic sets and other strange ways to implement logic programs. In Proceedings of the Fifth ACM Symposyum on Principles of Database Systems, pages 1–15, 1986.
C. Beeri and R. Ramakrisnhan. On the power of magic. In Journal of Logic Programming, 10 (3 & 4), pages 255–299, 1991.
S. Ceri, G. Gottlob, L. Tanca, Logic Programming and Databases, Springer-Verlag, 1990.
M. Gelfond and V. Lifschitz. The stable model semantics of logic programming. In Proceedings of the Fifth Intern. Conference on Logic Programming, pages 1070–1080, 1990.
M. Gelfond, V. Lifschhitz, Logic Programs with Classical Negation, In Proc. of the Seventh Int. Conf. Logic Programming, pages. 579–597, 1990.
S. Greco, D. Saccà, Negative Logic Programs, In Proc. of the North American. Conf. on Logic Programming, pages 480–497, 1990.
S. Greco, D. Saccà, Magic Set Transformation for Negative Logic Programs, Technical Report, 1992.
J.W. Lloyd, Foundations of Logic Programming, Springer Verlag, Berlin, 1987.
R.A. Kowalski, F. Sadri, Logic Programming with Exeptions, In Proc. of the Seventh Int. Conf. Logic Programming, pages 598–616, 1990.
N. Leone, M. Romeo, P. Rullo, D. Saccà, Effective Implementation of negation in Database Logic Query Languages, In this volume.
D. Saccà and C. Zaniolo, The generalized counting method of recursive logic queries for databases. In Theoretical Computer Science, No. 62, pages 187–220, 1989.
D. Saccà and C. Zaniolo, Magic-counting methods. In Proceedings of the 1987 ACM SIGMOD Int. Conf. on Management of Data, pages 149–59, 1987.
D. Saccà, C. Zaniolo, Stable models and Non-determinism for logic programs with negation, In Proc. ACM SIGMOD-SIGACT Symp. on Principles of Database Systems, pages 205–217, 1990.
J.D. Ullman, Principles of Database and Knowledge-Base Systems, Vol. 1, Computer Science Press, Rockville, Md., 1988.
J.D. Ullman, Principles of Database and Knowledge-Base Systems, Vol. 2, Computer Science Press, Rockville, Md., 1989.
A. Van Gelder, Negation as Failure Using Tight Derivations for Logic Programs, in Foundations of Deductive Databases and Logic Programming, Minker, J. (ed.), Morgan Kaufman, Los Altos, pages 88–148, 1988.
A. Van Gelder, K.A. Ross, and J.S. Schlipf. The well-founded semantics for general logic programs. In Journal of ACM, Vol. 38, No. 3, pages 149–176, 1991.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Greco, S., Romeo, M., Saccà, D. (1993). Evaluation of negative logic programs. In: Atzeni, P. (eds) LOGIDATA+: Deductive Databases with Complex Objects. Lecture Notes in Computer Science, vol 701. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0021895
Download citation
DOI: https://doi.org/10.1007/BFb0021895
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-56974-9
Online ISBN: 978-3-540-47844-7
eBook Packages: Springer Book Archive