Capacity Scaling Minimum Cost Flow - Capacity Scaling Minimum Cost Flow is a network-flow method that finds the least-cost way to satisfy specified supplies and demands while respecting edge...
CART - CART stands for Classification and Regression Trees, a methodology for learning decision trees from labeled data.
Cascaded finite-state transducers - Cascaded finite-state transducers are a sequence of finite-state processing stages in which one stage's output becomes input for the next.
Case agreement - Case agreement is compatibility in grammatical case between words or phrases that a language's grammar requires to agree.
Case-based planning - Case-based planning constructs a plan for a new situation by retrieving relevant previous planning experiences and adapting them.
Cell decomposition - Cell decomposition is a planning technique that divides a space into regions called cells and represents usable connections between them.
Certainty effect - The certainty effect is a pattern in decision making in which a guaranteed outcome receives disproportionate weight compared with outcomes that are merely...
Certainty equivalent - A certainty equivalent is a guaranteed outcome that a decision maker values equally to a specified uncertain prospect.
Certification - Certification is a formal attestation that a specified object meets defined requirements within an identified scope.
Chain rule - The chain rule of probability expresses a joint probability as a product of successive conditional probabilities.
Chains - Chains, in the graph-algorithm sense used here, are paths or cycles produced by a chain decomposition based on a depth-first search tree.
Chance nodes - Chance nodes represent uncertain outcomes in a decision tree, game tree, or decision network.
Characters - Characters are the written-text elements that a system represents and processes, such as letters, digits, punctuation, and other symbols.
Child node - A child node is a node directly below another node, its parent, in a rooted tree.
Chordal - Chordal describes an undirected graph in which every cycle of four or more vertices has a chord: an edge connecting two vertices that are not consecutive on...
Choreography - Choreography is a description or coordination pattern for how multiple participants interact through messages and agreed behavior.
Chronological backtracking - Chronological backtracking is a search method that responds to a dead end by undoing the most recent decision that still has an untried alternative.
Circuit verification - Circuit verification checks whether a circuit design satisfies a stated specification.
Circumscription - Circumscription is a formal approach to nonmonotonic reasoning that prefers models in which selected properties hold for as few entities as possible...
Classical planning - Classical planning is the task of finding actions that transform a known initial state into a state satisfying a goal, under a simplified model with...
Clause - A clause, in the logic used by many symbolic AI systems, is a disjunction of literals: statements joined by logical OR, where each statement is an atom or...
Closed-loop - Closed-loop describes a system in which information about the system's behavior feeds back into decisions that influence its subsequent behavior.
Closed-world assumption - The closed-world assumption is a reasoning convention that treats relevant facts not established by the knowledge base as false.
Closeness - Closeness, or closeness centrality, measures how near a node is to other nodes in a graph according to shortest-path distances.
Clutter - Clutter, in tracking and data association, means detections that do not come from the target or targets of interest and instead create nuisance observations.
co-NP - co-NP, usually written coNP, is the class of decision problems whose complementary problems belong to NP.
co-NP-complete - A decision problem is co-NP-complete, or coNP-complete, when it belongs to coNP and every problem in coNP can be transformed into it by a polynomial-time...
Coarse-to-fine - Coarse-to-fine is a strategy that begins with a simplified or lower-detail representation and progressively introduces more detail.
Cognitive architectures - Cognitive architectures are general frameworks that specify how components such as memory, perception, reasoning, learning, and action selection work...
Cognitive science - Cognitive science is the interdisciplinary study of mind, cognition, and intelligent behavior.
Coloring - Coloring, in the graph-theory sense used here, assigns labels called colors to graph vertices so that adjacent vertices receive different labels.
Combinatorial search - Combinatorial search explores combinations of discrete choices to find a solution satisfying constraints or optimizing an objective.
Combs method - The Combs method is an approach to organizing fuzzy rules associated with William Combs and the union rule configuration.
Commonsense reasoning - Commonsense reasoning uses everyday knowledge about the world to draw conclusions that are not explicitly stated.
Communicability - Communicability is a network measure describing the connection between two nodes using walks of many lengths, rather than only their shortest path.
Communicability Betweenness - Communicability betweenness is a node-centrality measure based on how much that node contributes to the weighted walks connecting other nodes.
Commutativity - Commutativity means that changing the order of specified operations does not change their result.
Competitive ratio - A competitive ratio measures an online algorithm's performance against an optimal offline algorithm that knows the entire input sequence in advance.
Complementary literals - Complementary literals are a pair consisting of an atom and its negation, such as P and NOT P.
Complete assignment - A complete assignment gives a value to every variable in a specified problem.
Complete data - Complete data contain observed values for every variable in the probability model for every example being used to learn that model.
Complete-state formulation - A complete-state formulation represents every search state as a fully specified candidate, rather than a partially constructed candidate.
Completeness - Completeness is a guarantee that a method can find every kind of result it is intended to find within a specified formal scope.
Completion - Completion, in the logical database and rule-program sense, makes explicit that the listed facts or defining rules provide all the ways a specified relation...
Complex sentences - Complex sentences in formal logic are built from simpler logical expressions using connectives such as NOT, AND, OR, and implication, and, in predicate...
Complexity analysis - Complexity analysis studies the computational resources required by an algorithm or problem as a function of input size.
Compliant motion - Compliant motion is robot movement that accommodates contact forces and physical constraints rather than rigidly insisting on an exact free-space trajectory.
Composition - Composition of substitutions combines successive variable replacements into one substitution with the same overall effect.