Virtual memory support for OR-parallel logic programming systems

Véron, André; Xu, Jiyang; Delgado-Rannauro, S. A.; Schuerman, Kees

doi:10.1007/3-540-54152-7_78

Search citation statements

Order By: Relevance

Paper Sections

Select...

Paged Binding Array1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

1991

1993

Publication Types

Select...

Article1

Book1

Relationship

Self Cite0

Independent2

Authors

Journals

Cited by 2 publications

(1 citation statement)

References 5 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…| A paged binding array has also been used in the ElipSys system of ECRC [VX91], but for entirely different reasons. In ElipSys, when a choice point is reached the BA is replicated for each new branch.…”

Section: Paged Binding Arraymentioning

confidence: 99%

And-Or parallel Prolog: A recomputation based approach

1993

View full text Add to dashboard Cite

We argüe that in order to exploit both Independent And-and Or-parallelism in Prolog programs there is advantage in recomputing some of the independent goals, as opposed to all their solutions being reused. We present an abstract model, called the Composition-Tree, for representing and-or parallelism in Prolog Programs. The Composition-tree closely mirrors sequential Prolog execution by recomputing some independent goals rather than fully re-using them. We also outline two environment representation techniques for And-Or parallel execution of full Prolog based on the Composition-tree model abstraction. We argüe that these techniques have advantages over earlier proposals for exploiting and-or parallelism in Prolog.

show abstract

Section: Paged Binding Arraymentioning

confidence: 99%