(Enter summary)
Abstract: This paper presents two algorithms as extensions to the basic Resolution Principle of logic
programs which exploit parallelism retaining the full semantics of Prolog. The first algorithm,
called SPU, allows parallel execution of unifications belonging to deterministic paths of the
proof tree, giving in effect AND-parallel execution. The second algorithm, called MPU, retains
the benefits of SPU while exploiting OR-parallelism. We also present simulation results which
are indicative of the... (Update)
Context of citations to this paper: More
...goals. The OASys approach imposes a different and much simpler implementation aiming towards higher performance. Our previous work [19] proposed a formal model for the resolution of AND ORparallelism and suggested its implementation and abstract architecture [20] In OASys,...
Cited by: More
OASys: An AND/OR Parallel Logic Programming System - Vlahavas, Kefalas, Halatsis
(Correct)
Active bibliography (related documents): More All
0.3: PARTHEO: A High Performance Parallel Theorem Prover - Schumann, Letz (1990)
(Correct)
0.2: Efficient Theorem Provers based on an Abstract Machine - Schumann (1991)
(Correct)
0.2: A Graphical User Interface for SETHEO - Schumann, Moser (1993)
(Correct)
Similar documents based on text: More All
0.3: Multiple OR-Parallel Resolution: Meta-Level Control of.. - Kefalas, Vlahavas
(Correct)
0.3: An Adaptable Framework for Educational Software.. - Stamelos, Refanidis.. (2000)
(Correct)
0.2: PRACTIC: A Concurrent Object Data Model for a Parallel.. - Bassiliades, Vlahavas (1995)
(Correct)
BibTeX entry: (Update)
I. Vlahavas and P. Kefalas. A Parallel Prolog Resolution Based on Multiple Unifications. Parallel Computing, North-Holland, vol. 18, 1992, 1275-1283. http://citeseer.ist.psu.edu/vlahavas92parallel.html More
@article{ vlahavas92parallel,
author = "I. Vlahavas and P. Kefalas",
title = "A parallel {Prolog} resolution based on multiple unifications",
journal = "Parallel Computing",
volume = "18",
number = "11",
pages = "1275--1283",
year = "1992",
url = "citeseer.ist.psu.edu/vlahavas92parallel.html" }
Citations (may not include all citations):
634
A machine oriented logic based on the resolution principle (context) - Robinson - 1965
120
The Aurora OR-parallel Prolog system (context) - Lusk, Warren et al. - 1990
73
Restricted AND-parallelism (context) - DeGroot - 1984
42
The extended Andorra model with implicit control (context) - Warren - 1990
34
The Muse approach to OR-parallel Prolog
- Ali, Karlsoon - 1990
31
An abstract machine based execution model for computer archi.. (context) - Hermenegildo - 1986
28
The parallel ECRC Prolog system PEPSys: An overview and eval.. (context) - Baron - 1988
21
Pandora: non-deterministic parallel logic programming (context) - Bahgat, Gregory - 1989
20
Principles of the DelPhi parallel inference machine (context) - Clocksin - 1987
8
An abstract KL1 machine and its instruction set (context) - Kimura, Chikayama - 1987
6
LUSH-resolution and its completeness (context) - Hill - 1974
5
Introduction to Guarded Horn Clauses (context) - Ueda - 1986
4
A new abstract Prolog instruction set (context) - Vlahavas, Halatsis - 1987
2
ACM Transactions for Languages and Systems (context) - Clark, Gregory et al. - 1986
2
OR-parallel Prolog and search problems in AI applications (context) - Reynolds, Kefalas - 1990
1
Concurrent Prolog and its interpreter (context) - Shapiro - 1983
1
Performance comparison of AND- and OR- logic programming arc.. (context) - Tick - 1989
1
A RISC Prolog machine architecture (context) - Vlahavas, Halatsis - 1987
1
Towards a parallel inference machine: The APIM project (context) - Vlahavas - 1990
1
AND parallelism in logic programming (context) - Conery, Kibler - 1983
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC