Concurrent logic languages are high-level programming languages for parallel and
distributed systems that offer a wide range of both known and novel concurrent …

Parallelizing logic programming has attracted much interest in the research community,
because of the intrinsic OR-and AND-parallelisms of logic programs. One research stream …

Both logic programming in general and Prolog in particular have a long and fascinating
history, intermingled with that of many disciplines they inherited from or catalyzed. A large …

Since the early days of logic programming, researchers in the field realized the potential for
exploitation of parallelism present in the execution of logic programs. Their high-level …

Andorra-I is anexperimental parallel Prolog system that transparently exploits both
dependent and-parallelism and or-parallelism. It constitutes the first implementation of the …

SICStus Prolog has evolved for nearly 25 years. This is an appropriate point in time for
revisiting the main language and design decisions, and try to distill some lessons. SICStus …

A Prolog technology theorem prover (PTTP) is an extension of Prolog that is complete for the
full first-order predicate calculus. It differs from Prolog in its use of unification with the occurs …

Muse (Mu lti-se quential Prolog engines) is a simple and efficient approach to Or-parallel
execution of Prolog programs. It is based on having several sequential Prolog engines, each …

From the point of view of distributed programming one of the most interesting communication
mechanisms is associative tuple matching in a shared dataspace, as exemplified in the …

Tabled evaluations ensure termination of logic programs with finite models by keeping track
of which subgoals have been called. Given several variant subgoals in an evaluation, only …