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

00:10

00:09

00:08

00:07

00:06

00:05

00:04

00:03

00:02

00:01

Intelligent backtracking is always a great word to know.
So is lollapalooza. Does it mean:
the offspring of a zebra and a donkey.
an extraordinary or unusual thing, person, or event; an exceptional example or instance.
Dictionary.com, LLC. Copyright © 2012. All rights reserved.
  • Please Login or Sign Up to use the Recent Searches feature