Lifting lemma - The lifting lemma is a result in automated reasoning that connects resolution on ground clauses with resolution on general first-order clauses.
Lightweight ontology - A lightweight ontology is a relatively simple, explicit model of a domain's concepts and relationships, using limited formal detail compared with a more...
Limited rationality - Limited rationality is decision-making that accounts for limits on time, information, memory, or computation.
Line search - Line search is an optimization procedure that chooses how far to move from a current point along a selected direction.
Linear constraints - Linear constraints are equalities or inequalities in which decision variables appear only in weighted sums with fixed coefficients.
Linear hashing - Linear hashing is a dynamic hashing method that expands a table or file by splitting buckets in a predetermined sequence.
Linear partial information - Linear partial information is a way to represent incomplete knowledge through linear restrictions, especially restrictions on probabilities or normalized...
Linear planning - Linear planning, in the historical classical-planning sense used here, solves subgoals through separate subplans and joins those subplans without...
Linear probing - Linear probing is a collision-resolution method for a hash table stored in an array.
Linear resolution - Linear resolution is a strategy for organizing resolution proofs around a continuing chain of derived clauses.
Linear search - Linear search finds an item by checking entries one at a time until a match is found or the searchable collection is exhausted.
Linear separator - A linear separator is a decision boundary defined by a weighted sum of features plus an offset.
Linear temporal logic - Linear temporal logic, or LTL, is a formal language for describing how conditions should hold along a sequence of system states.
Linguistic Linked Open Data - Linguistic Linked Open Data, or LLOD, is an approach and community movement for publishing and connecting language resources using linked-data principles...
Linkage constraints - Linkage constraints are restrictions imposed by the physical connections among the links and joints of a mechanism.
Liquid event - A liquid event is an event type or temporal property that, when true throughout an interval, is also true throughout its subintervals.
Literal - A literal, in logic, is an atomic formula or the negation of an atomic formula. P is a positive literal, and NOT P is a negative literal.
Local beam search - Local beam search is a local-search method that keeps several candidate states at once.
Local Community Detection - Local community detection identifies a group of related nodes around a chosen source node in a network.
Local consistency - Local consistency is a family of conditions used in constraint satisfaction to check whether assignments to small groups of variables can be extended...
Local search - Local search is a family of methods that looks for useful solutions by modifying current candidate solutions and evaluating nearby alternatives.
Localist representation - A localist representation assigns a particular concept or item to a dedicated representational unit.
Locality-sensitive hash - A locality-sensitive hash is a hash designed so that similar items are more likely than dissimilar items to receive the same value.
Locking - In historical automated theorem proving, locking is a restriction on resolution that uses labels on literal occurrences to control which inferences are...
Logic - Logic provides formal ways to express statements and determine what follows from them.
Logical connectives - Logical connectives are operators that combine or modify statements to form more complex statements.
Logical equivalence - Logical equivalence means that two statements have the same truth value in every interpretation allowed by the chosen logic.
Logical inference - Logical inference is the process of deriving conclusions from premises using specified reasoning rules.
Logical minimization - Logical minimization, in the circumscription sense used in knowledge representation, prefers models that make selected predicates true of as few cases as...
Logical omniscience - Logical omniscience is an idealization in which an agent is treated as knowing every logical consequence of what it knows, as well as every logical validity.
Look-ahead (backtracking) - Look-ahead in backtracking is the use of current choices and constraints to examine remaining possibilities before extending a search branch further.
Loopy belief propagation - Loopy belief propagation is the repeated application of belief-propagation message updates to a probabilistic graphical model containing cycles.
Loss function - A loss function assigns a numerical penalty to a model's output according to a specified objective.
Machine reading - Machine reading is the use of AI to interpret information expressed in text and make it available for tasks such as answering questions, extracting...
Macrops - Macrops are macro-operators: reusable planning structures that package a sequence of actions so a planner can consider the sequence as a larger unit.
Magic set - A magic set is an auxiliary relation used in a logic-program rewriting technique to identify which bindings are relevant to a particular query.
Maintaining Arc Consistency - Maintaining Arc Consistency, often abbreviated MAC, is a constraint-search strategy that restores arc consistency after each decision during backtracking.
Makespan - Makespan is the time at which all scheduled work has finished, measured from a specified scheduling origin.
Margin - In classification, a margin measures how far an example lies from a decision boundary, usually with a sign indicating whether it is on the correct side.
Markov blanket - A Markov blanket is a set of variables that makes a target variable conditionally independent of the remaining variables when the blanket's values are known.
Markov chain Monte Carlo - Markov chain Monte Carlo, or MCMC, is a family of methods for estimating quantities from a probability distribution by generating a dependent sequence of...
Markov network - A Markov network is a probabilistic graphical model that uses an undirected graph to represent relationships among variables.
Markov reward process - A Markov reward process, or MRP, is a Markov state-transition model equipped with rewards.
Maximal independent set - A maximal independent set is a set of graph nodes with no edges between selected nodes, to which no additional node can be added without creating an edge...
Maximin - Maximin is a decision rule that chooses the option with the best worst-case payoff.
Maximin equilibrium - In the standard two-player zero-sum setting, a maximin equilibrium is a pair of strategies in which each player secures the best worst-case expected payoff...