Compositional semantics - Compositional semantics builds the meaning of a complex expression from the meanings of its parts and the structure that combines them.
Computable - A function is computable if an algorithm can produce its specified output from each valid input in a finite number of steps.
Computational graphs - Computational graphs represent calculations as connected operations and intermediate values.
Computational learning theory - Computational learning theory studies what can be learned from data, under which assumptions, and with what requirements for examples and computation.
Concurrent action list - A concurrent action list specifies actions that must or must not occur alongside a particular action for its modeled effects to apply.
Condition-action rule - A condition-action rule connects a recognized situation to an action: if a specified condition holds, select or perform the associated response.
Conditional effect - A conditional effect is an outcome of an action that occurs only when an additional condition holds.
Conditional Gaussian - A conditional Gaussian model describes continuous variables with a Gaussian distribution once specified conditioning information is fixed.
Conditional plan - A conditional plan specifies an action and alternative continuations chosen according to information obtained during execution.
Conditional random field - A conditional random field, or CRF, is a probabilistic model for predicting related output variables given observed inputs.
Conditioning - Conditioning is the operation of evaluating a probability distribution given specified information.
Conditioning case - A conditioning case is one combination of values assigned to a Bayesian-network node's parents.
Configuration space - Configuration space is the set of possible configurations of a robot or mechanical system.
Conflict-directed backjumping - Conflict-directed backjumping is a constraint-search method that uses explanations of failure to choose where to backtrack.
Conflict set - A conflict set records earlier assignments implicated in a failure during constraint-satisfaction search.
Conjunct ordering - Conjunct ordering is the choice of the sequence in which a reasoning or query system evaluates conditions joined by logical AND.
Conjunction - Conjunction is the logical operation AND. A conjunction is true exactly when every component statement, called a conjunct, is true.
Conservative approximation - A conservative approximation simplifies a representation while preserving a direction of correctness.
Consistency - Consistency means satisfying the compatibility requirements of a specified formal setting.
Constraint graph - A constraint graph represents the structure of a binary constraint-satisfaction problem.
Constraint hypergraph - A constraint hypergraph represents a constraint-satisfaction problem whose constraints may involve more than two variables.
Constraint learning - Constraint learning records new restrictions derived from failures encountered while solving a constraint problem.
Constraint logic programming - Constraint logic programming, or CLP, combines logic programming with specialized constraint solving.
Constraint propagation - Constraint propagation uses known restrictions to derive further restrictions on variable values.
Constraint satisfaction problem - A constraint satisfaction problem, or CSP, describes a task using variables, the possible values of those variables, and rules that acceptable combinations...
Constraint weighting - Constraint weighting assigns numerical weights to constraints to guide a solver's search.
Context-specific independence - Context-specific independence is a probabilistic relationship in which some variables become independent when a particular context holds.
Continuous domains - Continuous domains are sets of possible variable values modeled as a continuum, such as all real numbers in an interval.
Contraction - A contraction is a mapping that reduces the distance between any two inputs by at least a fixed proportional factor smaller than one.
Contraction hierarchies - Contraction hierarchies are a shortest-path acceleration technique that preprocesses a weighted graph into an ordered hierarchy with shortcut edges.
Contradiction - In classical logic, a contradiction is a statement that is false under every interpretation, such as P AND NOT P.
Control theory - Control theory studies how to influence a changing system so that its behavior meets specified objectives.
Corpus - A corpus is a collection of language material assembled for analysis, research or computational use.
Critical path - A critical path is a sequence of dependent activities that determines a project's earliest completion time in a basic precedence schedule.
Critical path method - The critical path method, or CPM, is a scheduling technique that uses activity durations and dependencies to calculate early and late start and finish...
Crossover point - A crossover point is a position in a candidate solution's representation where a crossover operation switches from material inherited from one parent to...
Cuckoo hashing - Cuckoo hashing is a hash-table technique that gives each key a small number of possible storage locations.
Current Flow Betweenness - Current-flow betweenness is a graph centrality measure that scores a vertex by how much modeled electrical flow passes through it between other pairs of...
Current Flow Closeness - Current-flow closeness is a centrality measure based on effective resistance between vertices in an electrical-network model of a graph.
Curriculum Learning - Curriculum learning is a training strategy that deliberately changes the examples or tasks presented to a model over time, often beginning with easier...
Curse of dimensionality - The curse of dimensionality describes difficulties that can arise as the number of dimensions in a problem increases.
Cutoff test - A cutoff test is a condition that tells a search algorithm to stop expanding a state before the complete underlying problem has necessarily ended.
Cutset conditioning - Cutset conditioning is a method for solving a constraint problem by trying assignments to a selected set of variables whose removal leaves an acyclic...
Cycle - A cycle is a route through a graph that returns to its starting vertex. In a simple cycle, no other vertex is repeated.
Cycle cutset - A cycle cutset is a set of vertices whose removal leaves a graph without cycles.
Cyclic solution - A cyclic solution is a plan or policy that can return to an earlier state or decision point and repeat actions.
CYK algorithm - The CYK algorithm, named for Cocke, Younger and Kasami, is a dynamic programming method for recognizing and parsing strings with a context-free grammar.