Global constraint - A global constraint is a constraint that expresses a structured relationship over a collection of variables, often with a specialized method for propagating...
Global maximum - A global maximum is the greatest value that an objective function actually attains anywhere in its specified feasible set.
Global minimum - A global minimum is the smallest value an objective function actually reaches over its entire feasible set. A point that reaches it is a global minimizer.
Goal - A goal is a desired condition that an AI agent is intended to achieve or establish.
Goal clauses - Goal clauses are clauses with no positive literals, used in Horn-clause logic and resolution-based reasoning to represent goals to be proved by refutation.
Goal-directed reasoning - Goal-directed reasoning organizes inference around a particular question or target conclusion.
Goal formulation - Goal formulation is the process of deciding what an agent should try to achieve and expressing that outcome clearly enough to guide reasoning.
Goal test - A goal test is a procedure that determines whether a candidate state satisfies the goal of a search or planning problem.
Gomory-Hu Tree - A Gomory-Hu tree is a weighted tree that compactly represents the minimum cut values between every pair of vertices in an undirected capacitated graph.
Grammar - A grammar is a formal description of how valid expressions can be structured in a language.
Graph - A graph is a mathematical structure made of vertices, also called nodes, and edges that represent relationships between them.
Graph clustering - Graph clustering groups data points represented as nodes of a graph using the relationships encoded by its edges.
Graph coloring - Graph coloring assigns labels, traditionally called colors, to graph elements under specified compatibility rules.
Graph Convolutional Network - A Graph Convolutional Network, or GCN, is a neural-network architecture that learns representations using a graph's connections together with features...
Graph Convolutional Policy Network - Graph Convolutional Policy Network, or GCPN, is a model introduced for goal-directed graph generation using reinforcement learning.
Graph Hashing - Graph hashing converts a graph's selected structural and attribute information into a compact identifier.
Graph of a function - The graph of a function is the set of all input-output pairs produced by that function over its specified domain.
Graph search - Graph search is a family of problem-solving procedures that explore states and transitions while accounting for states reached more than once.
Graphical degree sequence - A graphical degree sequence is a list of nonnegative integers that can be realized as the node degrees of a graph of the specified kind.
Graphplan - Graphplan is an automated planning algorithm developed by Avrim Blum and Merrick Furst.
Grasping - Grasping is the process of establishing and maintaining physical contact that lets a robot hold or control an object.
Greedy best-first search - Greedy best-first search is a search strategy that expands the frontier node with the lowest estimated remaining cost to a goal.
Grid search - Grid search is a systematic way to evaluate every combination in a predefined set of candidate parameter values.
Ground term - A ground term is a term in formal logic that contains no variables.
Grover's algorithm - Grover's algorithm is a quantum algorithm for finding a marked item in an unstructured search space.
Harmonic Centrality - Harmonic centrality measures a node's accessibility by adding the reciprocals of shortest-path distances between it and other nodes.
Hash function - A hash function maps an input to a compact value used for purposes such as indexing, comparison, or verification.
Hebbian learning - Hebbian learning is a family of learning ideas in which a connection changes according to the activity of the units it connects.
Heuristic - A heuristic is a practical rule or method used to reach a useful answer or guide a decision with limited effort.
Heuristic function - A heuristic function assigns a numerical estimate that helps guide a search.
Heuristic search - Heuristic search uses problem-specific estimates or evaluation rules to guide which candidates a search explores.
Hidden representation - A hidden representation is an internal set of values a model computes while transforming an input into an output.
Hierarchical decomposition - Hierarchical decomposition breaks a complex task into smaller tasks arranged across levels of detail.
Hierarchical lookahead - Hierarchical lookahead is planning ahead using actions or states represented at multiple levels of abstraction.
High-level action - A high-level action is an abstract action that represents a more detailed procedure or a family of possible procedures.
High-performance fuzzy computing - High-performance fuzzy computing refers to applying high-performance computing techniques to computationally demanding fuzzy-system workloads.
Higher-order logic - Higher-order logic is a family of formal logics that allow variables to range over functions, predicates, or other structured mathematical entities in...
Hinton diagrams - Hinton diagrams display the values in a matrix using squares whose area represents magnitude and whose color represents sign.
Homophones - Homophones are words that share a pronunciation while differing in meaning, and often in spelling.
Hopscotch hashing - Hopscotch hashing is a hash-table technique that keeps each stored entry within a small neighborhood of its home bucket.
Horizon effect - The horizon effect is a problem in limited-depth search where an important consequence lies beyond the search cutoff and is therefore misjudged.
Horn clause - A Horn clause is a disjunction of literals containing at most one positive literal.
HTTPRange-14 - HTTPRange-14 is the name of a historical World Wide Web Consortium Technical Architecture Group issue about what HTTP identifiers can identify and how...
Hub - A hub is a node that connects to other nodes in a way that makes it useful for navigating a network.
Human-level AI - Human-level AI is a term for artificial intelligence whose abilities are comparable to human abilities under a specified comparison.
Hungarian algorithm - The Hungarian algorithm solves a linear assignment problem by finding a one-to-one pairing with minimum total cost.
Hybrid architecture - A hybrid architecture is an agent design that combines different approaches to control, typically reactive behavior and deliberative planning.
Identification in the limit - Identification in the limit is a criterion for learning success in which a learner eventually settles on a correct hypothesis and never changes it afterward.