Execution of logic programs by iterative-deepening A\(^*\) SLD-tree search

DOI10.1007/BF01989745zbMath0781.68103OpenAlexW2051471953MaRDI QIDQ688625

Roland Olsson

Publication date: 30 November 1993

Published in: BIT (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01989745

zbMATH Keywords

iterative-deepeningSLD-tree search

Mathematics Subject Classification ID

Logic programming (68N17)

Cites Work

• Unnamed Item
• Depth-first iterative-deepening: An optimal admissible tree search
• Negation and control in PROLOG
• Automating control for logic programs
• Efficient randomized pattern-matching algorithms
• Negation as failure using tight derivations for general logic programs
• The well-founded semantics for general logic programs

This page was built for publication: Execution of logic programs by iterative-deepening A\(^*\) SLD-tree search