Skip to main content
SpringerLink
Log in

Update rules in datalog programs

  • Conference paper
  • First Online:
Logic Programming and Nonmonotonic Reasoning (LPNMR 1995)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 928))

Abstract

We consider Datalogneg databases containing two kinds of rules: update rules and query rules. We regard update rules as constraints, all consequences of which must hold in the database until a new update. We introduce a semantics framework for database updates and query answering based on the well-founded semantics. In this framework, updating over intensional predicates is deterministic.

Work partially supported by the French National Project GDR-PRC BD3 and the Brazilian Government (CNPq and Universidade Federal do Paraná — Brazil)

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. J. J. Alferes and L. M. Pereira. On logic of program semantics with two kinds of negation. In Proceedings of the Joint International Conference and Symposium of Logic Programming, 1992.

    Google Scholar 

  2. N. Bidoit. Negation in rule-based database languages: a survey. Theoretical Computer Science, 78(1), 1991.

    Google Scholar 

  3. N. Bidoit and Ch. Froidevaux. Negation by default and unstratifiable logic programs. Theoretical Computer Science, 78(1), 1991.

    Google Scholar 

  4. S. Ceri, G.Gottlob, and L.Tanca. Logic Programming and Databases. Springer-Verlag, 1990.

    Google Scholar 

  5. A. Van Gelder, K.A. Ross, and J.S. Schlipf. The well-founded semantics for general logic programs. Journal of the ACM, 38(3), 1991.

    Google Scholar 

  6. M. Gelfond and V. Lifschitz. Logic programming with classical negation. In Proceedings of the Seventh International Conference of Logic Programming, 1990.

    Google Scholar 

  7. M. Gelfond and V. Lifschitz. The stable model semantics for logic programming. In Proceedings of the Fifth International Conference and Symposium of Logic Programming, 1990.

    Google Scholar 

  8. M. Gelfond, H. Przymusinka, and T. Przymusinki. On the relationship between circumscription and negation as failure. Artificial Inteligence, 38(1), 1989.

    Google Scholar 

  9. M. Halfeld Ferrari Alves, D. Laurent, and N. Spyratos. Passive and active rules in deductive databases. Technical Report LRI, Université de Paris-Sud, 1994.

    Google Scholar 

  10. M. Halfeld Ferrari Alves, D. Laurent, and N. Spyratos. Passive and active rules in deductive databases. In Proceedings of the International Symposium on Mathematical Foundations of Computer Science, number 841 in LNCS — Lecture Notes in Computer Science. Springer-Verlag, 1994.

    Google Scholar 

  11. M. Halfeld Ferrari Alves, D. Laurent, and N. Spyratos. Update driven rules in Datalogneg databases. Technical Report 94-06, LIFO, Université d'Orléans, 1994.

    Google Scholar 

  12. M. Halfeld Ferrari Alves, D. Laurent, and N. Spyratos. Update rules in Datalog programs. Technical Report LRI, Université de Paris-Sud, 1995.

    Google Scholar 

  13. K. Konolige. On the relation between default and autoepistemisc logic. Artificial Inteligence, 35, 1989.

    Google Scholar 

  14. R. A. Kowalski and F. Sadri. Logic programs with exceptions. In Proceedings of the Seventh International Conference of Logic Programming, 1990.

    Google Scholar 

  15. J. W. Lloyd. Foundations of Logic Programming. Springer-Verlag, second extended edition, 1987.

    Google Scholar 

  16. T. C. Przymusinki. On the relationship between logic programming and nonmontonic reasoning. In The seventh National Conference of Artificial Intelligence, Saint Paul, Minnesota, 1988.

    Google Scholar 

  17. R. Reiter. On closed word databases. In H. Gallaire and J. Minker, editors, Logic and data bases. Plenum Press, New York, 1978.

    Google Scholar 

  18. J. C. Shepherdson. Negation in logic programming. In J. Minker, editor, Foundations of Deductive Databases and Logic Programming. Morgan Kaufmann Publishers, 1988.

    Google Scholar 

  19. J.D. Ullman. Principles of Databases and Knowledge Base Systems, volume I and II. Computer Science Press, 1989.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. LIFO, Université d'Orléans, F-45067, Orléans Cedex 2, France

    D. Laurent

  2. LRI, Université de Paris-Sud, U.R.A. 410 du CNRS, Bât. 490, F-91405, Orsay Cedex, France

    M. Halfeld Ferrari Alves, D. Laurent & N. Spyratos

Authors
  1. M. Halfeld Ferrari Alves
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. D. Laurent
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. N. Spyratos
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

V. Wiktor Marek Anil Nerode M. Truszczyński

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ferrari Alves, M.H., Laurent, D., Spyratos, N. (1995). Update rules in datalog programs. In: Marek, V.W., Nerode, A., Truszczyński, M. (eds) Logic Programming and Nonmonotonic Reasoning. LPNMR 1995. Lecture Notes in Computer Science, vol 928. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-59487-6_6

Download citation

  • DOI: https://doi.org/10.1007/3-540-59487-6_6

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-59487-1

  • Online ISBN: 978-3-540-49282-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation