Unrestricted and-parallel execution of logic programs with dependency directed backtracking

作者: Nikos Drakos

DOI:

关键词:

摘要: A model of unrestricted And-parallel execution for logic programs is described, based on Dependency Directed Backtracking (DDBT) aimed at improving the efficiency while remaining faithful to conventional syntax and semantics. This achieved with maximum exploitation parallelism, DDBT, support opportunistic stream parallelism potentially parallel backtracking. The same dependency information needed DDBT used resolve variable binding conflicts. An algorithmic description behavior processes embodying logical procedures given. Circular dependencies arising out nature are removed by imposing an ordering overwriting rule. Various aspects discussed illustrated examples.

参考文章(15)
Jung-Herng Chang, Doug DeGroot, Alvin M. Despain, AND-Parallelism of Logic Programs Based on a Static Data Dependency Analysis. COMPCON. pp. 218- 226 ,(1985)
Maurice Bruynooghe, Luís Moniz Pereira, Deduction revision by intelligent backtracking Implementations of Prolog. pp. 194- 215 ,(1984)
Hans Diel, Concurrent Data Access Architecture. Future Generation Computer Systems. pp. 373- 382 ,(1984)
Piotr Dembinski, Jan Maluszynski, AND-Parallelism with Intelligent Backtracking for Annotated Logic Programs. SLP. pp. 29- 38 ,(1985)
Barry Steven Fagin, None, A parallel execution model for prolog University of California, Berkeley. ,(1987)
Luís Moniz Pereira, Luís Monteiro, José Cunha, Joaquim N. Aparício, Delta Prolog: a distributed backtracking extension with events international conference on logic programming. pp. 69- 83 ,(1986) , 10.1007/3-540-16492-8_65
Vipin Kumar, Yow-Jian Lin, A Framework for Intelligent Backtracking in Logic Programs foundations of software technology and theoretical computer science. pp. 108- 123 ,(1986) , 10.1007/3-540-17179-7_7