A data-dependency-based intelligent backtracking scheme for PROLOG

DOI10.1016/0743-1066(88)90017-9MaRDI QIDQ3789106zbMATH OpenOpenAlexFDO

Authors Vipin Kumar, Yow-Jian Lin

Publication date 1988

Published in The Journal of Logic Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0743-1066(88)90017-9

zbMATH Keywords

data dependency between literalsintelligent backtrackingperformance evaluationPrologunification failuresWarren's abstract machine

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• An improved data-dependency-based backtracking scheme for Prolog
• scientific article; zbMATH DE number 3976298
• scientific article; zbMATH DE number 3967899
• Some results on the complexity of exploiting data dependency in parallel logic programs
• scientific article; zbMATH DE number 4009855

Cited in

(9)

• An execution model for exploiting AND-parallelism in logic programs
• A backtracking algorithm for the stream AND-parallel execution of logic programs
• Intelligent backtracking in \(\text{CLP}(\Re)\)
• An improved data-dependency-based backtracking scheme for Prolog
• Intelligent data retrieval in prolog: An illuminating idea
• Intelligent Backtracking in Plan-Based Deduction
• scientific article; zbMATH DE number 3976298 (Why is no real title available?)
• scientific article; zbMATH DE number 4009855 (Why is no real title available?)
• Optimization by non-deterministic, lazy rewriting

This page was built for publication: A data-dependency-based intelligent backtracking scheme for PROLOG

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