Advertisement

A Prolog processor based on a pattern matching memory device

  • Ian Robinson
Session 2a: Implementations And Architectures
Part of the Lecture Notes in Computer Science book series (LNCS, volume 225)

Abstract

A Prolog processing system using a parallel pattern matching component is outlined. The component, called a Pattern Addressable Memory (PAM), is used to store the clause heads from a Prolog database, and match them against an input goal/subgoal. It is shown that using this device has advantages not only for clause selection, but also for the unification function itself. Such a system, it is argued, demonstrates superior performance compared to serial approaches.

Keywords

Pattern Match Serial Approach Unification Function Indexing Instruction Match Token 
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. [Con83]
    J.S. Conery ‘The AND/OR Process Model for Parallel Interpretation of Logic Programs' PhD. thesis, Univ. of California at Irvine, June '83.Google Scholar
  2. [DaR85a]
    A.L. Davis S.V. Robison ‘The FAIM-1 Symbolic Multiprocessing System’ Proc. Compcon, Feb '85.Google Scholar
  3. [DaR85b]
    A.L. Davis S.V. Robison ‘An Overview of the FAIM-1 Multiprocessing System’ Proc. 1st AI & Adv. Computer Tech. Conf., April '85.Google Scholar
  4. [DaR85c]
    A.L. Davis S.V. Robison ‘The Architecture of the FAIM-1 Symbolic Multiprocessing System’ Proc. IJCAI, August '85.Google Scholar
  5. [Dob85]
    T.P. Dobry A.M. Despain Y.N. Patt ‘Performance Studies of a Prolog Machine Architecture’ 8th Annual Int'l Symp. on Comp. Arch., June '85.Google Scholar
  6. [Dwo84]
    C. Dwork P.C. Kanellakis J.C. Mitchell ‘On the Sequential Nature of Unification’ J. Logic Programming, Vol 1, '84.Google Scholar
  7. [Nak85]
    R. Nakazaki et al. ‘Design of a High-Speed Prolog Machine’ 8th Annual Int'l Symp. on Comp. Arch., June '85.Google Scholar
  8. [Rob84]
    I. Robinson ‘The Pattern Addressable Memory’ SPAR internal publication, Nov '84.Google Scholar
  9. [TiW83]
    E. Tick D. Warren ‘Towards a Pipelined Prolog Processor’ Tech. report, SRI AI Centre, Aug '83.Google Scholar
  10. [War77]
    D. Warren ‘Implementing Prolog’ Tech. report 39, Edinburgh University, May '77.Google Scholar
  11. [War83]
    D. Warren ‘An Abstract Prolog Instruction Set’ Tech. Report 309, AI Centre, SRI International, October '83.Google Scholar
  12. [WiP84]
    M.J.Wise D.M.W.Powers ‘Indexing Prolog Clauses via Superimposed Code Words and Field Encoded Words’ Proc. Int. Symp. on Logic Programming, Feb '84.Google Scholar
  13. [Yas84]
    H. Yasuura ‘On Parallel Computational Complexity of Unification’ Proc. Int. Conf. on FGCS '84.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1986

Authors and Affiliations

  • Ian Robinson
    • 1
  1. 1.Schlumberger Palo Alto ResearchComputer Aided Systems LaboratoryPalo Alto

Personalised recommendations