Research Commons
      • Browse 
        • Communities & Collections
        • Titles
        • Authors
        • By Issue Date
        • Subjects
        • Types
        • Series
      • Help 
        • About
        • Collection Policy
        • OA Mandate Guidelines
        • Guidelines FAQ
        • Contact Us
      • My Account 
        • Sign In
        • Register
      View Item 
      •   Research Commons
      • University of Waikato Research
      • Computing and Mathematical Sciences
      • Computer Science Working Paper Series
      • 1993 Working Papers
      • View Item
      •   Research Commons
      • University of Waikato Research
      • Computing and Mathematical Sciences
      • Computer Science Working Paper Series
      • 1993 Working Papers
      • View Item
      JavaScript is disabled for your browser. Some features of this site may not work without it.

      The design of an optimistic AND-parallel Prolog

      Cleary, John G.; Olthof, Ian
      Thumbnail
      Files
      uow-cs-wp-1993-06.pdf
      6.147Mb
      Find in your library  
      Citation
      Export citation
      Cleary, J.G. & Olthof, I. (1993). The design of an optimistic AND-parallel Prolog (Working paper 93/6). Hamilton, New Zealand: University of Waikato, Department of Computer Science.
      Permanent Research Commons link: https://hdl.handle.net/10289/9962
      Abstract
      A distributed AND-parallel Prolog implementation is described. The system can correctly handle all pure Prolog programs. In particular, it deals with the problem of distributed backtracking. Conflicts in variable bindings are resolved by assigning a time value to every unification. Bindings with smaller time values are given precedence over those with larger time values. The algorithm is based on the optimistic Time Warp system, with Prolog-specific optimizations. The optimizations include two new unification algorithms that permit unification and backtracking in any order. The result is a system which can fully exploit the parallelism available in both dependent and independent AND-parallelism.
      Date
      1993-10
      Type
      Working Paper
      Series
      Computer Science Working Papers
      Report No.
      93/6
      Publisher
      University of Waikato, Department of Computer Science
      Rights
      ©1993 John G. Cleary and Ian Olthof.
      Collections
      • 1993 Working Papers [12]
      Show full item record  

      Usage

      Downloads, last 12 months
      14
       
       

      Usage Statistics

      For this itemFor all of Research Commons

      The University of Waikato - Te Whare Wānanga o WaikatoFeedback and RequestsCopyright and Legal Statement