An improved data-dependency-based backtracking scheme for Prolog

DOI10.1016/0020-0190(89)90121-XMaRDI QIDQ1823727zbMATH OpenOpenAlexFDO

Authors Vishv Mohan Malhotra, Tang Van To, Kanchana Kanchanasut

Publication date 1989

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0020-0190(89)90121-x

zbMATH Keywords

unificationdata dependencyintelligent backtrackingWAM

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• A data-dependency-based intelligent backtracking scheme for PROLOG
• scientific article; zbMATH DE number 3967899
• Some results on the complexity of exploiting data dependency in parallel logic programs
• scientific article; zbMATH DE number 3976298
• scientific article; zbMATH DE number 1149402

Cites work

• A data-dependency-based intelligent backtracking scheme for PROLOG
• Maximal unifiable subsets and minimal non-unifiable subsets

Cited in

(2)

• Lazy stream manipulation in prolog via backtracking: the case of \textbf{2P-Kt}
• A data-dependency-based intelligent backtracking scheme for PROLOG

This page was built for publication: An improved data-dependency-based backtracking scheme for Prolog

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1823727)