Skip to main content
SpringerLink
Log in

Metric Characterizations of Contextual Logic Programs

  • Conference paper
ALPUK92

Part of the book series: Workshops in Computing ((WORKSHOPS COMP.))

  • 36 Accesses

Abstract

The aim of this paper is twofold: to characterize contextual logic programs by means of metric semantics and to argue the usefulness of metric characterizations for formally reasoning about program properties.

A new denotationsl semantics of contextual logic programs is proposed. It is defined compositionally, without any help of any declarative paradigm and of any transition system. Following the lines of [7], it uses metric spaces rather than cpo’s and processes as semantic domains. It is shown to be well-suited to tackle extra-logical features and abstract enough for program analysis.

A methodology of program analysis is derived from the denotations] metric charaterization of programs. It is suggested that most program properties can be proved by using the equalities defining the denotational semantics and by using inductive reasoning. Properties of the computed answer substitutions can also be established by reasoning about the substitutions reported by the semantics. Those claims are argued through the study of the universal termination property of several classical procedures.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. K.R. Apt and M. Bezem. Acyclic Programs. In D.H.D. Warren and P. Szeredi, editors, Proc. 7 th Int. Conf. on Logic Programming, pages 617–633, Jerusalem, Israel, 1990. The MIT Press.

    Google Scholar 

  2. K.R. Apt and D. Pedreschi. Studies in pure Prolog: termination. In J.W. Lloyd, editor, Symposium on Computational Logic, pages 150–176. Springer-Verlag, 1990.

    Google Scholar 

  3. K.R. Apt and D. Pedreschi. Proving Termination of General Prolog Programs. In T. Ito and A. Meyer, editors, Proceedings of the International Conference on Theoretical Aspects of Computer Software, volume 526 of Lecture Notes in Computer Science, pages 265–289. Springer-Verlag, 1991.

    Chapter  Google Scholar 

  4. K.R. Apt and M.H. van Emden. Contributions to the theory of logic programming. Journal of ACM, 29(3):841–862, 1982.

    Article  MATH  Google Scholar 

  5. M. Baudinet. Proving Termination Properties of Prolog Programs: a Semantic Approach. In Proc. 3 rd Symp. on Logic In Computer Science, pages 336–347, Edinburgh, Great-Britain, 1988. IEEE Computer Society Press.

    Google Scholar 

  6. M. Bezem. Characterizing Termination of Logic Programs with Level Mappings. In E.L. Lusk and R. Overbeek, editors, Proc. of the North American Conference on Logic Programming, pages 69–80, Cleveland, USA, 1989. The MIT Press.

    Google Scholar 

  7. J.W. deBakker and J.I. Zucker. Processes and the Denotational Semantics of Concurrency. Information and Control, 54:70–120, 1982.

    Article  MathSciNet  Google Scholar 

  8. Y. Deville. Logic Programming: Systematic Program Development. International Series in Logic Programming. Addison-Wesley, 1990.

    Google Scholar 

  9. R. Engelking. General Topology. Heldermann Verlag, 1989.

    MATH  Google Scholar 

  10. C.J. Hogger. Introduction to Logic Programming. Academic Press, 1984.

    MATH  Google Scholar 

  11. J.-M. Jacquet and L. Monteiro. Comparative Semantics for a Parallel Contextual Logic Programming Language. In S. Debray and M. Hermenegildo, editors, Proc. of the North American Conference on Logic Programming, pages 195–214, Austin, USA, 1990. The MIT Press.

    Google Scholar 

  12. J.W. Lloyd. Foundations of Logic Programming. Springer-Verlag, second edition, 1987.

    Book  MATH  Google Scholar 

  13. L. Monteiro and A. Porto. Contextual Logic Programming. In G. Levi and M. Martelli, editors, Proc. 6 th Int. Conf. on Logic Programming, pages 284–302, Lisboa, 1989. The MIT Press.

    Google Scholar 

  14. C. Palamidessi, E. Marchiori, and K.R. Apt. Semantics and Proof Theory of First-Order Built-in’s of Prolog. Technical report, Centre for Mathematics and Computer Science (CWI), Amsterdam, The Netherlands, 1992. To appear.

    Google Scholar 

  15. L. Plümer. Termination Proofs for Logic Programs, volume 446 of Lecture Notes in Artificial Intelligence. Springer-Verlag, 1990.

    Book  MATH  Google Scholar 

  16. R.K. Shyamasundar, M.R.K. Rao, and D. Kapur. Rewriting Concepts in the Study of Termination of Logic Programs. This volume.

    Google Scholar 

  17. J.D. Ullman and A. van Gelder. Efficient tests for top-down termination of logical rules. Journal of ACM, 35(2):345–373, 1988.

    Article  Google Scholar 

  18. M.H. van Emden and R.A. Kowalski. The semantics of predicate logic as a programming language. Journal of ACM, 23(4):733–742, 1976.

    Article  MATH  Google Scholar 

  19. T. Vasak and J. Potter. Characterization of Terminating Logic Programs. In Proc. 3 rd Symp. on Logic Programming, pages 140–147, Salt Lake City, USA, 1986. IEEE Computer Society Press.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Namur, Namur, Belgium

    Jean-Marie Jacquet

Authors
  1. Jean-Marie Jacquet
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computing, Imperial College of Science, Technology and Midicine, 180 Queen’s Gate, SW7 2BZ, London, UK

    Krysia Broda BSc, MSc, PhD

Rights and permissions

Reprints and permissions

Copyright information

© 1993 British Computer Society

About this paper

Cite this paper

Jacquet, JM. (1993). Metric Characterizations of Contextual Logic Programs. In: Broda, K. (eds) ALPUK92. Workshops in Computing. Springer, London. https://doi.org/10.1007/978-1-4471-3421-3_2

Download citation

  • DOI: https://doi.org/10.1007/978-1-4471-3421-3_2

  • Publisher Name: Springer, London

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

  • Online ISBN: 978-1-4471-3421-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation