Turing Test
Agent
Representation and Reasoning System
Dimensions of Representational Complexity
Markov assumption
State Space
Variable
State
Action
Goal state
Successor function
Search problem
Graph
Path
Solution
Frontier
Search strategy
Forward branching factor
Completeness of a search algorithm
Time complexity of a search algorithm
Space complexity of a search algorithm
Depth-first search
Breadth-first search
Uninformed search
Heuristic search
Optimality of a search algorithm
Search heuristic
Admissibility of a heuristic
Relaxed version of a search problem
Heuristic values
Path cost
Optimal Efficiency of a search algorithm
Branch-and-Bound
Cycle-checking
Multiple-path pruning
Backwards branching factor
Bidirectional search
Dynamic programming
Constraint Satisfaction Problem
CSP variables
CSP constraints
Model of a CSP
Arc consistency
Domain consistent
Constraint network
TODO arc
Neighbour relation
Scoring function
Hill-climbing
Gradient ascent
Gradient descent
Plateau
Random walk
Random restart
Runtime distribution
Min-Conflict Heuristic
Simulated Annealing
Annealing Schedule
Tabu Search
Beam Search
Genetic Algorithms
Crossover operator
Tabular representation
State-based representation
STRIPS representation
Frame rule
STRIPS assumption
Precondition of an action
Effect of an action
Forward planning
Domain-specific pruning
Precondition constraints
Effect constraints
Initial state constraints
Goal constraints
Action constraints
State constraints
Propositional definite clauses
Horizon
Syntax
Semantics
Proof procedure
Atom
Body
Definite clause
Knowledge base
Interpretation
Model
Logical consequence
Proof
Soundness of a proof procedure
Completeness of a proof procedure
Forward chaining
SLD resolution
Answer in SLD resolution
Derivation
Datalog: variable
Datalog: constant
Datalog: term
Datalog: predicate symbol
Datalog: atom
Datalog: definite clause
Datalog: knowledge base
Datalog: interpretation
Datalog: semantics
Datalog: truth in an interpretation