Skip to main content

Towards a systematic approach to representing knowledge in declarative logic programming

Invited Talk

  • Regular Papers
  • Conference paper
  • First Online:
Logic Programming And Nonmonotonic Reasoning (LPNMR 1997)

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

  • 105 Accesses

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

Access this chapter

Institutional subscriptions

References

  1. C. Baral, M. Gelfond, and O. Kosheleva. Approximating general logic programs, Proc. ILPS, pp. 181–198, 1993.

    Google Scholar 

  2. Y. Deville. Logic Programming: systematic program development, Clark, K., series editor, Addison-Wesley Publishing Co., 1990.

    Google Scholar 

  3. M. Gelfond and H. Przymusinska. Towards a theory of elaboration tolerance: logic programming approach. International Journal of Software Engineering and Knowledge Engineering, 6(1):89–112, 1996.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Jürgen Dix Ulrich Furbach Anil Nerode

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Gelfond, M. (1997). Towards a systematic approach to representing knowledge in declarative logic programming. In: Dix, J., Furbach, U., Nerode, A. (eds) Logic Programming And Nonmonotonic Reasoning. LPNMR 1997. Lecture Notes in Computer Science, vol 1265. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-63255-7_17

Download citation

  • DOI: https://doi.org/10.1007/3-540-63255-7_17

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-63255-9

  • Online ISBN: 978-3-540-69249-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics