OnlineWoerterBuecher.de
Internes

Lexikon


intelligent backtracking


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)

In addition suitable contents:
[ = ] [ ad ] [ ai ] [ al ] [ algorithm ] [ am ] [ an ] [ ar ] [ arc ] [ at ] [ au ] [ b ] [ ba ] [ backtracking ] [ be ] [ bi ] [ bo ] [ ca ] [ cc ] [ ch ] [ ck ] [ co ] [ com ] [ ding ] [ do ] [ du ] [ ec ] [ ed ] [ ee ] [ er ] [ es ] [ et ] [ failure ] [ fi ] [ file ] [ fo ] [ for ] [ fr ] [ ge ] [ gi ] [ gn ] [ gs ] [ h ] [ hang ] [ hm ] [ hose ] [ hr ] [ id ] [ il ] [ in ] [ inc ] [ int ] [ interpreter ] [ it ] [ ki ] [ Lex ] [ logic variable ] [ lu ] [ mo ] [ mod ] [ module ] [ mp ] [ N ] [ na ] [ nc ] [ ng ] [ no ] [ om ] [ ph ] [ point ] [ pr ] [ Prolog ] [ query ] [ rc ] [ re ] [ record ] [ records ] [ rete ] [ ro ] [ se ] [ set ] [ si ] [ su ] [ th ] [ to ] [ tr ] [ track ] [ tracking ] [ us ] [ va ] [ var ] [ variable ] [ ve ]






Go Back ]

Free On-line Dictionary of Computing

Copyright © by OnlineWoerterBuecher.de - (3569 Reads)

All logos and trademarks in this site are property of their respective owner.

Page Generation in 0.094 Seconds, with 17 Database-Queries
Zurück zur Startseite