Making exhaustive search programs deterministic-Reference-Cited by-同舟云学术

Making exhaustive search programs deterministic

Published:1987-03 Issue:1 Volume:5 Page:29-44
ISSN:0288-3635
Container-title:New Generation Computing
language:en
Short-container-title:New Gener Comput

Author:

Ueda Kazunori

Publisher

Springer Science and Business Media LLC

Subject

Computer Networks and Communications,Hardware and Architecture,Theoretical Computer Science,Software

Link

http://link.springer.com/content/pdf/10.1007/BF03037456.pdf

Reference15 articles.

1. Bowen, D. L., Byrd, L., Perira, F. C. N., Pereira, L. M. and Warren, D. H. D.,DECsystem-10 Prolog User’s Manual (Bowen, D. L. ed.), Dept. of Artificial Intelligence, Univ. of Edinburgh, 1983.

2. Carlsson, M., “On Implementing Prolog in Functional Programming,”Proc. 1984 Int. Symp. on Logic Programming, IEEE Computer Society, pp. 154–159, 1984.

3. Proc. IFIP ’83;A. Ciepielewski,1983

4. Research Report DOC;K. L. Clark,1984

5. Research Report DOC 84/16;K. L. Clark,1984

Cited by 16 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Logic/Constraint Programming and Concurrency: The hard-won lessons of the Fifth Generation Computer project;Science of Computer Programming;2018-10

2. Chain programs for writing deterministic metainterpreters;Theory and Practice of Logic Programming;2002-03

3. Binary Speed Up for Logic Programs;Computational Logic — CL 2000;2000

4. Automatic compile-time parallelization of logic programs for restricted, goal level, independent and parallelism;The Journal of Logic Programming;1999-02

5. An Exhaustive-Search Method Using Layered Streams Obtained Through a Meta-Interpreter for Chain Programs;Logic-Based Program Synthesis and Transformation;1999