Skip to main content
SpringerLink
Log in
Book cover

International Workshop on Computer Science Logic

CSL 1989: CSL '89 pp 396–408Cite as

Stratification of definite clause programs and of general logic programs

  • Conference paper
  • First Online:

  • 131 Accesses

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

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • Aandrea, S. O. [1971] On the decision problem for formulas in which all disjunctions are binary, Proc 2nd Scandinavian Logic Symposium, North Holland, Amsterdam, pp 1–18

    Google Scholar 

  • Apt, K. R, Blair, H. and Walker, A. [1988] Towards a theory of declarative knowledge. (to appear)

    Google Scholar 

  • Borger, E. [1971] Reduktionstypen in Krom-und Hornformeln Dissertation Universitat Muenster, (the respective part of the above Dissertation was published in the paper cited next below)

    Google Scholar 

  • [Borger, E. [1974] Beitrag zur Reduktion des Entscheidungproblems auf Klassen von Hornformeln mit kurzem Alternation, Arch. f. mathematische Logik u. Grundlagenforschung 16(1974), 67–84

    Google Scholar 

  • Lassez, C. McAloon, K. and Port, G. [1987] Stratification and Knowledge Base Management in: Proc Fourth Int. Conf. Logic Programming J.-L. Lassez (editor) MIT Press, pp. 136–151

    Google Scholar 

  • Maher, M. J. [1986] Equivalences of Logic Programs in: Proc. Third Int. Conference on Logic Programming, E. Shapiro (editor) LNCS 225 Springer-Verlag pp.410–424

    Google Scholar 

  • Ochozka, V., Stepankova, O., Stepanek, P. and Hric, J. [1989] Normal Forms and the Complexity of Computations of Logic Programs in: CSL '88 “nd workshop on Computer Science Logic, Duisburg 1988, Lecture Notes in Comp. Sci. Vol 385, Springer-Verlag 1989 pp 357–371

    Google Scholar 

  • Sebelik, J., Stepanek, P. [1980] Horn Clause Programs Suggested by Recursive Functions, in Proc Logic Programming Workshop, Debrecen 1980, S.A. Trnlund (editor)

    Google Scholar 

  • Sebelik, J., Stepanek, P. [1982] Horn Clause programs for Recursive Functions in: Logic Programming, K.J.Clark and S.A. Tarnlund (Editors), ACADEMIC PRESS London pp 325–240

    Google Scholar 

  • Stepankova, O., Stepanek, P. [1984] Transformations of Logic Programs J. Logic Programming 1 (1984), 305–318

    Google Scholar 

Download references

Authors
  1. Olga Stepankova
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Petr Stepanek
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Egon Börger Hans Kleine Büning Michael M. Richter

Rights and permissions

Reprints and permissions

Copyright information

© 1990 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Stepankova, O., Stepanek, P. (1990). Stratification of definite clause programs and of general logic programs. In: Börger, E., Büning, H.K., Richter, M.M. (eds) CSL '89. CSL 1989. Lecture Notes in Computer Science, vol 440. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-52753-2_54

Download citation

  • DOI: https://doi.org/10.1007/3-540-52753-2_54

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-52753-4

  • Online ISBN: 978-3-540-47137-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation