D* - D*, or Dynamic A*, is an incremental path-planning algorithm that repairs a route when new information changes edge costs in a graph.
D-Separation - D-separation is a graphical criterion for determining which conditional independences are implied by a directed acyclic graph.
Dancing links - Dancing links is a technique for efficiently removing and restoring elements in linked data structures during backtracking.
Data complexity - Data complexity measures the computational difficulty of a task as the data grows while the query, rule set or other specified logical description is held...
Data compression - Data compression represents information using fewer bits than a chosen original representation, when the data and method permit it.
Data-oriented parsing - Data-oriented parsing, or DOP, is an approach to analyzing language by combining fragments of previously analyzed utterances.
Datalog - Datalog is a declarative logic-programming language for expressing facts and rules over relations.
Davis-Putnam algorithm - The Davis - Putnam algorithm is a resolution-based procedure for deciding satisfiability of propositional formulas in conjunctive normal form.
De-identification - De-identification is the process of reducing the association between data and the people or other subjects it describes.
Decayed MCMC - Decayed MCMC is an approximate filtering method that uses Markov chain Monte Carlo over possible state histories while updating recent states more...
Decentralized planning - Decentralized planning develops coordinated behavior for multiple agents that make decisions using their own available information and authority.
Decision analysis - Decision analysis is a structured approach to choosing among alternatives by making objectives, uncertainties, consequences and preferences explicit.
Decision lists - A decision list is an ordered sequence of rules in which the first matching condition determines the output.
Decision network - A decision network is a graphical model that combines uncertain variables, available decisions and utilities to support choosing actions under uncertainty.
Decision nodes - Decision nodes represent choices that an agent or decision maker can control in a decision model.
Decision-theoretic metareasoning - Decision-theoretic metareasoning uses decision theory to choose which computations to perform, how much effort to spend and when to stop thinking and act.
Decision theory - Decision theory studies how choices relate to beliefs, uncertainty and preferences.
Decomposition - Decomposition is the process of expressing a problem or structure as smaller parts whose solutions or properties can be combined to address the original whole.
Deductive learning - Deductive learning is learning that uses existing knowledge and logical reasoning to derive reusable knowledge or procedures.
Deductive synthesis - Deductive synthesis is the construction of a program from a specification by applying logical reasoning and justified transformation rules.
Default logic - Default logic is a formal approach to reasoning with assumptions that may be withdrawn when additional information becomes available.
Default rules - Default rules are rules that permit a provisional conclusion when stated conditions hold and no relevant defeating information prevents the inference.
Definite clause - A definite clause is a logical clause containing exactly one positive literal.
Definite clause grammar - A definite clause grammar, or DCG, is a notation for describing grammars and related sequence-processing relations in logic programming.
Deformable template - A deformable template is a model of an object's shape or structure that can change within specified limits to fit observed data.
Defuzzification - Defuzzification is the process of converting a fuzzy output representation into a single numerical value.
Degree heuristic - The degree heuristic is a variable-selection rule for constraint satisfaction that prefers an unassigned variable involved in many constraints with other...
Degree of belief - A degree of belief is the probability an agent assigns to a proposition in light of its information and assumptions.
Degree of truth - A degree of truth expresses how fully a proposition is true within a logic that permits intermediate truth values.
Delete list - A delete list is the set of facts that an action makes false in a STRIPS-style planning model.
Demographic parity - Demographic parity is a statistical fairness criterion requiring a model's predictions to be independent of a specified sensitive attribute.
Demonic nondeterminism - Demonic nondeterminism is an interpretation of unspecified choice in which a required guarantee must withstand every permitted alternative, including...
Dempster-Shafer theory - Dempster-Shafer theory, also called evidence theory or the theory of belief functions, is a mathematical framework for representing uncertain evidence.
Dependency-directed backtracking - Dependency-directed backtracking is a search and reasoning approach that uses the dependencies behind a failure to decide which earlier assumptions or...
Dependency grammar - Dependency grammar is an approach to describing sentence structure through relationships between words, typically linking a head word to its dependents.
Depth First Search - Depth First Search, usually abbreviated DFS, is a graph or tree traversal strategy that explores one branch as far as it can before returning to explore...
Depth First Search on Edges - Depth First Search on Edges is a traversal that explores graph connections in depth-first order while tracking edges as the items to visit.
Detailed balance - Detailed balance is a pairwise flow condition for a Markov chain and a probability distribution.
Deterministic nodes - Deterministic nodes are variables in a graphical model whose values are fixed functions of their parent variables.
Deterministic parser - A deterministic parser follows a single parsing course rather than maintaining several competing analyses at each decision.
Diameter - In graph theory, the diameter is the greatest shortest-path distance between nodes in a graph.
Dichotomic search - Dichotomic search is a search process that narrows its possibilities by choosing between two alternatives at each decision step.
Dictionary - In the natural-language-processing sense used here, a dictionary is a structured resource that records words or expressions and information about them.
Difference-map algorithm - The difference-map algorithm is an iterative method for searching for a point that satisfies two sets of constraints simultaneously.
Differentiable programming - Differentiable programming is an approach to designing numerical programs whose outputs can be differentiated with respect to selected inputs or parameters.
Differential heuristic - A differential heuristic estimates the remaining shortest-path cost by comparing precomputed distances to selected landmark nodes.
Digital object memory - A digital object memory is an organized collection of digital information associated with an individual physical object over time.