intelligent backtracking

Computing Dictionary

intelligent backtracking definition

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.
(1996-04-06)
The Free On-line Dictionary of Computing, © Denis Howe 2010 http://foldoc.org
Cite This Source
Explore Dictionary.com
Previous Definition: intelligent agent
Next Definition: intelligent card
More from Thesaurus.com
Synonyms and Antonyms for intelligent backtracking
More from Reference.com
Search for articles containing intelligent backtracking
Dictionary.com Word FAQs

Dictionary.com presents 366 FAQs, incorporating some of the frequently asked questions from the past with newer queries.

Copyright © 2014 Dictionary.com, LLC. All rights reserved.
  • Please Login or Sign Up to use the Recent Searches feature