作者: 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.