Skip to main content
SpringerLink
Log in

Representing null values in logic programming

  • Conference paper
  • First Online:
Logical Foundations of Computer Science (LFCS 1994)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 813))

Included in the following conference series:

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. Chitta Baral and Michael Gelfond. Logic programming and representation of commonsense reasoning. Manuscript, 1993.

    Google Scholar 

  2. Codd E. F. Extending the database relational model to capture more meaning. ACM Transactions on Database Systems, 4(4):397–434, 1979.

    Google Scholar 

  3. R Fagin. Monadic generalized spectra. Z. Math Logic, (21):89–96, 1975.

    Google Scholar 

  4. Michael Gelfond. Logic programming and reasoning with incomplete information. Annals of Mathematics and Artificial Intelligence, 1992. To appear.

    Google Scholar 

  5. Michael Gelfond and Vladimir Lifschitz. Classical negation in logic programs and disjunctive databases. New Generation Computing, pages 365–387, 1991.

    Google Scholar 

  6. K. Inoue, M. Koshimura, and R. Hasegawa. Embedding negation as failure into a model generation theorem prover. In The Eleventh International Conference on Automated Deduction, 1992.

    Google Scholar 

  7. Hector Levesque. The logic of incomplete knowledge bases. In John Mylopoulos and Michael Brodie, editors, Artificial Intelligence and Databases, pages 328–341. Morgan Kaufmann, San Mateo, CA, 1988.

    Google Scholar 

  8. Yuan Liu. Null values in definite programs. In Proc. of the 1990 North American Conference on Logic Programming, pages 273–287, 1990.

    Google Scholar 

  9. Teodor Przymusinski. Extended stable semantics for normal and disjunctive programs. In David Warren and Peter Szeredi, editors, Logic Programming: Proc. of the Seventh Int'l Conf., pages 459–477, 1990.

    Google Scholar 

  10. Raymond Reiter. On integrity constraints. In Moshe Vardi, editor, Theoretical Aspects of Reasoning about Knowledge: Proc. of the Second Conf., pages 97–111, 1988.

    Google Scholar 

  11. Raymond Reiter. Towards a logical reconstruction of relational data base theory. In John Mylopoulos and Michael Brodie, editors, Artificial Intelligence and Data Bases, pages 301–327. Morhan Koufmann, San Mateo, Ca., 1988.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of Texas at El Paso, USA

    Bonnie Traylor & Michael Gelfond

Authors
  1. Bonnie Traylor
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Michael Gelfond
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Anil Nerode Yu. V. Matiyasevich

Rights and permissions

Reprints and permissions

Copyright information

© 1994 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Traylor, B., Gelfond, M. (1994). Representing null values in logic programming. In: Nerode, A., Matiyasevich, Y.V. (eds) Logical Foundations of Computer Science. LFCS 1994. Lecture Notes in Computer Science, vol 813. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58140-5_32

Download citation

  • DOI: https://doi.org/10.1007/3-540-58140-5_32

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-58140-6

  • Online ISBN: 978-3-540-48442-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation