Identity uncertainty - Identity uncertainty is uncertainty about whether different observations, names, or records refer to the same underlying entity.
Ignore preconditions heuristic - The ignore preconditions heuristic estimates remaining planning effort using a relaxed problem in which actions no longer require their original preconditions.
Imitation learning - Imitation learning is a family of methods that learn how to perform a task from demonstrations of another agent's behavior.
Imperfect information - Imperfect information is a condition in a game where a player making a decision cannot distinguish all relevant situations that may have occurred.
Implementation level - The implementation level describes the concrete mechanisms that make an information-processing system operate.
Implication - An implication is a logical statement of the form “if P, then Q,” written P → Q. P is its antecedent and Q its consequent.
Inadmissible heuristic - An inadmissible heuristic is a search estimate that overestimates the true minimum remaining cost for at least one relevant state.
Inclusion-exclusion principle - The inclusion-exclusion principle calculates the size of a union of overlapping sets, or the probability that at least one of several events occurs.
Incremental belief-state search - Incremental belief-state search builds a plan by considering possible physical states progressively.
Independent subproblems - Independent subproblems are parts of a larger problem that can be solved separately and whose solutions can be combined without additional compatibility...
Index - An index is an auxiliary data structure that links searchable keys or terms to the records, sentences, or documents associated with them.
Indexing - Indexing is the process of organizing a knowledge base so that a reasoning system can fetch potentially relevant facts or rules efficiently.
Inductive learning - Inductive learning is learning a general rule or predictive function from specific examples.
Inductive logic - Inductive logic is the study of formal principles for assessing how strongly evidence supports a hypothesis without necessarily proving it.
Inductive logic programming - Inductive logic programming, usually abbreviated ILP, is a machine-learning approach that learns logical rules from examples and background knowledge.
Inference - Inference is the process of obtaining conclusions or outputs from available information using a specified method.
Inference Data - Inference data consists of the input values supplied to a trained machine-learning model when it produces a prediction or other output.
Inference engine - An inference engine is the component of a knowledge-based system that applies rules or other reasoning procedures to available facts to derive conclusions...
Inference Logs - Inference logs are records of the inputs supplied to an inference pipeline and the corresponding predictions or other outputs it produces.
Inference path - An inference path is the route a particular input follows through a decision tree when the tree produces a prediction.
Inference Pipeline - An inference pipeline is the sequence of processing steps that takes input data, prepares it as needed, applies a trained model, and delivers a prediction...
Inference rules - Inference rules are formal patterns for deriving conclusions from premises.
Inferential frame problem - The inferential frame problem is the difficulty of reasoning efficiently about what remains unchanged as actions occur.
Infinite horizon - An infinite horizon is a sequential decision setting with no fixed final time step.
Infix - Infix is a notation in which an operator appears between its operands. In 8 + 5, the plus sign sits between the two numbers it combines.
Infobox - An infobox is a compact, structured summary of selected information about a subject, usually presented as labeled fields and their values alongside a longer...
Information extraction - Information extraction is the process of identifying selected information in text and representing it as structured data.
Information gain - Information gain measures a reduction in uncertainty.
Information gathering - Information gathering is the deliberate collection of evidence to improve knowledge, reduce uncertainty or support a decision.
Information gathering action - An information-gathering action is an action taken to obtain an observation that can change an agent's knowledge or beliefs.
Information sets - Information sets are groups of decision nodes that a player cannot distinguish using the information available to that player.
Information value theory - Information value theory evaluates information by how much it can improve a decision, taking account of uncertainty and the consequences of available actions.
Inheritance - Inheritance in knowledge representation is the use of a category hierarchy to derive information about more specific categories or their members from...
Initial state - An initial state is the state from which a modeled process, search problem or planning task begins.
Input resolution - Input resolution is a restricted resolution strategy in automated reasoning: at least one parent clause in every resolution step must belong to the original...
Inside-outside algorithm - The inside-outside algorithm is a dynamic-programming method for computing quantities over the possible parse trees of a context-free grammar.
Instance-based learning - Instance-based learning predicts a new case by comparing it with stored examples.
Intelligence - Intelligence is a broad term for capacities such as learning, reasoning, adapting and using information to achieve goals.
Interleaving - Interleaving is the arrangement of steps from different activities within one combined sequence.
Interlingua - An interlingua is an intermediate representation intended to express meaning independently of a particular source language.
Internal state - An internal state is information an agent maintains within itself to support decisions over time.
Interpolation search - Interpolation search is a search algorithm for a sorted sequence of numerical keys.
Inverse entailment - Inverse entailment is a principle used in inductive logic programming to help find a hypothesis that, together with background knowledge, entails observed...
Inverse kinematics - Inverse kinematics is the calculation of joint values that place a robot's end effector, or the end of an articulated animation chain, at a desired position...
Isolates - Isolates are graph nodes with no incident edges: their degree is zero. In a directed graph, an isolate has neither incoming nor outgoing edges.
Iterative deepening search - Iterative deepening search repeatedly performs depth-limited depth-first searches with increasing depth limits until it finds a goal or establishes failure.
Iterative expansion - Iterative expansion, or IE, is a memory-bounded heuristic search algorithm developed by Stuart Russell.