Unrestricted And-Parallel Execution of Logic Programs with Dependency Directed Backtracking
Proceedings of the Eleventh International Joint Conference on Artificial Intelligence. Parallel and Distributed Processing. Pages 157-161.
Abstract
A model of unrestricted And-parallel execution for logic programs is described, based on Dependency Directed Backtracking (DDBn aimed at improving the efficiency of execution while remaining faithful to conventional syntax and semantics. This is achieved with maximum exploitation of parallelism, DDBT, support of opportunistic stream parallelism and potentially parallel backtracking. The same dependency information needed for DDBT is used to resolve variable binding conflicts. An algorithmic description of the behavior of processes embodying logical procedures is given. Circular dependencies arising out of the opportunistic nature of execution are removed by imposing an ordering on dependencies with an overwriting rule. Various aspects of the model are discussed and illustrated with examples.
@inproceedings{ijcai1989p25,
title = {Unrestricted And-Parallel Execution of Logic Programs with Dependency Directed Backtracking},
author = {Drakos, Nikos},
booktitle = {Proceedings of the Eleventh International Joint Conference on
Artificial Intelligence, {IJCAI-89}},
publisher = {International Joint Conferences on Artificial Intelligence},
editor = {N. S. Sridharan},
pages = {157--161},
year = {1989},
month = {8},
note = {Parallel and Distributed Processing},
url = {https://ijcai.org/proceedings/1989/25},
}
TY - CPAPER TI - Unrestricted And-Parallel Execution of Logic Programs with Dependency Directed Backtracking AU - Drakos, Nikos T2 - Proceedings of the Eleventh International Joint Conference on Artificial Intelligence, IJCAI-89 PB - International Joint Conferences on Artificial Intelligence PY - 1989 SP - 157 EP - 161 UR - https://ijcai.org/proceedings/1989/25 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
