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.
(1996-04-06)
Read Also:
- Intelligent card
noun 1. another name for smart card
- Intelligent database
database A database management system which performs data validation and processing traditionally done by application programs. Most DBMSs provide some data validation, e.g. rejecting invalid dates or alphabetic data entered into money fields, but often most processing is done by application programs. There is however no limit to the amount of processing that can be […]
- Intelligent key
database A relational database key which depends wholly on one or more other columns in the same table. An intelligent key might be identified for implementation convenience, where there is no good candidate key. For example, if the three-letter initials of a group of people are known to be unique but only their full names […]
- Intelligent knowledge-based system
noun 1. a computer system in which the properties of a database and an expert system are combined to enable the system to store and process data and make deductions from stored data IKBS
- Intelligently
[in-tel-i-juh nt] /ɪnˈtɛl ɪ dʒənt/ adjective 1. having good understanding or a high mental capacity; quick to comprehend, as persons or animals: an intelligent student. 2. displaying or characterized by quickness of understanding, sound thought, or good judgment: an intelligent reply. 3. having the faculty of reasoning and understanding; possessing : intelligent beings in outer […]