Skip to main content
SpringerLink
Log in

Analysis of dependencies to improve the behaviour of logic programs

  • Friday Morning
  • Conference paper
  • First Online:
Book cover 5th Conference on Automated Deduction Les Arcs, France, July 8–11, 1980 (CADE 1980)

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

Included in the following conference series:

Abstract

Traditionally, backtracking uses a total order over the derivation steps. On failure, it returns to the most recent state. We consider states as a set of derivation steps. For each step, we save a ‘inputset’ validating the derivation. This results in a partial order over the derivation steps and allows a more accurate ‘intelligent’ backtracking.

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.

9. References

  1. Bruynooghe, M. Intelligent backtracking for an interpreter of Horn Clause logic programs. Report CW 16, Afdeling Toegepaste Wiskunde en Programmatie, K.U.Leuven, Belgium, september 1978.

    Google Scholar 

  2. Bruynooghe, M. Naar een betere beheersing van de uitvoering van programma's in de logika der Horn-uitdrukkingen. (In Dutch). Doctoral dissertation, Afdeling Toegepaste Wiskunde en Programmatie, K.U.Leuven, Belgium, may 1979.

    Google Scholar 

  3. Colmerauer, A., Kanoui, H., Roussel, P. and Pasero, R. Un systeme de communication homme-machine en francais. Groupe d'Intelligence Artificielle, U.E.R. de Luminy, Université d' Aix-Marseille, 1973.

    Google Scholar 

  4. Doyle, J. A truth maintenance system. Artificial Intelligence 12 (1979), 231–272.

    Article  Google Scholar 

  5. Kowalski, R.A. Predicate logic as a programming language. Information Processing 74, North-Holland Pub. Co., Amsterdam, 1974, pp. 569–574.

    Google Scholar 

  6. Kowalski, R.A. Algorithm = logic + control. Comm. ACM 22, 7 (july 1979), 424–436.

    Google Scholar 

  7. Robinson, J.A. Logic: form and function. Edinburgh University Press 1979.

    Google Scholar 

  8. Sussman, G.J. and McDermott, D.V. Why conniving is better than planning. AI Memo 255A, MIT, april 1972.

    Google Scholar 

  9. Warren, D., Pereira, L.M. and Pereira, F. PROLOG-The language and its implementation compared with LISP. Proc. symp. on Art. Intell. and Programming Languages; SIGPLAN Notices (ACM) 12, 8; SIGART Newsletters (ACM) 64 (august 1977), pp. 109–115.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Afdeling Toegepaste Wiskunde en Programmatie, Katholieke Universiteit Leuven, B-3030, Heverlee, Belgium

    Maurice Bruynooghe

Authors
  1. Maurice Bruynooghe
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Wolfgang Bibel Robert Kowalski

Rights and permissions

Reprints and permissions

Copyright information

© 1980 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bruynooghe, M. (1980). Analysis of dependencies to improve the behaviour of logic programs. In: Bibel, W., Kowalski, R. (eds) 5th Conference on Automated Deduction Les Arcs, France, July 8–11, 1980. CADE 1980. Lecture Notes in Computer Science, vol 87. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-10009-1_23

Download citation

  • DOI: https://doi.org/10.1007/3-540-10009-1_23

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation