1.0
The Artificial Intelligence Tree Taxonomy created with OntoLearn Reloaded (see http://ontolearn.org)
abstraction
event
act
action
activity
action
activity
knowledge
procedure
process
process
knowledge domain
knowledge base
domain
knowledge base
domain
system
representation
property
quantity
measure
measure
algorithm
methodology
method
method
communication
metric system
si
a si is a complete metric system of units of measurement for scientists .
state
state is si and the previous joint action is ( ) .
model
framework
framework
technique
technology
approach
technology
approach
data
information
information
concept
amount
quality
inference
a inference is a reasoning process by which a new premise is derived from one or more given premises .
reasoning process
theory
data structure
degree
a degree is the amount that an entity possesses a certain property
rule
rule is the degree of consistency for the rule .
phenomenon
expression
instruction
statement
a statement is an instruction in a computer program .
reasoning
a reasoning is the act of using inference to lead to a conclusion based on existing knowledge and\ or data . .
code
feature
a feature is a concept applied to several fields of linguistics , typically involving the assignment of or unary conditions which act as constraints .
graph
in computer science , a graph is an abstract data structure that is meant to implement the graph and hypergraph concepts from mathematics .
structure
function
process of making
agent
agent is using incorrect information about the world .
source code
incorrect information
source
a source is a source code .
mapping
a mapping is the process of making maps .
process of breaking
logic
a logic is a system of reasoning .
mechanism
a mechanism is the philosophical theory that all phenomena can be explained in terms of physical or biological causes .
analysis
a analysis is the process of breaking down a substance into its constituent parts , or the result of this process .
ability
database
program
moving
a moving is the process of leaving one dwelling and settling in another .
translation
in euclidean geometry , a translation is moving every point a constant distance in a specified direction .
search
search in and\ or graphs is able to take care of loops .
care
a care is the state of being cared for by others .
process of leaving
process of formulating
planning
planning is the process of formulating an intended course of action .
vector
sequence
a sequence is a succession of geological events .
correction
string
a string is a database and web resource of known and predicted protein-protein interactions .
succession
equation
a equation is a small correction to observed values to remove the effects of systematic errors in an observation .
relation
discipline
study
field of study
study
field of study
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 .
value
a value is the state of an object .
emergent property
an emergent property is an unexpected collective phenomenon that arises from a system consisting of interacting parts .
language
intelligence
intelligence is an emergent property .
scholarly knowledge
learning
a learning is a profound scholarly knowledge .
sentence
sentence ( ) is an acceptable translation of ( ) , but ( ) does not mean the same thing as ( ) .
operator
an operator is a mapping from one vector space or module to another .
length
in phonetics , length or quantity is a feature of sounds that are distinctively longer than other sounds .
environment
a environment is an affine an equation that can be written in terms of matrix-vector multiplication and vector addition . .
pattern
path
a path is a single sequence of choices that could be made by a nondeterministic machine . .
space
a space is the state of mind one is in when daydreaming .
affine
a affine is an equation that can be written in terms of matrix-vector multiplication and vector addition . .
computer program
a computer program is an algorithm written in a language that a computer can understand , but the same algorithm can be written in several different languages .
node
a node is the representation of a computational device in the unified modeling language .
inference rule
inference rule refers to intelligence that ties concepts together .
robot
a robot is a mechanism that can move automatically .
tree
tree is the length of its longest branch .
network
a network is a type of digraph in graph theory .
probability distribution
a probability distribution is a theoretical concept and many such distributions can be expressed mathematically .
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 .
digraph
a digraph is a directed graph .
heuristic
a heuristic is a rule of thumb , simplification or educated guess that reduces or limits the search for solutions in domains that are difficult and poorly understood .
variable
application
a application is an expression that normally refers to software designed for a specific use such as a word processor . .
task
instrumentality
magnitude
a magnitude is an of a vector , the norm , most commonly , the two-norm .
device
ratio
a ratio is the relative magnitudes of two quantities .
consequence
a consequence is a phenomenon that follows and is caused by some previous phenomenon .
definition
therefore , a definition is a promising source for lr relations between the defined concept and the definition terms .
table
resource
a resource is a source of aid or support that may be drawn upon when needed .
standardized procedure
plan
determination
search algorithm
science
generalization
in mathematical logic , generalization is an inference rule of predicate calculus .
clause
a clause is an expression including a subject and predicate but not constituting a complete sentence .
matrix
a matrix is a table of data .
distance
a distance is a considerable amount of space .
process of constructing
test
a test is any standardized procedure for measuring sensitivity or memory or intelligence or aptitude or personality etc.
motion
formula
a formula is any mathematical rule expressed symbolically .
construction
a construction is the process of constructing .
probability
a probability is an event that is likely to occur .
person
distribution
a distribution is a probability distribution
aggregate
a aggregate is an analysis , a technique used in amortized analysis in computer science , especially in analysis of algorithm .
semantic
a semantic is a string attached to a shader .
assignment
an assignment is a mapping ~ of variables to the elements of some feature alge- bra .
generation
a generation is the aggregate of the functions and phenomena which attend reproduction .
resolution
a resolution is the quality of an x-ray crystallography data set .
optimization algorithm
indexing
a indexing is a system used to assign indexes , such as .
decomposition
a decomposition is the organic phenomenon of rotting .
development
a development is a state in which things are improving .
process of identifying
neural network
a neural network is any network of neurons or nuclei that function together to perform some function in the body .
essence
a essence is a significant feature of something .
notation
principle
a principle is a fundamental essence , particularly one producing a given quality .
result
a result is the final consequence of a sequence of actions or events expressed qualitatively or quantitatively .
assumption
a assumption is a statement that is assumed to be true and from which a conclusion can be drawn .
complexity
parameter
operation
software technique
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 .
justification
a justification is a statement in explanation of some action or belief .
alphanumeric string
computing
computer science
computer science is the study of algorithms , including : ? their formal and mathematical properties ? their hardware realizations ? their linguistic realizations ? their applications computer science is that the computer science people will only concentrate more on the programming side but the it professionals had to concentrate more on the previous things that the particular need for developing the software and how we will communicate to the clients through what media etc. computer science is considered by some to have a much closer relationship with mathematics than many scientific disciplines , with some observers saying that computing is a mathematical science .
constraint
a constraint is a path used to specify that particular function symbols must appear at particular places in a term .
effect
a effect is the state of being binding and enforceable , as in a rule , policy , or law .
evaluation
a evaluation is a determination of the value of a variable or expression .
curve
a curve is a software technique for image manipulation .
hypothesis
a hypothesis is a proposed explanation for a phenomenon .
process of putting
expert system
an expert system is a system the development of expert system is implemented in clips .
text
text means computing a consistent knowledge base .
metric
decision-making method
utility function
a utility function is any instance method that has no dependency on the state of the instance .
computer system
symbol
a symbol is an alphanumeric string headed by .
architecture
architecture is the set of descriptive representations that are required in order to create an object .
sort
a sort is an algorithm for sorting a list of items into a particular order .
interpretation
an interpretation is an assignment of meaning to the symbols of a formal language .
gradient descent
gradient descent is a very simple optimization algorithm and is used in many real life examples of optimization .
descriptive representation
sorting algorithm
a sorting algorithm is a process of putting a group of objects in a certain list or order .
calculus
a calculus is a decision-making method , especially one appropriate for a specialised realm .
paradigm
explanation
an explanation is a justification of the system 's beliefs .
classifier
instance method
computer virus
a computer virus is a program which can covertly transmit itself between computers via networks or removable storage such as cds , usb drives , floppy disks , etc. , often causing damage to systems and data .
computation
a computation is a simulated annealing a partially random method of search and optimization usually used for combinatorial optimization problems .
dynamic programming
so dynamic programming is also gradient descent ? hmm , i do n't think so , though dynamic programming is frequently used for optimization .
power
a power is a mathematical notation indicating the number of times a quantity is multiplied by itself .
graph search algorithm
simulation
a simulation is the process of imitating a real phenomenon with a set of mathematical formulas . .
platform
a platform can refer to a computer systems operating system , , application or server .
context
context are the sentences containing constraints or background information to the question , while answer are that provide solutions .
time
process of using
ontology
a ontology is a logical system involving theory of classes , developed by stanislaw lesniewski .
learning algorithm
place
a place is a space reserved for sitting
depth-first search
depth-first search is a special case of best-first search .
programming language
a programming language is a code of reserved words and symbols used in computer programs , which give instructions to the computer on how to accomplish certain computing tasks .
process of determining
communication system
query
in descriptive complexity , a query is a mapping from structures of one signature to structures of another vocabulary .
process of imitating
link
a link is a two-way radio communication system
compound statement
a compound statement is a sequence of simple statements . .
ai
ai is a computer virus which infects .
phrase
phrase is a potential referring expression .
decision problem
a decision problem is a partitioning of a under some desired properties .
data type
a data type is a definition of the data .
first-order logic
first-order logic is a system of symbolic logic that can be attributed largely to the work of gottlob frege .
two-way radio communication system
requirement
difference
a difference is the quality of being unlike or dissimilar .
approximation
corpus
a corpus is a reference system based on an electronic collection of texts composed in a certain language .
circuit
a circuit is an electrical device that provides a path for electrical current to flow . .
reference system
decision
a decision is a determination of future action . .
being
a being is the state or fact of existing .
utility
a utility is a type of computer program that 's designed to help you manage the computer , or diagnose or fix problems . .
best-first search
best-first search is a search algorithm which optimizes breadth-first search by expanding the most promising node chosen according to some rule .
condition
a condition is a comparative test between user-defined values and the actual values of a session request .
proposition
proposition is equivalent to the formula in question .
process of becoming
service
encoding
extension
extension and reduction are sound inference rules .
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
research
research is the development of anytime csg algorithms .
recognition
a recognition is the state or quality of being recognized or acknowledged .
cost
a cost is a negative consequence or loss that occurs or is required to occur .
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 .
concise representation
size
size is a ratio of two sizes .
partitioning
a partitioning is an analysis into mutually exclusive categories .
map
a map is a continuous function .
attempt
sign
a sign is an event that is experienced as indicating important things to come .
reduction
design
a design is a plan for the structure and functions of an artifact , building or system .
rate
in mathematics , a rate is a ratio between two measurements , often with different units .
attribute
a attribute is a characteristic or quality of a thing .
data mining algorithm
algorithmic representation
binary relation
a binary relation is the sort of relation which can be expressed by a 2-place predicate : for example : x loves y. x is greater than y. (
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 .
vertex
a vertex is a node in a graph .
connectivity
a connectivity is the ability to make a connection between two or more points in a network .
decision tree
a decision tree is an arrangement of tests that provides an appropriate classification at every step in an analysis .
role
computational technique
acquisition
a acquisition is an ability that has been acquired by training .
software development
a software development is the translation of a user need or marketing goal into a software product .
generative model
generative model is a process of growing graphs by adding nodes and other words , a generative model is invariant with respect to time in the sense that .
graphical model
a graphical model is a family of distributions that is restricted to be markov with respect to a certain graph .
situation
a situation is the general state of things .
line
process of capturing
integer
in computer science , the term integer is used to refer to a data type which represents some finite subset of the mathematical integers .
diagram
a diagram is a graph or chart .
computational paradigm
bound
a bound is a value which is known to be greater or smaller than a given set of values .
modeling
a modeling is the construction and use of a computer model of a physical system .
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 . .
knowledge engineering
a knowledge engineering is the acquisition of knowledge from a human expert or similar source and its coding in an expert system . .
connection
a connection is the process of bringing ideas or events together in memory or imagination .
sensor model
a sensor model is an algorithmic representation of a sensor in its state at the time of image collection .
process of enclosing
process of growing graph
search method
indeterminacy
indeterminacy is the source of the mantra that nonaddi - tive genetic and common environmental variance parameters can not simultaneously be estimated in the .
interval
a interval is the distance between things .
processor
a processor is the primary chip of the system that oversees all the other components of the system . .
association
a association is a category of data mining algorithm that establishes relationships about items that occur together in a given record . .
scheme-like language
connected network
relationship
a relationship is a relation between people .
configuration space
configuration space is a complete and compact geometric representation of part motions and part interactions that supports the core mechanism design tasks of .
limitation
a limitation is the quality of being limited or restricted .
process of bringing
logic programming language
a logic programming language is a notational system for writing logical statements together with specified algorithms for implementing inference rules .
strategy
a strategy is the branch of military science dealing with military command and the planning and conduct of a war .
web
a web is the connectivity or resources available to computer users . .
region
vehicle
a vehicle is an entity to achieve an end .
constraint logic programming language
process of finding
formalism
a formalism is one of several alternative computational paradigms for a given theory .
order
order is a frequent inference of wth .
function symbol
control
a control is a regulation or maintenance of a function or action or reflex etc.
input
in disambiguation mode , the input is the text whose sentence boundaries have not been marked up yet and need to be disambiguated .
deductive system
compact geometric representation
state-space search
disjunction
a disjunction is a compound statement formed by combining two statements using the word or .
package
software
software system
software
software system
decision process
notational system
increase
a increase is a process of becoming larger or longer or more numerous or more important .
boolean function
a boolean function is an assignment of 0 or 1 to each of these 2n different n - tuples .
kernel
a kernel is a scheme-like language .
segment
a segment is a straight path between two points that is the shortest distance between them .
evolution
a evolution is the extraction of a root from a quantity .
binary tree
a binary tree is a data structure in which each node has at most two children , each node but the root has one parent , and there are no cycles .
measurement
regulation
a regulation is the ability of an early embryo to continue normal development after its structure has been somehow damaged or altered .
arrangement
a arrangement is an organized structure for arranging or classifying .
search tree
a search tree is representation of all possible computation paths .
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 .
classification
a classification is an association of an input vector with a particular target vector . .
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 .
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 .
machine learning
chip
chip is a constraint logic programming language developed by m. dincbas in 1985 at ecrc .
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 .
process of converting
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 .
importance
a importance is the quality of being important and worthy of note .
directed acyclic graph
a directed acyclic graph is a directed graph with no cycles -- closed paths across the graph that start and end at the same vertex and follow .
encapsulation
a encapsulation is the process of enclosing
predicate
a predicate is a sentence that contains a finite number of variables and becomes a statement when specific values are sub - stituted for the variables .
synapse
a synapse is the connection between processing elements in a neural network . .
formal semantics
bounded indeterminacy
decision-theoretic agent
natural language text
conceptual graph
a conceptual graph is a representation of a part of knowledge under an ontology or a canon (
integration
family of inference relation
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 .
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 .
dialogue act
source enterprise software development
optimality search
linear programming
termination condition
guarded horn clause
guarded horn clause is the union of the guard of the guarded atom and the guard of the original guarded horn clause .
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 .
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
an influence diagram is a graphical device showing the relationships among the decisions , the chance events , and the consequences .
vacuum environment
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 .
unary constraint
a unary constraint is simply a constraint over a single variable
flow network
hash function
a hash function is a cryptographic algorithm that accepts input , .
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 .
question answering
question answering is a key component technology .
prim's algorithm
minimax decision
sensing action
sensing action is the reduction in entropy of the posterior distribution that is induced by the measurement .
diameter of a state space
model-based agent
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 .
tree-adjoining grammar
spatial network
basically , a spatial network is a pattern , a topological arrangement supported by a geographical system .2 it is usually assumed that this arrangement is a formal .
search process
behavior
planning system
incremental dynamic programming procedure
information property
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 .
item of information
kruskal's algorithm
chronological backtracking
chronological backtracking is a very simple algorithm , pro- gressively theorem 1 , we can conclude that chronological backtracking is complete .
acquisition tool
acquisition tool is an editor of sorts that provides a structured .
automatic programming
automatic programming is the use ofsearch techniques to nd programs thatsolve a problem .
high-level ontology
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
application of machine learning
multiple inheritance
multiple inheritance is the goto of object oriented programming .
augmented transition network
an augmented transition network is a recursive transition network with three added features : reg - isters , tests on arcs , and structure building actions that probably .
asymptotic analysis
completeness of resolution
completeness of resolution is an immediate consequence of this theorem .
tiling algorithm
monotonicity of a logic
natural language interface
a natural language interface is a specially designed graphical user interface for dealing with natural language input and output .
belief network construction
pragmatic
pragmatic is a global open source enterprise software development , consulting and training company .
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 .
propagation procedure
information value theory
information value theory is a decision analytic approach to calculating the economic value of new information .
vector of probability
segment of discourse
remote agent
a remote agent is a computer program aboard a spacecraft that controls the spacecraft .
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 .
negative feedback
negative feedback is the process of pointing out what someone is doing poorly and telling him how to change it .
op strips operator
cluster assignment matrix
node structure
information retrieval
information retrieval is a search approach which is based on a direct analysis of the content objects of a digital library .
ordering constraint
ordering constraint is a set of clauses .
composite object
a composite object is an encapsulation of a group of other objects that together provide a commonly useful graphical representation .
existential quantifier
existential quantifier is a logical operator of predicate logic , written thereis , which makes it possible to express that at least one .
analysis of gene expression
analysis of gene expression is fundamental to biological research , and detection of differential expression of a gene ( ) between .
morphology
a morphology is a shape , form , external structure , or arrangement , especially as an object of study or classification .
knowledge-based approach
complete proof procedure
actor model of computation
rule of thumb
searching
a searching is a search
arithmetic notation
arithmetic notation is a programming language
point-based algorithm
point-based algorithm is the parallel vector algorithm .
addition of knowledge
partial mapping
mobot
a mobot is a mobile autonomous robot , especially one used in artificial intelligence research , or as a toy .
representation formalism
representation formalism is naturalness of representation .
temporal relation
a temporal relation is a relation of earlier than or later than to a certain degree .
qualitative probabilistic network
a qualitative probabilistic network is a graphical model of the probabilistic influences among a set of statistical variables , in which each influence is associated .
sequential voting rule
source domain
information extraction
information extraction is an area of natural language processing that is concerned with examining unstructured text in order to extract concepts and relationships between these concepts .
process of analyzing
conditional random field
a conditional random field is a discriminative maximum entropy model that uses features on each line ( ) to determine what label to assign .
thesis
in essence , the thesis describes marker-passing algorithms used to select between possible candidates for disambiguation .
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
phonological context
hopfield network
hopfield network is a dynamic network , which iterates to converge from an the fully connected hopfield network is shown in following figure .
orthogonality pattern
world wide web
existential introduction
existential introduction is the opposite rule in which you applied .
units function
propagation algorithm
minimax search
minimax search is the oldest algorithm in game theory or multi-agent systems : zermelo used it in 1913 to prove that there were optimal .
case base
a case base is a structure where the cases are stored .
knowledge source
knowledge source is a leading source of healthcare business information and analyses services for executives who seek a competitive edge .
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 .
conjunctive query
a conjunctive query is a formula of the form ( ) ( ) , where z1 , , zk are first - order the total size of a conjunctive query is the number of atomic formulas in .
knowledge engineering with uncertainty
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 .
mathematical induction schema
target language
a target language is a computer language into which something written in another computer language is to be translated .
computer language
interaction graph
interaction graph is a tree .
natural language expert system
multiply connected network
hybrid approach
first-order language
utterance
a utterance is the ability to speak .
regular grammar
a regular grammar is a set of rules such that the regular expressions of the rules recognize pairwise disjoint languages .
deliberate ambiguity
deliberate ambiguity is a perfectly valid operator , even simpler than that of qsf .
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 .
probability model
process of measuring
unsatisfied clause
training pattern
finding
decision analyst
decision analyst is a program that structures logical decision-making for policy analysis .
process of acquiring
meta-comment
meta-comment is communication about communication , as in .
complex
a complex is a whole structure made up of interconnected or related structures .
speech understanding
speech understanding is key to communication .
cardinal direction calculus
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 .
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 .
obstacle avoidance
obstacle avoidance is a robotic discipline with the objective of moving vehicles on the basis of the sensorial information .
iterative algorithm
convex hull
convex hull is a very important data structure of computational geometry design .
optical character recognition
real-world setting
naive method
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 .
extraction process
value function
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 (
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 .
temporal-difference equation
syntactic parsing
syntactic parsing is the process of constructing a syntactic parse tree for an input .
reference ontology
a reference ontology is analogous to a scientific theory
kinematics
kinematics is the study of the geometrically possible motion of a body or system of bodies , without consideration of the forces involved .
mathematical theory of computation
minimum proof graph
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.
data mining technique
discriminant analysis
speech recognition
speech recognition refers to the systems ability to recognise the words spoken not the speaker ) .
graphical user interface
a gui or graphical user interface is an user interface , that talks to the user using graphics .
regular path query
random walk
expansion of state
adjective phrase
an adjective phrase is a prepositional or verbal phrase that functions as an adjective .
execution time
execution time is platform dependent -- the same algorithm may require different times for the same input on different machines .
understanding system
an understanding system is being built around this model , allowing for unconstrained spoken input in a database retrieval task .
integer linear programming
association graph
an association graph is an abstract graph that is generated from model features in the original image .
description logic
merging framework
generalized logic
higher-order logic
higher-order logic is the logic of quantification over propositional functions , functions whose range consists of propositions .
multistratal grammar
latent perceptron
horn logic
horn logic is a subset of predicate logic that allows efficient reasoning , orthogonal to description logics
gain
a gain is the advantageous quality of being beneficial .
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 .
line segment
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 .
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 .
text categorization
utility scale
a utility scale is a function u : v → r. the utility scale u is said to fit .
logical inference
brain
a brain is a computer virus .
refinement operator
discourse coherence
discourse coherence is a scalar phenomenon , however .
probabilistic scheme
probabilistic scheme is a library for implementing prob - ability models in the central concept in probabilistic scheme is that of a probability .
exponential increase
logical positivism
boolean algebra
a boolean algebra is a system of symbolic logic devised by george boole .
similarity
a similarity is the quality of being similar .
checkers learning
logical semantic
sensor node platform
stochastic simulation
stochastic simulation is a development of geostatistics and estimates the conditional cumulative distribution functions at each location .
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 .
majority function
a majority function is a system that will assert when there are more 1 's than 0 's on the inputs .
domination of heuristic
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 .
numerical value
intercausal inference
real number
in mathematics , a real number is a value that represents a quantity along a continuum , such as -5 ( ) , 4\ 3 ( ) , 8.6 .
terminal node
a terminal node is a node with no edges .
graph representation
application of decision analysis
easy-to-use program
background assumption
patrol algorithm
certainty factor
monte-carlo search
monte-carlo search is search method to use not random player but monte-carlo player in simulation .
multiple processor
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 .
artificial agent
an artificial agent is a non-human entity that is ( ) autonomous , interacts with its environment , and adapts itself as a function of its .
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 .
text interpretation
computational complexity
computational complexity is the subfield of computer science that rigorously studies the intrinsic difficulty of computational problems .
analysis of verb
process of discovering
markov network
value-function approximation
approximation algorithm
an approximation algorithm is an estimation algorithm that can solve an a typical example for an approximation algorithm is the one for .
rational decision
a rational decision is based on testing and data and an understanding of the mechanics underneath the system you 're working on .
parallel distributed processing
local consistency
local consistency is often a suitable paradigm for solving constraint satisfaction problems .
cognitive architecture
a cognitive architecture is able to take advantage of this structural regularity and retrieve additional information about the constituents from memory .
process of dividing
data file
a data file is a computer file which stores data for use by a computer application or system .
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 .
mathematical theory of evidence
benchmark
a benchmark is a set of routines or actions used to evaluate computer performance .
space complexity
space complexity refers to the space used on a given input .
explicit representation
an explicit representation is a map from a known parameter space for in - stance the unit cube to 3d-space .
robot motion planning
retrieval
a retrieval is the operation of accessing data , either from memory or from a storage device .
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 ( ) .
mechanical device
ontological engineering
ontological engineering is a branch of knowledge engineering which uses ontology to build ontologies .
scoring function
in essence , a scoring function is an equation that relates measurable descriptors of binding to ligand receptor affinity .
occurrence of event
probabilistic interpretation
probabilistic interpretation is a probability distribution over worlds .
heuristic function
heuristic function is gain ratio .
sequential testing algorithm
noun phrase
a noun phrase is an uninterrupted string of nomina ( ) .
computing system
discrete event
admissible heuristic
an admissible heuristic is a heuristic that for every node never overestimates the actual lowest cost from the given node to a goal .
rating matrix
natural deduction
natural deduction is a collection of inference rules .
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 .
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 .
coherence relation
a coherence relation is a relation among clauses or sentences , such as elaboration , support , cause , or exemplification .
blocks-world learning
dynamic environment
robotic device
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 .
stable extension
conditional action
a conditional action is equivalent to a vhdl process or a verilog always process .
sequence of word
fuzzy set
agreement
a agreement is a state whereby several parties share a view or opinion
motion planning
complete algorithm
medical expert system
tractability of inference
compositional semantic
stationary sensor model
algorithm of figure
turing machine
a turing machine is similar to a finite automaton with supply of unlimited memory .
creating
goal-driven approach
psycholinguistic study
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 .
prepositional logic
prepositional logic is a generalized logic that includes all possible values between 0 and 1 .
refinement strategy
transitivity of preference
transitivity of preference is an assumption made in order to convert paired comparison data to rank order data .
action theory
action theory is an analysis of action starting with the individual actor .
use ofsearch technique
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 .
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 .
intelligent agent
immortal agent
straightforward implementation
a straightforward implementation is the fdtd approach .
reactive planning
linear combination
a linear combination is a vector in rn created by adding together scalar multiples of other vectors in .
state variable
a state variable is a precisely measurable physical property which characterizes the state of a system , independently of how the system was brought to that state .
polygon
a polygon is a representation of a targets in computer graphics .
nonparametric technique
joint probability distribution
nondeterministic environment
a nondeterministic environment is a function : t 2b .
evidential corpus
polytree
basically , a polytree is a type of graph in which there is at most one undirected path between any two verti - ces .
weighted heuristics mechanism
least-constraining-value heuristic
dewey decimal system
conventional sign
a conventional sign is a standard sign used on a map to indicate a particular feature .
automaton pruning
surface
a surface is a the locus of an equation in a more-than-two-dimensional space .
atomic concept
an atomic concept is a representation of a concept that is not composed of other simpler concept representations within a particular terminology .
limited rational agent
complexity analysis
complexity analysis is one of the most techniques and therefore we consider it to architecture of a modern corporate .
expository text
expository text is text that is written to communicate information .
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 .
actuator
a actuator is a mechanism that puts something into automatic action .
decision trees learning
matrix factorization
matrix factorization is the decomposition of measurements or observation data into the product of two low-rank matrices , one of which is a lower dimensional .
pattern recognition
pattern recognition refers to the process of recognizing a set of stimuli arranged in a certain pattern that is characteristic of that set of stimuli .
expression pattern
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 .
inhibitory synapse
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 .
dag
dag is a tree , otherwise we may call it dag-like for emphasis .
top-down learning
algorithmic compatibility
algorithmic compatibility is the property of data distributions of matrix a , matrix b , and matrix .
deterministic algorithm
game tree
a game tree is an abstract representation of an actual game .
prediction sequence
philosophy
a philosophy is an inquiry into the nature of things based on logical reasoning rather than empirical methods . ( ) ( ) .
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 .
bayesian network
bayesian network is a graphical model appropriated to represent and to analyze uncertainty , knowledge and beliefs contained implicitly in the data .
indexing scheme
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 .
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 .
absence
a absence is the state of being absent .
theory resolution
proof
proof is based on theorem 2.2 .
step function
a step function is a cost function in which the .
grammar formalism
process of ensuring
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 .
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 .
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 .
decision tree expressiveness
temporal constraint
temporal constraint is a disjunction of basic allen primitives , in the probabilistic disjunctive temporal constraint is given a probability , rather than assigning a.
environment simulator
an environment simulator is a program that keeps track of the performance measure for each agent .
causal link
a causal link is a link from a chance node ( ) or a decision node to a chance node .
least mean square
least mean square is sensitive to initialization parameters .
procedural semantics
finally , procedural semantics is a top-down or backward-chaining technique .
fine-motion planning
first-order probabilistic logic
first-order probabilistic logic is a first-order logic that associates a real-valued parameter to every predicate .
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
parallel architecture
a parallel architecture is a set of processors arranged into an unoriented graph pattern by communication lines that connect them .
quick sort
quick sort is a well-known sorting algorithm developed by c. a. r. hoare that , on average , makes o ( ) ( ) comparisons to sort n items .
psychology of computer vision
text classification
feature of a state
fitness function
acoustic-phonetic rule
knowledge-based learning
viterbi algorithm
viterbi algorithm is an efficient decoding algorithm for decoding convolution codes .
memory-based model
low-level process
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 , .
egomotion
egomotion is defined as the motion of the observer relative to his environment and can be described by 6 parameters
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 .
accurate prediction
knowledge representation language
causal graph
formally , a causal graph is defined as a directed acyclic graph ( ) in which nodes represent variables and each node is conditionally independent ( ) of its .
logical definition
inductive logic
an inductive logic is a system for reasoning that derives conclusions which .
test result
meta language
index function
intelligence test
an intelligence test is a psychological or educational test designed to measure intellectual operations , functions , and general abilities .
process of updating
temporal reasoning
temporal reasoning is an important task in many areas of computer science including planning , scheduling , temporal databases and instruction optimisation for .
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 .
general ontology
general ontology is a high-level ontology which captures general features of basic contextual entities .
process of testing
logical consequence
logical consequence is a fundamental concept in logic .
order language
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 ( ) .
terminal state
noncomputability
noncomputability is the negative formulation of what turns out to be a basic , and highly significant , feature of biological organisms in their interactions .
idealized representation
belief propagation
belief propagation is an iterative algorithm , which tries to .
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
lattice theory is a theory about preorders .
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 .
speaker identification
speaker identification is the process of identifying different speakers usually , speaker identification is done by one of the following methods .
subset
subset are predicates
error
a error is the difference between a measured or calculated value and a true one .
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 .
confidence interval
in statistics , a confidence interval is an interval between two numbers , where there is a certain specified level of confidence that a population parameter lies .
automated debugging
quantificational calculus
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
temporal logic is a system of rules , symbolism , reasoning and propositions pertaining to time .
gold standard
a gold standard is a test or measure of comparison that is considered ultimate or ideal .
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 .
discourse understanding
• discourse understanding is a process of updating a dialogue state by a user utterance .
input resolution
input resolution is simply a definition of space .
nondeterministic planning
nondeterministic planning is similar to decision-theoretic planning in that it considers actions with multiple outcomes , allows plan execution to include .
taxonomic hierarchy
a taxonomic hierarchy is a classification , really a hypothesis , that can be databased , that can be used as the source for a checklist , .
speech act interpretation
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 . .
generalised representation
feature selection method
feature selection method is the evaluation of feature subsets .
probabilistic updating procedure
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 .
autonomous agent
an autonomous agent is a computer simulation that is based on concepts from artificial life research .
search technique
optimally efficient algorithm
theoretical analysis
partitioned semantic network
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 .
base relation
base relation is a data structure which consists of a heading and an unordered set of base relation is a relation that is not a derived relation .
intelligence method
object recognition
object recognition is the brain 's ability to recall an object 's shape and properties .
active agent
automatic theorem
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 .
computation model
bolt
a bolt is a mechanism used in firearms .
bilingual dictionary
a bilingual dictionary is a great resource for you to master foreign languages .
behavior-based robotics
behavior-based robotics is a branch of robotics that bridges arti cial intelligence , en - .
incremental process
objective function
objective function is a mathematical expression describing a relationship of the optimization parameters or the result of an operation ( ) that .
consistency checking
well-established method
classification accuracy
classification accuracy is the ability of a marker or diagnostic test to discriminate between two groups of individuals , cases and controls , and is com- monly summarized by using the receiver operating characteristic curve .
sparse covariance function
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
mathematical induction
mathematical induction is a method of reasoning that enables us to prove that some property is true for every number n. for example , if you have to prove that .
resolve
a resolve is a formal expression by a meeting .
scanner in chart parsing
combined indexing
linear regression
linear regression is the glm regression algorithm supported by oracle data mining .
scene
a scene is a situation treated as an observable object .
protocol
weight vector
mathematical model
mathematical model is an idealized representation expressed in mathematical symbols and expressions .
fastest sorting algorithm
text string
translation of language
expectimin value
telepathic communication
telepathic communication is an ability we are all born with .
object-oriented database
an object-oriented database is a database that subscribes to a model with information represented by objects .
bilingual parallel corpus
metalevel reasoning expert system
user interface
a user interface is the system by which people ( ) interact with a machine .
proof graph
a proof graph is a representation of a proof .
analytic sentence
statistical approach
logical notation
inquiry
a inquiry is a search for truth , information , or knowledge
undirected graph
an undirected graph is a set of nodes ( ) together with a set of each node in an arc of an undirected graph is said to be incident with .
correlation analysis
if-then rule
an if-then rule is an expression of the form .
orthography
quantified sentence
process of removing
automaton
a automaton is a mechanism that can move automatically .
dempster-shafer theory
dempster-shafer theory is a generalization of bayesian .
image reconstruction
error rate
data-driven inference
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 .
excellence
a excellence is the quality of being excellent
dynamic weighting
dynamic weighting is a mechanism to assign importance to a theory .
semantic indexing
navigation robot
field of research
wordnet
wordnet is a lexical database that uses conceptualsemantic and lexical relations in order to group lexical items and link them to other groups ( ) .
artificial intelligence
a artificial intelligence is the essential quality of a machine which thinks in a manner similar to or on the same general level as a human being .
spanning tree
a spanning tree is a tree with v − 1 edges , i.e. a tree that connects all the vertices .
visibility graph
selection sorting
selection sorting is an algorithm for sorting lists of data and is specifically an in place comparison sort .
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 .
parsing chart
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 .
diffusion kernel method
vector of variable
formation
a formation is the geological features of the earth .
composite decision process
composite heuristic
motion planning complexity
htn model
boltzmann machine
eigenvalue decomposition
decision-making agent
decision making
in contrast , decision making is a selection process where one of two or more possible solutions is chosen to reach a desired goal .
ability of agent
arbitrary first-order sentence
an arbitrary first-order sentence is a theorem or not .
analogical mapping
analogical mapping is a matching process that is sensitive to three main .
setting
a setting is the state of the environment in which a situation exists .
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 ? .
sense disambiguation
the word sense disambiguation is a non trivial task within an information retrieval system .
input vector
a input vector is a vector presented to the network . .
nondeterminism
nondeterminism is a algorithm to solve a problem by just defining it .
matching algorithm
boyer-moore algorithm
boyer-moore algorithm is superior to knuth-morris-pratt algorithms and brute force algorithms .
macroscopic phenomenon
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 .
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 ( ) .
machine learning research
qualitative spatial reasoning
connectionism
connectionism is a style of modeling based upon networks of interconnected simple processing devices .
communication protocol
a communication protocol is a set of rules that must be adhered to by two or more processes ( ) during their communication .
debugging
debugging is finding bugs in our software and correcting them as necessary .
logical formalism
information gain
information gain is defined as the difference between the shannon -- wiener information numbers before and after receipt of data .
logical symbol
logical symbol is the operator # .
matching process
knowledge effect
conditioning cutset
graph of predicate
ratio of efficiency
decoding algorithm
interleaving
behavior-based system
inverse resolution
inverse resolution is a complete algorithm for learning first-order theories ( ) .
linking curve
thus , a linking curve is simply a curve that passes through the axes of the manipulator in order .
inference procedure
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 .
process of applying
iterative dynamic programming
probabilistic planning
probabilistic planning is based on markov decision processes .
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 .
constrained shortest path finding
automatic pilot
a automatic pilot is a cognitive state in which you act without self-awareness .
semi-automatic metric
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 .
computational linguistics
a computational linguistics is the engineering of systems that process or analyze written or spoken natural language . .
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 .
combinatory logic
combinatory logic is a branch of mathematical logic that analyzes certain processes , such as substitution , which are associated with variables .
average case analysis
parallel text
parallel text is one of the most valuable resources for development of statistical machine translation systems and other nlp applications .
one-shot decision
background process
satellite-based navigation system
payoff function
a payoff function is a function .
data value
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 .
order of similarity calculation
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 .
dolev-yao model
logical equivalence
logical equivalence is an important concept in set-builder notation : big .
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 .
representation of document
communication channel
spatial relation
spatial relation is defined as the distance of an object located in space in relation to a certain reference object .
learning process
fcrfs model
satisfiability checking
satisfiability checking is a core algorithm in almost all approaches to verification and testing .
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
goto
goto is a statement found in many computer programming languages .
theoretical result
rsa encryption
rsa encryption is a public-key encryption algorithm .
bubble function
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 .
exploration function
goal-oriented theory
terminal symbol
a terminal symbol is a character string such as .
compiler
computational model
omniscient agent
mind
a mind is the ability to focus the thoughts .
backward chaining
backward chaining is a depth-first search : in any knowledge base of realistic size , many search paths will result in failure .
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 .
grammar induction
grammar induction is a subset of inductive logic programming ( ) , and as such , have primarily depended on ilp techniques .
computational resource
f free space
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 .
parsing
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 .
merging process
exchange of information
minimal determination
probabilistic algorithm
learning system
material handling
material handling is a science of motion , managing and storing of content for the period of transportation .
artificial intelligence application
induction
a induction is the generation of an electric current by a varying magnetic field .
expectimax value
stopword removal
spectral kernel
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 . .
signal
a signal is a bolt out of the blue
simulation of world
graph data structure
analysis of algorithm
analysis of algorithm is a field of computer science that is dedicated to understanding the complexity of algorithms .
greedy agent
sum of squared difference
metonymy
metonymy is an intradomain phenomenon .
character string
a character string is a string of any ebcdic characters ( ) that are used as a value .
simplification rule
herbrand base
boolean formula
boolean formula is a parenthesized expression that is formed from boolean vari - boolean formula is in conjunctive normal form ( ) if it is formed as a collec .
uniformly weighted heuristic
logic string
q-learning
q-learning is an incremental dynamic programming procedure that determines the optimal policy in a step-by-step manner .
binary heap
a binary heap is a heap which is maintained as a complete binary tree , meaning all levels are full except possibly the last level , which is filled out from the left .
knowledge-based technique
knowledge-based technique is the absence of training .
compilation language
training algorithm
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 .
phrase structure
phrase structure is a syntactic structure in which phrases are basic and explicit rather than derived and implicit , as in dependency grammar .
representation of causality
static variable
dealing
problem formulation
problem formulation is the process of deciding what actions and states to consider .
compilation time
symbolic integration
linear plan
sweeping statement
photogrammetry
photogrammetry deals with relations that exist between the object and the image spaces .
scalar phenomenon
factorization
a factorization is the resolution of an entity into factors such that when multiplied together they give the original entity .
fuzzy set theory
fuzzy set theory is a sweeping statement of set theory .
public key encryption
public key encryption is the encryption methodology used in pki and was initially proposed by diffie and hellman in 1976 .
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 .
model of knowledge
behaviour of agent
extension of description logic
semantic tree
a semantic tree is an ordered tree with nodes labeled with relation and concept names .
non-human entity
causal semantic
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 .
search complexity
search complexity is a polynomial function of memory order .
process of condensing
dropping condition
dropping condition is an genetic operator for rule learning , to avoid subsumed rules .
explanation-based learning
a explanation-based learning is a machine-learning approach that assumes that there is enough existing theory to rationalize why one instance is or is not a prototypical member of a class . .
source of datum
dotted rule
a dotted rule is a data structure used in top-down parsing to record parital solutions towards discovering a constituent .
computer simulation
machine-learning approach
default rule
the term default rule is used to describe a rule with a query scope of all .
lookup table
a lookup table is an array that helps to find data very quickly .
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 .
domain theory
domain theory is the study of such structures .
self-constructed test tree
integer factorization
in number theory , integer factorization is the process of breaking down a composite number into smaller non-trivial divisors , which when .
tactile sensor
tactile sensor is the sandwiched structure that the cncs were inserted between .
conditional event
a conditional event is an expression of the kind .
single entity
model-based approach
machine translation
machine translation is a computer program which automatically analyzes the meaning of a sentence and attempts to produce a sentence in a different language .
sequential search
sequential search is an algorithm in which a data structure , such as an array or a list , not known to be sorted is searched element by element .
min-conflicts
min-conflicts is an appealing technique described in ( ) .
fitness-based selection
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 .
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 .
causal inference
propositional sentence
web mining
web mining is the process of analyzing an assortment of behavioral , demographic , lifestyle , transactional , internet and geographic information .
breadth first search tree
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
procedural algorithm
pragmatic interpretation
object-oriented programming
a object-oriented programming is a creating a program that can use and support objects .
target ontology
matching methodology
matching methodology is a superficial minimum distance method .
qualitative reasoning
qualitative reasoning is an area of artificial intelligence that creates representations for continuous aspects of the world to support reasoning with .
estimation algorithm
quantization
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 .
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 .
machine evolution
brain computational power
process of producing
agent-based software engineering
inheritance with exception
inheritance with exception is a semantic pattern that is very often useful .
error of a hypothesis
induction of decision tree
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 .
pronoun resolution
training sequence
alignment method
alignment method is based on similarity measure between the component images .
contour of a state space
regret minimization
mesh generation
mesh generation is the process of dividing the analysis continuum into a number of discrete parts or finite elements .
machine intelligence
machine intelligence is concerned with computational techniques for representing and reasoning about complex objects .
sensor network
a sensor network is a collection of small size , low power , low - cost sensor nodes that has limited computational , communication capability and limited storage .
relaxed problem
relaxed problem is an admissible heuristic for the original problem .
unsupervised manner
model-based recognition
model-based recognition is a goal-driven approach that compares a representation of the unknown target to a reference library of unknown targets .
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 .
depth first search tree
edge base
head of a clause
experimental evaluation
multiplicative utility function
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 , .
map hypothesis
hierarchical organization
a hierarchical organization is an organizational structure where every entity in the organization , except one , is subordinate to a single other entity .
dcg
dcg is an international software development consulting firm helping companies frustrated with development costs , hampered by poor quality or struggling to .
sequential decision problem
a sequential decision problem is a sequence of decisions , where for each decision you should consider .
prior knowledge
prior knowledge is the knowledge a student brings with him or her to the this posting discusses why the activation of prior knowledge is so important when .
logic programming constraint
figure of speech
a figure of speech is a language used in a figurative or nonliteral sense .
background knowledge
background knowledge is the experience and knowledge that a student brings to classroom learning .
greedy heuristic
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 .
bit of information
classification function
in general , a classification function is a function defined on feature vectors and taking values in a set of class labels .
script
a script is a particular orthography or writing system .
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
bayesian
vhdl process
commonsense ontology
commonsense ontology is a cultural construction , just as the concepts that articulate scientific theories are cultural constructions : `` theory may be deliberate , .
probabilistic network
a probabilistic network is a concise representation of a joint probability distribution on a set of statistical vari - ables ( ) .
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 .
neural network efficiency
computational biology
computational biology is defined as the development and application of data - analytical and theoretical methods , mathematical modeling , and computational .
optimization model
knuth-morris-pratt algorithm
knuth-morris-pratt algorithm is searching the string looking for a match of the first letter of the pattern .
adjoining grammar
adjoining grammar is either a leaf node ( ) or binary branching .
linguistic expression
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 . .
micro-planner
micro-planner is now a publically accessible systems program in the ai group systems its .
standard deviation
standard deviation is a statistical measurement of how far a variable quantity , such as the price of a stock , moves above or below its average value .
broadest search
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 .
family of programming language
brain state
inclusion axiom
linked list
autonomous driving
autonomous driving is essentially a continuous environment sensing applications producing continuous sensor data that needs to be integrated by .
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.
operations research
operations research is being defined broadly and includes the use of analytical techniques to achieve better health outcomes , define optimal .
iterative improvement search
normalization
slowest search selection
soft global constraint
default
a default is a value used when none has been given
order approximation
logical formula
a logical formula is a structure or a set of structures put together with `` and `` s , `` or `` s , and `` not `` s. .
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 .
optimal control
library
in computer science , a library is a collection of resources used to develop software .
cross-validation
cross-validation is a mainstay for measuring performance and progress in machine learning .
neural information processing
neural network learning
neural network learning is a major task within an ann that ensures it continues to be able to process data correctly and therefore perform its function properly .
completeness of a search algorithm
digital circuit
a digital circuit is a circuit that functions on a number of different logic gates .
conjunctive normal form
conjunctive normal form is a boolean expression if it is expressed as the product ( ) of sums ( ) .
partition
a partition is a vertical structure that divides or separates
diagnostic rule
constraint optimization
state diagram
a state diagram is a type of diagram used in computer science and related fields to describe the behavior of systems .
discontinuous function
a discontinuous function is a function whose graph has one or more gaps or breaks .
predicate logic sentence
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 .
venn diagram
a venn diagram is a graph showing two overlapping circles .
union
a union is a data structure that can store any of various items , but only one at a time .
loss function
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 .
program agent
robotic 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 .
human-computer interaction
a human-computer interaction is a analysis of the relationship of computers and humans . .
discourse intention
a discourse intention is a state of mind that one can describe in terms of domain plans , for .
accurate classifier
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 .
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 .
fuzzy logic
computational model of discourse
abstract algebra
abstract algebra is the study of operations , their properties , and the structures that support them .
anaphor predicate
lexicalized formalism
activation function
a generalized neuronal activation function is defined as the output activity , i.e. the firing rate of action potentials , as a function of an input and .
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 .
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 .
symmetric matrix
a symmetric matrix is a square matrix that is its own transpose , and is symmetric about the main diagonal .
upper bound
convolution
convolution is a formal mathematical operation , just as multiplication , convolution is used in the mathematics of many fields , such as probability and statistics .
uniform cost search
uniform cost search is similar to breadth-first search but expands the node with lowest path cost , g ( ) .
empirical study
an empirical study is a report of original research in which an hypothesis is tested
hidden markov model
a hidden markov model is a double embedded stochastic process with two hierarchy levels .
robotic discipline
search engine
a search engine is a program that finds and lists web sites or pages that match some user-selected criteria . .
process of replacing
cognitive psychology
robot trajectory
irrational behavior
probability density
probability density is probability per unit independent variable , and that : with continuous variables , the probability corresponding to some exact value (
supervised method
domain of discourse
symbolic planning
symbolic planning is an important feature responsible for any robotics system to exhibit an intelligent behavior whenever dealing with non completely structured .
bigram model
bigram model is a simple and popular simplification , which makes the following approximation .
clustering result
epistemic structure
compliant motion
compliant motion is motion which complies with constraints imposed by the geometry of the task .
expectimax
expectimax is a variation of the minimax algorithm that combines the minimization and maximization nodes of minimax search with chance .
control system
tlplan system
computation time
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 .
polynomial time
polynomial time is the set of boolean queries expressible in first-order logic extended by the ability to define new relations by induction .
uninformed search algorithm
user input
polygonal model
cryptographic algorithm
bang-bang control
bang-bang control is a positive ( ) feedback mechanism .
line orthogonality pattern
proving approach
process of receiving
machine learning algorithm
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 .
source of knowledge
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 .
singular value
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 .
syntax
in linguistics , syntax is the study of the principles and rules for constructing sentences in natural languages .
equivalence class
an equivalence class is a set of nodes related by an equivalence relation , which must be reflexive , symmetric , and transitive .
fibonacci heap
fibonacci heap is a collection of many trees .
estimation
a estimation is the process of making an estimate .
regular expression
a regular expression is any pattern for text matching or searching , frequently offering more or less functionality than a theoretical regular expression .
support vector machine
local consistency algorithm
causal support
causal support is the analog of a prior probability , summarizing the background knowledge lending support to a belief .
agent function
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 .
cognitive science
cognitive science is an attempt to unify views of thought developed by studies cognitive science is a perspective rather than a discipline , it is impossible to .
hierarchical clustering
hierarchical clustering is one of the clustering methods which allows to group objects to clusters and build hierarchy of clusters .
training corpus
target compilation language
a target compilation language is a class of formulas which is tractable for a set of transformations and queries .
bottom-up dynamic programming
bottom-up dynamic programming is a self-constructed test tree , the algorithm has exponential storage and computational complexity of o ( ) (
maximum likelihood
pac learning
control knowledge
control knowledge is the tlplan system by bacchus .
semidynamic environment
normative theory
a normative theory is a goal-oriented theory that represents real world situations , not as they are , but as they should be .
query variable
c configuration space
formulation
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 .
two-valued logic
two-valued logic is the sort of logic sports fans use : `` my team is good .
well-formed formula
a well-formed formula is an expression built up in the usual way by means of the connective d and the quantifiers from elementary well-formed formulas .
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 .
feed-forward network
a feed-forward network is an acyclic graph of neurons unambiguously signed ( ) by numbers from r ( ) .
logicism
logicism is the thesis that mathematics is reducible to logic , or so it is often said .
core language engine
the core language engine ( ) ( ) is a domainindependent system developed at sri cambridge , which translates english sentences into formal representations .
parent node
a parent node is any node in the treeview control 's node collection that has .
gain ratio
gain ratio is an alternative metric from quinlan 's 1986 .
similarity metric
apparent motion
apparent motion is a perceived motion produced by the presentation of sequential but static images containing no physically continuous motion .
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 .
construct
a construct is a concept or model .
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 .
spectrophotometry
a spectrophotometry is the quantitative analysis of electromagnetic spectra by use of a spectrophotometer
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 .
g activation function
web of datum
diagnostic inference
engineering
premise
a premise is a statement that is assumed to be true and from which a conclusion can be drawn .
invariant shape representation
exhaustive decomposition
extractive activity
item of knowledge
first-order logic semantics
kernel discriminant analysis
kernel discriminant analysis is a nonparametric technique that offers greater flexibility at the cost of increased com - plexity .
recurrent neural network
a recurrent neural network is a neural network where the connections between the units form a directed cycle .
cryptarithmetic problem
cryptarithmetic problem is an interesting constraint satisfaction problem for which different algorithms have been given .
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 .
binary dag
base case
base case is state of the art mid 2006 .
markov decision problem
a markov decision problem is a markov chain with the addition of an action model and a performance criterion .
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
indirect speech act
random variable
random variable is an important concept in probability theory , and its applications to .
axiom scheme of knowledge
confirmation theory
confirmation theory is the study of the logic by which scientific hypotheses may be confirmed or disconfirmed ( ) by evidence .
process of deciding
network of relation
cnf decomposition
prototypical implementation
a prototypical implementation is available including source .
human cognition
initialization parameter
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 .
optical flow
optical flow is a state of the art technology that uses pixel by pixel motion analysis to create new frames in the video with smooth results .
sampling rate
sampling rate is the parameter that determines much of the quality of an audio sample .
syntactic ambiguity
syntactic ambiguity is information property consistent with sentences which may be parsed digital more that one way .
mathematics
a mathematics is a science dealing with the logic of quantity and shape and arrangement .
expectiminimax complexity
coreference resolution
coreference resolution is the process of identifying when two noun phrases ( ) refer to the same entity .
linear classifier
a linear classifier is an algorithm to find a linear function that best separates the data .
software specification
root node
root node is the root of the tree .
markov property
markov property is an assumption that allows the system to be analyzed .
on-line tuning method
natural language processing
natural language processing is a range of computational techniques for analyzing and representing naturally occurring texts at one or more levels of linguistic .
embedding
long-distance dependency
long-distance dependency is one of the major sources of problems in the process of detecting syntacti - cally related associations .
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 .
content-based image retrieval
inference algorithm
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 .
room
a room is a space '' for '' something , or '' to '' carry out an activity . .
experimental vehicle
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 .
dijkstra's algorithm
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 .
specialized tree-based data structure
architecture for speech recognition
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 kernel
a gaussian kernel is a kernel with the shape of a gaussian ( ) curve .
computational property
computational property is actually an emergent property of hundreds of thousands of neurons cooperating to produce the amazing processing .
grammar attribute
source language
in yii , the source language is default to the application source language while the target language is default to the application language .
completeness theorem
intrinsic property
the name intrinsic property is a member-name property .
goal-based agent
existential restriction
an existential restriction is a path to a variable node in the ed tree
sensory stimulus
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 .
built-in knowledge
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 .
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 .
consistency algorithm
dynamic symbol
a dynamic symbol is the defining feature of our current ampang-kl strategy .
reflex agent
sift feature
static environment
process monitoring
goal formulation
goal formulation is based on the current situation amp; the agent 's performance measures .
vacuum agent
selection process
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.
prepositional phrase
statistical relational learning
statistical relational learning is the intersection of research in graphic models , logic representations and probabilistic theories .
profile of dependency graph
active vision
unsupervised learning algorithm
semi-supervised alignment
semi-supervised alignment is based on eigenvalue decomposition .
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 .
variable planning
process of selecting
pagerank
pagerank is a system that helps google to organize its search result pages .
closure resolution
dynamic conditional random field
syntactic parser
a syntactic parser is an important module of various kinds of natural language processing systems .
knowledge-based system
a knowledge-based system is a system that can undertake intelligent tasks in a specific domain that is normally performed by highly skilled people (
reduction algorithm
non-monotonic logic
a non-monotonic logic is a formal logic whose consequence relation is not monotonic .
distribution of class
assumption-based system
qualified existential restriction
advice taker
advice taker is the proposed program for common-sense reasoning .
locus
a locus is the scene of any event or action
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 .
utility-based agent
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 .
quotient
a quotient is the ratio of two quantities to be divided .
separable utility function
causal model
discretization
discretization is the process of converting real gene expression data into a typically small number of finite values ( ) .
em algorithm
declarative approach
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 .
constraint satisfaction problem
a constraint satisfaction problem is a structure ( ) where .
linear order
linear order is a function of asymmetric c-command relations ( ) .
refinement matrix
observation sentence
morphology analysis
reductio ad absurdum
in formal logic , the reductio ad absurdum is actually a legitimate argument , but it is often applied fallaciously .
training event
constraint based theory
transformation
a transformation is a rule describing the conversion of one syntactic structure into another related syntactic structure .
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 .
tree decomposition
a tree decomposition is a representation of a complete set of vertex separators of a graph .
belief network
a belief network is a representation of the probabilistic relationships among states of a portion of the world .
event calculus
event calculus is indeed the proper theory to treat a group of phenomena including .
conditional planning
conditional planning is planning based on unknown information .
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 .
deductive approach
deductive approach is based on accepted assumptions from formal decision theory .
theorem proving
theorem proving is the systematic derivation of a mathematical proof from a set of axioms by the use of rules of inference .
advantageous quality
memory space
iterative deepening search
iterative deepening search is a strategy that sidesteps the issue of choosing the best depth limit by trying all possible depth limits : first depth 0 , then depth 1 , then .
incompleteness theorem
incompleteness theorem is a theorem of classical mathematics ( )
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
decision maker is unable to resolve the claim if the initial decision maker lacks sufficient information to evaluate the merits of the claim or if the initial decision .
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 . .
training instance
a training instance is a record from a data set that is used to construct a model for classification as described herein .
percept sequence
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 .
inflectional morphology
inflectional morphology is the phenomenon whereby the grammatical properties of a word ( ) are expressed by realizing the word in a particular form .
compilation complexity
trigger
spelling correction
spelling correction is an important feature in many different types of software applications , such as word processing applications and email applications .
incorporation
a incorporation is a linguistic phenomenon .
k-dl decision list
vertex elimination order
virtual agent
document corpus
human-robot interaction
human-robot interaction is being studied through the creation of ` socially interactive robots .
generalized phrase structure
top-down dynamic programming
search cost
a search cost is a cost that is associated with acquiring information about a product .
action-utility table
character
negation
a negation is a negative statement .
robotics
robotics is the science of creating artificial intelligence .
strong connectivity algorithm
golog program
node utility
mainstay
a mainstay is a chief support .
distance metric learning
distance metric learning is a parametric technique defined under the supervised setting .
fusion
a fusion is the state of being combined into one body .
process of selecting feature
image edge
image edge is an important feature of image .
simulation result
pruning
resource requirement
label propagation
intercausal reasoning
intercausal reasoning is a common inference pattern involving probabilistic .
input pattern
declarative sentence
a declarative sentence is a proposition - that is , something to which a truth value can be assigned .
data-directed inference
user requirement
cognitive modelling
short-term memory
short-term memory is the ability to ` hold in mind ' information .
stability of sorting algorithm
graph coloring
graph coloring is a register allocation algorithm that works by creating a graphical representation of the program .
speech synthesis
speech synthesis is the process of producing vocal signal using machines , based on the phonetical transcription of messagesamp;quot .
applicable operator
finite state automaton
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 .
euclidean distance
euclidean distance is an integer with bounded magnitude and precision .
training datum
training datum is available to the system , whose the desired output is known .
unit resolution
unit resolution is an application of resolution , where one clause is a unit clause also called boolean constraint propagation .
process of dealing
airflow simulation
software engineering
software engineering is about the sound construction of computer systems for today and tomorrow .
web service
a web service is a method of communication between two electronic devices over a network .
sensitivity analysis
sensitivity analysis is the process of determining how small pertubations of model inputs affect model outputs .
real-world application
beam search
beam search is a standard heuristic for controlling complexity during viterbi decoding , but during forward-backward , standard beam heuristics can be danger - .
goal predicate
cooperative computation
morphological context
behavioral theory
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
range
a range is the distance from a person or sensor to an object , target , emanation , or event .
lexical pattern
generally , a lexical pattern is a sequence of strings .
software verification
software verification is the process of ensuring that a program meets its intended specification ( ) .
support vector
a support vector refers to a characteristic vector si on the optimal identification hyperplane .
data mining
operator reduction
sequence of token
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 .
training sample
a training sample is a pair of a sample input vector and a desired output vector .
epistemic logic
epistemic logic is the study of the principles of inference and the formal semantics of knowledge , belief , and other epistemic notions .
process of searching
neural network link
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 .
agent-oriented system
modell of event
transit motion
search space
autonomous vehicle underwater
transfer motion
additive utility function
nondeterministic polynomial time
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 .
reach
a reach is the distance from the center of the robot to the fullest extension of the robotic arm .
intersection
a intersection is a representation of common ground between theories or phenomena .
hidden variable
dependency tree
a dependency tree is a representation of the syntactic structure based on the idea of replacing the explicit representation of the way the words are grouped .
polynomial space
game-theoretic consideration
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 ( ) .
prioritized sweeping
backtracking search
backtracking search is basic uninformed search algorithm for csps .
disjoint subset
iterative deepening
iterative deepening is a well-known quality of results .
node search
node search is a very useful feature and is function available or has it been deemed not necessary .
cooperative coevolution
cooperative coevolution is quite an elaborate mechanism .
terminological logic
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 .
rewrite rule
rewrite rule is one of the rules governing the possible forms that a sentence 's phrase structure can take .
artificial environment
advantage
a advantage is the quality of having a superior or more favorable position .
state automaton
data modelling technique
input clause
an input clause is a formula of the form .
record
a record is a set of related data values in a.
bayesian updating
bayesian updating is a probabilistic updating procedure that is widely used the main purpose of bayesian updating is to infer the likelihood of a given .
modification operator
a modification operator is a function m : x → x , where x is the instance space .
matrix multiplication
matrix multiplication is a classical benchmark for experimenting with techniques used to exploit machine architecture and to overcome the limitations of .
adjacency list
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 .
constraint calculus
possibility theory
possibility theory is an interpretation of fuzziness that assigns possibility theory is intrinsically more compatible with subjective ( ) and heuristic .
combinational circuit
decision node
decision node is an assertion that the chance event will not be observed by the time the decision is made .
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 .
natural language
natural language is used to describe probability , it is highly probable that errors will be introduced into the assessment of risk .
uncertain rule
precision-recall curve
fraction
a fraction is the quotient of two rational numbers .
multiattribute utility theory
training curve
specularly reflected light
specularly reflected light is the same color as the source .
taxonomic information
functional programming
functional programming is based on logic and could be a basis for logic on its own .
component graph
primitive function
assembly planning
assembly planning is concerned with the generation of a logical sequence of steps each of which is a motion plan .
reactive planner
a reactive planner is a system that builds or changes its .
situated planning agent
fault
a fault is the quality of being inadequate or falling short of perfection .
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 .
hierarchical decomposition
hierarchical decomposition is the process of decomposing a system in a top down fashion .
execution mechanism
singly connected network
similarity measure
version space
version space is the region of feature space defined as the intersection of the unit sphere and the polyhedral cone of the feature space .
sat solver
fast sat solver is an program , which solves the boolean satisfiability problem using genetic algorithm ( ) .
truth maintenance system
a truth maintenance system is a program that keeps track of dependencies between sentences so that retraction ( ) will be more .
prepositional semantics logic
sample pattern
situated language
acquisition of knowledge
acquisition of knowledge is the key feature that distinguishes education ( ) at any level from all other activities .
relation phrase
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 .
general search
general search is the broadest search available .
argumentation tree
software architecture
software architecture is the design of the major components of complex information systems , and how they interact to form a coherent whole .
hypothesis recognition
sentiment lexicon
sentiment lexicon is a common phenomenon when users are getting excited .
mixture model
a mixture model is a collection of distributions d. in this role , the mixture model is a robust estimator .
discriminative maximum entropy model
goal-directed reasoning
sigmoid belief network
a sigmoid belief network is a binary dag , with .
feedback loop
a feedback loop is a service when an isp lets you know if someone of its users complains about your email .
graph mining
vector algorithm
number theory
number theory is the branch of mathematics concerned with the properties of numbers in general , and integers in particular , as well as the wider classes of .
unsupervised learning
unsupervised learning is the process of discovering significant patterns or features in the input data when no certain output or response categories ( ) are .
example character
semantic interpretation
semantic interpretation is the process of converting the raw text of spoken utterances into a representation of data that is more easily .
priority queue
a priority queue is an abstract data type in computer programming .
additivity of utility function
intelligent action
intelligent action is the fusion of research and activity .
vector quantization
vector quantization is simply the quantization of a vector , an ordered set of real numbers .
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 . .
replanning agent
replanning agent is research with genetic based replanning agent in order to accelerate the optimization speed of path planning technique .
associative memory
an associative memory is a system such that when given input x produces output y. that is , the memory associates x with y. an auto-associative memory is an .
systems program
a systems program is a program that controls some aspect of the operation of a computer .
decision theory
multilayer neural network
a multilayer neural network is defined as a system that consist of neurons of the above type and connections with a layered structure .
associative relation
an associative relation is a relation that is also an associative operation .
abstract noun
an abstract noun is a state , a quality or feeling that can not be perceived by the senses .
perceptron representational power
with domain
domain adaptation
domain adaptation is of practical importance in many areas of applied machine learning , ranging from computational biology ( ) to natural language .
longitudinal control
lexical database
a lexical database is a lexical resource which has an associated software environment database which permits access to its contents .
fdtd approach
connection method
hierarchical planning
hierarchical planning is one of the sources of inflexibility .
gaussian process
a gaussian process is a collection of random variables , any finite number of which have consistent joint gaussian distributions ( ) .
speech feature
identity relation
in logic , the identity relation is normally defined as the relation that holds only between a thing and itself .
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 - .
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 .
automatic recognition
full-width search
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 .
non-euclidean geometry
non-euclidean geometry is a form of a posteriori knowledge , and most scientists believe the same about space (
optimal solution
an optimal solution is an integrated system for detecting attacks on several levels .
block
a block is a region of code in a program that acts as a single unit , such as a function or loop .
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 .
problem-solving system
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 .
recursively enumerable grammar
logical constant
a logical constant is either the logical value true or false .
constraint network
hierarchical abstraction
hierarchical representation
vacuum world
vacuum world is a simple simulation environment used to introduce some concepts in artificial intelligence ( ) , but can also be .
diagnostic knowledge
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 .
with computational technique
maximum entropy
access function
an access function is a short public function whose job is to return the value of a private member variable .
instructional method
variable-free tree structure
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 .
hypothesis space
hypothesis space is the set of all hypotheses the learning algorithm is designed to entertain .
learning curve
a learning curve is a graph showing the rate of learning
situation calculus planning
finite state machine
a finite state machine is a computation model consisting of a set of finite or constant states that define behavior , a start state or initial state , an application - specific .
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 (
analogical language
analogical language is language , and the use of language , to suggest ideas by comparisons .
role of domain knowledge
planning agent
encryption methodology
similarity computation
software agent
predicate logic
predicate logic is a formal deduction system whose atomic formulas are propositional functions .
consequence relation
a consequence relation is a binary relation ∼ between sentences of classical propositional logic .
marker-passing algorithm
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 .
modal operator
modal operator is any expression that points out the modality in a scope that precedes a modal operator is a the modal operator is '' shall , '' the front scope is .
conditional probability
conditional probability is a theory of how to model these intuitions .
deterministic environment
role inclusion
similarly , a role inclusion is an expression of the form .
psychological reasoning
constant symbol
a constant symbol is a o-ary function symbol .
semi-supervised learning
finally , semi-supervised learning is actually a supervised method that avoids labeling a large number of instances .
nonholonomic robot
similarly , a nonholonomic robot is defined as a robot , that has one or more nonholonomic kinematic constraints ( ) .
recursive dynamic programming
kernel function
kernel function is one of the smoothing techniques .
orthogonal relation
depth
a depth is the intellectual ability to penetrate deeply into ideas .
belief network inference
descriptive theory
a descriptive theory is a behavioral theory of what people actually do when facing a decision .
forward chaining
forward chaining is a artificial intelligence method of reasoning which uses inference rules to create new sentences from existing facts .
transfer path
sensor measurement
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 .
editor
a editor is a program designed to perform such editorial functions as rearrangement or modification or deletion of data .
output activity
multiagent system
inconsistent heuristic
total order planning
inference method
an inference method is just a simple base language method marked with an annotation '' @ inferencemethod '' .
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 .
kalman filtering
kalman filtering is a recursive algorithm , which has been proposed as an attractive alternative to correct overlapping interferences in icp-aes .
most transparent model
query mining
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 .
episodic environment
situated automaton
mathematically , a situated automaton is a finite state automaton in the form of a mealy machine ( ) a 'd t e track .
expansion operator
statistical-relational learning
interval algebra
interval algebra is based on thirteen basic relations that can hold between intervals
game theory
game theory is a branch of applied math which looks at competitive situations where 2 or more people have conflicting interests .
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 .
existential graph
an existential graph is a type of diagram .
driverless system
monotonic deductive system
process of pointing
decision procedure
process state
wacky agent
cook's theorem
member-name property
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 .
induction hypothesis
dependency analysis
a dependency analysis is an directed acyclic graph where the words correspond to nodes and depen - dencies to edges .
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 .
metropolis algorithm
analog
a analog is a computer program that analyzes log files from web servers .
password generation
conceptual clustering
conceptual clustering is a form of clustering in machine learning that , given a set hence , conceptual clustering is a two-step process : clustering is performed .
control method
problem-solving heuristic
event detection
event detection is the trigger that sets in motion the process of consequence .
parallel processing
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 .
integrability
a integrability is the quality of being integrable .
dfs
a dfs is a depth first search . .
terminal test
stochastic process
a stochastic process is a statistical phenomenon that evolves in time according to probabilistic laws .
markov model
a markov model is a finite state machine with probabilities governing transitions between states and controlling the emission of output symbols .
knowledge acquisition
knowledge acquisition is a method of learning , first proposed by aristotle in his seminal work `` organon '' .
decision-theoretic planning
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 .
consistent plan
situation space planning
conditioning bounded cutset
process of reducing
linear transformation
a linear transformation is an important concept in mathematics because many real world phenomena can be approximated by linear models .
relevance-based learning
bounded-error planning
linear resolution
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 .
simulation environment
human decision maker
graphic representation
nondeterministic algorithm
in the theory of computation , a nondeterministic algorithm is a hypothetical algorithm where computation can branch , choosing among different execution paths .
knowledge engineer
a knowledge engineer is a computer systems expert who is trained in the field of expert systems .
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 .
transit path
a transit path is a path of the robot when it is not grasping the object .
inference pattern
equality symbol
dynamical system
process of forming
hierarchical decomposition planning
silhouette method
silhouette method is a graphical cluster validation technique , which can be used to select the number of clusters .
root
a root is the single node of a tree that has no parent .
fully instantiated plan
surface error
rate of convergence
boolean expression
a boolean expression is a logical statement that is either true or false .
anytime algorithm
an anytime algorithm is an iterative refinement algorithm that can be interrupted each anytime algorithm is a performance profile , which is a function that maps .
parenthesized expression
schema rule
diagnostic method
semi-supervised feature selection
semi-supervised feature selection is a new concept that combines the feature selection and semi-supervised learning techniques ( ) .
belief network inference complexity
training set
a training set is a set of example characters from which a neural network learns to recognize a font during font training . .
performance measure
a performance measure is defined as a metric used to quantify the efficiency and \ or effectiveness of an action .
boolean logic
a boolean logic is a see boolean algebra . ( ) .
propositional logic
a propositional logic is a formal deductive system in which formulae representing propositions can be formed by combining atomic propositions using logical connectives .
leaf node
a leaf node is any node in the treeview s nodes collection that has no child nodes
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 .
sufficient condition
a sufficient condition is a condition that guarantees that a statement is true ( ) .
proof sketch
a proof sketch is the central data structure which represents the state of a proof .
kernel method
a kernel method is an algorithm that depends on the data only through dot - products .
core algorithm
search spaces planning
shortest path
a shortest path is any path who 's path weight is equal to the shortest path weight .
gaussian function
a gaussian function is also a useful lineshape function .
knowledge compilation
knowledge compilation is the process of transforming a domain theory into a form specialized for the solution of a given problem set .
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 .
markov decision process
functional dependency
informally , a functional dependency is a statement to the effect that the values associated wtth one set of attributes uniquely determine the values associated .
deferred planning
algebra of feature
speedup learning
speedup learning is a form of learning in which an inefficient problem solver is transformed into an efficient one .
backward state-space search
re-targetable query compiler
systems ability
bound search
deterministic finite automaton
evaluation function
evaluation function is a heuristic function , and it is where the domain experts ' knowledge resides .
question-answering system
combinatory categorial grammar
combinatory categorial grammar is a lexicalized formalism that excels in dealing with long and short-range dependencies .
degree of consistency
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 .
answer set programming
production rule
a production rule is an expression in the make utility that when evaluated directs the execution of commands by the system which result in the creation of certain target files from certain dependent source files .
domain of value
heap sort
heap sort is one of the fastest sorting algorithms , rivaling such speed-demons as quicksort and mergesort .
declarative programming language
acyclic circuit
an acyclic circuit is called combinational logic .
continuous environment
new predicates learning
agent design
i-dt decision tree
actor architecture
acyclic graph
an acyclic graph is a directed graph without cycles .
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 .
qualitative calculus
qualitative calculus is calculus of qualitative variables with values taken from the domain -lcb- - , 0 , + -rcb- .
generalized resolution
generalized resolution is the following rule of inference : a1 amp; a2 amp; ... amp; am = ) b1 v b2 v ... v bk .
structural relationship
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 .
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 . .
empirical result
utility function learning
case-based planning
case-based planning is a problem-solving method that uses a case library one of the most difficult tasks in case-based planning , is handled through the .
process of recognizing
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 .
reasoning with uncertainty
reasoning with uncertainty is the branch of artificial intelligence one approach to reasoning with uncertainty is to use higher-order nonmonotonic .
polynomial function
a polynomial function is any function whose value is the solution of a polynomial .
commonsense rule
expectiminimax
like minimax , expectiminimax is a full-width search up to a particular look-ahead depth .
activation level
parametric technique
process of decomposing
probabilistic projection
probabilistic projection is a special case of reasoning about continuously changing quantities involving partial orders and other sorts of incomplete information .
lineshape function
entity tree
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 .
backjumping
neural network expressiveness
role of heuristic
rule of combination
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 .
goal representation
least commitment
least commitment is a useful concept for analyzing when decisions should be made in any search problem .
computer algorithm
completeness of a proof procedure
graphical device
dependency grammar
dependency grammar is a class of syntactic theories separate from generative grammar in which structure is determined by the relation between a word (
force sensor
a force sensor is a device that is used to measure the vector quantity of force .
cumulative learning
cumulative learning is an area of machine learning research in computer science .
automation of reasoning
dominance
a dominance is the power or right to give orders or make decisions .
audio recorder
audio recorder is a small and easy-to-use program that allows you to record any sound on your computer .
inductive learning process
rational action
minimax algorithm
derivative
a derivative is an expression that characterizes how the output of a function changes as the input is varied .
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 .
dynamic belief network
medium
a medium is a state that is intermediate between extremes .
language perception
language perception is identical to the l2 initial state , as predicted by the full .
report
truth maintenance
disjunctive effect
sparse coding
sparse coding is an unsupervised learning algorithm that at - tempts to learn a thus hardly surprising that when sparse coding is applied to a self-taught .
non-metric distance
blocks world
blocks world is a theory of the first-order predicate calculus with equality .
indicator
neural computation
neural computation is a macroscopic phenomenon that results from the interaction between ensembles of interacting neurons .
expected case analysis
relation-independent pattern
decision rule
a decision rule is a logical statement of the type `` if ( ) , then ( ) .
canonical distribution
canonical distribution is the maximum entropy distribution for a given expected utility .
cryptography
probabilistic model
algorithmic complexity
a algorithmic complexity is the size of the smallest program that can produce a particular sequence of numbers .
intentional state
an intentional state is a state which has a certain propositional content .
parameterized random variable
process of eliminating
context-sensitive grammar
context-sensitive grammar is now populated and password generation can begin .
user preference
user preference is one of the important user requirements .
indefinite domain
annealing
annealing is the process of heating the beads to a controlled temperature that annealing is a heat treatment process that is used to change the properties of .
argument
a argument is a variable in a logical or mathematical expression whose value determines the dependent variable .
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 .
configuration space obstacle
genetic algorithm
a genetic algorithm is a computer program that tries potential solutions and evaluates them .
decision network evaluation
null hypothesis
a null hypothesis is a statement about a population parameter .
motivation
intersective semantic
gaussian distribution
a gaussian distribution is a theoretical distribution with finite mean and variance .
bar code
a bar code is a pattern of bars ( ) and spaces .
multi-agent system
a multi-agent system is a system composed of multiple interacting intelligent agents , capable of solving problems which are difficult or impossible for an individual agent or monolithic system to solve .
process of transforming
decision lists learning
detachment
distance function
a distance function is a particular way of calculating distance , such as the euclidean distance between two vectors . .
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 .
default logic
default logic is a non-monotonic logic proposed by raymond reiter to formalize reasoning with default assumptions .
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 .
constraint satisfaction search
subsumption architecture
language model
adaptive planning
problem-solving agent
mean square error
manner
a manner is a customary method of acting
completeness search
bounded optimality
conjunction
a conjunction is the grammatical relation between linguistic units that are connected by a conjunction .
analog process
process of heating
theory of information value
qbf solver
qbf solver is an algorithm that determines the truth value of such formulas .
cost function
cost function is the derivative of ( ) the average cost function .
successor-state axiom
edge detection
chess automaton
a chess automaton is a mechanism that purports to play .
kolmogorov complexity
assertion
a assertion is a statement in a program asserting a condition expected to be true at a particular point , used in debugging .
search graph
search graph is a tree the solution may not be optimal .
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
artifacts , model checking is a well-established technique in single system development .
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 .
open planning architecture
appealing technique
classification task
consistent decomposition
correlation coefficient
adl formalism planning
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 .
logical implication
a logical implication is a statement that relates two propositions .
acoustic signal
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 .
logic variable
a logic variable is an abstraction of uncertainty .
mobile device
decision analysis
decision analysis is a quantitative evaluation of the outcomes that result from a set of choices in a specific clinical situation .
language processing
language processing is a memory-based model .
belief
a belief is the quality or state of believing .
glm regression algorithm
normalized utility
active learning
active learning is generally defined as any instructional method that engages students in the learning process .
domain of application
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 .
feedback mechanism
uniform convergence theory
predicate type
a predicate type is an arbitrary boolean function supplied by the flux programmer that is applied to the node 's output .
heap selection
probabilistic transition
a probabilistic transition is defined to be a function t : ω × fω → ( ) such that for each θ ∈ fω , .
parse tree
a parse tree is a tree structure representing sentences or expressions of a formal language that mirrors the grammar of that language , as defined by its bnf .
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 .
semantic network
topic model
a topic model is a generative model for documents : it specifies a simple probabilistic procedure by which documents can be generated .
linear input resolution
problem-solving method
application of artificial intelligence
optimization
a optimization is a process of finding the best values for the independent variables within a function , which is most commonly the maximum or minimum value . .
knowledge representation
a knowledge representation is a medium for human expression .
refutation graph
a refutation graph is a graph whose nodes are literals ( ) and its edges connect complementary literals .
stochastic game
stochastic game is equivalent to the optimal control of a mdp without future reward discount .
structure of discourse
cell decomposition
a cell decomposition is a special kind of partition .
cross-entropy based filter technique
data driven technique
posteriori knowledge
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 .
robot architecture
a robot architecture is a set of guiding principles used to structure a robot 's control system .
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
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 .
o-ary function symbol
ockham algorithm
np-completeness
np-completeness is a statement about coming up with .
interpropositional relation
static symbol
fortran
a fortran is a formula translating system : a programming language widely used for many years in scientific applications . .
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 .
theory of inheritance
a theory of inheritance is a theory of how characteristics of one generation are derived from earlier generations .
data fusion
time complexity
time complexity is proportional to the size of a traversed tree .
state space
state space is a method of modeling complex dynamic systems as a set of first order differential equations .
learning rate
learning rate is one of the parameters which governs how fast a neural network learns and how effective the training is .
unary notation
unary notation is a perfectly fine language you still need a human to decide if a representation is .
program synthesis
passive agent
analysis of time
neighborhood kernel
neighborhood kernel is the bubble function ( ) ( ) which is non-zero for the neighborhood but zero elsewhere .
fermat's last theorem
with relation
measure of uncertainty
constraint logic programming
constraint logic programming is a new class of declarative programming languages whose primitive operations are based on constraints (
ground resolution theorem
jordan curve theorem
jordan curve theorem is the construction of a path joining two points and missing a curve .
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
in genetic algorithms , inheritance is the ability of modelled objects to mate , mutate and propagate their problem solving genes to the next generation , in order to produce an evolved solution to a particular problem .
reinforcement learning
reinforcement learning is a simulation-based method rooted in dynamic programming .
constraint satisfaction
finite automaton
a finite automaton is an algorithm with a finite memory which scans through an input string or text .
initial state
initial state will be the state in which all the variables are unassigned .
process of grasping
ontology language
an ontology language is an artificial language that expresses knowledge about the structure of human communication and that is suitable to .
derivation
in categorial semantics , derivation is a background process that builds up logical forms , but is not explicitly represented in the semantic formalism .
speech act
speech acts planning
analogical reasoning
analogical reasoning is a kind of reasoning that is commonly used in the day to however , a particular form of analogical reasoning is based on simple and .
experimental methodology
tropistic agent
metalevel reasoning
decision-making process
theory of language
cross validation
cross validation is the process of testing a model on more than one sample .
planning under uncertainty
planning under uncertainty is a critical ability for au - tonomous robots operating in uncontrolled environments , such as homes or offices .
decomposition tree
a decomposition tree is a tree whose nodes are sets and such that each node that is furthermore , it is easy to check if a decomposition tree is a proper .
mobile robot
a mobile robot is a type of robot with its own engine or power able to move without constraints on its path . .
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 .
tree-based indexing
learning architecture
a learning architecture is a strategic design for learning to meet a particular business goal in a particular situation .
intensional predicate
an intensional predicate is a predicate logic sentence that is defined by a set of clauses .
nonterminal symbol
a nonterminal symbol is the structure that the parser recognizes .
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 .
nlp
nlp is the study of human excellence .
skolemization
skolemization is the process of eliminating existential quantifiers from a formula thus , skolemization is an equisatisfiable transformation .
score rule
score rule is a new system in the school .
christofides' heuristic
situation-action rule
orthogonal line
confidence factor
confidence factor is a numerical value between 0 and .
memory requirement
game robot
uncertain reasoning
uncertain reasoning is the main diagnostic method .
means-ends analysis
multiset variable
a multiset variable is a variable that will be assigned to a multiset of integer values .
ontology matching
ontology matching is the process of finding correspondences between .
analysis of complex scene
dynamic decision network
model tree
model tree is a data driven technique for dealing with continuous class problems , that provides structural representation of the data and piecewise linear fit .
phenomenology
space-efficient dynamic programming
sample space
interval-valued definition
sketch recognition
sketch recognition is the process of identifying user strokes into meaningful symbols that can be sketch recognition is divided into three main steps .
logical query
a logical query is the process of selecting features whose attributes meet specific logical criteria (
maximum expected utility
encoded message model
value iteration
value iteration is an unguided algorithm for solving the bellman equations and for this reason , for mdps , value iteration is often terminated after a predefined .
inference of relationship
acoustic model
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 .
visual feature
probability vector
a probability vector is a vector with nonnegative entries that add up to 1 .
ground clause
a ground clause is a clause which does not contain any variables .
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 .
base language method
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 .
data set
multiagent reasoning
transfer function
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 .
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 .
face recognition
face recognition is one of biometric methods , to identify given face image using main features of face .
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.
alpha-beta search
locally finite graph
a locally finite graph is a graph where the degree of each vertex is finite .
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 .
conditional effect
a conditional effect is an effect of an action that depends on the value of other features .
undirected weighted graph
intradomain phenomenon
unguided algorithm
logic sampling
probabilistic first-order logic
classification problem
classification problem is exactly the posterior probability .
boruvka's algorithm
experience
causal relation
a causal relation is an interpropositional relation in which the situation expressed by some proposition(s ) is communicated as bringing about .
biometric method
conversational agent
a conversational agent is human-computer dialogue system that interacts with the user turn by turn using natural language .
interpretation semantic
electronic circuits domain
runtime variable
a runtime variable is a field value that is defined by the user at the time of running the report .
belief network learning
resolution completeness proof
longest common substring
oft-touted property
modell of computation
clever indexing
existential elimination
homeomorphism
a homeomorphism is a similarity in the crystal structure of unrelated compounds .
benchmarking
benchmarking is the process of identifying `` best practice '' in relation to both products ( ) and the processes by which those products are created and .
logic of relevance
dependency-directed backtracking
dependency-directed backtracking is a powerful search strategy .
learning agent
in supervised learning , a learning agent is given mappings of inputs to desired outputs .
default value
a default value is a value that is auto ¬ matically displayed by the computer .
perceptron
deduction system
input generalization
minimum description length
conjunctive probability
prediction
a prediction is a statement of what will happen in the future .
domain closure effect
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 .
naive agent
regression
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 . .
unit clause
a unit clause is a clause containing only one literal ( ) , while a binary clause con - tains exactly two literals .
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 .
differential equation
a differential equation is an algebraic relation between variables that includes the rates of change of the variables as well as their .
dcop algorithm
action model
iterative cost
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 .
principle of database system
asynchronous dynamic programming
transition function
in topology , a transition function is a homeomorphism from one coordinate chart to in computing , a transition function is the function that defines the state .
partial regression equation
autonomous land vehicle
regression recognition
bayes' rule
adaptive control theory
sign function
in mathematics , the sign function is an odd mathematical function that extracts the sign of a real number .
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 .
named entity
a named entity is a piece of text string which refers to an entity .
coalitional game
a coalitional game is system .
latent variable
blocks world planning
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 .
mining
a mining is any extractive activity .
time expression
multi-document summarization
multi-document summarization is the process of dealing with a large amount of information present in multiple related source documents by comprises only the .
foliation
a foliation is the process of forming into a leaf or leaves .
language analysis
nonlinear plan
bel belief about state
parallel search
binary classification
grid map
a grid map is simply a map that has been divided into marked sections .
computational complexity theory
computational complexity theory is the study of the inherent hardness or easiness of computational tasks .
field value
image retrieval
image retrieval is gaining importance as a support tool for diagnosis , research and education in medical domain ( ) .
target concept
virtual environment
derived sentence
distribution of agent
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 .
pseudo code
pseudo code is basically code that is used to outline the operations of a the syntax of pseudo code is not strict at all and can vary between .
completeness of a plan
pronunciation learning
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 .
direct graph
a direct graph is used to describe the node structure in simulation .
prior probability
prior probability is posterior probability μ after the update prior probability μ to ... kind of probability density function .
procedural attachment
prepositional logic agent
g-set
a g-set is a structure , where is a group , such that .
bsp tree
a bsp tree is just a binary tree plus the partition that separates both children .
linear program
a linear program is a mathematical optimization model that has a linear objective function and a set of linear constraints .
algorithm resolution
knowledge level
unbounded indeterminacy
algorithm of adaptation
branch-and-bound search
branch-and-bound search is a basic algorithm for solv - ing combinatorial optimization problems .
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
functionality
a functionality is the ability to perform a task or function
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
sample complexity
isa link
isa link is the a node .
ordinary differential equation
an ordinary differential equation is any relationship between a function ( ) ) and its derivatives up to some order : f ( x , y , dy dx .
basis function
basis function is a gaussian with diagonal covariance .
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 .
contingency planning
contingency planning is the process of identifying risks from disruption of operations and services .
human-computer dialogue system
entropy distribution
domainindependent system
probabilistic sensor model
recursive transition network
a recursive transition network is a graph theoretical schematic used to represent the rules of a context free grammar .
organisation of knowledge
uncertainty model
automaton program
anaphora resolution
anaphora resolution is the process of determining whether two expressions in natural language refer to the same real world entity .
baseline
trajectory
computational learning theory
computational learning theory is one of the first attempts to construct a computational learning theory is a subject which has been advancing rapidly in .
hybrid system
a hybrid system is a dynamic system that exhibits both continuous and discrete dynamic behavior -- a system that can both flow (
symbolic differentiation
in mathematics , symbolic differentiation is an operation that converts a given arithmetic expression into another arithmetic expression called the derivative .
first-order sentence
artificial intelligence programming language
structured programming construct
feature vector
a feature vector refers to the generation of at least two features .
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
a randomization is the process of making random .
source of information
neuron
a neuron is a see neural network , also mcculloch-pitts .
herbrand's theorem
real-time architecture
linear separability
linear separability is an important concept in neural networks .
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.
map variable
syntactic pattern
a syntactic pattern is a pattern based on syntax rules .
language origin
language origin is the theory that explains how human acquired language at the first time .
multi-agent planning
multi-agent planning is fundamental to the generation of cooperative ac - tivities .
disjunction of literal
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 .
markov blanket
markov blanket is a cross-entropy based filter technique capable of identifying both redundant and irrelevant features .
degree of similarity
ease-based planning
notation logic
computability
computability is the science of determining what can and can not be computed .
service composition
service composition is a natural extension of web services paradigm .
first-order predicate calculus
first-order predicate calculus is a logic that extends propositional calculus to include atoms with function symbols and logical variables .
algebraic relation
acquisition of adaptation knowledge
public-key encryption algorithm
path cost
path cost is a value assigned to each port .
local encoding
reasoning task
reasoning task is also called instance checking .
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 .
markov chain
markov chain is a procedural algorithm used to make coherent chains of values , instead of just random noise .
dimensionality reduction
dimensionality reduction is the search for a small set of features to describe a large set of observed dimensions .
stochastic dominance
simplification
a simplification is the act of reducing complexity .
heuristic search
heuristic search is the study of computer algorithms designed for problem solving , based on trial-and-error exploration of possible solutions .
naturalness
a naturalness is the quality of innocent naivete .
unit preference
unit preference is the heuristic of prioritizing resolutions where one parent is a unit clause .
feature space
feature space is the representation of features in euclidean space , each feature plotted on an axis perpendicular to each other axis .
asbestos removal
asbestos removal is the process of removing asbestos containing materials ( ) from a building or structure .
causal theory
a causal theory is a set of casual rules of the form : φ ⇒ ψ , where φ and ψ are propositional formulas .
word segmentation
word segmentation is an important task in natural language processing ( ) for languages without word delimiters ( ) .
assistive technology
dialectical tree
introspection
communicating agent
a communicating agent is a proactive agent that introduces new function - alities of communication .
bellman equation
knowledge representation system
expected utility
truth-preserving inference
rhetorical relation
term rewriting
term rewriting is one of the standard decision procedures for varieties .
discrete environment
bound computation
binary search
a binary search is a very efficient search when you are dealing with a large table .
inductive learning
inductive learning is a kind of learning in which , given a set of examples an agent tries to estimate or create an evaluation function .
proof tree
a proof tree is a set of applications of inference rules , arranged as a tree with a goal at the root .
full power
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 .
array
a array is a vector .
logic programming
logic programming is the study of computer programs that implement logic .
good old-fashioned ai
motion parallax
consistent hypothesis
consistent hypothesis is a map hypothesis (
principal component analysis
principal component analysis is a well-established method of data analysis .
computer vision
computer vision is the branch of computer science concerned with the analysis of images to extract information about the world .
density
a density is the spatial property of being crowded together .
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 .
capacity
a capacity is the ability to hold , receive or absorb .
knowledge-based agent
input method
input method is system to help user 's keyboard input .
spatial relationship
a spatial relationship is a vector .
case-based reasoning
case-based reasoning is a principle of constructivism that can be used to support advanced learning in an ill-structured domain .
logical variable
a logical variable is an independent variable which can take any value from .
decision analytic approach
behavioral module
behavioral module is a behavior-based system (
scaled orthographic projection
scaled orthographic projection is a first order approximation of the perspective projection .
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
nonepisodic environment
language understanding
language understanding is a process of grasping .
low-level action
simplest method
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 .
incremental learning
incremental learning is likely to increase when professionals are frequently another important factor influencing individual incremental learning is the time and .
formal grammar
a formal grammar is a set of rules for rewriting strings , such a formal grammar is often called a rewriting system or a phrase structure grammar in the .
abstraction planning
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
cosine similarity is a common vector based similarity measure similar to dice coefficient .
mobile sensor
mobile sensor is based on the popular sensor node platform .
analysis of document corpus
class variable
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 .
signal processing
signal processing is the process of measuring , manipulating or analyzing elec3104 digital signal processing is an introductory signal processing course .
clustering
dempster's rule
backward-chaining technique
hybrid model
a hybrid model is a polygonal model that uses rapid surfacing and traditional solid modeling techniques .
semantics of logic program
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 .
component analysis
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 .
distributed encoding
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 .
computational cost
memory
a memory is the ability of an organism to record information about things or events with the facility of recalling them later at will .
error bound
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 .
semantic space
semantic space is an indefinite domain of possible expression to which the current text bears some active and particular relationship .
feedforward circuit
constraint graph
a constraint graph is a directed graph that models the constraints placed on instructions in a multithreaded execution by the memory consistency model , .
grammatical formalism
collaborative filtering
collaborative filtering is an algorithm successfully and widely used in recommender system .
partial regression
horn clause
a horn clause is a clause with at most one positive literal , called the head of the clause , and any number of negative literals , forming the body of the clause .
simulation-based method
passive adp agent
linearization
linearization is the process of reducing a homogeneous polynomial into a multilinear map over a commutative ring .
table-based indexing
predicate symbol
predicate symbol is also a function symbol .
irrationality
a irrationality is the quality or state of being irrational
boolean variable
a boolean variable is a place in memory where a boolean value may be stored .
abstract operator
incremental algorithm
an incremental algorithm is an algorithm that includes several ( ) our incremental algorithm is compared experimentally to an .
monotonicity of a heuristic
transition model
image annotation
an image annotation is the explanatory or descriptive information about the pixel data of an image that is generated by a human or machine observer .
uncooperative agent
gps
gps is a satellite-based navigation system originally developed for military purposes and is maintained and controlled by the united states department of .
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 .
feed-forward neural network
feed-forward neural network is merely a mathematical function that maps an input vector to a number of outputs ( ) .
memory limitation
descriptive information
pruning strategy
domain transition graph
a domain transition graph is a graph representation of a state variable and shows the possible ways in which values can change .
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.
planning problem
planning problem is essentially constrained shortest path finding .
path consistency
path consistency is a property similar to arc consistency , but considers pairs of variables instead of only one .
syntactic theory of knowledge
instance checking
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 .
hybrid mst algorithm
charge-coupled device
charge-coupled device is a system that converts the light signals to digital data .
perceptron learning rule
perceptron learning rule is one of the most transparent models for learning in .
cognitive robotics
cognitive robotics is concerned with integrating reasoning , perception , and action within a uniform theoretical and implementation framework (
similarity network
a similarity network is a construction consisting of a similarity graph and a collection of local knowledge maps corresponding to each edge in the similarity graph .
model parameter
epipolar line
algorithm template
inverse method
utility space
analysis of information processing system
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 .
robot box
gene expression pattern
gene expression pattern is an indicator of the state of the cell , and abnormal cellular states can be inferred by comparing expression profiles .
bilingual lexicon
bilingual lexicon is a crucial resource for cross-lingual ap - plications of natural language processing ( ) including machine translation ( ) , .
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 .
shallow parser
a shallow parser is a computer program which can determine the boundaries of phrases in a sentence , but not the complete structure .
genetic engineering
logical sentence
support
a support is a supporting structure that holds up or provides a foundation .
reinforcement learning agent
node expansion
node expansion is the generation of all the successors of a given parent node .
effective branching factor
control rule
computational chemistry software program
register allocation algorithm
sample input vector
logical interpretation
logical interpretation is a translation from terms that denote signs to terms that denote phonological entities .
module
perceptron convergence theorem
automated reasoning
automated reasoning is the process of searching for a chain of rules which connect certain facts with given conclusions .
information processing
information processing is the process of receiving information through the senses analyzing and making it meaningfull .
multiple agent
lexical-functional grammar
lexical-functional grammar is a constraint based theory of language , whose basic syntactic architecture distiguishes two levels of representation : c-structure .
auv
an auv is a system that is too difficult to control .
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 .
run time
a run time is the time during which a program is executing .
adaptive network
an adaptive network is network of nodes and directional links .
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 .
proactive agent
information theory
collective computation
collective computation is an analog process , not a digital process .
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 .
demodulation
demodulation is the process of filtering out the actual transferred information from the received signal .
agent architecture
image formation
pathmax
pathmax is a standard concept in heuristic search which is used to thus pathmax is used in the same way as in the single objective search model , but for .
time constraint
in master data , the time constraint is a definite feature of the infotype or subtype .
well-established technique
non-formal language
incidence matrix
in mathematics , an incidence matrix is a matrix that shows the relationship in this case the incidence matrix is also a biadjacency matrix of the levi .
logical expert system
target domain
target domain is source domain -- this is the basic formula for metaphor
free variable
a free variable is defined as an input variable that has not yet been assigned a standard deviation .
decision tree pruning
decision tree pruning is a process of replacing sub - trees with leaves to reduce the size of the decision tree while retaining and hopefully increasing the .
representation language
simulation of intelligence
query answering
query answering is a direct , simple retrieval of data or knowledge from the knowledge - rich database
pattern mining
pattern mining is the task of finding existing patterns in data .
robotic network
a robotic network is a group of robotic agents moving in space and endowed with communication capabilities .
logical assertion
a logical assertion is a statement that asserts that a certain premise is true , and is useful for statements in proof .
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.
data path
kl-one
kl-one is a well known knowledge representation system in the tradition of semantic networks and frames .
shape
a shape is the state of health
recommender system
taxonomy
taxonomy is a branch of biological science involved with classifying organisms based on characteristics they share in common .
graphical cluster validation technique
semi-supervised classification
semi-supervised classification is a special form of classification .
axiomatic definition
depth-limited search
depth-limited search is dfs with an imposed maximum path depth cutoff .
functioning
mathematical statement
binary decision diagram
a binary decision diagram is a concise representation of the shannon decom - position of a boolean function ( ) .
model state evolution
incremental search
incremental search is the search method in firefox and chrome , vc + + , emacs and eclipse
context-free grammar
a context-free grammar is a generative model denoted by a 4-tuple : g = ( ) where : α is a terminal alphabet , ( ) .
constructive induction
mixed inference
current-best-hypothesis search
natural number
in mathematics , a natural number is either a positive integer ( ) or a non-negative integer ( ) .
parsing algorithm
worst case analysis
cross-indexing
domain-specific search engine
search approach
role hierarchy
turning video communication
clustering method
horn sentence
a horn sentence is a conjunction of a set of horn clauses .
commitment protocol
recognition program
tokenization
tokenization is the process of using an unrelated string of numbers and\ or letters to represent and access securely stored credit card information so that the .
psychology
a psychology is the study of the human mind .
definite clause grammar
definite clause grammar is a convenient rewriting system with an arrow .
pure inductive inference
alpha-beta pruning
alpha-beta pruning is a search algorithm which seeks to reduce the number of nodes alpha-beta pruning is a sound optimization in that it does not change the .
modal logic
modal logic is a form of reasoning that allows us to qualify the truth of a judgment in our system .
probabilistic inference
approximately correct hypothesis
an approximately correct hypothesis is therefore the hypothesis that has the probability of error bounded by a small positive constant ε .
uninterrupted string
prepositional syntax logic
feature selection
feature selection is the process of selecting a subset of the terms occurring in the training set and using only this subset as features in text classification .
consideration
pattern matching
pattern matching is fundamental to languages such as haskell , scala pattern matching is , at least in haskell , deeply tied to the concept of .
metaphor
a metaphor is a comparison between two things as if they were the same .
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 .
rewriting system
correspondence theory
cluster ensemble
cluster ensemble is the estimation of the probabilities p with which data points belong to the combined clusters .
covariance function
real-time ai
analytical expression
in mathematics , an analytical expression is a mathematical expression , constructed using well-known operations that lend themselves readily to calculation .
formalization planning
inference relation
an inference relation is a relation between existing knowledge and the .
situated agent
a situated agent is basically a software agent that has the sole purpose of performing design actions .
graph algorithm
a graph algorithm is an algorithm ( ) that takes one or more graphs as inputs .
leak node
a leak node is a source in the graph added as an extra input to a node in order to represent a possible unknown cause .
most technique
partially observable markov decision problem
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 .
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 .
model-free method
image processing
forward-chaining agent
quantum theory
a quantum theory is a physical theory that certain properties occur only in discrete amounts
optimality of a search algorithm
implication rule
formally , an implication rule is an expression of the form furthermore , let us assume that this implication rule is valid only in a certain .
recursive algorithm
stationarity in pac learning
dynamic logic
dynamic logic is a language for specifying programming languages and gives a the original work on dynamic logic is by pratt ( ) and by harel .
comparison
a comparison is an evaluation of the similarities and differences of one or more things relative to some other or each-other .
chart
a chart is a data structure used in parsing . it consists of a collection of active arcs
generalization hierarchy
a generalization hierarchy is a form of abstraction that specifies that two or more entities that share common attributes can be generalized into a higher-level .
jacquard loom
a jacquard loom is a mechanical loom , used to weave complex textile patterns .
customary method
knowledge-based program
a knowledge-based program is a program with explicit tests for knowledge .
reading sign
compression
a compression is a data files are often compressed to take up less network bandwidth , memory etc.
intractability
a intractability is the state of being intractable
markov decision
bayesian learning
bayesian learning is the process of determining probability distributions over each dataset 's possible values given the gold standard .
heuristic rule
a heuristic rule is a commonsense rule intended to increase the probability of solving some problem .
dependency graph
a dependency graph is essentially a directed graph of org .
input string
nonmonotonic logic
nonmonotonic logic is a branch of logic that has been developed to model situations with incomplete information .
atomic event
informally , an atomic event is a happening ( ) to which each web site ( ) may decide .
stimulus
cleaning robot
scheme
in mathematics , a scheme is an important concept connecting the fields of algebraic geometry , commutative algebra and number theory .
key word
key word is one of the slowest search selections .
empirical evaluation
stochastic matrix
a stochastic matrix is a matrix having the property that the entries in each column are non-negative , real and sum to 1 .
constraint propagation
constraint propagation is the process of applying constraints to either pin solution cell values or eliminate solution cell candidate values .
photometry
photometry is the branch of science that deals with the measurement of light intensity .
local search
local search is any search aimed at finding something within a specific local search is seeking information online with the intention of .
pseudo-code
pseudo-code is a non-formal language , a way to create a logical the big plus of the pseudo-code is that the application logic can be easily .
geometric invariant
process of filtering
text corpus
text corpus is an important knowledge source of it .
knuth-bendix algorithm
subordinate clause
a subordinate clause is a dependent clause that adds some extra information to the main clause .
intelligent room
smoothing technique
system of communication
ambiguous sentence
multiattribute utility
protection interval
temporal differencing
temporal differencing is an efficient model-free method that saves on storage space since no model of the environment is explicitly stored .
derivational morphology
physical system
bug
a bug is a fault or defect in a computer program , system , or machine .
categorization task
tag tree-adjoining grammar
universal quantifier
universal quantifier is a logical operator of predicate logic , written all , which makes it possible to express that all entities in the .
expressive power
expressive power is the motivation for designing new planning languages .
class probability
class probability is closer to the theoretical probability .
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 .
entity