1.0
The Artificial Intelligence DAG_0_99 Taxonomy created with OntoLearn Reloaded (see http://ontolearn.org)
abstraction
state
state is a function of the entire contents of its memory .
event
act
action
activity
action
activity
communication
function
function can be a source of error .
knowledge
procedure
process
process
structure
structure is the new node .
record
a record is a set of related data values in a.
data value
node
a node is a record used to build linked data structures such as trees , linked lists , and computer-based representations of graphs .
code
value
a value is the state of an object .
system
knowledge domain
knowledge base
domain
knowledge base
domain
relation
person
space
a space is the state of mind one is in when daydreaming .
source code
source
source
function
function
function
property
program
a program is a mathematical space related to computer targetming . .
path
a path is a single sequence of choices that could be made by a nondeterministic machine . .
directed acyclic graph
a directed acyclic graph is a tree if it satisfies the following properties : there is one and only one vertex ( ) , which no edges enter .
metric system
si
a si is a complete metric system of units of measurement for scientists .
state
sequence
a sequence is the primary structure of a biopolymer .
representation
software program
a software program is a written programs or procedures or rules and associated documentation pertaining to the operation of a computer system and that are stored in read\ write memory .
network
network is a directed acyclic graph ( ) .
tree
a tree is any structure or construct having branches akin to .
quality
expression
tree
neural network
a neural network is any network of neurons or nuclei that function together to perform some function in the body .
string
a string is a database and web resource of known and predicted protein-protein interactions .
plan
a plan is a programming language for nineteen-hundred a low-level language used to program the ict 1900 range of computers .
program
database
a database is a software program for storing , retrieving and manipulating a database ( ) .
search
search in and\ or graphs is able to take care of loops .
tree
notation
a notation is a system of characters , symbols , or abbreviated expressions used in an art or science or in mathematics or logic to express technical facts or quantities .
methodology
method
method
quantity
measure
measure
care
a care is the state of being cared for by others .
programming language
a programming language is a notation for writing programs , which are specifications of a computation or algorithm .
design
a design is a plan for the structure and functions of an artifact , building or system .
being
a being is the state or fact of existing .
size
a size is the actual state of affairs .
network
algorithm
concept
path
segment
a segment is a straight path between two points that is the shortest distance between them .
production system
a production system is a computer program typically used to provide some form of artificial intelligence , which consists primarily of a set of rules about behavior .
character
a character is a being involved in the action of a story .
statement
a statement is an instruction in a computer program .
operator
a operator is a segment of dna regulating the activity of genes .
model
framework
framework
data
information
information
logic
a logic is the branch of philosophy that analyzes inference .
technique
technology
approach
technology
approach
inquiry
a inquiry is a search for truth , information , or knowledge
philosophy
a philosophy is an inquiry into the nature of things based on logical reasoning rather than empirical methods . ( ) ( ) .
circuit
a circuit is an enclosed path of an electric current , usually designed for a certain function .
value
value
instrumentality
device
directed graph
a directed graph is a graph in which the edges are ordered pairs , so that , if the edge is in the graph , the edge need not be in the graph and is distinct from if it is .
sequence
alphanumeric string
symbol
a symbol is an alphanumeric string headed by .
discipline
study
field of study
study
field of study
feature
a feature is a concept applied to several fields of linguistics , typically involving the assignment of or unary conditions which act as constraints .
data structure
node
node
computer program
a computer program is the expression of an algorithm in a particular programming language .
computer program
amount
constraint
a constraint is a path used to specify that particular function symbols must appear at particular places in a term .
application
a application is a program that gives a computer instructions that provide the user with tools to accomplish a task .
binary tree
a binary tree is a tree in which every node has exactly two links i. a binary tree is made of nodes , where each node contains a amp;quot .
instruction
instruction
computation
a computation is a simulated annealing a partially random method of search and optimization usually used for combinatorial optimization problems .
equation
a equation is a state of being essentially equal or equivalent .
analysis
a analysis is a branch of mathematics involving calculus and the theory of limits .
network
degree
a degree is the amount that an entity possesses a certain property
ability
vector
structure
production system
program
variable
a variable is a symbol that is used in mathematical or logical expressions to represent a variable quantity .
rule
rule is the degree of consistency for the rule .
neural network
distribution
a distribution is a probability distribution
statement
connected network
subset
subset are predicates
environment
a environment is an affine an equation that can be written in terms of matrix-vector multiplication and vector addition . .
affine
a affine is an equation that can be written in terms of matrix-vector multiplication and vector addition . .
succession
a succession is an acquisition of property by descent or by will .
dynamic programming
so dynamic programming is also gradient descent ? hmm , i do n't think so , though dynamic programming is frequently used for optimization .
generalization
in mathematical logic , generalization is an inference rule of predicate calculus .
first-order logic
first-order logic refers to first-order predicate calculus wherein facts may be expressed as a combination of a functor and an argument .
constraint
map
a map is a continuous function .
optimization
a optimization is the design and operation of a system or process to make it as good as possible in some defined sense .
machine learning
machine learning is concerned with the design and analysis of algorithms that enable computers to automatically find patterns in the data .
sentence
a sentence is a string of words satisfying the grammatical rules of a language .
environment
calculus
a calculus is the branch of mathematics that is concerned with limits and with the differentiation and integration of functions .
size
order
a order is an of computation '' , the computational complexity of an algorithm .
curve
a curve is a line on a graph representing data .
directed acyclic graph
search strategy
a search strategy is a specific plan for how you 'll conduct an efficient and effective search so that you uncover the most relevant information that a particular .
theorem
in mathematics , a theorem is a statement that has been proven on the basis of previously established statements , such as other theorems , and previously accepted statements , such as axioms .
binary relation
a binary relation is an partial order if it transitive and antisymmetric .
character
science
context
a context is the relevant constraints of the communicative situation that influence language use , language variation and discourse .
predicate
a predicate is a single constraint for a query .
partitioned semantic network
place
a place is an equivalence relation defined on absolute values of an integral domain or field .
first-order predicate calculus
bayesian network
a bayesian network is a directed acyclic graph that represents a probability .
probability distribution
a probability distribution is a function of a discrete random variable yielding the probability that the variable will have a given value .
assertion
a assertion is a statement in a program asserting a condition expected to be true at a particular point , used in debugging .
equivalence relation
an equivalence relation is a binary relation which comprises of two elements of a set that are semantically and syntactically equivalent on some way .
equation
equation
language
simulated annealing
simulated annealing is a generalization of a monte carlo method for examining the equations of state and frozen states of n-body systems .
inference rule
inference rule refers to intelligence that ties concepts together .
construct
a construct is a concept or model .
graph
a graph is a construct that consists of many nodes connected with edges .
graph
graph
graph
magnitude
a magnitude is an of a vector , the norm , most commonly , the two-norm .
relationship
a relationship is a relation between people .
constraint
line
line is a regression ﬁt to the data , which is averaged over 20 trials .
ratio
in mathematics , a ratio is a relationship between two numbers of the same kindwentworth , p .
ratio
state-space search
line
phenomenon
polynomial function
a polynomial function is any function whose value is the solution of a polynomial .
development
a development is a state in which things are improving .
gradient descent
gradient descent is a search strategy used in continuous search spaces .
gradient descent
intelligence
intelligence is an emergent property .
evaluation
a evaluation is a determination of the value of a variable or expression .
probability distribution
time
time is a polynomial function of abstraction size .
operator
determination
a determination is the state of decision
selection
a selection is an operator that takes a relation and returns a new relation on the same attributes , with only those rows satisfying a given boolean expression
disjoint subset
equivalence class
a equivalence class is any one of the subsets into which an equivalence relation partitions a set , each of these subsets containing all the elements of the set that are equivalent under the equivalence relation .
programming language
anaphor predicate
acquisition
acquisition
belief network
a belief network is a directed acyclic graph containing a set of nodes , a set of arcs and a probabilistic inference in a belief network is the task of computing a.
regression
a regression is an equation using specified and associated data for two or more variables such that one variable can be estimated from the remaining variable ( ) .
grammar induction
grammar induction is a particular case of inductive learning .
theory
succession
sample space
condition
a condition is a state at a particular time .
attribute
a attribute is a characteristic or quality of a thing .
attribute
network
digraph
a digraph is a directed graph .
machine learning
integer
in computer science , the term integer is used to refer to a data type which represents some finite subset of the mathematical integers .
inference rule
application domain
a application domain is an isolated context , with its own virtual address space , in which an application runs , analogous to a process in an operating system .
path
morphological context
phonological context
i-dt decision tree
decision tree expressiveness
dynamic conditional random field
markov chain
a markov chain is a special sort of belief network used to represent sequences of values , such as the sequence of states in a dynamic system or the sequence of .
domain constraint
a domain constraint is a unary constraint of the form ' x in set ' where x is a real valued variable and set denotes the domain of x. the set in a domain constraint .
sentence
eigenvalue
a eigenvalue is an embedding a method of taking a scalar time series and using delayed snapshots of the values at fixed time intervals in the past so that the dynamics of the underlying system can be observed as a function of the previously observed states . .
simulated annealing
support vector machine
support vector machine is a kind of neural network that optimally classifies measured data based on kernel method which is very popular in neural network technologies .
neural network expressiveness
feed-forward neural network
boltzmann machine
boltzmann machine is a neural network whose units ( ) have stochastic input-output functions .
associative memory
associative memory is a major class of neural networks with a wide range of applications , such as content-addressable memory and pattern recognition .
hopfield network
a hopfield network is a recurrent neural network having synaptic connection pattern such that there is an underlying lyapunov function for the .
multilayer network
a multilayer network is a kind of neural network which consists of one or the multilayer network is the basis for backpropagation network .
recurrent neural network
a recurrent neural network is a neural network where the connections between the units form a directed cycle .
connectionism
connectionism is the study of artificial neural networks .
neural network efficiency
multilayer neural network
neuron
a neuron is a see neural network , also mcculloch-pitts .
formula
formula was a theorem .
search
care
scheme
a scheme is a systematic plan of future action .
classification
a classification is an association of an input vector with a particular target vector . .
architecture
a architecture is the design and structure of specific components of a computer system and how they connect and interact with one another . .
grammar
grammar is the structure of that language : the way it 's used , and the conventions that help us understand what is meant from the context .
inductive learning
inductive learning is a form of supervised learning in which a system tries to .
essence
a essence is a significant feature of something .
operation
a operation is the state of being in effect or being operative .
principle
a principle is a fundamental essence , particularly one producing a given quality .
principle
constraint
motion
a motion is a state of change .
mathematics
mathematics
mathematics
length
in phonetics , length or quantity is a feature of sounds that are distinctively longer than other sounds .
disjunction
a disjunction is a logical operator that results in true when some of its operands are true .
predicate
generation
a generation is the normal time between successive generations .
eigenvalue
reasoning process
embedding
a embedding is a map which maps a subspace to the whole space .
logic
tree
inference
a inference is a reasoning process by which a new premise is derived from one or more given premises .
tree
probability
a probability is the state of being probable
service
a service is the state of being subordinate to or employed by an individual or group .
graphical model
a graphical model is a family of distributions that is restricted to be markov with respect to a certain graph .
aggregate
a aggregate is an analysis , a technique used in amortized analysis in computer science , especially in analysis of algorithm .
grammar induction
program synthesis
program synthesis is the systematic derivation of a program from a given a deductive approach to program synthesis is presented for the construction of .
theorem proving
theorem proving is the systematic derivation of a mathematical proof from a set of axioms by the use of rules of inference .
context
first-order logic semantics
character
horn logic
horn logic is a certain subset of first-order logic ( ) , namely the subset that results when only horn formulas are used .
first-order probabilistic logic
first-order probabilistic logic is a first-order logic that associates a real-valued parameter to every predicate .
probabilistic first-order logic
checking
checking is a web application developed by optimyth intended for monitoring the quality of software development process and its results , that covers the needs of organizations that want to control software quality before it is put into production .
latent perceptron
context
predicate
multiply connected network
singly connected network
dynamic decision network
conceptual graph
a conceptual graph is a semantic network where graph nodes represent concepts and graph edges represent semantic relations .
spatial network
a spatial network is a network of spatial elements in physical space which typically includes urban or building space spatial networks are derived from maps .
boltzmann machine
adaptive network
an adaptive network is network of nodes and directional links .
network of relation
perceptron
a perceptron is a network of such elements .
sensor network
a sensor network is a network that is composed of a collection of sensor node ( ) , normally , a sensor network is used to do a certain task such .
polytree
a polytree is a network where there is at most one path from one variable to another .
multi-agent system
multi-agent system is a loosely connected network of intelligent , which are fundamental element of multi-agent system is an intelligent agent .
semantic network
a semantic network is a network which has been built ( ) to represent the semantic relations among words to derive .
hopfield network
database
dag
a dag is a directed acyclic graph , a type of graph used in computer science and mathematics .
generation
notation
ai
ai is a computer virus which infects .
binary dag
derivation
a derivation is a binary tree whose leaves are each a single-word constituent , and whose internal nodes are each a constituent which is derived from its children by an application of one of the com- binatory rules .
semantic
a semantic is a string attached to a shader .
sigmoid belief network
a sigmoid belief network is a binary dag , with .
decision tree
a decision tree is a binary tree where each non-leaf vertex is labeled by a query , each edge is labeled by a possible answer to the query , and each leaf is labeled by an output
result
result is the distribution of coalition values .
substring
a substring is a string of characters that is contained in another string , like `` ello '' in `` hello '' . precisely , a string a is a substring of b , if b = c . a . d for some strings c and d , where '' . '' is a concatenation operator , and c and d are possibly empty .
binary decision diagram
binary decision diagram is a dag , representing a boolean function , with two terminal nodes ( ) .
heuristic
a heuristic is a function that , when applied to a state , returns a number that is an in other words , the heuristic is telling us , that it thinks a solution might be .
package
software
software system
software
software system
sentence
bayesian network
memory
a memory is the time within which past events can be or are remembered .
partially observable markov decision problem
finite state machine
a finite state machine is a digital circuit whose output is dependent not only on nevertheless , the concept of finite state machine is useful in software design as .
modal logic
modal logic is applicable to a wide range of reasoning domains .
dag
derivation
markov decision problem
a markov decision problem is a markov chain with the addition of an action model and a performance criterion .
hidden markov model
a hidden markov model is a markov chain for which the state is only .
undirected graph
an undirected graph is a tree if and only if there is a unique simple path between any two of it vertices .
search tree
a search tree is a tree ( ) in which the the branching factor in a search tree is the number of actions available to the .
decision tree
association
a association is the state of being connected together as in memory or imagination .
semantic
machine learning
power
a power is a mathematical notation indicating the number of times a quantity is multiplied by itself .
reasoning
a reasoning is the act of using inference to lead to a conclusion based on existing knowledge and\ or data . .
decision-making method
calculus
calculus
emergent property
emergent property
decision problem
a decision problem is a partitioning of a under some desired properties .
first-order logic
intelligence
intelligence
factorization
a factorization is the resolution of an entity into factors such that when multiplied together they give the original entity .
ontology
ontology is a branch of metaphysics concerned with the nature and relations of being .
comparison
a comparison is an evaluation of the similarities and differences of one or more things relative to some other or each-other .
application
q-learning
q-learning is a specific kind of reinforcement learning that assigns values to state - action pairs .
first-order predicate calculus
predicate calculus
a predicate calculus is the branch of logic that deals with quantified statements such as `` there exists an x such that ... '' or `` for any x , it is the case that ... '' , where x is a member of the domain of discourse .
belief
a belief is the quality or state of believing .
architecture
range
range is the longest final substring in brange that matches a word-final substring in the diction- ary .
markov network
a markov network is similar to a bayesian network in its the joint distribution represented by a markov network is given by : .
data type
in computer programming , a data type is a classification identifying one of various types of data , such as floating-point , integer , or boolean , that determines the possible values for that type
causal network
a causal network is similar to a bayesian network but : the edge x ! y exists iff x is a direct cause of y. the conditional probabilities have a.
influence diagram
now-a-days , an influence diagram is a bayesian network extended with utility an influence diagram is solved by computing a strategy yielding the highest .
process of breaking
generalized cylinder
a generalized cylinder is the surface produced by ex - truding a circle along a path through space , allowing the circle 's radius to vary along the path .
similarity network
a similarity network is a set of bayesian networks , each constructed under .
integer linear programming
programming language
surface
a surface is a the locus of an equation in a more-than-two-dimensional space .
programming language
theorem
programming language
analysis
locus
a locus is the scene of any event or action
analysis
conceptual clustering
conceptual clustering is a form of unsupervised learning (
data mining
data mining refers to the application of algorithms for extracting patterns from data without the additional steps of the kdd process .
process of making
generalization
sorting algorithm
a sorting algorithm is comparison based if it uses comparison operators to find the order between two numbers .
retrieval
a retrieval is the operation of accessing data , either from memory or from a storage device .
resolution
a resolution is an analysis into clear-cut components .
markov network
conditional random field
a conditional random field is an undirected graph h whose nodes correspond to xuy
partitioning
a partitioning is an analysis into mutually exclusive categories .
resolution
grammar formalism
grammar formalism is described as a constraint - .
research
a research is a search for knowledge .
unary constraint
a unary constraint is a special binary constraint : if we consider an origin , say x0 , of the world then a unary constraint x ∈ a becomes equivalent to the binary .
precision-recall curve
cryptarithmetic problem
cryptarithmetic problem is an interesting constraint .
training curve
functional dependency
a functional dependency is defined as a constraint between two sets of attributes in a relation from a database .
grammar
binary constraint
a binary constraint is a constraint on at most two variables , and a binary constraint graph corresponds to a set of binary constraints .
parameter
a parameter is the value which is passed into the function to instantiate such a name
situation
a situation is the general state of things .
plan
dynamic belief network
plan
data type
array
an array is a variable containing multiple values .
logic programming constraint
unary constraint
depth
a depth is a low moral state .
silhouette curve
a silhouette curve is a curve on the surface of the model separating the the silhouette curve is traced by stepping the parametric coordinate of the .
linking curve
thus , a linking curve is simply a curve that passes through the axes of the manipulator in order .
plan
soft global constraint
extension
extension and reduction are sound inference rules .
temporal constraint
a temporal constraint is an atomic constraint if it is a fluent literal .
regression
mapping
a mapping is the process of making maps .
scene
a scene is the place where some action occurs .
boolean variable
a boolean variable is a place in memory where a boolean value may be stored .
semantic web
in essence , the semantic web is a place where machines can read web pages much as we humans read them , a place where search engines .
linear classification
linear classification is the obvious first place to start , owing to its long history in pattern recognition and its suitability for small-sample classification .
computer science
computer science is the study of principles , applications , and technologies of computing and computers .
computer science
philosophy
philosophy
correction
temporal logic
temporal logic is a type of modal logic that is used for reasoning about changing properties with time .
dynamic logic
dynamic logic is modal logic .
equation
process of formulating
rewrite rule
a rewrite rule is a function that can be applied to a term using an explicit application function .
proposition
proposition is equivalent to the formula in question .
epistemic logic
epistemic logic is a modal logic used to reason about information , including have , because epistemic logic is suited to deal with situations involving more than .
predicate calculus
ontology
time
table
speedup learning
speedup learning is a branch of machine learning that studies learning mech - anisms for speeding up problem solvers based on problem solving experience .
iterative dynamic programming
semi-supervised learning
semi-supervised learning is a field of machine learning that studies learning from both labeled and unlabeled examples .
real-time dynamic programming
real-time dynamic programming is a special case of asynchronous dynamic programming , in which the stages of the optimal value function being approximated .
case-based reasoning
case-based reasoning ( ) is a form of machine learning that uses examples .
support vector machine
supervised learning
supervised learning is a kind of machine learning where the learning algorithm is provided with a set of inputs for the algorithm along with the corresponding correct outputs , and learning involves the algorithm comparing its current actual output with the correct or target outputs , so that it knows what its error is , and modify things accordingly .
explanation-based learning
explanation-based learning is a branch of machine learning in which prior knowledge of the world is integrated into the process of automatically forming new .
top-down dynamic programming
space-efficient dynamic programming
reinforcement learning
reinforcement learning is an area of machine learning which addresses how an autonomous agent can learn long-term successful behavior through interaction with its environment .
inductive logic programming
inductive logic programming is the subfield of machine learning that uses first or - the second motivation for using inductive logic programming is that it em - .
asynchronous dynamic programming
unsupervised learning
unsupervised learning is a method of machine learning whereby the algorithm is presented with examples from the input space only and a model is fit to these .
recursive dynamic programming
pattern recognition
pattern recognition is a sub-topic of machine learning .
resolution
epipolar line
orthogonal line
order
modal logic
decomposition
a decomposition is the analysis of a vector field .
semi-supervised feature selection
adaptive network
machine learning
expert system
an expert system is a program that emulates the interaction a user might have with a human expert to solve a problem .
metaphysics
a metaphysics is the branch of philosophy which studies fundamental principles intended to describe or explain all that is , and which are not themselves explained by anything more fundamental
logic
range
predicate calculus
cost
a cost is a value measured by what must be given or done or undergone to obtain something .
bound
a bound is a value which is known to be greater or smaller than a given set of values .
utility
a utility is a software program specifically designed to help manage and tune the computer hardware , operating system or application software , and perform a single task or a small range of tasks
expert system
computer virus
a computer virus is a software program capable of reproducing itself and usually capable of causing great harm to files or other programs on the same computer .
computer virus
logic
trajectory
a trajectory is the path that a moving object follows through space as a function of time .
dependency tree
a dependency tree is a particular type of dependency graph .
probability
web application
a web application is an application that resides on a company 's web server , which any authorized user can access over a network , such as the world wide web .
fastest sorting algorithm
mechanism
evolutionary programming
evolutionary programming is a branch of ai where the principles of darwinian evolution are used to evolve a modeling process to solve a.
mechanism
real-time ai
possibility theory
possibility theory is a branch of fuzzy logic .
good old-fashioned ai
guarded horn clause
minimum proof graph
belief network
temporal constraint
research
horn clause
a horn clause is a disjunction of literals , among which there is at most one positive a de nite horn clause is a horn clause having exactly one positive literal .
competitive ratio
competitive ratio is a performance measure designed to quantify the ability of an algorithm a will be called strongly competitive if its competitive ratio is within a.
disjunction of literal
causal graph
a causal graph is a deterministic finite automaton ( ) where states are е equivalence classes , and transitions correspond to actions .
causal graph
feature selection
feature selection refers to the selection of an optimum subset of features derived from these input variables .
binary decision diagram
proof graph
a proof graph is a directed acyclic graph .
qualitative probabilistic network
a qualitative probabilistic network is a directed acyclic graph whose nodes represent random variables and whose edges represent the dependencies between .
axiom
in traditional logic , an axiom or postulate is a proposition that is not proved or demonstrated but considered to be either self-evident , or subject to necessary decision .
free variable
a free variable is defined as an input variable that has not yet been assigned a standard deviation .
key word
key word is one of the slowest search selections .
heap selection
user input
fitness-based selection
slowest search selection
deterministic selection
deterministic selection is a fitness-based selection , whereby an individual is so , if deterministic selection is used , in each generation , each individual can .
dependency graph
a dependency graph is a directed acyclic graph ( ) , in which each node represents an operation and directed edges represents .
dependency analysis
a dependency analysis is an directed acyclic graph where the words correspond to nodes and depen - dencies to edges .
sorting algorithm
dependency tree
consequence relation
a consequence relation is a binary relation ∼ between sentences of classical propositional logic .
task
a task is a symbolic representation of an activity .
bsp tree
a bsp tree is just a binary tree plus the partition that separates both children .
binary heap
a binary heap is a binary tree that is completely filled , with the possible exception of the bottom level , which is filled from left to right with no missing nodes .
semantic tree
a semantic tree is a binary tree with nodes that are signed formulas .
decomposition tree
decomposition tree is a binary tree , whose every internal node is labeled by some .
binary space partition
a binary space partition is a binary tree where each node corresponds to a connected region of the space ( ) and to a geometric object that bipartitions .
task
inference rule
breadth first search tree
paradigm
inductive logic programming
graph mining
graph mining is a type of data mining in which data is organized into a graph in order to extract information regarding the data .
web mining
web mining is a branch of data mining that concentrates on analyzing the structure of the world wide web ( ) .
sentence
control
a control is a regulation or maintenance of a function or action or reflex etc.
selection
capacity
a capacity is the power to learn or retain knowledge .
searching
a searching is a search
supervised learning
depth first search tree
game tree
a game tree is a tree which represents the current state and possible future of the root of the game tree is shown to be 0 , meaning that neither player .
proof tree
a proof tree is a tree created from the path from the start node to the goal node , proving the correctness of the goal found .
conditional random field
argumentation tree
fibonacci heap
fibonacci heap is a collection of many trees .
semantic tree
tree decomposition
a tree decomposition is a tree t ( ) .
decomposition tree
search graph
search graph is a tree the solution may not be optimal .
taxonomic hierarchy
a taxonomic hierarchy is a kind of tree in the general sense , and hence we can divide comparison of hierarchies into two tasks : comparison of nodes and .
maximum expected utility
linear input resolution
interaction graph
interaction graph is a tree .
self-constructed test tree
bottom-up dynamic programming
bottom-up dynamic programming is a self-constructed test tree , the algorithm has exponential storage and computational complexity of o ( ) (
order of similarity calculation
feature extraction
feature extraction is a complex mathematical tree that would separate blood cells based on their physical features including the nucleus to cytoplasmic ratio , diameter and density .
minimum spanning tree
a minimum spanning tree is a spanning tree : ( ) whose weight is less than or equal to the weight of every other spanning tree .
constraint graph
constraint graph is a tree .
spanning tree
a spanning tree is a tree with v − 1 edges , i.e. a tree that connects all the vertices .
binary heap
dialectical tree
abstraction hierarchy
an abstraction hierarchy is a tree , in which the nodes are frames and the branches the morph abstraction hierarchy is described by a set of frames and a.
vertex elimination order
entity tree
model tree
model tree is the tree of preprocessing operators to be applied to the test \ execution data .
gaussian
gaussian is a computational chemistry software program initially released in 1970 by john pople and his research group at carnegie-mellon university as gaussian 70 .
conjunction
a conjunction is the state of being joined together .
actor architecture
chart
a chart is a map for a very particular purpose , such as shipping or aeroplanes\ airplanes , showing information useful for that purpose and ignoring most other information .
web application
performance measure
performance measure was search nodes .
polynomial time
a polynomial time is a time complexity which is bounded by some polynomial .
connection
a connection is the state of being connected .
deterministic finite automaton
a deterministic finite automaton is a finite state machine where for each pair of state and input symbol there is one and only one transition to a next state .
computational chemistry software program
information retrieval
information retrieval is the study of ranked retrieval of data items based on a natural query .
software agent
a software agent is a software program that is capable of autonomous ( ) actions in pursuit of a specific goal .
markov model
a markov model is a finite state machine with probabilities governing transitions between states and controlling the emission of output symbols .
real-time architecture
scheme
domain-specific search engine
recognition
a recognition is the state or quality of being recognized or acknowledged .
open planning architecture
ai
hidden markov model
agent architecture
augmented transition network
augmented transition network is a finite state machine with variables nodes transitions variables structure of a node name : unique identifier .
polytree
agent
agent is using incorrect information about the world .
incorrect information
process of finding
algorithm resolution
computing
closure resolution
application
input resolution
an input resolution is a resolution in which one of the two parent clauses is an in - put clause .
robot
a robot is a mechanism that can move automatically .
pronoun resolution
computing
utility
operation
communication system
input
input is an array of intensity values from the camera image .
proof of theorem
proof of theorem is based on the factorization of the assumption formula k ( ) ± 2r-1 on multipliers a and b. the checker is shown on figure 1 .
data mining
probability distribution
probability distribution
definition
therefore , a definition is a promising source for lr relations between the defined concept and the definition terms .
matrix factorization
specifically , matrix factorization is the factorization of the latent factor model of n users and m items with a sparse matrix of ratings each user .
linear resolution
applicable operator
modal operator
in modal logic , a modal operator is an operator which forms propositions from propositions .
high-level ontology
op strips operator
abstract operator
deliberate ambiguity
deliberate ambiguity is a perfectly valid operator , even simpler than that of qsf .
expansion operator
target ontology
dropping condition
dropping condition is an genetic operator for rule learning , to avoid subsumed rules .
semantic network
existential quantifier
existential quantifier is a logical operator of predicate logic , written thereis , which makes it possible to express that at least one .
general ontology
general ontology is a high-level ontology which captures general features of basic contextual entities .
universal quantifier
universal quantifier is a logical operator of predicate logic , written all , which makes it possible to express that all entities in the .
logical symbol
logical symbol is the operator # .
source ontology
source ontology is an ontology about the eu legislation on package travels at the next step of ontology-based query translation , the source ontology is .
primitive operator
a primitive operator is an operator that may be referenced in the definition of a hierarchical operator , but whose definition is not provided within the scope of the .
refinement operator
label propagation
label propagation is a popular scheme for exploiting unlabeled data when a good graph can be constructed by considering the pairwise distances between .
behavior-based robotics
behavior-based robotics is a branch of robotics that bridges arti cial intelligence , en - .
agent-based software engineering
axiom scheme of knowledge
incremental learning
incremental learning is an efficient scheme for reducing computational complexity of batch learning .
theory resolution
theory resolution is a scheme to exploit information about the meaning now the propositional schema for total theory resolution is as follows : let t be a theory .
binary space partition
transformation
a transformation is a function that changes the position or direction of the axes of a coordinate system .
static environment
simulation environment
autonomous driving
autonomous driving is essentially a continuous environment sensing applications producing continuous sensor data that needs to be integrated by .
generalization
network
semidynamic environment
clause
a clause is an expression including a subject and predicate but not constituting a complete sentence .
episodic environment
metric
a metric is a function of a topological space that gives , for any two points in the space , a value equal to the distance between them .
network
computational paradigm
virtual environment
artificial environment
deterministic environment
dynamic environment
continuous environment
discrete environment
vacuum world
vacuum world is a simple simulation environment used to introduce some concepts in artificial intelligence ( ) , but can also be .
nonepisodic environment
vacuum environment
bound computation
similarity computation
first-order logic
standardized procedure
argument
a argument is a variable in a logical or mathematical expression whose value determines the dependent variable .
regulation
a regulation is the state of being controlled or governed .
place
basic action theory
basic action theory is a set of sentences of our logic which describes how every object of the system would change under every kind of actions .
predicate logic sentence
quantified sentence
moving
a moving is the process of leaving one dwelling and settling in another .
place
derived sentence
time complexity
time complexity is proportional to the size of a traversed tree .
effect
a effect is the state of being binding and enforceable , as in a rule , policy , or law .
mind
a mind is a healthy mental state .
reasoning task
reasoning task is also called instance checking .
scholarly knowledge
modal logic
pattern matching
in computer science , pattern matching is the act of checking some sequence of tokens for the presence of the constituents of some pattern .
arbitrary first-order sentence
cooperative computation
link
a link is a physical connection between two nodes in a network .
test
a test is any standardized procedure for measuring sensitivity or memory or intelligence or aptitude or personality etc.
ambiguous sentence
first-order sentence
logical sentence
intensional predicate
an intensional predicate is a predicate logic sentence that is defined by a set of clauses .
computational complexity
computational complexity is the study of computation and the resources a different way of studying computational complexity is indirectly through logic , and in .
process of leaving
modell of computation
decision
a decision is a determination of future action . .
posterior probability
in summary , the posterior probability is the probability , based on our knowledge of the values of other variables , that the respective case belongs to a particular .
observation sentence
symbolic planning
symbolic planning is based on checking the satisfiability of formulas ( ) .
learning
a learning is a profound scholarly knowledge .
object recognition
object recognition is the brain 's ability to recall an object 's shape and properties .
analytic sentence
propositional sentence
instance checking
natural language expert system
translation
in euclidean geometry , a translation is moving every point a constant distance in a specified direction .
computer science
formalism
a formalism is one of several alternative computational paradigms for a given theory .
medical expert system
logical expert system
formula
computer science
computer science
computer science
translation
metalevel reasoning expert system
computer science
brain
a brain is a computer virus .
computer science
node utility
multiattribute utility
arrangement
a arrangement is an organized structure for arranging or classifying .
template
a template is a structure , based on slots for three semantic formulas that can themselves have dependent formulas , such that the whole structure represents a possible message .
model-based reasoning
model-based reasoning is semantic : it relies on the construction and inspection of alternative models , where each model represents a unique state of a airs .
time
causal semantic
function symbol
operator
compositional semantic
expected utility
expected utility is a specific form of economic utility applied to finance .
logical semantic
text string
intersective semantic
default reasoning
default reasoning is a method of knowledge representation and reasoning which allows one in this paper we describe why default reasoning is difficult , .
normalized utility
decision tree
step function
a step function is a cost function in which the .
semantic network
operator
interpretation semantic
variable
digital circuit
a digital circuit is a circuit that functions on a number of different logic gates .
derivational morphology
feed-forward network
a feed-forward network is a special case of combinational circuits , with the additional feature that the intermediate variables in the network can assume non - .
logistic regression
logistic regression is a variation of ordinary regression , useful when the observed outcome is restricted to two values , which usually represent the occurrence or .
resolution
feedforward circuit
robot trajectory
graphical model
anytime algorithm
anytime algorithm is a smooth trajectory that complies with the dynamic constraints of the robot and can therefore be tracked by the robot with high precision .
conflict resolution
conflict resolution is a wide range of methods of addressing sources of conflict - whether at the inter-personal level or between states - and of finding means of .
confidence interval
in statistics , the confidence interval is the range that a population parameter is likely to fall into , for a given probability .
kalman filtering
kalman filtering is a linear regression .
combinational circuit
planning
curve
prediction
a prediction is a model parameters can be estimated from prior data .
access path
access path is internal to file and data path is external to it .
search node
a search node is a path from state x to the start state ( ) .
integration
a integration is an operation used in the calculus whereby the integral of a function is determined .
euclidean distance
euclidean distance is an integer with bounded magnitude and precision .
undirected graph
sensor model
sensor model is gaussian ... each belief function is uniquely characterized by its mean m and covariance matrix
electronic circuit
an electronic circuit is path made out of electronically conductive material such as metal , with electronic components on the path for controlled flow of electricity .
model parameter
qualified existential restriction
distance
a distance is a considerable amount of space .
depth-first search
depth-first search is a special case of best-first search .
natural number
in mathematics , a natural number is either a positive integer ( ) or a non-negative integer ( ) .
vertex
a vertex is a node in a graph .
resource
a resource is a source of aid or support that may be drawn upon when needed .
compiler
a compiler is a program that converts another program written in one programming language into another programming language while retaining the semantics specified by the original program .
bigram model
bigram model is a simple and popular simplification , which makes the following approximation .
shortest path
a shortest path is any path who 's path weight is equal to the shortest path weight .
decision tree
knowledge representation
a knowledge representation is the notation or formalism used for coding the knowledge to be stored in a knowledge-based system . .
planning
priority queue
a priority queue is an abstract data type in computer programming .
kolmogorov complexity
so kolmogorov complexity is an integer defined up to a constant ! but the .
existential restriction
an existential restriction is a path to a variable node in the ed tree
state space
state space is the set of all paths from root node to other nodes .
optimization algorithm
distance
cutset
cutset is a set of vertices s ⊆ v , such that the graph obtained by removing all even the optimal cutset is too large , we will not care about it because pearl 's .
transit path
a transit path is a path of the robot when it is not grasping the object .
transfer path
root node
root node is the root of the tree .
utility function
a utility function is a formula that shows the total utility associated with each bundle .
number theory
number theory is the study of integers only .
certainty factor
a certainty factor is an integer in the range from -100 ( ) to +100 ( ) .
line segment
proof sketch
a proof sketch is the minimal path that the .
data path
random walk
random walk is the path of a variable over time that exhibits no predictable pattern at all .
segment of discourse
iterative deepening
iterative deepening is a complete search strategy , which combines depth-first with hence time complexity of iterative deepening is still o ( ) .
relaxed problem
relaxed problem is an admissible heuristic for the original problem .
multiattribute utility theory
merge sort
merge sort is a stable sorting algorithm based on divide and conquer principle with the fundamental idea behind merge sort is merging of already sorted .
alpha-beta pruning
alpha-beta pruning is a search strategy that reduces the number of states that a minimax approach must consider by pruning suboptimal branches of the search .
two-valued logic
two-valued logic is also called boolean logic .
alpha-beta pruning
stationary sensor model
iterative improvement
iterative improvement is one of the well-established traditional optimization it should be noted that iterative improvement is a local optimization method , and .
probabilistic sensor model
flow of information
a flow of information is the capacity to extract information of temporary value out of events and to distribute it widely and quickly .
quick sort
in practice , quick sort is usually the fastest sorting algorithm .
bucket sort
bucket sort is a sorting algorithm that works by inserting the elements of the sorting array intro buckets , then , each bucket is sorted individually .
quick sort
dependency-directed backtracking
dependency-directed backtracking is a powerful search strategy .
heap sort
heap sort is one of the fastest sorting algorithms , rivaling such speed-demons as quicksort and mergesort .
linear programming
linear programming is the study of optimization of linear functions with linear constraints .
beam search
beam search is an optimization of best-first search that reduces its memory requirements .
bounded optimality
bounded optimality is the capacity to generate maximally successful behavior given the available information and computational resources .
training set
a training set is a set of example characters from which a neural network learns to recognize a font during font training . .
power
determination
room
a room is a space '' for '' something , or '' to '' carry out an activity . .
web
a web is the connectivity or resources available to computer users . .
software architecture
software architecture is the design of the major components of complex information systems , and how they interact to form a coherent whole .
finite state machine
determination
syntax
syntax is the grammar , structure , or order of the elements in a language statement .
link
cognitive architecture
a cognitive architecture is a design for a computational system for simulating some aspect of human cognition .
consistent plan
utility theory
utility theory is a branch of decision analysis that is concerned with building models to explain and guide choice behavior under uncertainty in situations in .
recursively enumerable grammar
semantic space
semantic space is an euclidean space where words and entities are put .
completeness of a plan
complexity
example character
learning architecture
a learning architecture is a strategic design for learning to meet a particular business goal in a particular situation .
data type
multistratal grammar
simplification
in mathematical logic , simplification is a valid argument and rule of inference which makes the inference that , if the conjunction a and b is true , then a is true , and b is true .
input
language model
a language model is a kind of grammar in a speech recognition system .
disjunction
tag tree-adjoining grammar
predicate
fully instantiated plan
linear plan
dependency grammar
a dependency grammar is a grammar which describes a syntax structure , defining a modification relation between two words and its type as basic elements .
robotics
robotics is the study of the design , construction and use of robots .
nonlinear plan
definite clause grammar
a definite clause grammar is a way of expressing grammar , either for natural or formal languages , in a logic programming language such as prolog .
sign
a sign is a character indicating a relation between quantities .
formal grammar
a formal grammar is a precisely defined grammar , typically used for computer programming languages .
reductio ad absurdum
in formal logic , the reductio ad absurdum is actually a legitimate argument , but it is often applied fallaciously .
assumption
a assumption is a statement that is assumed to be true and from which a conclusion can be drawn .
complexity
tree-adjoining grammar
condition
customary method
hash table
a hash table is a very fast kind of lookup table , somewhat like an alist in that it maps lookup in a hash table is extremely fast for large tables -- in fact , the time .
condition
manner
a manner is a customary method of acting
induction of decision tree
manner
circuit
condition
boltzmann machine
context-sensitive grammar
context-sensitive grammar is now populated and password generation can begin .
pattern
sensor model
rate
in mathematics , a rate is a ratio between two measurements , often with different units .
nondeterministic polynomial time
automatic programming
automatic programming is the generation of programs by computer , usually based on specifications that are higher-level and easier for humans to specify than .
dominance
a dominance is the power or right to give orders or make decisions .
full power
markov chain
derivative
a derivative is the value of this function for a given value of its independent variable .
sentence
assembly planning
assembly planning is concerned with the generation of a logical sequence of steps each of which is a motion plan .
pattern
brain computational power
feature vector
a feature vector refers to the generation of at least two features .
perceptron representational power
node expansion
node expansion is the generation of all the successors of a given parent node .
qualitative probabilistic network
support vector machine
diagram
a diagram is a graph or chart .
probabilistic network
a probabilistic network is a graphical model of a probability distribution over a collection of stochastic variables ( ) and is used for solving .
psychology
a psychology is the study of the human mind .
environment
linear programming
union
in computer science , a union is a value that may have any of several representations or formats
speech synthesis
speech synthesis is the generation of speech by machine .
induction
a induction is the generation of an electric current by a varying magnetic field .
inductive learning
embedding
multi-agent planning
multi-agent planning is fundamental to the generation of cooperative ac - tivities .
password generation
synapse
a synapse is the connection between processing elements in a neural network . .
arithmetic notation
arithmetic notation is a programming language
justification
a justification is a statement in explanation of some action or belief .
process of bringing
conditional random field
artificial intelligence programming language
causal link
a causal link is a link from a chance node ( ) or a decision node to a chance node .
cost function
cost function is the derivative of ( ) the average cost function .
computer system
boolean function
a boolean function is a map f : bn → b , for some positive integer n called the arity of f. because we only discuss boolean functions , we refer to them simply as .
constraint logic programming
constraint logic programming is a new class of declarative programming languages whose primitive operations are based on constraints (
ordinary differential equation
fortran
fortran is one of the oldest programming languages around .
search algorithm
a search algorithm is a set of predetermined rules that control how a search engine works .
time complexity
conditional link
a conditional link is defined as a link where each node is associated with a the link from a source node or to a target node of a conditional link is only .
explanation
an explanation is a justification of the system 's beliefs .
data matrix
data matrix is a high density 2 dimensional matrix style bar code that was first newest version of data matrix is called ecc 200 and is recommended for all .
search algorithm
declarative programming language
pseudo code
pseudo code is programming language neutral and can be ( ) used no matter what programming language is used .
autoepistemic logic
autoepistemic logic is a nonmonotonic logic for modeling the beliefs of an ideally rational the meaning of a formula in autoepistemic logic is context-sensitive .
content-based image retrieval
probability density
in mathematics , probability density is the derivative of the cumulative probability .
neural network link
mereology
mereology is a branch of formal logic that deals with the rules of how however , because mereology is a formal system of logic , in order to .
computational model
boolean logic
a boolean logic is a see boolean algebra . ( ) .
operation
boolean algebra
a boolean algebra is a system of symbolic logic devised by george boole .
confirmation theory
confirmation theory is the study of the logic by which scientific hypotheses may be confirmed or disconfirmed ( ) by evidence .
logical syntax
logical syntax is a universal logic would be the development of ( ) an acceptable system of notation adequate for exhibiting the logically categorical form of all .
engineering
a engineering is a room in which the engine is located .
machine learning research
analysis of gene expression
analysis of gene expression is fundamental to biological research , and detection of differential expression of a gene ( ) between .
cumulative learning
cumulative learning is an area of machine learning research in computer science .
functional programming
functional programming is based on logic and could be a basis for logic on its own .
lookup table
a lookup table is an array that helps to find data very quickly .
iterative deepening search
iterative deepening search is depth-limited search with increasing limit .
active vision
active vision is the control of the optics and the mechanical structure of cameras to simplify the processing for computer vision .
temporal logic
image retrieval
image retrieval is an extension to traditional information retrieval .
percept sequence
sensitivity analysis
sensitivity analysis is a form of quantitative research .
non-monotonic logic
a non-monotonic logic is a formal logic whose consequence relation is not monotonic .
motion
prepositional semantics logic
sequence of token
combinational logic
in digital circuit theory , combinational logic is a type of digital logic which is implemented by boolean circuits , where the output is a pure function of the present input only .
acyclic circuit
an acyclic circuit is called combinational logic .
sensor network
model theory
model theory is a branch of mathematical logic where we study mathematical structures by considering the first-order sentences true in those structures and the .
sequence of word
graph search algorithm
information extraction
information extraction is a type of information retrieval whose goal is to automatically extract structured information from unstructured machine-readable documents , generally human language texts by means of natural language processing .
nonmonotonic logic
nonmonotonic logic is a branch of logic that has been developed to model situations with incomplete information .
prediction sequence
notation logic
dfs
a dfs is a depth first search . .
backward chaining
backward chaining is a system of logic used by artificial intelligence systems .
combinatory logic
combinatory logic is a branch of mathematical logic that analyzes certain processes , such as substitution , which are associated with variables .
decision node
decision node is a control node that accepts tokens on one or two incoming edges and selects the notation for a decision node is a diamond-shaped symbol .
fuzzy logic
basically , fuzzy logic is a precise logic of in this paper , fuzzy logic is viewed in a nonstandard nontraditional view of fuzzy logic is that of precisiation .
source language
in yii , the source language is default to the application source language while the target language is default to the application language .
generalized logic
definition
epistemic logic
higher-order logic
higher-order logic is the logic of quantification over propositional functions , functions whose range consists of propositions .
prepositional logic
prepositional logic is a generalized logic that includes all possible values between 0 and 1 .
propositional logic
propositional logic is the logic of compound statements -- statements that are made propositional logic is one main branch of what is known as symbolic logic .
replanning agent
replanning agent is research with genetic based replanning agent in order to accelerate the optimization speed of path planning technique .
default logic
default logic is a non-monotonic logic proposed by raymond reiter to formalize reasoning with default assumptions .
human decision maker
stochastic game
stochastic game is equivalent to the optimal control of a mdp without future reward discount .
question answering
question answering is a specialised form of information retrieval .
two-valued logic
augmented transition network
object-oriented programming
object-oriented programming is an area of current research .
terminological logic
commonsense rule
longitudinal control
monotonicity of a logic
training sequence
logic of relevance
inductive logic
inductive logic is the logic of science .
artificial intelligence
artificial intelligence is an area of research that goes back to the very beginnings of computer science .
optimal control
prepositional syntax logic
operation
metareasoning
metareasoning is defined as the application of reasoning techniques to the process a primary reason to perform metareasoning is the desire to reflect on the .
probability
web mining
machine translation
machine translation is the application of computers to the translation of texts from one natural language into another .
scoring function
in essence , a scoring function is an equation that relates measurable descriptors of binding to ligand receptor affinity .
heuristic
unit resolution
unit resolution is an application of resolution , where one clause is a unit clause also called boolean constraint propagation .
heuristic
differential equation
a differential equation is a mathematical equation for an unknown function of one or several variables that relates the values of the function itself and its derivatives of various orders .
heuristic
classification problem
classification problem is exactly the posterior probability .
linear equation
a linear equation is an equation with one or more variables but the degree of the highest of the terms of the equation is one .
accurate prediction
asynchronous conversation
an asynchronous conversation is a conversation where the source program has detached itself from the conversation , but data is still being read by the target .
proof tree
real-world application
application of artificial intelligence
matrix
a matrix is a table of data .
decision maker
decision maker is an application for building and evaluating decision analytic models , or `` decision ( ) trees '' .
mathematical model
a mathematical model is an equation or a set of equations in which letter represent a mathematical model is often an idealization of the real world situation if .
reactive planning
reactive planning is increasingly becoming applications because it has all the features of a domain , where reactive planning is necessary : 1 ) the agent ( the .
prior probability
prior probability is posterior probability μ after the update prior probability μ to ... kind of probability density function .
partial regression equation
fuzzy logic
computational biology
computational biology is the application of computational tools ( ) to automatically ex - tract information and\ or patterns directly from .
mainstay
a mainstay is a chief support .
inductive logic
text categorization
text categorization is a conventional classification problem applied to the textual domain .
application of machine learning
ray tracing
ray tracing is an ideal application for parallel processing since there are many pixels , each of whose values is independent and can thus be calculated in .
heuristic
software engineering
a software engineering is the application of a systematic , disciplined , quantifiable approach to the development , operation , and maintenance of software , and the study of these approaches . that is the application of engineering to software .
conditional entropy
conditional entropy is defined as a conditional probability of a class , y , given a value , v , for an attribute ( ) , x. it is defined as .
collaborative filtering
collaborative filtering is a method of making automatic predictions ( ) about the interests of a user by collecting preferences or taste information from many .
application of decision analysis
artificial intelligence application
temporal-difference equation
linear programming
service
bellman equation
text categorization
case-based planning
case-based planning is the application of the cbr methodology to planning , and as such , it is planning as remembering ( ) .
probability
cross-validation
cross-validation is a mainstay for measuring performance and progress in machine learning .
parameterized random variable
priority queue
probability
pathfinder
pathfinder is a re-targetable query compiler that turns xquery expressions into while pathfinder is tightly coupled with monetdb we also provide a sql code .
conjunctive probability
simulated annealing
setting
a setting is the state of the environment in which a situation exists .
natural language
natural language is used to describe probability , it is highly probable that errors will be introduced into the assessment of risk .
multiset variable
a multiset variable is a variable that will be assigned to a multiset of integer values .
derivation
situated agent
a situated agent is basically a software agent that has the sole purpose of performing design actions .
certainty factor
constraint network
a constraint network is a collection of variables , their domains , and zero or a binary constraint network is called arc-consistent if none of the domains of its .
conversational agent
a conversational agent is a software agent .
input
computation
test result
medium
a medium is a state that is intermediate between extremes .
random variable
a random variable is a variable that takes values according to a certain probability more formally , a random variable is a function of the sample space onto r.
latent variable
consequence
a consequence is a phenomenon that follows and is caused by some previous phenomenon .
re-targetable query compiler
query variable
syntactic parser
a syntactic parser is an important module of various kinds of natural language processing systems .
logical variable
a logical variable is an independent variable which can take any value from .
map variable
reduction
a reduction is the act of reducing complexity .
shape
a shape is the state of health
configuration space
in classical mechanics , the configuration space is the space of possible positions that a physical system may attain , possibly subject to external constraints .
density
a density is the probability that an event will occur , as a function of some observed variable .
boolean function
graphical user interface
a gui or graphical user interface is an user interface , that talks to the user using graphics .
randomization
randomization is a multiple instrumental variable in the sense that one randomization deﬁnes the parameter of interest expressed as a function of multiple .
simulated annealing
hidden variable
conditional probability
a conditional probability refers to the probability of observing an event a given that you have observed a separate event b. the computer system refers to the component mapping to identify components that are to be configured to implement the received application instructions .
ai
probability density
hypothesis
a hypothesis is a proposed explanation for a phenomenon .
class variable
pattern matching
compound statement
a compound statement is a sequence of simple statements . .
knowledge representation
clustering result
free variable
multi-agent system
static variable
empirical result
argument
boolean variable
truth maintenance system
thus , a truth maintenance system is able to share partial results across different branches of a search space .
simulation result
natural language interface
a natural language interface is a specially designed graphical user interface for dealing with natural language input and output .
state variable
a state variable is any variable the describes the state or condition of the system at a single point in time and is typically a measure of system structure or function .
simulated annealing
boolean expression
a boolean expression is a logical statement that is either true or false .
gaussian process
a gaussian process is a collection of random variables , any finite number of which have consistent joint gaussian distributions ( ) .
theoretical result
class probability
class probability is closer to the theoretical probability .
simulated annealing
vector of probability
static symbol
partition
a partition is a vertical structure that divides or separates
assignment
an assignment is a mapping ~ of variables to the elements of some feature alge- bra .
probabilistic interpretation
probabilistic interpretation is a probability distribution over worlds .
gaussian process
computer algorithm
complex
a complex is a whole structure made up of interconnected or related structures .
noun phrase
a noun phrase is an uninterrupted string of nomina ( ) .
social network
a social network is a social structure made up of individuals ( ) called `` nodes '' , which are tied ( ) by one or more specific types of .
lexical item
lexical item is a conceptual structure that has been built up and is being built up by its different uses in different situations .
domain theory
domain theory is the study of such structures .
subsumption architecture
until today , subsumption architecture is the basic structure for robots and applied ai , not only in those helpful little creatures whose intelligence is limited to .
conversation
conversation is a complex , highly context-dependent , behavioral phenomenon .
online algorithm
online algorithm is a probability distribution over the deterministic algorithms , so it corresponds to a mixed strategy for the algorithm designer .
tactile sensor
tactile sensor is the sandwiched structure that the cncs were inserted between .
software architecture
dynamic system
dynamic system is the mathematical structure which , after introducing the system the gain of the dynamic system is the integral of the weighting function from .
named entity
a named entity is a piece of text string which refers to an entity .
pagerank
pagerank is a probability distribution used to represent the likelihood that a person randomly clicking on links will arrive at any particular page .
model theory
problem frame
a problem frame is a template that arranges and describes phenomena in the problem space , whereas a pattern maps forces to a solution in .
web mining
canonical distribution
canonical distribution is the maximum entropy distribution for a given expected utility .
optical flow
optical flow is the distribution of apparent velocities of movement of brightness patterns in an yet , when it is rotated , the optical flow is zero at all points in the .
random field
a random field is a generalization of a stochastic process such that the underlying parameter need no longer be a simple real or integer valued time , but can instead be take values which are multidimensional vectors , or points on some manifold .
neural network
parity function
in boolean algebra , a parity function is a boolean function whose value is 1 if the the parity function is notable for its role in theoretical investigation of circuit .
mixture model
a mixture model is a collection of distributions d. in this role , the mixture model is a robust estimator .
gaussian process
generalized phrase structure
distribution of agent
b-tree
a b-tree is an efficient structure for data sorting , storage and retrieval on direct access storage devices such as magnetic disk .
gaussian distribution
a gaussian distribution is a theoretical distribution with finite mean and variance .
neural network
epistemic structure
direct graph
a direct graph is used to describe the node structure in simulation .
g-set
a g-set is a structure , where is a group , such that .
nonterminal symbol
a nonterminal symbol is the structure that the parser recognizes .
interaction graph
equality symbol
regular expression
a regular expression is a special text string for describing a search pattern .
formal language
a formal language is a set of strings , where the string are sequences of symbols selected from a finite alphabet , and the form of a string is described by rules .
qualitative calculus
qualitative calculus is a cognitive structure that develops or evolves in ways a ( ) qualitative calculus is defined by a non-empty finite set of .
uninterrupted string
normal distribution
in probability theory , the normal distribution is a continuous probability distribution that is often used as a first approximation to describe real-valued random variables that tend to cluster around a single mean value .
majority function
majority function is a boolean function , which takes a number n of binary inputs and returns the value which is most common among them .
terminal symbol
a terminal symbol is a character string such as .
joint probability distribution
bar code
a bar code is a printed symbol placed on a package or an item of merchandise , consisting of vertical bars and spaces that represent information about that .
entropy distribution
bucket sort
node structure
syntactic parsing
syntactic parsing is concerned with assigning grammatical structure to sentences by computer .
logical constant
in symbolic logic , a logical constant is a symbol that has the same semantic value in all models .
incomplete information
incomplete information is the decision rule , rather than the actual decision or incomplete information is wilson ( ) .2 wilson 's concept of efficiency is defined .
hierarchical organization
a hierarchical organization is an organizational structure where every entity in the organization , except one , is subordinate to a single other entity .
topological vector space
in mathematics , a topological vector space is one of the basic structures investigated in functional analysis .
priority queue
knowledge map
knowledge map is a structure of concepts with well-defined terms and to which a person believes that the knowledge map is easily understood and consistent .
predicate symbol
predicate symbol is also a function symbol .
constraint logic programming
lexical pattern
generally , a lexical pattern is a sequence of strings .
principal component analysis
principal component analysis is a vector space transform used to reduce multidimensional data sets to lower dimensions , in an attempt to make the analysis of .
cognitive psychology
cognitive psychology is the branch of experimental psychology that deals with mental processes , such as perception , language comprehension , or skilled movement .
module
a module is a generalization of a vector space in abstract algebra .
semantic space
euclidean space
euclidean space is the generalization of 2- and 3-dimensional spaces studied by the greek mathematician euclid , to any finite number of dimensions .
relational database
a relational database is a database whose records are organized into tables that can be processed by either relational algebra or relational calculus . .
language model
object-oriented database
an object-oriented database is a database that subscribes to a model with information represented by objects .
dependency tree
search engine
a search engine is defined as a database of resources extracted from the web through an automated process .
distribution of class
input string
character string
a character string is a string of any ebcdic characters ( ) that are used as a value .
semantic network
vector space
vector space is a topological vector space and thus carries a topological structure which is induced by the semi-norm .
predicate type
a predicate type is an arbitrary boolean function supplied by the flux programmer that is applied to the node 's output .
b-tree
case base
a case base is a structure where the cases are stored .
algorithm template
logic string
dempster-shafer theory
dempster-shafer theory is a generalization of bayesian .
model checking
model checking is based on the structure m = ( ) of a labeled state transition graph where .
representation of knowledge
a popular structural representation of knowledge is hierarchical organization , typically seen in classifications or thesauri , which may be depicted as a graph .
constant symbol
a constant symbol is a o-ary function symbol .
discrimination net
a discrimination net is a tries structure , that is , a tree structure specially conceived for searching patterns , like for example strings -- see the file .
phrase structure
phrase structure is a syntactic structure in which phrases are basic and explicit rather than derived and implicit , as in dependency grammar .
neural network
cryptarithmetic problem
support
a support is a supporting structure that holds up or provides a foundation .
wordnet
wordnet is a lexical database that uses conceptualsemantic and lexical relations in order to group lexical items and link them to other groups ( ) .
longest common substring
gaussian process
structure of discourse
cell decomposition
a cell decomposition is a special kind of partition .
universal quantifier
constraint satisfaction problem
a constraint satisfaction problem is a structure ( ) where .
regular expression
symbolic integration
morphology
morphology is the study of the structure and form of words in language or a language , including inflection , derivation , and the formation of compounds .
logical formula
a logical formula is a structure or a set of structures put together with `` and `` s , `` or `` s , and `` not `` s. .
psychology of computer vision
normal distribution
input generalization
o-ary function symbol
natural language processing
a natural language processing is a field of computer science and linguistics concerned with the interactions between computers and human languages .
decision analyst
decision analyst is a program that structures logical decision-making for policy analysis .
machine learning
data mining algorithm
long-term memory
long-term memory is defined as memory that can last anywhere from a few days to a long-term memory is divided into two separate sections : declarative .
process of identifying
association
associative memory
learning rate
learning rate is one of the parameters which governs how fast a neural network learns and how effective the training is .
search node
audio recorder
audio recorder is a small and easy-to-use program that allows you to record any sound on your computer .
initialization parameter
conditioning cutset
sampling rate
sampling rate is the parameter that determines much of the quality of an audio sample .
procedural attachment
procedural attachment is a method of attaching programs to the data structures , such as slots in a frame ( ) , win79 ) ) .
computer vision
computer vision is the branch of computer science concerned with the analysis of images to extract information about the world .
general problem solver
a general problem solver is a program that can produce solutions to all sorts of different problems about which it has no specific , designed-in .
sat solver
fast sat solver is an program , which solves the boolean satisfiability problem using genetic algorithm ( ) .
cross-correlation
cross-correlation is a mathematical operation that is used to quantify the similarity of two functions for of cross-correlation is very similar to that of convolution .
query answering
query answering is a direct , simple retrieval of data or knowledge from the knowledge - rich database
truth maintenance system
matrix multiplication
matrix multiplication is a very useful operation in mathematics , matrix multiplication is the operation by which one matrix is .
abstract algebra
abstract algebra is the study of operations , their properties , and the structures that support them .
computational learning theory
computational learning theory is an area of theoretical computer science that seeks to design efficient and provably correct algorithms for natural learning tasks .
artificial agent
an artificial agent is a program that acts independently in furtherance of its user 's interests .
decision tree
leak node
a leak node is simply an extra node that is added to the parent set of a noisy-or or a. noisy-and node .
expanded node
an expanded node is a complex node which is encoded by a basic node with two or more branches in conjunction with its first layer of basic nodes .
convolution
convolution is a formal mathematical operation , just as multiplication , convolution is used in the mathematics of many fields , such as probability and statistics .
recursive transition network
a recursive transition network is a set of transition networks in which the arcs of one network may also be labeled with the names of other networks
derivation
execution time
• execution time is program dependent .
artificial intelligence
search engine
decision making
decision making is the primary function of management .
dcg
dcg is a program which generates fortran code for difference approximations from a mathematical specification of a hyperbolic system .
knowledge-based system
a knowledge-based system is a program for querying a knowledge base .
logical implication
logical implication is an operation on two logical values , typically the values of two propositions , that produces a value of false just in case the .
conditioning bounded cutset
primitive operator
acquisition tool
acquisition tool is an editor of sorts that provides a structured .
golog program
systems program
a systems program is a program that controls some aspect of the operation of a computer .
recognition program
constraint network
association
root
a root is the single node of a tree that has no parent .
transition network
a transition network is a set of nodes ( ) and a set of directed arcs between the nodes , labeled with symbols from the language
intelligent agent
a intelligent agent is an autonomous software program that performs a function on its own , such as searching the web for information of interest to a person based on certain criteria . .
isa link
isa link is the a node .
metaphor
a metaphor is a comparison between two things as if they were the same .
basis function
basis function is a gaussian with diagonal covariance .
equivalence class
conventional sign
a conventional sign is a standard sign used on a map to indicate a particular feature .
qbf solver
a qbf solver is a software program to solve the qbf problem .
regularization parameter
a regularization parameter is a parameter used in some non linear iterative methods to suppress undesired solutions , by penalizing those with very high .
leaf node
a leaf node is any node in the treeview s nodes collection that has no child nodes
logical equivalence
logical equivalence refers to nodes that are functionally equivalent , such as all the inputs of a look-up table .
binary relation
automaton program
automated reasoning
automated reasoning is an area of computer science dedicated to understanding different aspects of reasoning in a way that allows the creation of software .
linked list
a linked list is a sequence of nodes .
theory of computing
theory of computing is a field of computer science that uses mathematical techniques to understand the nature of computation and to design and analyze .
context-free grammar
a context-free grammar is a notation for describing languages .
symbolic differentiation
in mathematics , symbolic differentiation is an operation that converts a given arithmetic expression into another arithmetic expression called the derivative .
linear program
a linear program is a program that can be expressed as : maximize ( ) subject to ( ) .
pseudo-code
pseudo-code is notation that looks like a programming language , but that is not executable .
text
text means computing a consistent knowledge base .
conceptual graph
range
generation
terminal node
a terminal node is a node with no edges .
easy-to-use program
knowledge-based program
a knowledge-based program is a program with explicit tests for knowledge .
edge detection
edge detection is one of the fundamental operations in computer vision with numerous .
deterministic node
a deterministic node is a node of a graph g representing a random variable the deterministic node is useful more generally whenever important interactions .
test goal
test goal is a node of the control flow graph at which execu - tion can diverge down a branch that prevents the test goal from being attainable .
association
reading sign
parent node
a parent node is any node in the treeview control 's node collection that has .
analysis of algorithm
analysis of algorithm is a field of computer science that is dedicated to understanding the complexity of algorithms .
machine learning
computational complexity
logical notation
strategy
a strategy is the branch of military science dealing with military command and the planning and conduct of a war .
consistency checker
a consistency checker is a program that is run , usually on startup of the operating system , that scans the logical structure of the disk or storage media and checks to ensure that it is consistent with its specification .
machine learning
advice taker
advice taker is the proposed program for common-sense reasoning .
script
in computer programming , a script is a program or sequence of instructions that is interpreted or carried out by another program rather than by the computer .
web service
a web service is a program that runs over a network and enables computers to exchange information over the internet .
resource
user interface
a user interface is a program that controls a display for the user and that allows the user to interact with the system .
adjoining grammar
adjoining grammar is either a leaf node ( ) or binary branching .
logic sampling
logic sampling is easy to program ( ) and hence it ( ) logic sampling is an anytime algorithm and can always give an .
micro-planner
micro-planner is now a publically accessible systems program in the ai group systems its .
software engineering
optimization
admissible heuristic
admissible heuristic is unable to prune many nodes .
machine learning
cross-validation
environment simulator
an environment simulator is a program that keeps track of the performance measure for each agent .
least mean square
least mean square is sensitive to initialization parameters .
logical positivism
logical positivism is a philosophy of knowledge which is both practical and theoretical .
alpha-beta pruning
machine learning
machine translation
web mining
editor
a editor is a program designed to perform such editorial functions as rearrangement or modification or deletion of data .
derivative
cognitive modelling
cognitive modelling is an area of computer science that deals with simulating human problem solving and mental task processes in a computerized model .
semi-supervised classification
semi-supervised classification is a special form of classification .
online cost
online cost is the iterative cost , which arises from computations involving the modified the online cost is constituted by the parts of eq .
search strategy
probabilistic model
a probabilistic model is any formalism to specify a complex probability distribution .
taxonomy
a taxonomy is a classification of organisms into groups based on similarities of structure or origin etc.
photogrammetry
photogrammetry is a cost efficient surveying method for mapping large areas .
least-constraining-value heuristic
supervised learning
reinforcement learning
uniformly weighted heuristic
sufficient condition
a sufficient condition is a condition that guarantees that a statement is true ( ) .
iterative cost
search cost
a search cost is a cost that is associated with acquiring information about a product .
boyer-moore algorithm
boyer-moore algorithm is superior to knuth-morris-pratt algorithms and brute force algorithms .
data fusion
data fusion is cost effective , as it requires no additional primary research , fits into existing analysis systems , and enhances existing data .
disjunction
termination condition
guarded horn clause
mathematical induction schema
beam search
domination of heuristic
binary tree
measurement
conjunctive query
consequently , a conjunctive query is equivalent to a union of conjunctive queries of a special kind , called terminal conjunctive queries .
binary tree
taxonomic hierarchy
unit preference
unit preference is the heuristic of prioritizing resolutions where one parent is a unit clause .
mental state
a mental state is a mental condition in which the qualities of a state are relatively constant even though the state itself may be dynamic .
approximation
admissible heuristic
monotonicity of a heuristic
rewrite rule
probabilistic model
prioritized sweeping
prioritized sweeping is a heuristic and is essentially an approximate adp algorithm .
greedy heuristic
importance
a importance is the quality of being important and worthy of note .
equivalence class
christofides' heuristic
analog
analog is a free web log analysis software program that runs under windows , mac os , linux , and most unix-like operating systems .
probabilistic model
signal
a signal is a bolt out of the blue
composite heuristic
computational complexity
approximation
inconsistent heuristic
computational cost
extension of description logic
regression
generative model
a generative model is a computational model that assumes that the observed data is sampled from ( ) some distribution .
backed-up value
backed-up value is the desired value of the parent with respect to the children , and the learning mechanism adjusts the weights w so that the evaluation for the .
binary search
a binary search is a very efficient search when you are dealing with a large table .
best-first search
best-first search is a graph search algorithm which starts from a set of initial nodes and searches for a given goal node or one passing a given .
run time
a run time is the time during which a program is executing .
heuristic function
heuristic function is gain ratio .
sequential search
sequential search is the simplest form of search .
optimality search
control
sequential decision problem
hash function
a minimal perfect hash function is a static search set imple - mentation defined by the following two properties : the perfect property : locating a table entry .
cnf decomposition
iterative algorithm
constructive induction
so constructive induction is searching for an adequate representation .
symbolic differentiation
grammar
training instance
a training instance is a record from a data set that is used to construct a model for classification as described herein .
natural deduction
natural deduction is a collection of inference rules .
rate
best-first search
algorithmic complexity
a algorithmic complexity is the size of the smallest program that can produce a particular sequence of numbers .
parallel search
stable extension
model-based recognition
model-based recognition is the search for consistent matches of the model and image features .
constraint satisfaction
constraint satisfaction is the search for a variable assignment that satis es the .
upper bound
general search
general search is the broadest search available .
field value
regression planning
regression planning is a backward state-space search that starts in the goal state and searches a sequence of actions that reach the initial state .
computational linguistics
a computational linguistics is the engineering of systems that process or analyze written or spoken natural language . .
local search
local search is searching for products , services online but using a geographical component to focus the search .
decision network evaluation
current-best-hypothesis search
error
a error is the difference between a measured or calculated value and a true one .
interpretation
a interpretation is an approximation that allows aspects of a mathematical theory to be discussed in ordinary language . .
dependency-directed backtracking
one-shot decision
excitatory synapse
an excitatory synapse is a synapse in which an action potential in a presynaptic neuron increases the probability of an action potential occurring in a postsynaptic cell .
tree decomposition
abstract sensor
an abstract sensor is a set of values that contains the present value of a another advantage provided by the concept of abstract sensor is the capacity of data .
conjunctive query
branch-and-bound search
branch-and-bound search is similar to backtrack search , except that only a subtree of the search tree must necessarily be explored .
computation time
feature selection method
feature selection method is the evaluation of feature subsets .
signal processing
signal processing is a branch of electrical engineering that deals with computers and electronics .
constraint satisfaction search
expected utility
satisfiability problem
in complexity theory , the satisfiability problem is a decision problem , whose instance is a boolean expression written using only and , or , not , variables , and parentheses .
blind search
blind search is the simplest random search in that the sampling generating the new $ boldsymbol -lcb- theta -rcb- $ value does not take account of where the previous .
completeness search
memory
confidence factor
confidence factor is a numerical value between 0 and .
singular value
sensor network
error bound
progression planning
progression planning is a forward state-space search that starts in the initial state and tries to find a sequence of actions that reaches a goal state .
game theory
game theory is the study of decision problems in competitive situations .
full-width search
regression
constraint satisfaction
computational complexity
logical constant
difference
in geometric terms , the difference is a distance .
order of magnitude
an order of magnitude is a range of values between a designated lower value and an upper value ten times as large .
backtracking search
backtracking search is a state-space search .
consistent decomposition
semi-supervised alignment
semi-supervised alignment is based on eigenvalue decomposition .
logic variable
a logic variable is bound to a likely value , but this binding is tentative pending verification of the rest of the rule .
generative model
root
numerical value
minimal determination
real number
in mathematics , a real number is a value that represents a quantity along a continuum , such as -5 ( ) , 4\ 3 ( ) , 8.6 .
matrix factorization
memory
confidence interval
cognitive psychology
sequential decision problem
iterative deepening
backward state-space search
bound search
unit resolution
process of constructing
evaluation function
evaluation function is a heuristic function , and it is where the domain experts ' knowledge resides .
decision analysis
decision analysis is a quantitative evaluation of the outcomes that result from a set of choices in a specific clinical situation .
bayesian network
inhibitory synapse
expectimax value
expectimin value
process of growing graph
search method
markov decision
model checking
process of discovering
metaphysics
conditional entropy
service composition
service composition is a natural extension of web services paradigm .
constraint propagation
constraint propagation is essentially the search for de - terministic information that is implied but not stated explicitly in the input .
temporal relation
a temporal relation is a relation involving time .
acyclic graph
an acyclic graph is a directed graph without cycles .
certainty equivalent
a certainty equivalent is the value of a certain prospect that yields the same utility as the expected utility of an uncertain prospect .5 consider an investor who has .
undecidable problem
an undecidable problem is a decision problem for which it is impossible to construct a single algorithm that always leads to a correct yes-or-no answer .
local search
knuth-morris-pratt algorithm
knuth-morris-pratt algorithm is searching the string looking for a match of the first letter of the pattern .
informed search
an informed search is any search where the domain is known , so the algorithm itself knows the boundaries and relative positions of the items it .
exhaustive decomposition
cognitive science
cognitive science is the study of the human mind and brain , focusing on how the mind represents and manipulates knowledge and how mental representations .
path cost
path cost is a value assigned to each port .
proof
proof is based on theorem 2.2 .
neural network learning
neural network learning is defined as the evaluation function .
knowledge representation
dimensionality reduction
dimensionality reduction is the search for a small set of features to describe a large set of observed dimensions .
broadest search
undirected graph
depth
runtime variable
a runtime variable is a field value that is defined by the user at the time of running the report .
compilation time
iterative improvement search
utility
halting problem
in computability theory , the halting problem is a decision problem which can be stated as follows : given a description of a program , decide whether the program .
expectiminimax
like minimax , expectiminimax is a full-width search up to a particular look-ahead depth .
decision tree
default
a default is a value used when none has been given
computer virus
probability model
undirected graph
data mining
default value
a default value is a value that is auto ¬ matically displayed by the computer .
eigenvalue decomposition
problem solving
problem solving is a systematic search through a range of possible actions in order the topic problem solving is discussed at the following external web sites .
resolution
domain closure effect
ontological engineering
ontological engineering is a branch of knowledge engineering which uses ontology to build ontologies .
analysis of complex scene
comparison
minimax search
a minimax search is always depth first .
human cognition
human cognition is central to clinical decision making .
backward chaining
graphical model
sensor node
sensor node is the service which is used in the form of the wireless networking the sensor node is also referred to as the mote and it is intended to be used in .
search engine
multiplicative utility function
egomotion
egomotion is defined as the motion of the observer relative to his environment and can be described by 6 parameters
basic action theory
construction
morphology
model checking
resolution
construction
knowledge effect
analysis of time
resolution
human-computer interaction
a human-computer interaction is a analysis of the relationship of computers and humans . .
asbestos removal
asbestos removal is a very useful service because it helps to clean your place after it is razed down .
conjunctive query
beam search
axiom
sort
a sort is an algorithm for sorting a list of items into a particular order .
depth-limited search
depth-limited search is a special case of the depth-first search , where only nodes with depth not exceeding some bound are examined .
representation formalism
representation formalism is naturalness of representation .
dcg
process of capturing
disjunctive effect
c configuration space
partitioning
expected case analysis
process of applying
extraction
a extraction is the process of capturing data from several sources , synthesizing them , summarizing them , determining which of them are relevant , and organizing them , resulting in their effective integration . .
mobot
mobot is a very unique service , and there is nothing else out there like mobot .
online dating website
online dating website is a particular and only service which is applicable to meet the curiosity of the online services in this busy schedule of .
non-euclidean geometry
a non-euclidean geometry is the study of shapes and constructions that do not map directly to any n-dimensional euclidean system , characterized by a non-vanishing riemann curvature tensor .
graphical model
kinematics
kinematics is the study of the geometrically possible motion of a body or system of bodies , without consideration of the forces involved .
logistic regression
sort
apparent motion
apparent motion is a perceived motion produced by the presentation of sequential but static images containing no physically continuous motion .
transit motion
depth-limited search
analysis of verb
resolution
conditional effect
a conditional effect is an effect of an action that depends on the value of other features .
transfer motion
logical equivalence
comparison
order
logical query
logical query is defined as a conjunctions of constraints ci on a single feature ql = c1 ∧ · · · ∧ cn .
configuration space obstacle
additive utility function
spectrophotometry
a spectrophotometry is the quantitative analysis of electromagnetic spectra by use of a spectrophotometer
game theory
analysis of information processing system
kernel discriminant analysis
kernel discriminant analysis is based on a conceptual transformation from the input space into a nonlinear high - dimensional feature space .
average case analysis
resolution
feedback loop
a feedback loop is a service when an isp lets you know if someone of its users complains about your email .
knowledge engineering with uncertainty
analysis of document corpus
intelligent room
partial instantiation
partial instantiation is the transformation in which the only part of features from its meta-model ( ) is selected and variant features are derived from .
decision analyst
transformational grammar
transformational grammar is a form of language analysis that establishes a relationship with the different elements in the sentence of a language and makes .
compliant motion
compliant motion is motion which complies with constraints imposed by the geometry of the task .
additivity of utility function
computer vision
depth first search
a depth first search is a depth-first search is best understood with respect to a tree , though it can be applied to graphs in general , provided a starting node is nominated . .
horn sentence
a horn sentence is a conjunction of a set of horn clauses .
rotary motion
rotary motion is a special case of circular motion in which the axis of actually , rotary motion is the sum of the circular motions of all the tiny .
separable utility function
conjunctive normal form
conjunctive normal form is a conjunction of clauses where a clause is a disjunction of literals .
action theory
action theory is an analysis of action starting with the individual actor .
backtracking
backtracking is a modified depth-first search of a tree consisting of all of the possible sequences that can be constructed from the problem set .
natural language processing
search technique
component analysis
alignment method
alignment method is based on similarity measure between the component images .
program synthesis
service composition
blind search
theoretical analysis
skolemization
skolemization is a syntactic transformation routinely used in automatic inference systems in which existential variables are replaced by ` new ' functions - function .
morphology analysis
dimensionality reduction
functional decomposition
functional decomposition is the analysis of the activity of a system as the product of a set of subordinate functions performed by independent subsystems , each .
prediction
reduction
parameter
sketch recognition
sketch recognition is the recognition of a model through the exploration of a number of hand drawn sketches by a computer system .
domain of a random variable
thus domain of a random variable is the sample space of an experiment and co - domain as set of real numbers .
stochastic process
contingency
a contingency is the state of being contingent on something .
blackboard architecture
a blackboard architecture is a shared memory space which enables agents sending and receiving messages to be decoupled from one .
default
detachment
a detachment is the state of being detached or disconnected
process of putting
regression recognition
memory space
discourse intention
a discourse intention is a state of mind that one can describe in terms of domain plans , for .
optical flow
real-world setting
language perception
language perception is identical to the l2 initial state , as predicted by the full .
version space
version space is a space of consistent hypotheses , or models with no error .
process state
line
computational learning theory
ontological commitment
an ontological commitment is an agreement to use a vocabulary and data model in a way that enables information systems to validate and interact with user .
bel belief about state
classifier
analog
diameter of a state space
result
constructive induction
intentional state
an intentional state is a state which has a certain propositional content .
viterbi algorithm
viterbi algorithm is being widely used in many wireless and mobile communication viterbi algorithm is effective in achieving noise tolerance , but the cost is an .
event detection
event detection is the trigger that sets in motion the process of consequence .
automatic pilot
a automatic pilot is a cognitive state in which you act without self-awareness .
initial state
initial state will be the state in which all the variables are unassigned .
human-robot interaction
human-robot interaction is being studied through the creation of ` socially interactive robots .
terminal state
agreement
a agreement is a state whereby several parties share a view or opinion
semi-automatic metric
hypothesis recognition
operationality
operationality is defined as the state of the existing and functional structures and managerial processes that enable the provision of essential health care to the .
stochastic process
expansion of state
understanding system
an understanding system is being built around this model , allowing for unconstrained spoken input in a database retrieval task .
gradient descent
deductive system
estimation algorithm
stochastic process
power
markov chain
intelligent action
intelligent action is the fusion of research and activity .
feature space
in pattern recognition a feature space is an abstract space where each pattern sample is represented as a point in n-dimensional space .
symbolic differentiation
fusion
a fusion is the state of being combined into one body .
abstract noun
an abstract noun is a state , a quality or feeling that can not be perceived by the senses .
temporal logic
input
contour of a state space
functionality
a functionality is the ability to perform a task or function
power
automatic recognition
hidden markov model
parameter
performance measure
goal formulation
goal formulation is based on the current situation amp; the agent 's performance measures .
bolt
a bolt is a mechanism used in firearms .
information retrieval
successor-state axiom
semantic
learning algorithm
causal support
causal support is the analog of a prior probability , summarizing the background knowledge lending support to a belief .
decomposition
connectivity
in mathematics and computer science , connectivity is one of the basic concepts of graph theory .
stochastic simulation
stochastic simulation is a development of geostatistics and estimates the conditional cumulative distribution functions at each location .
connectivity
f free space
gradient descent
kl divergence
kl divergence is a metric that can give you something of a pseudo-distance between one distribution and another assuming they have similar .
information gain
in machine learning , information gain is being used as a reward mechanism for reinforcement learning algorithms .
natural language processing
acoustic signal
chart
scene
proof tree
gradient descent
basic action theory
state space
hypothesis space
in fact , hypothesis space is complete space of finite discrete - valued functions .
language analysis
language analysis is being extended to allow for appropriate disambiguated , bilingual machine translation .
time complexity
process of searching
intractability
a intractability is the state of being intractable
gain ratio
gain ratio is an alternative metric from quinlan 's 1986 .
possibility theory
search space
euclidean space
computational biology
absence
a absence is the state of being absent .
g activation function
utility space
knowledge-based technique
knowledge-based technique is the absence of training .
approximation algorithm
an approximation algorithm is an estimation algorithm that can solve an a typical example for an approximation algorithm is the one for .
polynomial space
connectivity
irrationality
a irrationality is the state of being irrational .
cognitive modelling
brain state
inclusion axiom
maximum entropy
maximum entropy is being widely used as a general and powerful technique for reconstructing positive im - ages from noisy and incomplete data .
operations research
operations research is being defined broadly and includes the use of analytical techniques to achieve better health outcomes , define optimal .
naturalness
a naturalness is the state or quality of being natural .
parsing chart
base case
base case is state of the art mid 2006 .
space complexity
space complexity refers to the space used on a given input .
power
classification accuracy
classification accuracy is widely used as a metric for evaluation of machine learning systems .
transformation
fitness function
kernel function
a kernel function is any function in input space that corresponds to an inner product ( ) in some feature space .
scoring rule
a scoring rule is a reward function for eliciting or evaluating forecasts expressed the logarithmic scoring rule is shown to violate the transitivity property , and .
process of using
search complexity
search complexity is a polynomial function of memory order .
obstacle avoidance
obstacle avoidance is an essential function for any mobile robot .
indexing
a indexing is a system used to assign indexes , such as .
discontinuous function
a discontinuous function is a function whose graph has one or more gaps or breaks .
cardinal direction calculus
process of determining
fuzzy logic
query
in descriptive complexity , a query is a mapping from structures of one signature to structures of another vocabulary .
objective function
a objective function is a function to be maximized or minimized in optimization theory .
knowledge acquisition
knowledge acquisition is a function of different forms , methods and variety of teaching methods ( ) .
primitive function
cost function
neighborhood kernel
neighborhood kernel is the bubble function ( ) ( ) which is non-zero for the neighborhood but zero elsewhere .
sigmoid function
sigmoid function is a global function that divide whole the input space smoothly the temperature of the sigmoid function is 1.0 and the value range is from 0.0 .
sign function
in mathematics , the sign function is an odd mathematical function that extracts the sign of a real number .
similarity measure
a similarity measure is a function that associates a numeric value with sequences , with the idea that a higher value indicates greater similarity .
breadth first search
a breadth first search is a breadth-first search is best understood with respect to a tree , though it can be applied to graphs in general , provided a starting node is nominated . .
architecture
well-formed formula
a well-formed formula is either an atomic formula or one of the following seven forms where # .
index function
acoustic model
an acoustic model is essentially a map of the voice in relation to a series of printed an acoustic model is one of the two main files necessary to run a speech .
loss function
a loss function is a function which expresses numerically the loss produced by a decision or other event .
value function
language model
connection
possibility theory
transition function
in computing , a transition function is the function that defines the state transitions of a turing machine or a finite-state machine .
grid map
a grid map is simply a map that has been divided into marked sections .
product rule
in calculus , the product rule is a formula used to find the derivatives of one special case of the product rule is the constant multiple rule which states : if c is a.
linear transformation
a linear transformation is a map between vector spaces which respects addition and multiplication .
uniform cost search
uniform cost search is similar to breadth-first search but expands the node with lowest path cost , g ( ) .
separable utility function
boolean formula
a boolean formula is a function from some set of boolean variables v = -lcb- v1 , v2 , , vn -rcb- to -lcb- 0,1 -rcb- .
quantificational calculus
production rule
production rule is a logical formula , and the memory test consists of determining (
payoff function
a payoff function is a function .
process of reducing
activation function
in neural networks , an activation function is the function that describes the output behavior of a neuron . most network architectures start by computing the weighted sum of the inputs then the output of the neuron is 0 , otherwise it is 1 . a common squashing function is the logistic function .
reward function
a reward function is a function that assigns a value to each state the agent whereas a reward function is generally static and linked to a specific environment .
commitment protocol
natural language processing
refinement strategy
typically , refinement strategy is a function of both : data quality ( ) and current model quality .
declarative sentence
a declarative sentence is a proposition - that is , something to which a truth value can be assigned .
descriptive representation
transformation
regular expression
bubble function
utility scale
a utility scale is a function u : v → r. the utility scale u is said to fit .
exploration function
conjunction
nondeterministic environment
a nondeterministic environment is a function : t 2b .
normalization
a normalization is an of a function '' is the process of removable singularity removing a discontinuity
scheme
dynamic programming
boolean formula
binary relation
covariance function
dynamic programming
agent function
sparse covariance function
neighborhood kernel
connection
gaussian function
a gaussian function is also a useful lineshape function .
target compilation language
a target compilation language is a class of formulas which is tractable for a set of transformations and queries .
nlp
nlp is based on the proposition that all behavior has a structure and that the structure nlp is , therefore , the study of patterns in behavior and what can be .
sorting algorithm
access function
an access function is a short public function whose job is to return the value of a private member variable .
process of analyzing
sorting algorithm
transfer function
feature extraction
feed-forward neural network
cost
reflectance map
a reflectance map is the transfer function from surface orientation and illumination geometry to the surface normal , and in machine vision it plays a fundamental .
input method
an input method is a set of functions that translates key strokes into character strings in the code set specified by your locale .
classification function
in general , a classification function is a function defined on feature vectors and taking values in a set of class labels .
cross ratio
cross ratio is a rational function with linear numerator and quadratic here the numerator of the cross ratio is a constant and the denominator is quadratic .
units function
scheme
linear classifier
a linear classifier is a linear function of x and y , .
atomic sentence
in logic , an atomic sentence is a type of declarative sentence which is either true or false may also be referred to as a proposition , statement or .
probabilistic transition
a probabilistic transition is defined to be a function t : ω × fω → ( ) such that for each θ ∈ fω , .
measure of uncertainty
a measure of uncertainty is a function of a probability distribution and we know that a joint probability distribution for all possible measurements does not exist
analogical reasoning
analogical reasoning is a function of the associative , analogical reasoning is thus the use of schema analogs , or knowledge from previous .
conjunctive query
qualitative calculus
metric
belief propagation
belief propagation is a message passing protocol that operates on probabilistic graphical models such as bayesian networks and markov ran - dom fields .
regret minimization
in the domain of losses , regret minimization is a function of the following factors : rm .
linear order
linear order is a function of asymmetric c-command relations ( ) .
flow network
a flow network is a real function with the following three properties for all nodes and .
decision rule
in decision theory , a decision rule is a function which maps an observation to an appropriate action .
explicit representation
an explicit representation is a map from a known parameter space for in - stance the unit cube to 3d-space .
input clause
an input clause is a formula of the form .
modification operator
a modification operator is a function m : x → x , where x is the instance space .
lineshape function
trigger
a trigger is a function in event-driven programming .
constraint calculus
existential graph
an existential graph is a map , it is not the `` simplest kind '' of map .
conjunctive normal form
depth-first search
arbitrary first-order sentence
state diagram
a state diagram is a type of diagram used in computer science and related fields to describe the behavior of systems .
first-order logic
ontology
first-order logic
affinity graph
an affinity graph is an undirected weighted graph where each vertex after the instrumented executable finishes , an affinity graph is built and written .
data mining
artificial intelligence
venn diagram
a venn diagram is a graph showing two overlapping circles .
visibility graph
a visibility graph is a graph of intervisible locations .
first-order logic
qualitative spatial reasoning
component graph
best-first search
control
information gain
existential graph
software development
a software development is the translation of a user need or marketing goal into a software product .
difference
array
graph of predicate
first-order logic
minimax search
control
data mining
incompleteness theorem
incompleteness theorem is a theorem of classical mathematics ( )
theorem proving
search graph
fermat's last theorem
knowledge engineering
knowledge engineering is the task of gathering and inputting information for use in knowledge engineering is a labor-intensive multi-step process .
data mining
parallel distributed processing
cook's theorem
ground resolution theorem
reference system
indicator
semantic network
simulation of intelligence
indeterminacy
indeterminacy is the source of the mantra that nonaddi - tive genetic and common environmental variance parameters can not simultaneously be estimated in the .
processor
a processor is the primary chip of the system that oversees all the other components of the system . .
computer virus
ontology
representation theorem
in mathematics , a representation theorem is a theorem that states that every abstract structure with certain properties is isomorphic to a concrete structure .
first-order logic
data mining
expert system
spatial reasoning
spatial reasoning is an intelligence that effortlessly blends , weaves , decorates and measures geometric constructs once students learn the basic connect-the-dots knowledge that governs this system .
decision analysis
regulation
game theory
association graph
an association graph is an abstract graph that is generated from model features in the original image .
qualitative reasoning
qualitative reasoning is an area of artificial intelligence that creates representations for continuous aspects of the world to support reasoning with .
state space
robotics
completeness theorem
probabilistic network
metaphysics
graph coloring
in graph theory , graph coloring is a special case of graph labeling .
error of a hypothesis
requirement
game tree
utility function
influence diagram
chip
chip is a constraint logic programming language developed by m. dincbas in 1985 at ecrc .
breadth-first search
in graph theory , breadth-first search is a graph search algorithm that begins at the root node and explores all the neighboring nodes .
simulation
instance method
process of receiving
data mining
automatic theorem
utility
software technique
depth-first search
polytree
simulation
functioning
a functioning is a process or manner of functioning or operating .
mind
bayesian network
recursive transition network
airflow simulation
constraint graph
simulation
data mining
tree structure
a tree structure refers to a data structure in which a set of elements , here window records , are ordered by some linear order .
profile of dependency graph
curve
natural language processing
mind
phrase
phrase is a potential referring expression .
game theory
recursive algorithm
utility function
boolean expression
computer file
a computer file is a block of arbitrary information , or resource for storing information , which is available to a computer program and is usually based on some kind of durable storage .
difference
metaphysics
mathematical induction
mathematical induction is a method of mathematical proof typically used to establish that a given statement is true of all natural numbers ( ) .
herbrand's theorem
random graph
a random graph is a graph in which properties such as the number of graph vertices , graph edges , and connections between them are determined in some random way .
effect
automated reasoning
learning curve
a learning curve is a graph showing the rate of learning
modeling
a modeling is the construction and use of a computer model of a physical system .
data mining
knowledge engineering
satisfiability checking
satisfiability checking is equivalent to consistency checking ) but uses the same model construction .
data mining
feed-forward network
logicism
logicism is the thesis that mathematics is reducible to logic , or so it is often said .
interval
a interval is the distance between things .
simulation of world
compression
a compression is a data files are often compressed to take up less network bandwidth , memory etc.
expert system
sum of squared difference
dependency graph
simulation
locally finite graph
a locally finite graph is a graph where the degree of each vertex is finite .
data mining
undirected weighted graph
knowledge source
knowledge source is a leading source of healthcare business information and analyses services for executives who seek a competitive edge .
input
automaton
a automaton is a mechanism that can move automatically .
polytree
array
equivalence relation
process of imitating
decision theory
decision theory is the study of principles and algorithms for making correct decisions -- that is , decisions that allow an agent to achieve better .
utility
data file
a data file is a computer file which stores data for use by a computer application or system .
control
refutation graph
a refutation graph is a graph whose nodes are literals ( ) and its edges connect complementary literals .
semantic network
expert system
control
regulation
resolution completeness proof
temporal reasoning
temporal reasoning is a branch of artificial intelligence ( ) and involves the formal represen - tation of time and a computational reasoning system for it .
interpretation
incidence matrix
an incidence matrix is used to describe the graph of a network composed of the panels .
reasoning with uncertainty
reasoning with uncertainty is the branch of artificial intelligence one approach to reasoning with uncertainty is to use higher-order nonmonotonic .
utility
process of converting
computer vision
debugging
debugging is the art of diagnosing errors in programs and determining how to correct them .
data mining
perceptron convergence theorem
flow network
causal diagram
a causal diagram is then a directed graph g that implies the usual markov decomposition for p ( ) and displays additional properties relating p ( ) and do ( ) .
finding
bounded indeterminacy
np-completeness
np-completeness is a statement about coming up with .
lattice theory
lattice theory is the branch of mathematics that deals in precise mathematical language with the relation of different parts of the same whole to each other .
information processing
information processing is the process of receiving information through the senses analyzing and making it meaningfull .
belief network
finite state machine
applied statistic
an applied statistic is the fraction or percentage ... 0 .1 4 0 .1 2 0 .1 0 0 .0 8 expected value = ? = np standard deviation = σ = npq ? .
software agent
situated automaton
mathematically , a situated automaton is a finite state automaton in the form of a mealy machine ( ) a 'd t e track .
information processing
state space
dimensionality reduction
machine-learning approach
cryptography
cryptography is the science of using mathematics to encrypt and decrypt information .
role
deductive approach
deductive approach is based on accepted assumptions from formal decision theory .
connectionism
computational technique
sufficient condition
knowledge representation language
boolean function
logical definition
analog
consistent hypothesis
consistent hypothesis is a map hypothesis (
modal logic
hidden markov model
negative literal
a negative literal is the negation as failure ( ) not a of a given atom a. a clause or rule r is a formula a ← b1 ∧ · · · ∧ bk ∧ not bk +1 ∧ · · · ∧ not bm m ≥ 0 .
representation language
induction hypothesis
decision rule
sensing action
sensing action is the reduction in entropy of the posterior distribution that is induced by the measurement .
logical assertion
a logical assertion is a statement that asserts that a certain premise is true , and is useful for statements in proof .
markov property
markov property is an assumption that allows the system to be analyzed .
parallel corpus
parallel corpus is a very essential resource for developing many machine translation systems , particularly for those that are based on statistical learning algorithms .
collective decision-making
collective decision-making is central to the functioning of a society and supported by a system of rules , procedures , power structures and participants .
axiomatic definition
regular expression
random walk
behavior
platform
a platform can refer to a computer systems operating system , , application or server .
data mining technique
web application
pragmatic interpretation
hidden markov model
incremental learning
problem solving
information retrieval
predicate
information theory
a information theory is a branch of applied mathematics and engineering involving the quantification of information sent over a communication channel , disregarding the meaning of the sent messages , exemplified by the noisy-channel coding theorem .
null hypothesis
a null hypothesis is a statement about a population parameter .
adjective phrase
an adjective phrase is a reduction of an adjective clause .
architecture for speech recognition
acoustic model
parallel text
parallel text is one of the most valuable resources for development of statistical machine translation systems and other nlp applications .
dynamic system
bolt
search approach
deterministic finite automaton
boolean function
number theory
negation
a negation is a negative statement .
evolution
a evolution is the extraction of a root from a quantity .
gaussian process
ai
input resolution
production rule
knowledge-based system
signal
speech act interpretation
unbounded indeterminacy
multiple inheritance
multiple inheritance is the goto of object oriented programming .
corpus
a corpus is a reference system based on an electronic collection of texts composed in a certain language .
transitivity of preference
transitivity of preference is an assumption made in order to convert paired comparison data to rank order data .
context-free grammar
lexical database
a lexical database is a lexical resource which has an associated software environment database which permits access to its contents .
modal logic
encoding
semantic grammar
a semantic grammar is a formal definition of a language that uses concepts from a particular domain of discourse to specify acceptable expressions in that .
rate of convergence
goto
goto is a statement found in many computer programming languages .
room
intelligence method
approximately correct hypothesis
an approximately correct hypothesis is therefore the hypothesis that has the probability of error bounded by a small positive constant ε .
abstract algebra
recursive definition
a recursive definition is a definition of a function from which values of the function can be calculated in a finite number of steps .
computational complexity
finite state automaton
computation model
conditional independence
conditional independence is a useful assumption about a domain that is often natural to assess and can be exploited to give a useful representation .
regret minimization
propositional logic
bilingual dictionary
a bilingual dictionary is a great resource for you to master foreign languages .
exponential increase
probabilistic scheme
probabilistic scheme is a library for implementing prob - ability models in the central concept in probabilistic scheme is that of a probability .
computational complexity theory
computational complexity theory is the study of the minimal resources needed to solve computational problems .
mixture model
boolean logic
information retrieval
interval-valued definition
map hypothesis
context
link
computational resource
biconditional
in logic , a biconditional is a compound statement formed by combining two important ! it looks like this : what does it mean ? first , the biconditional is .
functional dependency
logical implication
two-way radio communication system
formulation
process of becoming
hypothesis space
background assumption
operator reduction
nash equilibrium
nash equilibrium is based on the premises that ( ) each individual acts rationally given her beliefs about the other players ' actions , and that ( ) these beliefs are .
signal
finite state machine
linear programming
compression
concise representation
bilingual parallel corpus
text interpretation
kernel matrix
kernel matrix is the diffusion kernel method , which has time complexity of o ( ) , and the kernel matrix is an n × n positive definite dense matrix , rep - resenting .
software specification
a software specification is a statement of what the software has to do .
world wide web
software agent
semantic web
vehicle
a vehicle is an entity to achieve an end .
chronological backtracking
chronological backtracking is based on the incremental search of a solution .
signal
finite state machine
predicate logic
predicate logic is a formal deduction system whose atomic formulas are propositional functions .
game theory
web of datum
premise
a premise is a statement that is assumed to be true and from which a conclusion can be drawn .
text corpus
text corpus is an important knowledge source of it .
error rate
decision process
bilingual lexicon
bilingual lexicon is a crucial resource for cross-lingual ap - plications of natural language processing ( ) including machine translation ( ) , .
model checking
cognitive psychology
pseudo code
genetic algorithm
a genetic algorithm is a stochastic process with state space the population space el , the m-tuples of elements of e. that is , the points of the set em are called .
computational complexity theory
diffusion kernel method
sweeping statement
state automaton
thesis
a thesis is a statement supported by arguments .
domain theory
human user
human user is one of the most uncertain resources that intelligent methodologies human user is very important for the systems to behave as the user wishes .
fuzzy set theory
fuzzy set theory is a sweeping statement of set theory .
library
in computer science , a library is a collection of resources used to develop software .
possibility theory
deduction system
decision node
script
natural language text
attempt
hierarchical representation
integration
computational learning theory
machine translation
sense disambiguation
the word sense disambiguation is a non trivial task within an information retrieval system .
conditional planning
conditional planning is planning based on unknown information .
psychology
algorithmic representation
source enterprise software development
union
satisfiability checking
increase
a increase is an amount by which a quantity is increased .
gaussian process
classification accuracy
logic programming
logic programming is the study of computer programs that implement logic .
ratio of efficiency
advantageous quality
optical character recognition
optical character recognition is the electronic or mechanical translation of scanned images of text that may be handwritten , typewritten or printed , into machine .
conversational agent
increase
textual entailment
textual entailment is the task of determining , e. text structure is a term that applies to the larger organizing pattern of a complete text , passage .
conceptual graph
breadth-first search
jordan curve theorem
jordan curve theorem is the construction of a path joining two points and missing a curve .
capacity
logical agent
a logical agent is an encapsulation of state and behavior , developed during the system design process , which may not even be independently actualizable .
application domain
compilation complexity
communication channel
a communication channel is a mechanism for communication between a transmitter and a receiver , where the information flow transits the ntcb partition .
case-based reasoning
knowledge representation
scaled orthographic projection
scaled orthographic projection is a first order approximation of the perspective projection .
conceptual clustering
finite automaton
a finite automaton is an algorithm with a finite memory which scans through an input string or text .
spatial network
derivation
speech acts planning
motion planning
simplest method
region
heap
in computer science , a heap is a specialized tree-based data structure that satisfies the heap property : if b is a child node of a , then key ≥ key .
laser range finder
laser range finder is an digital distance measuring device capable of providing accurate distance measure for 2 to 60ft or approximately 0.55 .
mathematical induction
abstraction planning
process of replacing
unsupervised learning
mobile robot
a mobile robot is a type of robot with its own engine or power able to move without constraints on its path . .
decision-theoretic planning
oriented pattern
derivation tree
derivation tree is a mechanism of finding out what labwork has been done on this note : the derivation tree is still a work in progress and therefore diagnostic .
graph mining
background process
satisfiability problem
turing machine
a turing machine is similar to a finite automaton with supply of unlimited memory .
creating
notational system
situation space planning
kernel
a kernel is a scheme-like language .
gain ratio
knowledge engineering
bounded-error planning
automatic programming
encapsulation
a encapsulation is the ability to provide users with a well-defined interface to a set of functions in a way which hides their internal workings .
search tree
polynomial time
information extraction
breadth-first search
graphic representation
similarity
a similarity is the relation of sharing properties .
learning process
spatial relation
spatial relation is defined as the distance of an object located in space in relation to a certain reference object .
uninformed search algorithm
parallel text
decision rule
nlp
intercausal reasoning
intercausal reasoning is a common inference pattern involving probabilistic .
inference pattern
input pattern
text classification
text classification is a very important task in information retrieval and data mining .
hierarchical decomposition
hierarchical decomposition is the underlying principle in understanding complex systems .
hierarchical decomposition planning
protocol
a protocol is a language and a set of rules that allow computers to interact in a well-defined way .
bang-bang control
bang-bang control is a positive ( ) feedback mechanism .
line orthogonality pattern
belief network construction
pragmatic
pragmatic is a global open source enterprise software development , consulting and training company .
web mining
machine learning algorithm
encapsulation
polygon
a polygon is a representation of a targets in computer graphics .
source of knowledge
unsupervised learning
remote agent
a remote agent is a computer program aboard a spacecraft that controls the spacecraft .
belief network inference complexity
compiler
syntax
game robot
weighted heuristics mechanism
derivative
regular expression
robotics
capacity
software engineering
decision tree
composite object
a composite object is an encapsulation of a group of other objects that together provide a commonly useful graphical representation .
search spaces planning
compiler
expository text
expository text is text that is written to communicate information .
incremental search
incremental search is a mechanism in visual studio 2010 by which you can search and focus on the searched keyword without any ui blocking from the user end .
actuator
a actuator is a mechanism that puts something into automatic action .
kernel function
markov decision process
deferred planning
mobot
expression pattern
markov chain
bidirectional search
bidirectional search is a graph search algorithm that finds a shortest path from an initial the idea behind bidirectional search is to simultaneously search both .
two-valued logic
memory limitation
process of enclosing
decision making
beam search
natural language
epistemic logic
orthogonality pattern
constraint logic programming language
similarity network
htn planning
htn planning is similar to classical planning in that each world state is represented by a set of literals and each action corresponds to a state .
question answering
coreference resolution
coreference resolution is the task of grouping all the mentions of entities into equivalence classes so that each class represents a discourse entity .
regression model
ultimately , a regression model is an approximation to a more realistic statistical model and a constant term is the first term in any approximation .
breadth-first search
morphology
hacker
a hacker is a programmer who breaks into computer systems in order to steal or change or destroy information as a form of cyber-terrorism .
compact geometric representation
engineering
reach
a reach is the distance from the center of the robot to the fullest extension of the robotic arm .
training algorithm
robot box
program synthesis
increase
extractive activity
combinatorial auction
a combinatorial auction is a mechanism for simultaneously selling different items by allowing participants to the auction to bid on bundles ( ) of them .
logic theorist
logic theorist is a computer program written in 1955 and 1956 by ( ) , ( ) and ( ) .
backtracking search
shallow parser
a shallow parser is a computer program which can determine the boundaries of phrases in a sentence , but not the complete structure .
computer language
cooperative coevolution
cooperative coevolution is quite an elaborate mechanism .
consistency checking
consistency checking is a mechanism for checking whether rules are .
nondeterminism
a nondeterminism is a computational property that may have more than one result . .
fine-motion planning
utterance
a utterance is the ability to speak .
input
psychology
homeomorphism
a homeomorphism is a similarity in the crystal structure of unrelated compounds .
knowledge engineering
parallel architecture
a parallel architecture is a set of processors arranged into an unoriented graph pattern by communication lines that connect them .
logical interpretation
logical interpretation is a translation from terms that denote signs to terms that denote phonological entities .
feature selection
training pattern
holonomic robot
a holonomic robot is a robot which can rotate at the same place with a turning radius of zero , and a nonholonomic robot is a car-like robot with minimal bound of .
cognitive psychology
indirect speech act
fuzzy logic
process of acquiring
fraction
a fraction is the quotient of two rational numbers .
execution monitoring
execution monitoring is the robot 's process of observing the world for discrepancies between the actual world and its internal representation of it , .
source of datum
computer simulation
joint of a robot
learning scheme
learning scheme is sort of like the dna of programming languages -- you may never use it directly , but you will very likely use descendants of .
prototypical implementation
a prototypical implementation is available including source .
psychology
multi-document summarization
multi-document summarization is the task of generating a short summary of documents retrieved from a search engine in response to a user formulated query .
principle of database system
transition function
derivative
parse tree
a parse tree is a hierarchical representation of .
gain
machine translation
knowledge acquisition
adaptive control theory
execution mechanism
well-established technique
expectiminimax complexity
density
non-metric distance
gene expression pattern
blocks world planning
branching factor
branching factor is just the ratio of how long it takes to search ply n +1 branching factor is used when describing tree structures (
mining
a mining is any extractive activity .
relation-independent pattern
user response
a user response is an instruction you issue to the computer by replying to a question posed by a computer program , such as do you want to save the change you .
indeterminacy
word sense disambiguation
word sense disambiguation is the task of identifying the correct sense for the word in a given context among a finite set of possible senses , and plays an important role in many natural language processing applications such as machine translation , document classification , and information retrieval .
temporal reasoning
pattern mining
pattern mining is the task of finding existing patterns in data .
sample pattern
sparse coding
sparse coding is a statistical generative model where the natural images are linear the original sparse coding is a generative model and ev - ery time the new .
cognitive robotics
cognitive robotics is concerned with enabling robots to perform higher level cog - nitive functions sucha as perception , reasoning and action in complex , .
automaton
scheme-like language
robot motion planning
long-distance dependency
long-distance dependency is one of the major sources of problems in the process of detecting syntacti - cally related associations .
configuration space
nondeterministic algorithm
a nondeterministic algorithm is of complexity .
linear classifier
limitation
a limitation is the quality of being limited or restricted .
logic programming language
a logic programming language is a notational system for writing logical statements together with specified algorithms for implementing inference rules .
functioning
procedural algorithm
computational complexity theory
context-free grammar
genetic algorithm
pattern recognition
transitivity of preference
specialized tree-based data structure
computational property
computational property is actually an emergent property of hundreds of thousands of neurons cooperating to produce the amazing processing .
bar code
grammar attribute
incomplete information
confidence interval
constraint logic programming language
process of transforming
optical flow
anaphora resolution
anaphora resolution is a central task in natural language understanding systems .
protocol
distance function
a distance function is a particular way of calculating distance , such as the euclidean distance between two vectors . .
event detection
nondeterministic planning
nondeterministic planning is similar to decision-theoretic planning in that it considers actions with multiple outcomes , allows plan execution to include .
decision theory
block
a block is the distance from one street to another in a city that is built to a grid pattern .
gain
inheritance with exception
inheritance with exception is a semantic pattern that is very often useful .
with domain
baum-welch algorithm
baum-welch algorithm is likely to reach a local maxi - mum of the posterior , while the other algorithms should tend to average over posterior parameters .
pure inductive inference
scoring rule
case-based planning
decision theory
alpha-beta pruning
computational efficiency
computational efficiency is an important limitation in object tracking algorithms and different efficient techniques , such as the projected-out optimization , have been proposed .
hierarchical planning
hierarchical planning is one of the sources of inflexibility .
decision tree
cryptography
linearization
linearization is the approximation of a nonlinear system as a linear system , based on the assumption that the system is almost linear within a certain range of .
unsupervised manner
text categorization
theorem proving
sign
hierarchical planning
selection process
virtual reality
virtual reality is a computer program that allows you to interact with it and one way to use virtual reality is to create `` virtual objects '' that have properties like .
chess automaton
a chess automaton is a mechanism that purports to play .
similarity
effective branching factor
capacity
conceptual clustering
formalization planning
deterministic finite automaton
decision tree
leak node
trajectory
sequential search
boolean query
a boolean query is a query using one or more of the boolean operators and , or , and not . for example , a search for all species of snakes which live in north america or south america , do not live in africa , and are poisonous . see boolean algebra . .
system gain
appealing technique
classification task
graph mining
problem frame
hierarchical representation
adl formalism planning
finite automaton
relative error
relative error is the ratio of the absolute error of the measurement to the when the accepted or true measurement is known , the relative error is found using .
dcg
knowledge source
variable planning
knowledge representation
source of information
protocol
background knowledge
background knowledge is the experience and knowledge that a student brings to classroom learning .
word sense disambiguation
shape
translation of language
sensor model
situation calculus planning
syntactic pattern
a syntactic pattern is a pattern based on syntax rules .
protocol
edge detection
string matching
string matching is the task of finding occurrences of a given `` pattern '' string within a target `` text '' string inputs : a text string ( ) and a pattern string (
functional description
syntactically , a functional description is a set of attribute and value pairs ( ) ( ) , where a is an attribute ( ) and v is either an atomic value or a nested feature set .
multiple processor
humanoid robot
a humanoid robot is a robot that is based on the general structure of a human , such as a robot that walks on two legs and has an upper torso , or a robot that has .
autonomous robot
an autonomous robot is a robot that can sense the surrounding environment , navigate since the operating environment of the autonomous robot is constantly .
root
feedback mechanism
markov chain
bayesian
knowledge engineering
cleaning robot
commonsense ontology
commonsense ontology is a cultural construction , just as the concepts that articulate scientific theories are cultural constructions : `` theory may be deliberate , .
value-function approximation
posterior probability
ease-based planning
limitation
autoepistemic logic
process of removing
metaphor
process of filtering
topic model
a topic model is a generative model for documents : it specifies a simple probabilistic procedure by which documents can be generated .
dynamic weighting
dynamic weighting is a mechanism to assign importance to a theory .
markov chain
modeling
nonholonomic robot
similarly , a nonholonomic robot is defined as a robot , that has one or more nonholonomic kinematic constraints ( ) .
navigation robot
simplification
protection interval
quotient
a quotient is the ratio of two quantities to be divided .
algorithmic complexity
word segmentation
word segmentation is an important task in natural language processing ( ) for languages without word delimiters ( ) .
categorization task
robot architecture
a robot architecture is a set of guiding principles used to structure a robot 's control system .
formation
a formation is the geological features of the earth .
order approximation
version space
knowledge representation system
motion planning complexity
truth maintenance system
expressive power
expressive power is the motivation for designing new planning languages .
protocol
neural network learning
neural information processing
total order planning
decision making
formal semantics
correlation analysis
decision-theoretic agent
conceptual graph
family of inference relation
bucket sort
dialogue act
cryptography
linear programming
minimax search
planning algorithm
probabilistic reasoning
probabilistic reasoning is concerned with the uncertain reasoning about well defined events or concepts such as symptom-a and illness-x .
influence diagram
backus-naur form
sir , backus-naur form is a meta language used to formally describe the syntax of a language .
growth
a growth is a process of becoming larger or longer or more numerous or more important .
categorial grammar
math
a math is a science dealing with the logic of quantity and shape and arrangement .
case-based reasoning
alpha-beta pruning
flow network
supervised learning
hash function
prim's algorithm
question answering
minimax decision
logic programming
model-based agent
search process
software verification
planning system
base relation
a base relation is a relation corresponding to an entity in the conceptual schema , whose tuples are physically stored in the database .
collaborative filtering
incremental dynamic programming procedure
information property
knowledge acquisition
item of information
inductive inference
inductive inference is reasoning that justifies change from one state of full belief or absolute certainty to another by adding new information to the initial state that .
kruskal's algorithm
domain theory
chronological backtracking
service composition
automatic programming
explanation-based learning
distributed processing
distributed processing is a functionality that exists within the ftk 3 application that allows users to create a distributed processing cluster with .
mathematical relation
transformational grammar
reinforcement learning
asymptotic analysis
execution time
tiling algorithm
completeness of resolution
completeness of resolution is an immediate consequence of this theorem .
nlp
ontological engineering
operator schema
an operator schema is the generalised representation of a state-transition .
adaptive dynamic programming
adaptive dynamic programming is an on-line tuning method .
recursive definition
propagation procedure
information value theory
information value theory is a decision analytic approach to calculating the economic value of new information .
back-propagation
back-propagation is a training algorithm used to make a layered network learn a functional mapping between a set of input patterns and their respective outputs .
adjacency list
an adjacency list is a data structure for representing adjacency relationships in sparse graphs .
hidden markov model
negative feedback
negative feedback is the process of pointing out what someone is doing poorly and telling him how to change it .
cluster assignment matrix
constraint satisfaction
term rewriting
stochastic simulation
description logic
a description logic is a formal language for knowledge represen - .
ordering constraint
ordering constraint is a set of clauses .
model theory
pagerank
knowledge-based approach
complete proof procedure
merge sort
actor model of computation
rule of thumb
point-based algorithm
point-based algorithm is the parallel vector algorithm .
addition of knowledge
partial mapping
temporal relation
sequential voting rule
source domain
information extraction
conditional random field
thesis
telepathic communication
telepathic communication is the universal language among animals .
approximate counting
approximate counting is a probabilistic algorithm proposed by r. morris ( ) that allows an approximate count in the interval 1 to n using only .
hypothetical algorithm
production rule
existential introduction
existential introduction is the opposite rule in which you applied .
propagation algorithm
minimax search
cognitive psychology
locally structured system
random restart
random restart is perhaps the simplest method to use .
psychological model
a psychological model is a theory which explains the phenomena of a condition .
target language
a target language is a computer language into which something written in another computer language is to be translated .
turing machine
semantic network
conflict resolution
first-order language
hybrid approach
regular grammar
a regular grammar is a set of rules such that the regular expressions of the rules recognize pairwise disjoint languages .
artificial intelligence research
artificial intelligence research is typically associated with domains such as speech synthesis and recognition , language translation , image recognition , and .
finite-state automaton
a finite-state automaton is a mathematical abstraction sometimes used to design digital logic or computer programs .
process of measuring
model-based reasoning
unsatisfied clause
agent-based software engineering
face recognition
face recognition is a new feature among digital cameras .
object recognition
chronological backtracking
model-based reasoning
meta-comment
meta-comment is communication about communication , as in .
constructive induction
speech understanding
speech understanding is key to communication .
hierarchical task network
a hierarchical task network is a planning system that uses a hierarchy of primitive and compound tasks to define a planning domain .
approximate counting
euclidean distance
obstacle avoidance
transformational grammar
convex hull
convex hull is a very important data structure of computational geometry design .
optical character recognition
naive method
extraction process
multi-document summarization
probability vector
a probability vector is a matrix of only one row , having nonnega - tive entries , with the what happens if the initial probability vector is different from .
syntactic parsing
reference ontology
a reference ontology is analogous to a scientific theory
ontological commitment
robotics
mathematical theory of computation
truth maintenance
the name truth maintenance is due to the ability of these systems to restore consistency .
discriminant analysis
speech recognition
speech recognition refers to the systems ability to recognise the words spoken not the speaker ) .
incomplete information
regular path query
adjective phrase
random walk
execution time
integer linear programming
differential equation
propositional logic
reactive planning
description logic
merging framework
horn logic
hash table
distance method
parse forest
a parse forest is a concise representation of a number of parse trees for .
feature extraction
disambiguation
disambiguation is the process of retaining relevant translation and removing the disambiguation is performed by selecting the equivalent whose sentence .
binary classification
probabilistic grammar
probabilistic grammar is a data modelling technique playing an increasing in this study , the probabilistic grammar is built on the patterns model extracted by .
optical flow
logical inference
text categorization
graph mining
discourse coherence
discourse coherence is a scalar phenomenon , however .
logical positivism
checkers learning
word segmentation
sensor node platform
randomized algorithm
a randomized algorithm is a deterministic algorithm with the extra ability of making random choices during the computation that are independent of the .
term rewriting
informed search
natural language processing
majority function
polynomial-time algorithm
a polynomial-time algorithm is an algorithm whose execution time is either givenby a polynomial on the size of the input , or can be bounded by such a polynomial .
grammar formalism
intercausal inference
semi-supervised learning
lookup table
dimensionality reduction
cognitive robotics
breadth first search
fuzzy logic
graph representation
model-based reasoning
distributed processing
informed search
random field
temporal logic
patrol algorithm
ontological engineering
priority queue
certainty factor
monte-carlo search
monte-carlo search is search method to use not random player but monte-carlo player in simulation .
artificial agent
heuristic search
a heuristic search is a search technique that applies heuristics to reduce the size of a problem domain . .
b-tree
markov network
rational decision
a rational decision is based on testing and data and an understanding of the mechanics underneath the system you 're working on .
causal link
parallel distributed processing
parallel processing
local consistency
local consistency is often a suitable paradigm for solving constraint satisfaction problems .
q-learning
cognitive architecture
process of dividing
binary search
pattern recognition
cross-correlation
cell decomposition
short-term memory
short-term memory is an expression used by psychologists when they realized this memory type .
heap property
summarizing
summarizing is a process of condensing or expressing in short something you have read , watched or heard .
robot system
hardness
a hardness is the quality of being difficult to do .
question answering
mathematical theory of evidence
discretization
discretization is the process of putting values into buckets so that there are a limited number of possible states .
program synthesis
benchmark
a benchmark is a set of routines or actions used to evaluate computer performance .
bounded optimality
confidence interval
robot motion planning
text categorization
computational learning theory
machine translation
mechanical device
occurrence of event
pattern matching
sequential testing algorithm
nash equilibrium
compliant motion
software architecture
computing system
discrete event
rating matrix
genetic engineering
coherence relation
a coherence relation is a relation among clauses or sentences , such as elaboration , support , cause , or exemplification .
blocks-world learning
robotic device
conditional action
a conditional action is equivalent to a vhdl process or a verilog always process .
information extraction
fuzzy set
complete algorithm
statistical relational learning
tractability of inference
evolutionary programming
algorithm of figure
word segmentation
support
goal-driven approach
psycholinguistic study
temporal logic
two-tailed t-test
a two-tailed t-test is the conservative test traditionally employed when the deviation from the pre-test mean can either increase or decrease in the post-test data .
logic programming
refinement strategy
information gain
use ofsearch technique
rule-based system
a rule-based system is a way of encoding a human expert 's knowledge in a fairly narrow area into an automated system .
principal component analysis
intelligent agent
straightforward implementation
a straightforward implementation is the fdtd approach .
immortal agent
reactive planning
user interface
linear combination
a linear combination is a vector in rn created by adding together scalar multiples of other vectors in .
means-ends analysis
means-ends analysis is a search technique proposed for the .
state variable
nonparametric technique
automated reasoning
constraint propagation
evidential corpus
dewey decimal system
language understanding
formal language
fuzzy set
cross-validation
event detection
automaton pruning
empirical evaluation
empirical evaluation is a necessarytool forobtainingthis knowledge .
atomic concept
an atomic concept is a representation of a concept that is not composed of other simpler concept representations within a particular terminology .
constraint satisfaction
long-distance dependency
limited rational agent
complexity analysis
complexity analysis is one of the most techniques and therefore we consider it to architecture of a modern corporate .
computer vision
decision trees learning
pattern recognition
service composition
programmer
iterative refinement algorithm
forward checking
forward checking is a propagation procedure that guarantees that at each step of the search , all the constraints between already assigned .
script
passive learning
passive learning is the process of acquiring knowledge or skill where the acquisition of the knowledge or skill was not deliberately intended by .
description logic
knowledge-based system
top-down learning
cosine similarity
algorithmic compatibility
algorithmic compatibility is the property of data distributions of matrix a , matrix b , and matrix .
recursive definition
deterministic algorithm
game tree
indexing scheme
epistemic logic
policy iteration
policy iteration is an algorithm for the exact solving of op - timization and game theory problems , formulated as equations on min max affine expressions .
theory resolution
dependency-directed backtracking
case-based reasoning
grammar formalism
process of ensuring
discriminative model
a discriminative model is a probability model in which the most likely values of hidden variables are calculated directly from the observed variable values without using the probability of the observed values .
cognitive science
standard deviation
iterative improvement
similarity measure
syntax
procedural semantics
finally , procedural semantics is a top-down or backward-chaining technique .
target compilation language
situation calculus
situation calculus is a first order language with following key concepts : situation = possible world history , which is a sequence of actions .
component technology
public key encryption
public key encryption is an asymmetric key algorithm .
unsupervised learning
text classification
rsa encryption
feature of a state
nondeterminism
expressive power
acoustic-phonetic rule
knowledge-based learning
viterbi algorithm
memory-based model
low-level process
logical implication
natural deduction
stochastic dominance
stochastic dominance is of practical importance in this context as it guarantees that a policy that optimizes expected seek distance also guarantees optimal seek .
inductive logic
meta language
policy iteration
intelligence test
an intelligence test is a psychological or educational test designed to measure intellectual operations , functions , and general abilities .
process of updating
kinematics
pre-trained classifier
nested monte-carlo search
nested monte-carlo search is an algorithm that uses no domain specific knowledge and which is widely applicable .
interleaving
interleaving is a feature of broadband technology which uses powerful error - correction algorithms to improve broadband speed and stability on long or noisy .
stochastic simulation
process of testing
q-learning
order language
logical consequence
logical consequence is a fundamental concept in logic .
idealized representation
noncomputability
noncomputability is the negative formulation of what turns out to be a basic , and highly significant , feature of biological organisms in their interactions .
belief propagation
forward-backward algorithm
in computer science , the forward-backward algorithm is an algorithm for computing the probability of a particular observation sequence in the context of .
gaussian elimination
in linear algebra , gaussian elimination is an algorithm for solving systems of linear equations , finding the rank of a matrix , and calculating the inverse of an .
data extraction
lattice theory
merge sort
speaker identification
speaker identification is the process of identifying different speakers usually , speaker identification is done by one of the following methods .
transformational grammar
adjacency matrix
an adjacency matrix is a matrix which describes a graph by if $ g $ is a graph of order $ n $ , then its adjacency matrix is an $ n times n $ square .
constructive induction
hierarchical clustering
beam search
automated debugging
graphical property
condition-action rule
a condition-action rule is an expression of form `` if enable s '' or `` if change state to f '' or where .
temporal logic
conversation
brain
gold standard
a gold standard is a test or measure of comparison that is considered ultimate or ideal .
discourse understanding
• discourse understanding is a process of updating a dialogue state by a user utterance .
generalised representation
nearest neighbor
a nearest neighbor is a data mining technique that performs prediction by finding the prediction value of records similar to the record to be predicted . .
probabilistic updating procedure
autonomous agent
an autonomous agent is a computer simulation that is based on concepts from artificial life research .
optimally efficient algorithm
base relation
active agent
case-based reasoning
incremental process
objective function
consistency checking
pattern recognition
well-established method
classification accuracy
mathematical induction
resolve
a resolve is a formal expression by a meeting .
scanner in chart parsing
markov property
compression
combined indexing
linear regression
linear regression is the glm regression algorithm supported by oracle data mining .
weight vector
mathematical model
combinatory logic
temporal logic
qualitative reasoning
telepathic communication
proof graph
user interface
statistical approach
model checking
active learning
active learning is learning by `` doing .
correlation analysis
if-then rule
an if-then rule is an expression of the form .
orthography
machine translation
image reconstruction
data-driven inference
excellence
a excellence is the quality of being excellent
semantic indexing
space complexity
np-completeness
genetic algorithm
field of research
artificial intelligence
kolmogorov complexity
lookup table
syntactic parsing
confirmation theory
visibility graph
selection sorting
selection sorting is an algorithm for sorting lists of data and is specifically an in place comparison sort .
game theory
logical entailment
logical entailment is the relation of truth preservation for all possible truth-value assignments logical entailment is both monotonic and transitive : ~ g a = \ b only .
vector of variable
formal semantics
composite decision process
htn model
symbolic differentiation
boltzmann machine
decision-making agent
ability of agent
natural language
analogical mapping
analogical mapping is a matching process that is sensitive to three main .
information extraction
input vector
a input vector is a vector presented to the network . .
nondeterminism
matching algorithm
macroscopic phenomenon
adaptive control
adaptive control is the control method used by a controller which must adapt to a controlled system with parameters which vary , or are initially uncertain .
reasoning system
a reasoning system is a computing system that can solve a reasoning task ( ) .
constructive induction
communication protocol
a communication protocol is a set of rules that must be adhered to by two or more processes ( ) during their communication .
logical formalism
debugging
cognitive psychology
matching process
clustering
decoding algorithm
interleaving
behavior-based system
adaptive control
inverse resolution
inverse resolution is a complete algorithm for learning first-order theories ( ) .
inference procedure
constraint logic programming
iterative dynamic programming
probabilistic planning
probabilistic planning is based on markov decision processes .
bayesian updating
bayesian updating is a well-established technique .
kinematics
constrained shortest path finding
prioritized sweeping
satellite-based navigation system
data extraction
decision analysis
unsupervised learning
coreference resolution
logical equivalence
dolev-yao model
representation of document
communication channel
fcrfs model
satisfiability checking
knowledge property
relative clause
a relative clause is a kind of subordinate clause which is attached to a head noun a restrictive relative clause is required to identify what is being referred to .
process of retaining
rsa encryption
goal-oriented theory
reductio ad absurdum
complexity analysis
omniscient agent
ray tracing
d-separation
d-separation is a graphical property of bayesian networks and has the following implication : if two sets of nodes x and y are d-separated in .
parsing
merging process
exchange of information
prior knowledge
hybrid model
a hybrid model refers to an expression of a state transition such as the one shown in fig .
learning system
probabilistic algorithm
material handling
material handling is a science of motion , managing and storing of content for the period of transportation .
speech synthesis
prior probability
laser range finder
iterative deepening
conditional event
a conditional event is an event in a reduced sample space .
stopword removal
neural network learning
spectral kernel
graph data structure
greedy agent
finite-state automaton
evolutionary programming
metonymy
metonymy is an intradomain phenomenon .
simplification rule
herbrand base
boolean formula
linear programming
probabilistic network
binary heap
q-learning
information gain
compilation language
decision analysis
abstract argumentation framework
an abstract argumentation framework is based on a monotonic deductive system ( ) , where v is a formal language and r is a set of inference rules .
representation of causality
dealing
model-based reasoning
problem formulation
problem formulation is the process of deciding what actions and states to consider .
linear program
maximum entropy
natural deduction
scalar phenomenon
photogrammetry
public key encryption
model of knowledge
polytree
forward checking
behaviour of agent
non-human entity
process of condensing
explanation-based learning
dotted rule
a dotted rule is a data structure used in top-down parsing to record parital solutions towards discovering a constituent .
functional programming
sensitivity analysis
default rule
the term default rule is used to describe a rule with a query scope of all .
rule-based architecture
two-level morphology
two-level morphology is a system which relates lexical representations of ( ) ( ) two-level morphology is not phonology -- but rather ( ) morphology or ( ) it .
integer factorization
in number theory , integer factorization is the process of breaking down a composite number into smaller non-trivial divisors , which when .
conditional event
discretization
single entity
model-based approach
sequential search
utility theory
theory resolution
bayesian learning
min-conflicts
min-conflicts is an appealing technique described in ( ) .
gaussian elimination
cognitive architecture
environment property
an environment property is a property that is automatically initialized to the value of a system environment variable that has the same name .
logicism
regret minimization
higher-order logic
causal inference
program synthesis
adaptive planning
value iteration
cooperative coevolution
web mining
state variable
software architecture
feature subscription
a feature subscription is a set of features , user - defined precedence constraints , and a set of catalogue precedence constraints defined on the selected features .
prediction-estimation process
contingency planning
context-free grammar
logical consequence
object-oriented programming
matching methodology
matching methodology is a superficial minimum distance method .
conversation
transformational grammar
quantization
obstacle avoidance
machine evolution
graph coloring
process of producing
agent-based software engineering
decision node
bar code
string matching
formal grammar
nlp
regret minimization
mesh generation
mesh generation is the process of dividing the analysis continuum into a number of discrete parts or finite elements .
natural language processing
machine intelligence
machine intelligence is concerned with computational techniques for representing and reasoning about complex objects .
stochastic dominance
computational linguistics
model-based recognition
conditional probability table
conditional probability table is a right stochastic matrix which means that each row consists of non-negative real numbers and is summing to 1 .
autoepistemic logic
edge base
experimental evaluation
head of a clause
q-learning
game theory
ray tracing
prior knowledge
figure of speech
a figure of speech is a language used in a figurative or nonliteral sense .
bit of information
vector quantization
script
exponential growth
a exponential growth is the growth in the value of a quantity , in which the rate of growth is proportional to the instantaneous value of the quantity
description logic
vhdl process
probabilistic network
web mining
processing system
control theory
control theory is the first scientific theory that can handle all these phenomena within a single testable concept of how living systems work .
optimization model
online algorithm
feature selection
dempster-shafer theory
knowledge map
linguistic expression
standard deviation
data fusion
family of programming language
linked list
kernel method
normalization
alpha-beta pruning
fibonacci heap
nested monte-carlo search
vector-space model
vector-space model is a similarly limited abstraction of the graph structure , into a representation on which straightforward classification techniques can be built .
completeness of a search algorithm
diagnostic rule
constraint optimization
loss function
backward chaining
program agent
kernel learning
kernel learning is a paradigm in the eld of machine learning that generalizes the use of inner products to compute similarities between arbitrary .
robotic agent
accurate classifier
tokenization
tokenization is the process of replacing some piece of sensitive data with a value that is not considered sensitive in the context of the environment that consumes the token and the original sensitive data .
string matching
fuzzy logic
discriminant analysis
computational model of discourse
constraint satisfaction
activation function
lexicalized formalism
mereology
symmetric matrix
a symmetric matrix is a square matrix that is its own transpose , and is symmetric about the main diagonal .
empirical study
an empirical study is a report of original research in which an hypothesis is tested
knowledge-based agent
a knowledge-based agent is essentially a model-based agent : knowledge representation .
value iteration
robotic discipline
maximum entropy
cognitive psychology
hash table
irrational behavior
supervised method
domain of discourse
symbolic planning
cryptography
knuth-morris-pratt algorithm
control theory
control system
expectimax
expectimax is a variation of the minimax algorithm that combines the minimization and maximization nodes of minimax search with chance .
tlplan system
non-deterministic domain
truth-functionality
intuitively , truth-functionality is the ability to compute a result from some input data , i. e. to combine information to obtain new information .
inheritance
inheritance is a relation between two classes .
unit resolution
regular expression
polygonal model
incorporation
a incorporation is a learning that is incorporated within yourself .
cryptographic algorithm
software specification
grammar formalism
proving approach
belief propagation
loom
loom or loom is a knowledge representation language developed by researchers in the artificial intelligence research group at the university of southern california 's information sciences institute .
estimation
a estimation is the process of making an estimate .
support vector machine
local consistency algorithm
induction algorithm
an induction algorithm is a learning algorithm used to capture the concept behind the the induction algorithm is a part of the feature search engine itself .
task network
a task network is a graphic representation of the task flow for a project .
graceful degradation
graceful degradation is the process of using scripting and programming to ensure a website can still be viewed on older machines or less sophisticated .
knowledge acquisition
cognitive science
hierarchical clustering
training corpus
feature selection
maximum likelihood
pac learning
control knowledge
control knowledge is the tlplan system by bacchus .
optical flow
q-learning
decision analysis
normative theory
a normative theory is a goal-oriented theory that represents real world situations , not as they are , but as they should be .
greedy algorithm
a greedy algorithm refers to a type of optimization algorithm that seeks to optimize each factor in each step , so that eventually the optimal solution is reached .
background knowledge
well-formed formula
core language engine
the core language engine ( ) ( ) is a domainindependent system developed at sri cambridge , which translates english sentences into formal representations .
similarity metric
optical flow
event calculus
event calculus is a specific formalism for reasoning about events , described here : http : \ \ en.wikipedia.org \ wiki\ event calculus .
genetic algorithm
unsupervised learning
linear equation
diagnostic inference
invariant shape representation
item of knowledge
kernel discriminant analysis
qualitative spatial reasoning
alpha-beta search
alpha-beta search is based on depth-first searching algorithm .
linked list
heuristic search
cross-correlation
logistic regression
wordnet
description logic
synthesis of algorithm
belief function
belief function is bayesian , one reaches the bayesian conclusion that any posterior beliefs can be represented in the form of a probability measure , .
implicit representation
multi-agent platform
routine
random variable
process of deciding
human cognition
autonomous vehicle
an autonomous vehicle is a driverless system which can derive information about the environment from its on-board sensors , make decisions based on the .
syntactic ambiguity
syntactic ambiguity is information property consistent with sentences which may be parsed digital more that one way .
coreference resolution
linear classifier
software specification
script
htn planning
on-line tuning method
natural language processing
content-based image retrieval
inference algorithm
machine translation
experimental vehicle
dijkstra's algorithm
autonomous agent
pattern recognition
matrix factorization
qualitative spatial reasoning
fraction
data matrix
gaussian kernel
a gaussian kernel is a kernel with the shape of a gaussian ( ) curve .
genetic algorithm
intrinsic property
the name intrinsic property is a member-name property .
multi-document summarization
sensory stimulus
goal-based agent
experience
a experience is the knowledge thus gathered .
subsumption architecture
built-in knowledge
collaborative filtering
successor function
in effect , the successor function is a virtual representation of the entire search tree , since it enables any part of the tree to be brought into .
tree search
tree search is one of the central algorithms of any game playing program .
connectionism
dynamic symbol
a dynamic symbol is the defining feature of our current ampang-kl strategy .
consistency algorithm
reflex agent
space complexity
sift feature
domain theory
process monitoring
vacuum agent
logical reasoning
logical reasoning is the process of using a rational , systematic series of steps based on sound mathematical procedures and given statements to arrive at a.
algorithmic complexity
normalization
prepositional phrase
statistical relational learning
active vision
unsupervised learning algorithm
morphology
nonmonotonic logic
process of selecting
pagerank
knowledge-based system
blind search
reduction algorithm
logic programming
first-order language
artificial intelligence
assumption-based system
speech act
a speech act is an utterance that is grammatically similar to a statement but is neither true nor false , though it is perfectly meaningful .
conditional independence
dynamical system
a dynamical system is a concept in mathematics where a fixed rule describes the time dependence of a point in a geometrical space .
gold standard
utility-based agent
causal model
discretization
em algorithm
declarative approach
refinement matrix
compression
conceptual graph
training event
constraint based theory
pattern matching
extrinsic property
an extrinsic property is a property defined solely in terms of functional relations , i.e. it is a property that is described with respect to something .
truth maintenance
euclidean space
tree decomposition
event calculus
fuzzy logic
model theory
linear regression
causation
a causation is the belief that events occur in predictable ways and that one event leads to another . .
chart parser
a chart parser is a variety of parsing algorithm that maintains a table of well-formed substrings found so far in the sentence being parsed .
policy iteration
information theory
pattern matching
iterative deepening search
color
a color is a property of quarks , with three values called red , green , and blue , which they can exchange by passing gluons .
multi-class classifier
decision maker
benchmarking
autonomous robot
local consistency
constraint propagation
inflectional morphology
inflectional morphology is the phenomenon whereby the grammatical properties of a word ( ) are expressed by realizing the word in a particular form .
spelling correction
spelling correction is an important feature in many different types of software applications , such as word processing applications and email applications .
trigger
incorporation
k-dl decision list
cryptography
virtual agent
document corpus
backtracking search
signal processing
mathematical induction
action-utility table
support vector machine
dynamical system
search engine
strong connectivity algorithm
photogrammetry
distance metric learning
distance metric learning is a parametric technique defined under the supervised setting .
hidden markov model
process of selecting feature
image edge
image edge is an important feature of image .
iterative deepening
pruning
resource requirement
label propagation
annealing
pagerank
maximum likelihood
data-directed inference
matrix multiplication
user requirement
software engineering
cognitive modelling
short-term memory
theory resolution
stability of sorting algorithm
graph coloring
speech synthesis
cryptography
logic sampling
training datum
training datum is available to the system , whose the desired output is known .
natural language processing
process of dealing
web service
pattern recognition
sensitivity analysis
goal predicate
first-order probabilistic logic
behavioral theory
game theory
web mining
software verification
cost function
web mining
support vector
a support vector refers to a characteristic vector si on the optimal identification hyperplane .
training sample
a training sample is a pair of a sample input vector and a desired output vector .
convex polygon
a convex polygon is a polygon such that no line containing a side of the polygon contains a point in the interior of the polygon .
parallel processing
agent-oriented system
modell of event
semantic grammar
computational complexity
autonomous vehicle underwater
state diagram
computational complexity theory
intersection
a intersection is a representation of common ground between theories or phenomena .
dependency tree
game-theoretic consideration
prioritized sweeping
iterative deepening
node search
node search is a very useful feature and is function available or has it been deemed not necessary .
rational agent
version-space learning
version-space learning is an incremental process : -- if an instance i is added , the version space is revised so that it consists of all .
advantage
a advantage is the quality of having a superior or more favorable position .
data modelling technique
bayesian updating
adjacency list
matrix multiplication
finite element method
neural network hardware
neural network hardware is usually devices designed to implement neural to present the state of the art in neural network .
domain knowledge
domain knowledge is a formal representation of expert information in a particular field .
feature extraction
active learning
uncertain rule
optical character recognition
multiattribute utility theory
specularly reflected light
specularly reflected light is the same color as the source .
evolutionary programming
relational database
taxonomic information
collaborative filtering
situated planning agent
reactive planner
a reactive planner is a system that builds or changes its .
fault
a fault is the quality of being inadequate or falling short of perfection .
hierarchical decomposition
baseline
computational learning theory
version space
similarity measure
execution monitoring
recommender system
situated language
acquisition of knowledge
acquisition of knowledge is the key feature that distinguishes education ( ) at any level from all other activities .
relation phrase
quantum theory
quantum theory is the language of all particle theories .
decision list
intuitively , a decision list is a useful representation for a boolean function whose a k-decision-list is a decision list in which each term ti consists of at most k.
ground term
a ground term is a variable-free tree structure built by operators from leaves .
recommender system
sentiment lexicon
sentiment lexicon is a common phenomenon when users are getting excited .
discriminative maximum entropy model
goal-directed reasoning
graph mining
vector algorithm
unsupervised learning
semantic interpretation
semantic interpretation is the process of converting the raw text of spoken utterances into a representation of data that is more easily .
vector quantization
binary search
forward chaining
associative memory
associative relation
an associative relation is a relation that is also an associative operation .
multilayer neural network
domain adaptation
domain adaptation is of practical importance in many areas of applied machine learning , ranging from computational biology ( ) to natural language .
fdtd approach
connection method
speech feature
identity relation
in logic , the identity relation is normally defined as the relation that holds only between a thing and itself .
information extraction
summarizing
possibility theory
knowledge engineer
non-euclidean geometry
optimal solution
an optimal solution is an integrated system for detecting attacks on several levels .
block
problem-solving system
data fusion
constraint network
hierarchical abstraction
diagnostic knowledge
with computational technique
event detection
cross-indexing
pattern recognition
maximum entropy
normalization
instructional method
variable-free tree structure
logic programming
noun compound
a noun compound is an expression which is made up of more than one word and which functions in the clause as a noun .
formal grammar
role of domain knowledge
analogical language
analogical language is language , and the use of language , to suggest ideas by comparisons .
planning agent
encryption methodology
marker-passing algorithm
modal operator
conditional probability
role inclusion
similarly , a role inclusion is an expression of the form .
psychological reasoning
semi-supervised learning
kernel function
orthogonal relation
cognitive architecture
belief network inference
descriptive theory
a descriptive theory is a behavioral theory of what people actually do when facing a decision .
forward chaining
dependency analysis
support vector machine
information extraction
convex hull
sensor measurement
artificial agent
output activity
multiagent system
inductive logic programming
np-completeness
inference method
an inference method is just a simple base language method marked with an annotation '' @ inferencemethod '' .
unsupervised learning
kalman filtering
most transparent model
query mining
hash function
causal rule
a causal rule is an expression of the form f ? g , where f and g are propositional formulas .5 these formulas are called the head and the body .
interval algebra
interval algebra is based on thirteen basic relations that can hold between intervals
statistical-relational learning
game theory
interleaving
driverless system
iterative deepening search
monotonic deductive system
discriminant analysis
adjacency list
process of pointing
boolean logic
decision procedure
wacky agent
tree decomposition
member-name property
metropolis algorithm
conditional random field
problem-solving heuristic
parallel processing
control method
integrability
a integrability is the quality of being integrable .
excellence
terminal test
knowledge acquisition
multi-core processor
a multi-core processor is a processing system composed of two or more or more individual processors , called cores , integrated onto a single chip package .
decision analysis
relevance-based learning
linear transformation
operations research
bayesian learning
nondeterministic algorithm
knowledge engineer
object-oriented database
process of forming
dynamical system
silhouette method
silhouette method is a graphical cluster validation technique , which can be used to select the number of clusters .
surface error
speech recognition
anytime algorithm
alpha-beta search
parenthesized expression
schema rule
diagnostic method
semi-supervised feature selection
propositional logic
divide and conquer algorithm
a divide and conquer algorithm is an algorithm that employs an algorithm strategy where a task is divided into smaller subtask of the same .
cognitive skill
cognitive skill is the ability to judge the number , order and identity of individual sounds in the language .
proof sketch
kernel method
core algorithm
operations research
product rule
behavior-based robotics
knowledge compilation
knowledge compilation is the process of transforming a domain theory into a form specialized for the solution of a given problem set .
algebra of feature
speedup learning
systems ability
deterministic finite automaton
question-answering system
pattern matching
combinatory categorial grammar
combinatory categorial grammar is a lexicalized formalism that excels in dealing with long and short-range dependencies .
cross validation
degree of consistency
answer set programming
domain of value
production rule
problem formulation
semi-supervised learning
new predicates learning
contingency
agent design
inductive learning
blind search
telepresence
telepresence is turning video communications into a near in-person experience .
unconditional probability
logic program
a logic program is a set of clauses with the restriction that there is exactly one positive literal in each clause .
memory rule
part-of-speech tagger
a part-of-speech tagger is a system which automat - ically assigns the part .
generalized resolution
generalized resolution is the following rule of inference : a1 amp; a2 amp; ... amp; am = ) b1 v b2 v ... v bk .
structural relationship
turing test
a turing test is a test proposed by alan turing in which a machine would be judged `` intelligent '' if the software could use conversation to fool a human into thinking it was talking with a person instead of a machine . .
production rule
case-based planning
utility function learning
cognitive robotics
process of recognizing
activation level
lookup table
motivation
a motivation is the psychological feature that arouses an organism to action toward a desired goal .
parametric technique
process of decomposing
mesh generation
probabilistic projection
probabilistic projection is a special case of reasoning about continuously changing quantities involving partial orders and other sorts of incomplete information .
computer vision
search engine
backjumping
logistic regression
interleaving
role of heuristic
rule of combination
goal representation
deterministic automaton
deterministic automaton is a concept of automata theory in which the outcome of a transition from one state to another given a certain input can be predicted for .
least commitment
least commitment is a useful concept for analyzing when decisions should be made in any search problem .
completeness of a proof procedure
graphical device
force sensor
a force sensor is a device that is used to measure the vector quantity of force .
dependency grammar
automation of reasoning
inductive learning process
rational action
minimax algorithm
arithmetic operation
an arithmetic operation is dealing with data in a computational manner , adding subtracting , etca logical operation would normally be regarded a a comparison .
depth first search
graceful degradation
report
truth maintenance
sparse coding
blocks world
blocks world is a theory of the first-order predicate calculus with equality .
neural computation
neural computation is a macroscopic phenomenon that results from the interaction between ensembles of interacting neurons .
convolution
probabilistic reasoning
cryptography
process of eliminating
role hierarchy
role hierarchy is the structural representation of roles that reflects the organizational work break down structure .
user preference
user preference is one of the important user requirements .
indefinite domain
knowledge compilation
qualitative reasoning
annealing
active vision
multiagent system
motivation
multi-agent system
multiple inheritance
theorem proving
web mining
decision lists learning
detachment
diagonal matrix
a diagonal matrix is a symmetric matrix with all of its entries equal to zero except may be the ones on the diagonal .
actuator
normalization
knowledge compilation
subsumption architecture
language model
adaptive planning
problem-solving agent
mean square error
inductive logic programming
bounded optimality
interval algebra
backward chaining
belief propagation
analog process
process of heating
theory of information value
probabilistic planning
qbf solver
edge detection
algorithmic complexity
integer factorization
dimensionality reduction
kolmogorov complexity
symbolic approach
symbolic approach is based on dolev-yao model ( ) which relies on a formal model : bitstrings are abstracted by formal expressions , the .
model checking
correlation coefficient
principal component analysis
logic variable
mobile device
support vector machine
language processing
language processing is a memory-based model .
glm regression algorithm
active learning
domain of application
uniform convergence theory
question answering
cluster ensemble
parse tree
happening
a happening is an event that happens .
open class
an open class is a training event scheduled at various locations wherein all crews are welcome to attend .
dimensionality reduction
semantic network
combinatory logic
knowledge acquisition
problem-solving method
cross-entropy based filter technique
data driven technique
posteriori knowledge
c-buridan
c-buridan is an implemented algorithm for plan gen - eration that models noisy sensors and e ectors ac - cording to a standard probabilistic interpretation , but .
data-base query
conversational agent
metonymy
ockham algorithm
interpropositional relation
epistemic logic
electronic circuit
fortran
logistic regression
theory of inheritance
a theory of inheritance is a theory of how characteristics of one generation are derived from earlier generations .
connectionism
data fusion
integer linear programming
unary notation
unary notation is a perfectly fine language you still need a human to decide if a representation is .
program synthesis
passive agent
theorem proving
with relation
measure of uncertainty
kolmogorov complexity
cognitive science
linear regression
anaphora
anaphora is the phenomenon of a linguistic expression which acts as a substitute or reference to some other linguistic form , which generally precedes it .
scoring rule
inheritance
reinforcement learning
passive learning
constraint satisfaction
linear regression
ontology language
an ontology language is an artificial language that expresses knowledge about the structure of human communication and that is suitable to .
process of grasping
speech act
analogical reasoning
tropistic agent
experimental methodology
metalevel reasoning
reinforcement learning
decision-making process
theory of language
cross validation
planning under uncertainty
planning under uncertainty is a critical ability for au - tonomous robots operating in uncontrolled environments , such as homes or offices .
web service
tree-based indexing
beam search
conceptual clustering
subsumption architecture
skolemization
score rule
score rule is a new system in the school .
dependency analysis
graceful degradation
situation-action rule
memory requirement
uncertain reasoning
uncertain reasoning is the main diagnostic method .
means-ends analysis
ontology matching
ontology matching is the process of finding correspondences between .
maximum likelihood
model tree
phenomenology
incorporation
semantic web
logical query
sketch recognition
encoded message model
value iteration
inference of relationship
knowledge-based system
apposition
a apposition is the quality of being side-by-side , apposed instead of being opposed , not being front-to-front but next to each other .
acoustic model
cluster ensemble
local consistency
visual feature
probability vector
ground clause
a ground clause is a clause which does not contain any variables .
skolemization
base language method
computational complexity
data set
fuzzy logic
multiagent reasoning
decision tree learning
decision tree learning is an inductive learning process which is based on example learning , focusing on pushing out rules of decision tree 's representation form .
perspective projection
perspective projection is the theory of how to display and move 2d coordinates in relation to each other to make the illusion of 3d space on a.
face recognition
recommender system
alpha-beta search
abstract noun
intradomain phenomenon
unguided algorithm
logic sampling
boruvka's algorithm
experience
normalization
causal relation
a causal relation is an interpropositional relation in which the situation expressed by some proposition(s ) is communicated as bringing about .
constraint propagation
biometric method
collective decision-making
conversational agent
electronic circuits domain
belief network learning
vector quantization
oft-touted property
event detection
clever indexing
existential elimination
benchmarking
distributed processing
domain knowledge
learning agent
in supervised learning , a learning agent is given mappings of inputs to desired outputs .
logical equivalence
perceptron
minimum description length
tokenization
dependency grammar
naive agent
unit clause
a unit clause is a clause containing only one literal ( ) , while a binary clause con - tains exactly two literals .
testing
a testing is a machine learning algorithms are trained on a collection of instances or patterns . once training is complete , it is usual to test the trained system on a collection of test instances or test patterns which were not used when training the system , in order to find out to what degree the system is able to generalise beyond its training data . .
parallel relation
a parallel relation is a relation between the branches , with each branch receiving the same total potential and their individual branched currents adding together .
dcop algorithm
differential equation
visibility graph
action model
ontological engineering
logical equivalence
feature selection
autonomous land vehicle
bayes' rule
robotics
coalitional game
a coalitional game is system .
time expression
multi-document summarization
cognitive science
foliation
a foliation is the process of forming into a leaf or leaves .
language analysis
atomic event
an atomic event is an assignment of particular values to all the variables -- in other words , a complete specification of the state of the domain .
support
binary classification
figure of speech
computational complexity theory
web mining
image retrieval
distributed processing
target concept
photogrammetry
pseudo code
pronunciation learning
higher-order logic
procedural attachment
prepositional logic agent
linear program
default logic
knowledge level
partial instantiation
algorithm of adaptation
computational efficiency
sequential search
branch-and-bound search
resolution strategy
resolution strategy is a sequential testing algorithm that determines the value of the expression , where each test is a query of the value of one variable .
justification-based system
neighbour classifier
disjoint set
a disjoint set is a data structure that contains non-overlapping elements , with the definition of overlapping being a parameter of the data structure
program synthesis
sample complexity
algorithmic complexity
ordinary differential equation
contingency planning
human-computer dialogue system
reinforcement learning
kalman filtering
domainindependent system
source language
organisation of knowledge
uncertainty model
anaphora resolution
dempster-shafer theory
baseline
computational learning theory
hybrid system
a hybrid system is a dynamic system that exhibits both continuous and discrete dynamic behavior -- a system that can both flow (
possibility theory
tree decomposition
pattern recognition
linear classifier
structured programming construct
cooperative agent
referential transparency
referential transparency is an oft-touted property of ( ) functional languages , which makes it easier to reason about the behavior of .
randomization
linear separability
linear separability is an important concept in neural networks .
language origin
language origin is the theory that explains how human acquired language at the first time .
beam search
stopword removal
markov blanket
markov blanket is a cross-entropy based filter technique capable of identifying both redundant and irrelevant features .
sparse coding
degree of similarity
cost function
linearization
supervised learning
computability
computability is the science of determining what can and can not be computed .
algebraic relation
acquisition of adaptation knowledge
cluster ensemble
model-based reasoning
public-key encryption algorithm
local encoding
stochastic dominance
heuristic search
stochastic dominance
rule-based system
naturalness
decision analysis
feature space
matrix factorization
causal theory
a causal theory is a set of casual rules of the form : φ ⇒ ψ , where φ and ψ are propositional formulas .
asbestos removal
assistive technology
introspection
communicating agent
a communicating agent is a proactive agent that introduces new function - alities of communication .
expected utility
truth-preserving inference
rhetorical relation
term rewriting
pattern matching
incomplete information
model theory
inductive learning
motion parallax
inductive inference
default reasoning
principal component analysis
constraint propagation
consistency checking
density
knowledge-based agent
input method
temporal logic
spatial relationship
a spatial relationship is a vector .
decision tree learning
decision analytic approach
mathematical model
behavioral module
behavioral module is a behavior-based system (
boolean logic
covariance matrix
in probability theory and statistics , a covariance matrix is a matrix whose element in the i , j position is the covariance between the
language understanding
nlp
qualitative reasoning
incremental learning
low-level action
computational biology
formal grammar
goal formulation
incidence list
incidence list is a graph data structure which lists each vertex and its incident edge s http \ \ wwwicsuciedu \ ~ eppstein\ 161\ 960201html # inclist the term is .
cosine similarity
decision tree pruning
mobile sensor
mobile sensor is based on the popular sensor node platform .
logical reasoning
data matrix
induction
clustering
signal processing
dempster's rule
decision rule
backward-chaining technique
dotted rule
hybrid model
semantics of logic program
distributed encoding
knowledge compilation
linear programming
knowledge acquisition
semantic space
operationality