Skip to main content
SpringerLink
Log in

Guarded horn clauses

  • Conference paper
  • First Online:
Logic Programming '85 (LP 1985)

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

Included in the following conference series:

Abstract

A set of Horn clauses, augmented with a ‘guard’ mechanism, is shown to be a simple and yet powerful parallel logic programming language.

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

  • Bowen DL (ed), Byrd L, Pereira FCN, Pereira LM, Warren DHD (1983) DECsystem-10 Prolog User's Manual. Dept of Artificial Intelligence, Univ. of Edinburgh

    Google Scholar 

  • Clark KL, Gregory S (1981) A Relational Language for Parallel Programming. In: Proc ACM Conf on Functional Programming Languages and Computer Architecture. ACM

    Google Scholar 

  • Clark KL, Gregory S (1984a) PARLOG: Parallel Programming in Logic. Research Report DOC 84/4. Dept of Computing, Imperial College, London

    Google Scholar 

  • Clark KL, Gregory S (1984b) Notes on Systems Programming in PARLOG. In: Proc Int Conf on Fifth Generation Computer Systems 1984. Institute for New Generation Computer Technology, Tokyo, 299–306

    Google Scholar 

  • Clark KL Gregory S (1984c) Notes on the Implementation of PARLOG. Research Report DOC 84/16. Dept of Computing, Imperial College, London

    Google Scholar 

  • Clark KL McCabe F (1980) IC-PROLOG—Language Features. In: Tärnlund, S-Ă… (ed) Proc Logic Programming Workshop. Debrecen, Hungary

    Google Scholar 

  • Gregory S (1985) private communication

    Google Scholar 

  • Hagiya M (1983) On Lazy Unification and Infinite Trees. In: Proc Logic Programming Conference '83. Institute for New Generation Computer Technology, Tokyo (in Japanese)

    Google Scholar 

  • Hoare CAR (1978) Communicating Sequential Processes. Comm ACM 21: 666–677

    Article  Google Scholar 

  • Kowalski R (1974) Predicate Logic as Programming Language. In: Proc IFIP 74. North-Holland, Amsterdam New York Oxford, 569–574

    Google Scholar 

  • Miyazaki T (1985) unpublished manuscript. Institute for New Generation Computer Technology, Tokyo

    Google Scholar 

  • Nakashima H, Ueda K, Tomura S (1984) What Is a Variable in Prolog? In: Proc Int Conf on Fifth Generation Computer Systems 1984. Institute for New Generation Computer Technology, Tokyo, 327–332

    Google Scholar 

  • Pereira LM, Nasr R (1984) Delta-Prolog: A Distributed Logic Programming Language. In: Proc Int Conf on Fifth Generation Computer Systems 1984. Institute for New Generation Computer Technology, Tokyo, 283–291

    Google Scholar 

  • Robinson JA (1965) A Machine-Oriented Logic Based on Resolution Principle. J ACM 12: 23–41

    Article  Google Scholar 

  • Roussel P (1975) Prolog: Manual de Reference et d'Utilisation. Groupe d'Intelligence Artificielle, Marseille-Luminy

    Google Scholar 

  • Sato M, Sakurai T (1984) Qute: A Functional Language Based on Unification. In: Proc Int Conf on Fifth Generation Computer Systems 1984. Institute for New Generation Computer Technology, Tokyo, 157–165

    Google Scholar 

  • Shapiro EY (1983) A Subset of Concurrent Prolog and Its Interpreter. ICOT Technical Report TR-003. Institute for New Generation Computer Technology, Tokyo

    Google Scholar 

  • Shapiro EY (1984) Systems Programming in Concurrent Prolog. In: Conf Record of the 11th Annual ACM Symp on Principles of Programming Languages, ACM, 93–105

    Google Scholar 

  • Shapiro EY, Takeuchi A (1983) Object Oriented Programming in Concurrent Prolog, New Generation Computing, 1: 25–48

    Google Scholar 

  • Takeuchi A, Furukawa K (1983) Interprocess Communication in Concurrent Prolog. In: Proc Logic Programming Workshop '83. Universidade Nova de Lisboa, Portugal

    Google Scholar 

  • Ueda K, Chikayama T (1984) Efficient Stream/Array Processing in Logic Programming Languages. In: Proc Int Conf on Fifth Generation Computer Systems 1984. Institute for New Generation Computer Technology, Tokyo, 317–326

    Google Scholar 

  • Ueda K, Chikayama T (1985) Concurrent Prolog Compiler on Top of Prolog. In: Proc 1985 Symposium on Logic Programming. IEEE Computer Society Press, 119–126

    Google Scholar 

  • Ueda K (1985) Concurrent Prolog Re-Examined. ICOT Tech Report TR-102. Institute for New Generation Computer Technology, Tokyo

    Google Scholar 

  • Warren DHD, Pereira LM, Pereira F (1977) PROLOG—The Language and Its Implementation Compared with Lisp. Sigplan Notices, 12: 109–115

    Google Scholar 

Download references

Author information

Author notes

  1. Kazunori Ueda

    Present address: Institute for New Generation Computer Technology, 1-4-28, Mita, Minato-ku, 108, Tokyo, Japan

Authors and Affiliations

  1. C&C Systems Research Laboratories, NEC Corporation, Kawasaki, Japan

    Kazunori Ueda

Authors
  1. Kazunori Ueda
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Eiiti Wada

Rights and permissions

Reprints and permissions

Copyright information

© 1986 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ueda, K. (1986). Guarded horn clauses. In: Wada, E. (eds) Logic Programming '85. LP 1985. Lecture Notes in Computer Science, vol 221. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-16479-0_17

Download citation

  • DOI: https://doi.org/10.1007/3-540-16479-0_17

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-16479-1

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation