intelligent backtracking

(algorithm)

An improved backtracking algorithm for Prolog interpreters, which records the point at which each logic variable becomes bound and, when a given set of bindings leads to failure, ignores any choice point which does not bind any of those variables. No choice from such a choice point can succeed since it does not change the bindings which caused the failure.

This article is provided by FOLDOC - Free Online Dictionary of Computing (foldoc.org)

All content on this website, including dictionary, thesaurus, literature, geography, and other reference data is for informational purposes only. This information should not be considered complete, up to date, and is not intended to be used in place of a visit, consultation, or advice of a legal, medical, or any other professional.