Advertisement

Guarded horn clauses

  • Kazunori Ueda
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 221)

Abstract

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

Keywords

Horn Clause Colored Pointer Partial Evaluator Generation Computer System Candidate Clause 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bowen DL (ed), Byrd L, Pereira FCN, Pereira LM, Warren DHD (1983) DECsystem-10 Prolog User's Manual. Dept of Artificial Intelligence, Univ. of EdinburghGoogle Scholar
  2. Clark KL, Gregory S (1981) A Relational Language for Parallel Programming. In: Proc ACM Conf on Functional Programming Languages and Computer Architecture. ACMGoogle Scholar
  3. Clark KL, Gregory S (1984a) PARLOG: Parallel Programming in Logic. Research Report DOC 84/4. Dept of Computing, Imperial College, LondonGoogle Scholar
  4. 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–306Google Scholar
  5. Clark KL Gregory S (1984c) Notes on the Implementation of PARLOG. Research Report DOC 84/16. Dept of Computing, Imperial College, LondonGoogle Scholar
  6. Clark KL McCabe F (1980) IC-PROLOG—Language Features. In: Tärnlund, S-Å (ed) Proc Logic Programming Workshop. Debrecen, HungaryGoogle Scholar
  7. Gregory S (1985) private communication Google Scholar
  8. 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
  9. Hoare CAR (1978) Communicating Sequential Processes. Comm ACM 21: 666–677CrossRefGoogle Scholar
  10. Kowalski R (1974) Predicate Logic as Programming Language. In: Proc IFIP 74. North-Holland, Amsterdam New York Oxford, 569–574Google Scholar
  11. Miyazaki T (1985) unpublished manuscript. Institute for New Generation Computer Technology, TokyoGoogle Scholar
  12. 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–332Google Scholar
  13. 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–291Google Scholar
  14. Robinson JA (1965) A Machine-Oriented Logic Based on Resolution Principle. J ACM 12: 23–41CrossRefGoogle Scholar
  15. Roussel P (1975) Prolog: Manual de Reference et d'Utilisation. Groupe d'Intelligence Artificielle, Marseille-LuminyGoogle Scholar
  16. 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–165Google Scholar
  17. Shapiro EY (1983) A Subset of Concurrent Prolog and Its Interpreter. ICOT Technical Report TR-003. Institute for New Generation Computer Technology, TokyoGoogle Scholar
  18. Shapiro EY (1984) Systems Programming in Concurrent Prolog. In: Conf Record of the 11th Annual ACM Symp on Principles of Programming Languages, ACM, 93–105Google Scholar
  19. Shapiro EY, Takeuchi A (1983) Object Oriented Programming in Concurrent Prolog, New Generation Computing, 1: 25–48Google Scholar
  20. Takeuchi A, Furukawa K (1983) Interprocess Communication in Concurrent Prolog. In: Proc Logic Programming Workshop '83. Universidade Nova de Lisboa, PortugalGoogle Scholar
  21. 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–326Google Scholar
  22. Ueda K, Chikayama T (1985) Concurrent Prolog Compiler on Top of Prolog. In: Proc 1985 Symposium on Logic Programming. IEEE Computer Society Press, 119–126Google Scholar
  23. Ueda K (1985) Concurrent Prolog Re-Examined. ICOT Tech Report TR-102. Institute for New Generation Computer Technology, TokyoGoogle Scholar
  24. Warren DHD, Pereira LM, Pereira F (1977) PROLOG—The Language and Its Implementation Compared with Lisp. Sigplan Notices, 12: 109–115Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1986

Authors and Affiliations

  • Kazunori Ueda
    • 1
  1. 1.C&C Systems Research LaboratoriesNEC CorporationKawasakiJapan

Personalised recommendations