Equality symbol - The equality symbol, usually written =, states in first-order logic that two terms refer to the same object.
Equational unification - Equational unification finds substitutions for variables that make two symbolic expressions equal according to a specified collection of equations.
Eulerian - A graph is Eulerian when it has a circuit that traverses every edge exactly once and returns to its starting vertex.
Evidence - Evidence, in probabilistic AI, is the information on which an inference is conditioned.
Evidence reversal - Evidence reversal is a probabilistic inference technique that restructures a model so observed evidence can guide the generation of hidden-state samples.
Evolutionary algorithms - Evolutionary algorithms are a family of search and optimization methods inspired by variation and selection in biological evolution.
Evolutionary strategies - Evolutionary strategies, commonly called evolution strategies or ES, are optimization methods that improve candidate solutions through variation...
Evolving intelligent system - An evolving intelligent system is a learning system that can adapt its internal structure as new data arrive, as well as update numerical parameters.
Exact cell decomposition - Exact cell decomposition is a motion-planning approach that partitions the collision-free configuration space into cells while preserving its relevant...
Execution - Execution is the process of carrying out selected actions or instructions.
Exhaustive decomposition - An exhaustive decomposition describes a category using subcategories whose combined membership covers the whole category.
Existence uncertainty - Existence uncertainty is uncertainty about whether a modeled object, event, or relationship actually exists.
Existential graphs - Existential graphs are a diagrammatic system of logic developed by Charles Sanders Peirce.
Expectation-maximization - Expectation-maximization, usually abbreviated EM, is an iterative method for estimating model parameters when some relevant information is unobserved.
Expected monetary value - Expected monetary value, or EMV, is the probability-weighted average of possible monetary outcomes.
Expected utility - Expected utility is the probability-weighted average of the utility assigned to possible outcomes.
Expected value - Expected value is the probability-weighted average of a numerical quantity's possible values. It is also called the mean or expectation.
Expectiminimax - Expectiminimax is a game-tree search method that extends minimax to include random events.
Expectiminimax value - An expectiminimax value is the value assigned to a game-tree position by combining maximizing choices, minimizing choices, and probability-weighted chance...
Expit - Expit is another name for the logistic sigmoid function, which maps a real number to a value between zero and one.
Explanation-based learning - Explanation-based learning, or EBL, uses existing domain knowledge to explain an example and derive a reusable rule from that explanation.
Exploitation - Exploitation is choosing an action that looks best according to what an agent currently knows.
Exponential search - Exponential search is a method for finding a value in sorted data by first expanding a search boundary geometrically, usually by doubling positions, and...
Expressiveness - Expressiveness is the range of distinctions, relationships or conditions that a representation language can describe with its defined meaning.
Extendible hashing - Extendible hashing is a dynamic indexing method that uses selected bits of a key's hash value to locate a storage bucket through a directory.
Extensive form - Extensive form is a way of representing a game that explicitly describes the sequence of decisions, who makes them, what each player knows when choosing...
Fact - A fact, in a symbolic knowledge system, is an assertion treated as true for the purposes of reasoning.
Factor - A factor, in probabilistic graphical-model inference, is a function that assigns a numerical value to each combination of values of some variables.
Factored frontier - Factored frontier is an approximate inference algorithm for dynamic Bayesian networks.
Factored representation - A factored representation describes a state using a set of variables or features and their values.
Factorial HMM - A factorial hidden Markov model, or factorial HMM, represents a time-varying hidden state as several component state variables rather than one categorical...
Factoring - Factoring, in automated logical reasoning, is an inference rule that combines literals of the same sign within one clause when a substitution makes them...
Feed-forward network - A feed-forward network is a neural network whose prediction computation moves through a directed structure without recurrent cycles.
Fibonacci search technique - The Fibonacci search technique locates a value in a sorted array by using Fibonacci numbers to choose successive comparison positions.
FIFO queue - A FIFO queue is a collection in which items are removed in the order they were added. FIFO stands for first in, first out.
Fine-motion planning - Fine-motion planning is the design of robot motion strategies for precise tasks where contact, sensing and positioning uncertainty matter.
Finger search - Finger search is searching an ordered collection from a known nearby position, called a finger, rather than always starting from the collection's global...
Finger search tree - A finger search tree is an ordered tree data structure designed to search efficiently from a reference to an existing element, called a finger.
Finite horizon - A finite horizon is a limited span of future stages over which a decision process is evaluated or planned.
First-choice hill climbing - First-choice hill climbing is a local-search method that samples neighboring solutions and moves to the first one that improves the current objective.
First-order logic - First-order logic is a formal language for describing objects, their properties and relationships, and statements quantified over those objects.
First-order Markov process - A first-order Markov process is a sequence of random states in which the next state's conditional distribution depends on the current state rather than the...
Flow-based disjoint paths - Flow-based disjoint paths are routes between a source and destination found by translating a path-separation requirement into a network-flow problem.
Flow-based Minimum Cuts - Flow-based minimum cuts are graph partitions found using a maximum-flow calculation.
Fluent - A fluent is a property or quantity whose truth or value can vary between situations or over time in an action model.
Fluid Communities - Fluid Communities is a graph community-detection algorithm that divides a network into a chosen number of groups.
Focus of expansion - The focus of expansion is the image location from which motion vectors appear to spread outward when a camera translates toward a stationary scene without...
Foreshortening - Foreshortening is the apparent reduction of a length or surface dimension when it is viewed at an angle.