Skip to main content
Springer Nature Link
Log in

A unified framework for characterising logic program executions

  • Logic Programming
  • Conference paper
  • First Online:
Knowledge Based Computer Systems (KBCS 1989)

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

Included in the following conference series:

  • 1949 Accesses

Abstract

This paper presents a unified framework for characterising execution models for logic programs. The framework consists of two basic entities, viz., objects and actions. Objects are abstractions of data values, program encodings, variable bindings etc., whereas actions represent events like application of a function to its arguments, unification, solving a conjunction,etc. The relationship between objects and actions are specified as rules, within an execution model. These rules govern the behaviour of an execution model. Within the framework, it is shown how to characterise the salient properties of dataflow model of logic programs, as well as execution models of concurrent logic languages. This enables us to understand better the relationships between the execution models of logic programs.

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. Arvind and Culler DE. Dataflow architectures. Annual Reviews in Computer science I, pp 225–253, 1986.

    Google Scholar 

  2. Bruynooghe M and Pereira LM. Deduction revision by intelligent backtracking, Implementations of Prolog, J.A.Campbell(ed.), Ellis Horwood, pp 194–215, 1984.

    Google Scholar 

  3. Conery JS. The AND-OR process model of parallel interpretation of logic programs. Technical report 1204, University of California at Irvine, 1983.

    Google Scholar 

  4. Davis AL and Keller RM. Dataflow program graphs, IEEE Computer, pp 26–41, February 1982.

    Google Scholar 

  5. Gregory S. Parallel logic programming in PARLOG. Addison Wesley, 1987.

    Google Scholar 

  6. Halim Z. A Data driven machine for OR-parallel evaluation of logic programs. New Generation Computing, 4, pp 5–33, 1986.

    Google Scholar 

  7. Kowalski R. Logic for problem solving. Elsevier North Holland, 1979.

    Google Scholar 

  8. Lusk E. Warren DHD. Haridi S. et al. The AURORA OR-parallel PROLOG system. Proceedings of the Intl. Conf. on FGCS, pp 819–830, 1988.

    Google Scholar 

  9. Ravindran E and Mehndiratta SL. A unified framework for characterising logic program executions. Technical Report, TR-003-89, I.I.T Bombay, October 1989.

    Google Scholar 

  10. Saraswath V. Problems with Concurrent Prolog. Technical Report, CMU-CS-86-100, Carnegie-Mellon University, 1986.

    Google Scholar 

  11. Saraswath V. The Concurrent logic programming language CP: Definition and operational semantics. Proceedings of the ACM Symposium on Principles of Programming Languages, pp 49–62, 1987.

    Google Scholar 

  12. Shapiro EY. A subset of Concurrent Prolog and its interpreter. Technical Report, TR-003, Weizmann Institute of Science, Israel, 1983.

    Google Scholar 

  13. Wise MJ. Prolog Multiprocessors. Prentice-Hall 1986.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Engg., Indian Institute of Technology, 400 076, Bombay, India

    E Ravindran & SL Mehndiratta

Authors
  1. E Ravindran
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. SL Mehndiratta
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

S. Ramani R. Chandrasekar K. S. R. Anjaneyulu

Rights and permissions

Reprints and permissions

Copyright information

© 1990 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ravindran, E., Mehndiratta, S. (1990). A unified framework for characterising logic program executions. In: Ramani, S., Chandrasekar, R., Anjaneyulu, K.S.R. (eds) Knowledge Based Computer Systems. KBCS 1989. Lecture Notes in Computer Science, vol 444. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0018384

Download citation

  • DOI: https://doi.org/10.1007/BFb0018384

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-52850-0

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics