Delta Prolog: A distributed backtracking extension with events

Monteiro, Luís; Cunha, José C.; Aparício, Joaquim Nunes

doi:10.1007/3-540-16492-8_65

Cited by 19 publications

(4 citation statements)

References 1 publication

Supporting

Mentioning

Contrasting

Order By: Relevance

“…(1) Those that add explicit message passing primitives to Prolog, e.g., Delta Prolog [Pereira et al 1986] and CS-Prolog [Futó 1993]. Multiple Prolog processes are run in parallel and they communicate with each other via explicit message passing or other rendezvous mechanisms.…”

Section: Introductionmentioning

confidence: 99%

Parallel execution of prolog programs

Gupta

Pontelli

Ali

et al. 2001

ACM Trans. Program. Lang. Syst.

116

View full text Add to dashboard Cite

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 nature, the presence of non-determinism, and their referential transparency, among other characteristics, make logic programs interesting candidates for obtaining speedups through parallel execution. At the same time, the fact that the typical applications of logic programming frequently involve irregular computations, make heavy use of dynamic data structures with logical variables, and involve search and speculation, makes the techniques used in the corresponding parallelizing compilers and run-time systems potentially interesting even outside the field. The objective of this paper is to provide a comprehensive survey of the issues arising in parallel execution of logic programming languages along with the most relevant approaches explored to date in the field. Focus is mostly given to the challenges emerging from the parallel execution of Prolog programs. The paper describes the major techniques used for shared memory implementation of Or-parallelism, Andparallelism, and combinations of the two. We also explore some related issues, such as memory management, compile-time analysis, and execution visualization.

show abstract

Section: Introductionmentioning

confidence: 99%

Parallel execution of prolog programs

Gupta

Pontelli

Ali

et al. 2001

ACM Trans. Program. Lang. Syst.

116

View full text Add to dashboard Cite

show abstract

“…More details on the algorithm can be found in Narboni (1999) and related references. Researchers have tried to improve the efficiency of this solving procedure, e.g., with intelligent backtracking based on the generator/consumer paradigm (Kumar and Lin 1988) or with parallel AND-tree verification in Pereira et al (1986). More recently, Zhang and Hong (2019) presented an approach based on linear model reduction.…”

Section: Prolog-based Plannersmentioning

confidence: 99%

Logic programming for deliberative robotic task planning

2023

View full text Add to dashboard Cite

Over the last decade, the use of robots in production and daily life has increased. With increasingly complex tasks and interaction in different environments including humans, robots are required a higher level of autonomy for efficient deliberation. Task planning is a key element of deliberation. It combines elementary operations into a structured plan to satisfy a prescribed goal, given specifications on the robot and the environment. In this manuscript, we present a survey on recent advances in the application of logic programming to the problem of task planning. Logic programming offers several advantages compared to other approaches, including greater expressivity and interpretability which may aid in the development of safe and reliable robots. We analyze different planners and their suitability for specific robotic applications, based on expressivity in domain representation, computational efficiency and software implementation. In this way, we support the robotic designer in choosing the best tool for his application.

show abstract

“…Various other intelligent backtracking schemes have been proposed [6,34,40,50], which can reduce the amount of computation in an AND-parallel system. These schemes usually rely on the information of the producer/consumer relationships obtained at both compile-time and run-time, in order to determine a backtracking point.…”

Section: Other Issues In And-parallelismmentioning

confidence: 99%

A review of exploitation of AND-parallelism and combined AND/OR-parallelism in logic programs

Zhang

1994

SIGPLAN Not.

View full text Add to dashboard Cite

Logic programs provide many opportunities for parallel execution. Among different forms of parallelism found in logic programs, AND-parallelism and OR-parallelism have shown to be most effective in speeding up the execution of logic programs. This paper offers a review of major activities in exploiting AND-parallelism and combined AND/OR-parallelism. Full version of this paper (23 pages) can be retrieved through anonymous ftp from ftp.mpce.mq.edu.au.

show abstract

Delta Prolog: A distributed backtracking extension with events

Cited by 19 publications

References 1 publication

Parallel execution of prolog programs

Parallel execution of prolog programs

Logic programming for deliberative robotic task planning

A review of exploitation of AND-parallelism and combined AND/OR-parallelism in logic programs

Contact Info

Product

Resources

About