Skip to main content
SpringerLink
Log in

Semantics of Prolog and Logic Programming in General

  • Chapter
Logic Programming

  • 109 Accesses

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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. Allison, L., An Executable Prolog Semantics, Algol Bulletin 50, (December, 1983 ).

    Google Scholar 

  2. Asirelli, P., Some Aspects of the Static Semantics of Logic Programs with Monadic Functions, Proceedings of 2nd Workshop on Logic Programming, Algarve, Portugal, 1983, 485–505.

    Google Scholar 

  3. Balogh, K., On a Logical Method Serving the Proof of the Semantic Features of Programs, Technical Report, Department of Computer Science, Eotvos Lorand University, Budapest, 1979. In Hungarian.

    Google Scholar 

  4. Bellia, M., Degano, P. and Levi, G., The Call by Name Semantics of a Clause Language with Functions, in Logic Programming, K. L. Clark and S. Tarnlund, (eds.), Academic Press, New York, 1982, 281–298. A.P.I.C. Studies in Data Processing No. 16.

    Google Scholar 

  5. Blair, H. A., The Recursion-Theoretic Complexity of the Semantics of Predicate Logic as a Programming Language, Technical Report, Iowa University, 1982. Also Appeared in Information and Control, 54, 25–47, 1982.

    Article  MathSciNet  MATH  Google Scholar 

  6. Brown, F. M., A Semantic Theory for Logic Programming, DAI Report 51, Department of Artificial Intelligence, University of Edinburgh, 1978.

    Google Scholar 

  7. Degano, P. and Diomedi, S., A First-Order Semantics of a Connective Suitable to Express Concurrency, Proceedings of Workshop on Logic Programming, Algarve, Portugal, 1983.

    Google Scholar 

  8. Deransart, P., An Operational Algebraic Semantics of Prolog Programs, Proceedings of Workshop on Logic Programming, Algarve, Portugal, 1983.

    Google Scholar 

  9. Deransart, P., An Operational Semantics of Prolog Programs, Technical Report, Institut National de Recherche en Informatique et en Automatique, France, 1984.

    Google Scholar 

  10. Van Emden, M. H. and Kowalski, R. A., The Semantics of Predicate Logic as a Programming Language, Journal of the ACM 2.4,4 (1976), 733–742.

    Google Scholar 

  11. Van Emden, M. H. and Nait-Abdallah, M. A., Top-Down Semantics of Fair Computations of Logic Programs, Technical Report CS-84–27, Department of Computer Science, University of Waterloo, Canada.

    Google Scholar 

  12. Fages, F., Note Sur L’unification Des Termes De Premier Ordre Finis Et Infinis, Actes du Seminaire Programmation En Logique, M. Dincbas, ed., March, 1983.

    Google Scholar 

  13. Falaschi, M., Levi, G. and Palamidessi, C., On the Fixed Point Semantic of Horn Clauses with Infinite Terms, Proceedings of 2nd Workshop on Logic Programming, Algarve, Portugal, 1983, 474–484.

    Google Scholar 

  14. Falaschi, M., Levi, G. and Palamidessi, C., A Synchronization Logic: Axiomatics and Formal Semantics of Generalized Horn Clauses, Proceedings Janos Bolyai Mathematical Society, Colloquim on Algebra, Combinatorics and Logic in Computer Science, Gyor, Hungary, 1983.

    Google Scholar 

  15. Falaschi, M., Levi, G. and Palamidessi, C., Synchronization in Logic Programming: Formal Semantics of Extended Horn Clauses, Proceedings of Colloqium on Algebra, Combinatorics and Logic in Computer Science, Hungary, 1983.

    Google Scholar 

  16. Goguen, J. A. and Meseguer, J., Equality, Types, Modules and Generics for Logic Programming, Proceedings of the Second International Logic Programming Conference,S. Tarnlund, ed., Uppsala University, Uppsala, Sweden, July 2–6, 1984, 115–126. Also as Technical Report, SRI, Stanford.

    Google Scholar 

  17. Heuschen, L. J., Semantic Resolution For Horn Sets, IEEE Transactions On Computers 25, 8 (1976).

    Google Scholar 

  18. Jaffar, J., Lassez, J. L. and Maher, M. J., A Theory of Complete Logic Programs With Equality, Technical Report, Monash University, Clayton, Victoria, Australia, May, 1984. Also FGCS Conference Proceedings, 1984.

    Google Scholar 

  19. Jaffar, J., Lassez, J. L. and Maher, M. J., A Logical Foundation For Prolog II, Technical Report, Monash University, Clayton, Victoria, Australia, September, 1984.

    Google Scholar 

  20. Jones, N. D. and Mycroft, A., Stepwise Development of Operational and Denotational Semantics for Prolog, Proceedings of the International IEEE Conference on Logic Programming, Atlantic City, 1984.

    Google Scholar 

  21. Kahn, G., The Semantics of a simple language for parallel programming, Information Processing,74.

    Google Scholar 

  22. Lassez, J. L. and Maher, M. J., The Semantics of Logic Programs Oxford University Press,. In Preparation.

    Google Scholar 

  23. Lassez, J. L. and Maher, M. J., Chaotic Semantics of Programming Logic, Technical Report, University of Melbourne, Department of Computer Science, Australia, 1982.

    Google Scholar 

  24. Lassez, J. L. and Maher, M. J., The denotational semantics of Horn Clauses as a Production System, in Proceedings of National Conference on Artificial Intelligence (AAAI-88), Washington D.C., August 1983, 229–231.

    Google Scholar 

  25. Lassez, J. L. and Maher, M. J., Optimal Fixedpoints of Logic Programs, in Proc. 8rd Inter. Conf. on the Foundations of Software Technology and Theoretical Computer Science, Bangalore, India, December 1983.

    Google Scholar 

  26. Lassez, J. L. and Maher, M. J., Closures and Fairness in the Semantics of Programming Logic, Theoretical Computer Science 29,(1984), 167–184. Also as Technical Report 83/3, Department of Computer Science, University of Melbourne.

    Google Scholar 

  27. Levi, G: and Palamidessi, C., The Declarative Semantics of Logical Read-only Variables, Proceedings of the End IEEE International Symposium on Logic Programming, Boston, USA, July, 1985.

    Google Scholar 

  28. Lloyd, J. W. and Topor, R. W., Making Prolog More Expressive, Technical Report 84/8, Department Of Computer Science, University Of Melbourne, 1984. To appear in the Journal of Logic Programming, 1984.

    Google Scholar 

  29. Mahr, B. and Makowsky, J. A., An Axiomatic Approach to Semantics of Specification Languages, Proceedings, 6th GI Conference on Theoretical Computer Science, Dortmund, Springer-Verlag Lecture Notes in Computer Science 145, (1983).

    Google Scholar 

  30. Mahr, B. and Makowsky, J. A., Characterizing Specification Languages which Admit Initial Semantics, Theoretical Computer Science 31 (1984.), 49–60.

    Article  MathSciNet  MATH  Google Scholar 

  31. Makowsky, J. A., Why Horn Formulas Matter in Computer Science: Initial Structures and Generic Examples, Technical Report, Department of Computer Science, Technion, Haifa, Israel, 1985.

    Google Scholar 

  32. Marque-Pucheu, G., Relational Set of Trees and the Algebraic Semantics of Logic Programming, Acta Info rmatica 20, (1983), 249–260.

    Article  MathSciNet  MATH  Google Scholar 

  33. Mccord, M. C., Semantic Interpretation for the Epistle System, Proceedings of the Second International Logic Programming Conference, S. A. Tarnlund, ed., Uppsala University, Uppsala, Sweden, July 2–6, 1984, 65–76.

    Google Scholar 

  34. Minker, J. and Perlis, D., On the Semantics of Circumscription, Technical Report, University Of Maryland, 1983.

    Google Scholar 

  35. Palmer, M. S., Where to connect? - Solving Problems in Semantics, Working Paper 22, Department of Artificial Intelligence, University of Edinburgh, July, 1977.

    Google Scholar 

  36. Pereira, L. M. and Monteiro, L. F., The Semantics of Parallelism and Coroutining in Logic Programming, Colloquium on Mathematical Logic in Programming, Hungary, 1978. Published by North-Holland in 1981.

    Google Scholar 

  37. Reddy, U., Narrowing as the Operational Semantics of Functional Languages, Proceedings of the 2nd IEEE International Symposium on Logic Programming, Boston, USA, July, 1985.

    Google Scholar 

  38. Sato, M., Negation and Semantics of Prolog Programs, Proceedings of the First International Logic Programming Conference, Marseille, France, September, 1982.

    Google Scholar 

  39. Sintzoff, M., Bounded-Horizon Success-Complete Restriction of Inference Programs, Proceedings of the Second International Logic Programming Conference, S. A. Tarnlund, ed., Uppsala University, Uppsala, Sweden, July 2–6, 1984, 139–150.

    Google Scholar 

  40. Skuce, D., Formal Semantics of KNOWLOG, Technical Report TR-83–15, Department of Computer Science, University of Ottawa, Canada, 1983.

    Google Scholar 

  41. Tamaki, H., Semantics of a Logic Programming Language with a Reducibility Predicate, Proceedings of the International IEEE Conference on Logic Programming, Atlantic City, 1984.

    Google Scholar 

  42. Tarlecki, A., Abstract Algebraic Institutions which Strongly Admit Initial Semantics, CSR-165–84, University of Edinburgh, Computer Science Department, 1984.

    Google Scholar 

  43. Voda, P. J., A View of Programming Languages as Symbiosis of Meaning and Control, Technical Report 84–9, Department of Computer Science, University of British Columbia, Canada, 1984. New Generation Computing, Vol 3, No 1, 1984.

    Google Scholar 

  44. Wolfram, D. A., Maher, M. J. and Lassez, J. L., A Unified Treatment of Resolution Strategies for Logic Programs, Proceedings of the 2nd International Logic Programming Conference, Sweden, July 2–6, 1984. Also Technical Report 83/12, Dept. of Computer Science, University of Melbourne, 36 pp.

    Google Scholar 

  45. Wrightson, G., Semantic Tableaux, Unification and Links, Technical Report, CSD-ANZARP-84–001, May, 1984.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Melbourne, 3052, Parkville, Victoria, Australia

    Isaac Balbin

  2. Computer Science Department, University of California, 90024, Los Angeles, California, USA

    Koenraad Lecot

Authors
  1. Isaac Balbin
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Koenraad Lecot
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

Copyright information

© 1985 Isaac Balbin and Koenraad Lecot

About this chapter

Cite this chapter

Balbin, I., Lecot, K. (1985). Semantics of Prolog and Logic Programming in General. In: Logic Programming. Springer, Dordrecht. https://doi.org/10.1007/978-94-009-5044-3_4

Download citation

  • DOI: https://doi.org/10.1007/978-94-009-5044-3_4

  • Publisher Name: Springer, Dordrecht

  • Print ISBN: 978-0-908069-15-6

  • Online ISBN: 978-94-009-5044-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation