Abstract
The notion of independence has been used in conventional logic programming as the basis for several optimizations, including program parallelization, intelligent backtracking, and goal reordering. In this paper we extend this notion to logic programming languages with dynamic scheduling. This type of scheduling, in which some calls are dynamically “delayed” until their arguments are sufficiently instantiated, is provided in most practical implementations because it offers advantages for both programming power and declarativeness. We focus on the notion of independence required for ensuring correctness and efficiency of parallelization within the independent and-parallel model. We also provide sufficient conditions for independence which can be evaluated “a-priori” (i.e., at run-time), as is needed in many practical applications.
Original language | English |
---|---|
Title of host publication | Algebraic and Logic Programming |
Subtitle of host publication | 5th International Conference, ALP'96 Aachen, Germany, September 25-27, 1996 Proceedings |
Editors | Michael Hanus, Mario Rodrfguez-Artalejo |
Place of Publication | Berlin Germany |
Publisher | Springer |
Pages | 47-61 |
Number of pages | 15 |
ISBN (Print) | 3540617353 |
DOIs | |
Publication status | Published - 1996 |
Event | International Conference on Algebraic and Logic Programming 1996 - Aachen, Germany Duration: 25 Sep 1996 → 27 Sep 1996 Conference number: 5th https://link.springer.com/book/10.1007/3-540-61735-3 (Proceedings) |
Publication series
Name | Lecture Notes in Computer Science |
---|---|
Publisher | Springer |
Volume | 1139 |
ISSN (Print) | 0302-9743 |
Conference
Conference | International Conference on Algebraic and Logic Programming 1996 |
---|---|
Abbreviated title | ALP 1996 |
Country/Territory | Germany |
City | Aachen |
Period | 25/09/96 → 27/09/96 |
Internet address |
|