Job-shop scheduling problem - A job-shop scheduling problem asks when to perform the operations of several jobs on shared machines while respecting each job's required operation order...
Johnson's algorithm - Johnson's algorithm computes shortest paths between all pairs of vertices in a weighted graph.
Join tree - A join tree is a tree of variable sets or clusters arranged so that every variable appears in a connected group of tree nodes.
Joint action - A joint action is a combination of actions, one for each participating agent, considered together at a decision step.
Joint plan - A joint plan describes coordinated actions for multiple agents so that their combined execution achieves specified goals.
JTMS - JTMS stands for justification-based truth maintenance system.
Jump point search - Jump point search, or JPS, is a pathfinding technique that reduces redundant search on suitable grid maps.
Jump search - Jump search is a lookup algorithm for sorted data that checks spaced block boundaries until it locates the block that could contain a target, then searches...
Justification - A justification is an explicit record of the reasons or conditions supporting a conclusion.
k-anonymity - k-anonymity is a property of a released table in which each record shares its combination of designated quasi-identifier values with at least k − 1 other...
K-components - K-components are maximal parts of an undirected graph whose node connectivity is at least k.
k-d tree - A k-d tree is a binary spatial index that recursively divides points using coordinate-aligned boundaries.
K-edge-components - K-edge-components are maximal groups of vertices for which every pair has at least k edge-disjoint connecting paths in the original graph.
K-independent hashing - K-independent hashing uses a randomly chosen hash function from a family whose outputs on any k distinct fixed keys are independent and uniformly distributed.
K-node-cutsets - K-node-cutsets are sets of k vertices whose removal separates a graph.
Kernel function - In kernel-based machine learning, a kernel function computes an inner product between feature representations of two inputs.
Kernel trick - The kernel trick rewrites a compatible learning algorithm so that feature-space inner products are computed through a kernel function instead of by...
Kinematic state - A kinematic state, in the robotics convention used here, describes a robot's configuration: its position, orientation and any relevant joint positions.
Kinematics - Kinematics is the study of the geometry of motion, including positions, orientations, velocities and accelerations, without using the forces and torques...
Knowledge acquisition - Knowledge acquisition is the process of obtaining, clarifying and validating the knowledge needed by an AI system.
Knowledge base - A knowledge base is an organized body of information that a system can use to answer questions or support reasoning.
Knowledge engineering - Knowledge engineering is the work of designing, building, testing and maintaining systems that use explicitly represented domain knowledge.
Knowledge level - The knowledge level is a way of describing an intelligent agent through what it knows, the goals it pursues and the actions available to it, while...
Knowledge representation - Knowledge representation is the way information about a domain is expressed so that a system can use it in reasoning and other intelligent tasks.
Knowledge representation language - A knowledge representation language is a formal means of expressing information about a domain so that a computer system can store it, interpret it, and...
Knuth's Algorithm X - Knuth's Algorithm X is a backtracking algorithm for solving exact cover problems.
Kolmogorov complexity - Kolmogorov complexity measures the length of the shortest program that produces a particular finite object, usually a string, and halts, relative to a fixed...
Kolmogorov's axioms - Kolmogorov's axioms are three basic rules that define a probability measure: event probabilities are nonnegative, the probability of the whole sample space...
Landmark points - In shortest-path search, landmark points are selected graph vertices whose precomputed distances help estimate the remaining distance between other vertices.
Language - A language is a system for expressing and interpreting messages through symbols and conventions.
Language generation - Language generation is the production of language by a computer system to express information, answer a request, or serve a communicative purpose.
Language identification - Language identification is the task of determining which language or languages are present in an input.
Large-scale learning - Large-scale learning is machine learning in a setting where the amount of data, size of the model, or computational workload makes time, memory, or data...
Late move reduction - Late move reduction is a selective game-search technique that initially examines some later-ranked moves to a shallower depth than the main search.
Leak node - A leak node is an additional, usually implicit, cause in a probabilistic model that accounts for an effect occurring through causes not represented...
Learning curve - A learning curve shows how a learning system's measured performance changes as a relevant resource or amount of experience increases.
Learning element - A learning element is the part of a learning-agent architecture that changes the agent's decision-making components using experience and feedback.
Least commitment - Least commitment is a search and planning principle that delays choices until they are needed, while making the commitments required for progress.
Least-constraining-value - Least-constraining-value is a value-ordering heuristic for constraint satisfaction problems.
Leiden Community Detection - Leiden community detection is a graph-clustering algorithm that groups nodes by optimizing a chosen measure of community structure.
Level cost - Level cost is a planning-graph heuristic that assigns a goal literal the index of the first proposition level at which it appears.
Level of abstraction - A level of abstraction is a degree of detail at which a system, problem, or action is represented.
Level sum - Level sum is a planning-graph heuristic that adds the individual level costs of a set of goal literals.
Lexical ambiguity - Lexical ambiguity occurs when a word or lexical expression has more than one possible interpretation.
Lexical category - A lexical category is a grammatical class associated with a word or lexical item, such as noun, verb, adjective, or adverb.
Lexicalized PCFG - A lexicalized PCFG is a probabilistic context-free grammar whose syntactic categories or rule probabilities incorporate lexical head information, often...
Lexicographic breadth-first search - Lexicographic breadth-first search, or LexBFS, is a graph traversal that orders vertices using lexicographic labels based on previously visited neighbors.
LIFO queue - A LIFO queue is a collection in which the most recently added item is the next one removed. LIFO means last in, first out.