P-Prolog, a Parallel Logic Programming Language
P-Prolog is put forward as an alternative proposal to the difficulties faced in the main research areas of parallel logic programmings, which have been studied. P-Prolog provides the advantages of guarded Horn clauses while retaining don't know non-determinism where required. This monograph presents also an or-tree model and an implementation scheme for it, to combine and- and or- parallelism with reasonable efficiency. The model and implementation scheme discussed can be applied to P-Prolog and other parallel logic languages.
What people are saying - Write a review
We haven't found any reviews in the usual places.
Other editions - View all
abstract machine alternative clauses and-or tree and-parallelism and or-parallelism and-queue argument arity atomic formula binary tree binding array breakdown function built-in predicates called Chapter choice non-deterministic languages classified Horn clauses committed choice non-deterministic complete binary tree computation Concurrent Prolog consistency check control strategy current node Definition depth described double neck clauses efficiency evaluated example exclusive relation executed in parallel Execution Procedure expected exclusive clauses goal goal's guarded Horn clauses Herbrand universe I/O pattern index binding scheme kind know non-determinism linear input resolution linear search logic programming languages merge multiple environments node's name or-shared variable order logic P-Prolog parallel logic languages parallel logic programming PARLOG pointer problem Program 4.2 pure Horn clauses qsort quicksort reduced reference cell resolution principle resolvent Section sequential logic set of clauses shallow binding shown in Figure single neck clauses step successor synchronization mechanism trail cells tree structured data unification unified variable's