Making exhaustive search programs deterministic

DOI10.1007/BF03037456zbMath0631.68074MaRDI QIDQ1094889

Kazunori Ueda

Publication date: 1987

Published in: New Generation Computing (Search for Journal in Brave)

zbMATH Keywords

parallelismprogram transformationcompilationexhaustive searchProlog programsHorn-clause programmultiple binding environments

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) General topics in the theory of software (68N01)

Related Items

Existential continuation, First order compiler: A deterministic logic program synthesis algorithm

Uses Software

• PARLOG
• GHC

Cites Work

• Notes on the implementation of PARLOG
• PARLOG: parallel programming in logic
• Unnamed Item
• Unnamed Item
• Unnamed Item