Referenced Items are not available for this document.
To improve the execution speed of logic programs, exploiting parallelism has proved promising. The paper presents a scheme supporting Restricted AND-parallelism improved over a previous scheme by exploiting more parallelism. The scheme is based on dataflow computation and implemented in a non-shared execution model, and thus taking advantages of distributed binding results. Comparison with the previous scheme is discussed and some examples given
Published in:
TENCON '93. Proceedings. Computer, Communication, Control and Power Engineering.1993 IEEE Region 10 Conference on
Date of Conference: 19-21 Oct 1993
- Page(s):
- 150 - 153 vol.1
- Meeting Date :
- 19 Oct 1993-21 Oct 1993
- Print ISBN:
- 0-7803-1233-3
- INSPEC Accession Number:
- 4777863
- Conference Location :
- Beijing
- Digital Object Identifier :
- 10.1109/TENCON.1993.319950
- Product Type:
- Conference Publications
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
