Problem generator - A problem generator is the part of a learning-agent architecture that proposes actions intended to produce useful new experience.
Procedural attachment - Procedural attachment connects a symbol or query in a knowledge-based reasoning system to an executable procedure.
Product rule - The product rule in probability calculates the chance that two events both occur by multiplying the probability of one event by the conditional probability...
Progression planning - Progression planning searches forward from an initial state by applying actions whose preconditions are satisfied and calculating their effects.
Proof - A proof is a justified derivation showing that a conclusion follows from stated assumptions under accepted rules of reasoning.
Proof-number search - Proof-number search is a best-first search method for proving or disproving a proposition represented by an AND - OR tree.
Proposition symbol - A proposition symbol is an atomic symbol used to represent a statement in propositional logic.
Propositional logic - Propositional logic is a formal system for reasoning with statements that are treated as true or false and combined using logical connectives.
Pruning - Pruning means removing or skipping parts of a search space or learned structure according to a rule.
Psychological reasoning - Psychological reasoning, in symbolic AI, is reasoning about agents in terms of what they know, believe, want, intend, and are likely to do.
Pure Monte Carlo search - Pure Monte Carlo search evaluates candidate moves by running simulated continuations, or playouts, and comparing their average outcomes.
Pure strategy - A pure strategy is a complete, deterministic plan specifying which action a player will choose at each of that player's decision situations in a game.
Pure symbol - A pure symbol is a propositional variable that appears with only one polarity in the relevant clauses of a satisfiability problem: always unnegated or...
Quadratic probing - Quadratic probing is a collision-resolution method for an open-addressed hash table.
Quadratic programming - Quadratic programming is optimization with a quadratic objective function and linear equality or inequality constraints.
Qualification problem - The qualification problem is the difficulty of specifying all the conditions required for a real-world action to produce its intended result.
Qualitative physics - Qualitative physics is an area of AI concerned with representing and reasoning about physical systems using meaningful qualitative distinctions, such as...
Qualitative probabilistic networks - Qualitative probabilistic networks represent probabilistic relationships using qualitative constraints, such as whether one variable has a positive...
Quantification - Quantification expresses how a statement applies to members of a domain, such as all objects, at least one object, or a specified number of objects.
Quasi-logical form - A quasi-logical form, or QLF, is a structured representation of sentence meaning that can leave some interpretation choices unresolved.
Querying - Querying is the process of asking a data source or knowledge system a precisely expressed question and obtaining results according to its rules.
Question answering - Question answering, or QA, is an AI task in which a system produces an answer to a user's question.
Quiescence search - Quiescence search is a selective extension of game-tree search that examines unstable positions beyond the normal cutoff before evaluating them.
Radial basis function - A radial basis function, or RBF, is a function whose value depends on distance from a center rather than on direction from that center.
Rainbow table - A rainbow table is a precomputed structure used to search for inputs that produce specified cryptographic outputs, especially password hashes in unsuitable...
Random-fuzzy variable - A random-fuzzy variable, in the measurement-uncertainty framework developed by Ferrero and colleagues, represents a measurement result while retaining...
Random geometric graph - A random geometric graph is a probabilistic graph model in which nodes occupy randomly chosen positions in a space and nearby nodes are connected.
Random-restart hill climbing - Random-restart hill climbing is a local-search strategy that runs hill climbing from several randomly selected starting states.
Random walk - A random walk is a sequence of states produced by repeatedly making a random step from the current state.
Randomness - Randomness refers to variation described through uncertain outcomes and probability rules rather than a fixed predictable outcome in the relevant model.
Range minimum query - A range minimum query, or RMQ, asks for the smallest value in a specified contiguous interval of an array.
Rao-Blackwellization - Rao - Blackwellization is a way to improve an estimator by replacing part of its random variation with an appropriate conditional expectation.
Rapidly exploring dense trees - Rapidly exploring dense trees, or RDTs, are incremental exploration structures that grow a tree through a configuration space using a dense sequence of...
Rapidly exploring random tree - A rapidly exploring random tree, or RRT, is a sampling-based planning structure that grows a branching tree through a state or configuration space.
Rationality - In AI, rationality is the principle of choosing actions that maximize expected performance, given the agent's available evidence, prior knowledge, and...
Reachable set - A reachable set is the collection of states a system can attain from specified initial conditions under the allowed transitions or inputs.
Reactive control - Reactive control chooses or adjusts actions in response to the current situation, using feedback from observations or an updated internal state.
Reactive planning - Reactive planning organizes goal-directed behavior so that the next action depends on the situation encountered during execution.
Real-time AI - Real-time AI is artificial intelligence designed to produce useful decisions or outputs within the timing requirements of its environment.
Real-time dynamic programming - Real-time dynamic programming, or RTDP, is a method for improving decisions by updating value estimates along trajectories through a decision problem.
Real-time search - Real-time search is a family of search methods that limit the computation performed before an agent commits to its next action.
Reasoning - Reasoning is the process of using information, assumptions, and relationships to reach conclusions, evaluate possibilities, or decide what follows.
Reciprocal rank - Reciprocal rank is a retrieval-evaluation score equal to one divided by the position of the first relevant or correct result in a ranked list.
Reciprocity - Reciprocity measures how often directed connections are matched by connections in the reverse direction.
Recombination - Recombination is an evolutionary-computation operation that creates candidate solutions by combining information from parent candidates.
Reconstruction - Reconstruction, in computer vision, is the process of estimating a scene's three-dimensional structure from observations such as photographs.
Record linkage - Record linkage is the process of deciding which records refer to the same real-world entity across or within datasets.
Rectangular grid - A rectangular grid is a two-dimensional arrangement of locations organized into rows and columns.