abstraction entity
state function STATE is a function of the entire contents of its memory .
event abstraction
act,action,activity event
knowledge abstraction
communication abstraction
structure node STRUCTURE is the new node .
record data value a RECORD is a set of related data values in a.
data value value
node record A NODE is a record used to build linked data structures such as trees , linked lists , and computer-based representations of graphs .
code communication
value state a VALUE is the state of an object .
knowledge domain,knowledge base,domain knowledge
relation abstraction
source code code CORE ONTOLOGY
source source code a SOURCE is a source code .
function act,action,activity
function relation a FUNCTION is a relation in which each element of the domain is associated with exactly one element of the codomain .
function source FUNCTION can be a source of error .
system abstraction
property abstraction
path sequence a PATH is a single sequence of choices that could be made by a nondeterministic machine . .
space state a SPACE is the state of mind one is in when daydreaming .
sequence structure a SEQUENCE is the primary structure of a biopolymer .
metric system system CORE ONTOLOGY
si metric system a SI is a complete metric system of units of measurement for scientists .
state si STATE is si and the previous joint action is ( ) .
procedure,process act,action,activity
program space a PROGRAM is a mathematical space related to computer TARGETming . .
representation knowledge
quality property
expression communication
directed acyclic graph tree a DIRECTED ACYCLIC GRAPH is a tree if it satisfies the following properties : there is one and only one vertex ( ) , which no edges enter .
tree structure a TREE is any structure or construct having branches akin to .
neural network network a NEURAL NETWORK is any network of neurons or nuclei that function together to perform some function in the body .
network directed acyclic graph NETWORK is a directed acyclic graph ( ) .
methodology,method knowledge domain,knowledge base,domain
quantity,measure abstraction
model,framework representation
search care SEARCH in and\ or graphs is able to take care of loops .
concept property
network path NETWORK is now path consistent .
segment path a SEGMENT is a straight path between two points that is the shortest distance between them .
software program 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 .
value expression In computer science , a VALUE is an expression which can not be evaluated any further .
value quality a VALUE is the quality that renders something desirable or valuable .
technique,technology,approach knowledge domain,knowledge base,domain
operator segment a OPERATOR is a segment of DNA regulating the activity of genes .
data,information abstraction
tree program TREE is a program available for Unix and Unix-like systems .
instrumentality entity
device instrumentality
care state a CARE is the state of being cared for by others .
path function a PATH is a continuous function .
logic philosophy a LOGIC is the branch of philosophy that analyzes inference .
string database a STRING is a database and web resource of known and predicted protein-protein interactions .
node representation a NODE is the representation of a computational device in the Unified Modeling Language .
node device a NODE is a device attached to a computer network or other telecommunications network , such as a computer or router , or a point in a network topology at which lines intersect or branch .
circuit path a CIRCUIT is an enclosed path of an electric current , usually designed for a certain function .
database software program a DATABASE is a software program for storing , retrieving and manipulating a database ( ) .
statement instruction a STATEMENT is an instruction in a computer program .
algorithm procedure,process
amount quantity,measure
structure model,framework
inquiry search a INQUIRY is a search for truth , information , or knowledge
philosophy inquiry a PHILOSOPHY is an inquiry into the nature of things based on logical reasoning rather than empirical methods . ( ) ( ) .
directed graph 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 .
discipline,study,field of study knowledge domain,knowledge base,domain
degree amount a DEGREE is the amount that an entity possesses a certain property
network node A NETWORK is node , arc , and path consistent iff all its nodes , arcs and paths are consistent .
program data,information
neural network circuit a NEURAL NETWORK is a circuit composed of a very large number of simple processing elements that are neurally based .
rule degree RULE is the degree of consistency for the rule .
constraint path A CONSTRAINT is a path used to specify that particular function symbols must appear at particular places in a term .
feature concept A FEATURE is a concept applied to several fields of linguistics , typically involving the assignment of or unary conditions which act as constraints .
alphanumeric string string
symbol alphanumeric string A SYMBOL is an alphanumeric string headed by .
data structure knowledge domain,knowledge base,domain
application program a APPLICATION is a program that gives a computer instructions that provide the user with tools to accomplish a task .
connected network network
first-order logic first-order predicate calculus FIRST-ORDER LOGIC refers to first-order predicate calculus wherein facts may be expressed as a combination of a functor and an argument .
equation state a EQUATION is a state of being essentially equal or equivalent .
vector methodology,method
ability quality
instruction act,action,activity
instruction code a INSTRUCTION is a line of code written as part of a computer program .
construct concept a CONSTRUCT is a concept or model .
graph construct a GRAPH is a construct that consists of many nodes connected with edges .
graph system a GRAPH is a conservative system a dynamical system that preserves the volume of its state space under motion and , therefore , does not display the types of behavior found in dissipative systems . .
graph data structure In computer science , a GRAPH is an abstract data structure that is meant to implement the graph and hypergraph concepts from mathematics .
statement code a STATEMENT is a line of code written as part of a computer program .
environment affine a ENVIRONMENT is an affine an equation that can be written in terms of matrix-vector multiplication and vector addition . .
affine equation a AFFINE is an equation that can be written in terms of matrix-vector multiplication and vector addition . .
variable symbol a VARIABLE is a symbol that is used in mathematical or logical expressions to represent a variable quantity .
directed acyclic graph directed 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 .
distribution probability distribution a DISTRIBUTION is a probability distribution
assertion statement a ASSERTION is a statement in a program asserting a condition expected to be true at a particular point , used in debugging .
sequence succession a SEQUENCE is a succession of geological events .
succession act,action,activity
equation assertion a EQUATION is an assertion that two expressions are equal , expressed by writing the two expressions separated by an equal sign
constraint equation CONSTRAINT is a linear equation in the field with two elements ) .
theorem statement 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 .
context constraint a CONTEXT is the relevant constraints of the communicative situation that influence language use , language variation and discourse .
path vector Finally , PATH is a vector of dependency arcs , path = ( ) , where l is the length of the path and arci ( ) satisfies arc1 .
line path a LINE is a path through two or more points
theory knowledge domain,knowledge base,domain
partitioned semantic network semantic network
notation character a NOTATION is a system of characters , symbols , or abbreviated expressions used in an art or science or in mathematics or logic to express technical facts or quantities .
first-order predicate calculus predicate calculus
evaluation determination a EVALUATION is a determination of the value of a variable or expression .
selection operator 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
probability distribution graph a PROBABILITY DISTRIBUTION is a graph , table , or formula that gives the probability for each value of the random variable .
phenomenon procedure,process
development state a DEVELOPMENT is a state in which things are improving .
machine learning computer science MACHINE LEARNING is a branch of computer science that is concerned with designing systems that can learn from the provided input .
logic principle a LOGIC is the study of the principles and criteria of valid inference and demonstration .
integer data type In computer science , the term INTEGER is used to refer to a data type which represents some finite subset of the mathematical integers .
determination state a DETERMINATION is the state of decision
network digraph a NETWORK is a type of digraph in graph theory .
digraph directed graph a DIGRAPH is a directed graph .
inference reasoning process a INFERENCE is a reasoning process by which a new premise is derived from one or more given premises .
reasoning process procedure,process
care act,action,activity
sample space space
character function In mathematics , a CHARACTER is a special kind of function from a group to a field .
essence feature a ESSENCE is a significant feature of something .
principle essence a PRINCIPLE is a fundamental essence , particularly one producing a given quality .
principle rule a PRINCIPLE is a rule or law concerning a natural phenomenon or the function of a complex system .
sentence theorem SENTENCE is a theorem .
curve line a CURVE is a line on a graph representing data .
sentence sample space SENTENCE is based on a sample space of points .
operator function In physics , an OPERATOR is a function acting on the space of physical states .
support vector machine neural network SUPPORT VECTOR MACHINE is a kind of neural network that optimally classifies measured data based on kernel method which is very popular in neural network technologies .
neural network expressiveness neural network
feed-forward neural network neural network
boltzmann machine neural network BOLTZMANN MACHINE is a neural network whose units ( ) have stochastic input-output functions .
associative memory neural network ASSOCIATIVE MEMORY is a major class of neural networks with a wide range of applications , such as content-addressable memory and pattern recognition .
multilayer network neural network a MULTILAYER NETWORK is a kind of neural network which consists of one or the multilayer network is the basis for backpropagation network .
recurrent neural network neural network a RECURRENT NEURAL NETWORK is a neural network where the connections between the units form a directed cycle .
connectionism neural network CONNECTIONISM is the study of artificial neural networks .
neural network efficiency neural network
multilayer neural network neural network
neuron neural network a NEURON is a see neural network , also mcculloch-pitts .
length feature In phonetics , LENGTH or quantity is a feature of sounds that are distinctively longer than other sounds .
disjunction operator a DISJUNCTION is a logical operator that results in true when some of its operands are true .
tree length TREE is the length of its longest branch .
decision-making method methodology,method
calculus decision-making method a CALCULUS is a decision-making method , especially one appropriate for a specialised realm .
markov chain belief network a MARKOV CHAIN is a special sort of belief network used to represent sequences of values , such as the sequence of states in a dynamic system or the sequence of .
grammar structure 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 .
classification association a CLASSIFICATION is an association of an input vector with a particular target vector . .
application computer program a APPLICATION is a computer program or the set of software that the end user perceives as a single entity as a tool for a well-defined purpose . .
belief network directed acyclic graph a BELIEF NETWORK is a directed acyclic graph containing a set of nodes , a set of arcs and a probabilistic inference in a belief network is the task of computing a.
computer program expression a COMPUTER PROGRAM is the expression of an algorithm in a particular programming language .
computer program algorithm 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 .
reasoning inference a REASONING is the act of using inference to lead to a conclusion based on existing knowledge and\ or data . .
science discipline,study,field of study
environment eigenvalue a ENVIRONMENT is an eigenvalue the change in length that occurs when the corresponding eigenvector is multiplied by its matrix . .
process of breaking procedure,process
analysis calculus a ANALYSIS is a branch of mathematics involving calculus and the theory of limits .
analysis process of breaking a ANALYSIS is the process of breaking down a substance into its constituent parts , or the result of this process .
analysis technique,technology,approach
formula statement a FORMULA is a conventionalized statement expressing some fundamental principle .
probability state a PROBABILITY is the state of being probable
belief quality a BELIEF is the quality or state of believing .
first-order logic semantics first-order logic
horn logic first-order logic HORN LOGIC is a certain subset of first-order logic ( ) , namely the subset that results when only horn formulas are used .
first-order probabilistic logic first-order logic FIRST-ORDER PROBABILISTIC LOGIC is a first-order logic that associates a real-valued parameter to every predicate .
database data,information
probabilistic first-order logic first-order logic
architecture structure a ARCHITECTURE is the structure and organization of a computer 's hardware or system software , or of the communication services , hardware , and software supporting a network . .
finite state machine circuit a FINITE STATE MACHINE is a digital circuit whose output is dependent not only on nevertheless , the concept of finite state machine is useful in software design as .
latent perceptron perceptron
constraint state a CONSTRAINT is the state of being physically constrained .
perceptron network a PERCEPTRON is a network of such elements .
network of relation network
multiply connected network connected network
sensor network network a SENSOR NETWORK is a network that is composed of a collection of sensor node ( ) , normally , a sensor network is used to do a certain task such .
singly connected network connected network
dynamic decision network network
conceptual graph network a CONCEPTUAL GRAPH is a semantic network where graph nodes represent concepts and graph edges represent semantic relations .
multi-agent system connected network MULTI-AGENT SYSTEM is a loosely connected network of intelligent , which are fundamental element of multi-agent system is an intelligent agent .
semantic network network a SEMANTIC NETWORK is a network which has been built ( ) to represent the semantic relations among words to derive .
adaptive network network an ADAPTIVE NETWORK is network of nodes and directional links .
hopfield network network HOPFIELD NETWORK is a dynamic network , which iterates to converge from an the fully connected hopfield network is shown in following figure .
checking web application 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 .
generalization inference rule In mathematical logic , GENERALIZATION is an inference rule of predicate calculus .
i-dt decision tree decision tree
decision tree expressiveness decision tree
emergent property phenomenon an EMERGENT PROPERTY is an unexpected collective phenomenon that arises from a system consisting of interacting parts .
operation state a OPERATION is the state of being in effect or being operative .
first-order logic logic FIRST-ORDER LOGIC is a system of symbolic logic that can be attributed largely to the work of gottlob frege .
intelligence emergent property INTELLIGENCE is an emergent property .
intelligence ability a INTELLIGENCE is the ability to comprehend .
first-order predicate calculus logic FIRST-ORDER PREDICATE CALCULUS is a logic that extends propositional calculus to include atoms with function symbols and logical variables .
inference rule intelligence INFERENCE RULE refers to intelligence that ties concepts together .
predicate calculus logic 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 .
being state a BEING is the state or fact of existing .
application domain context 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 .
grammar induction inductive logic programming GRAMMAR INDUCTION is a subset of inductive logic programming ( ) , and as such , have primarily depended on ilp techniques .
eigenvalue function EIGENVALUE is a function , right .
morphological context context
phonological context context
philosophy discipline,study,field of study
process of making procedure,process
philosophy belief a PHILOSOPHY is any personal belief about how to live or how to deal with a situation .
partially observable markov decision problem markov decision problem
markov decision problem markov chain a MARKOV DECISION PROBLEM is a markov chain with the addition of an action model and a performance criterion .
hidden markov model markov chain a HIDDEN MARKOV MODEL is a markov chain for which the state is only .
inductive learning supervised learning INDUCTIVE LEARNING is a form of supervised learning in which a system tries to .
predicate operator a PREDICATE is an operator or function that returns either true or false .
language communication
attribute quality a ATTRIBUTE is a characteristic or quality of a thing .
map function a MAP is a continuous function .
data type classification In computer programming , a DATA TYPE is a classification identifying one of various types of data , such as floating-point , integer , or Boolean , that determines the possible values for that type
heuristic function a HEURISTIC is a function that , when applied to a state , returns a number that is an in other words , the heuristic is telling us , that it thinks a solution might be .
logic reasoning a LOGIC is a system of reasoning .
comparison evaluation a COMPARISON is an evaluation of the similarities and differences of one or more things relative to some other or each-other .
data type value a DATA TYPE is a set of possible values , together with all the operations that know how to deal with those values .
bayesian network directed acyclic graph a BAYESIAN NETWORK is a directed acyclic graph that represents a probability .
polynomial function function a POLYNOMIAL FUNCTION is any function whose value is the solution of a polynomial .
machine learning development MACHINE LEARNING is concerned with the development of computer-based statistical procedures for finding patterns and dependencies in large volumes of data .
association state a ASSOCIATION is the state of being connected together as in memory or imagination .
ontology structure a ONTOLOGY is a structure of concepts or entity within a domain , organized by relationships
semantic string a SEMANTIC is a string attached to a shader .
table methodology,method
mapping process of making a MAPPING is the process of making maps .
power notation a POWER is a mathematical notation indicating the number of times a quantity is multiplied by itself .
package,software,software system code
proposition formula PROPOSITION is equivalent to the formula in question .
time polynomial function TIME is a polynomial function of abstraction size .
constraint condition In mathematics , a CONSTRAINT is a condition that a solution to an optimization problem must satisfy .
dynamic conditional random field conditional random field
design plan a DESIGN is a plan for the structure and functions of an artifact , building or system .
memory time a MEMORY is the time within which past events can be or are remembered .
q-learning reinforcement learning Q-LEARNING is a specific kind of reinforcement learning that assigns values to state - action pairs .
person entity
parameter value a PARAMETER is the value which is passed into the function to instantiate such a name
graphical model distribution a GRAPHICAL MODEL is a family of distributions that is restricted to be markov with respect to a certain graph .
mechanism knowledge domain,knowledge base,domain
semantic memory SEMANTIC is memory for facts .
derivation tree A DERIVATION is a tree with each node n labeled by a type assignment q~(n ) ( ) and by a set ( ) of type assignments giving the assumptions of ~(n ) .
axiom proposition 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 .
equation correction a EQUATION is a small correction to observed values to remove the effects of systematic errors in an observation .
generation aggregate a GENERATION is the aggregate of the functions and phenomena which attend reproduction .
cost value a COST is a value measured by what must be given or done or undergone to obtain something .
decision tree tree a DECISION TREE is a tree in which each non-leaf node has associated with it an attribute , each leaf node has associated with it a classification , and each arc has associated with it one of the possible values of the attribute at the node where the arc is directed from .
bound value a BOUND is a value which is known to be greater or smaller than a given set of values .
aggregate analysis a AGGREGATE is an analysis , a technique used in amortized analysis in computer science , especially in analysis of algorithm .
binary tree tree a BINARY TREE is a tree in which every node has exactly two links i. a binary tree is made of nodes , where each node contains a " .
correction quantity,measure
result distribution RESULT is the distribution of coalition values .
mechanism theory a MECHANISM is the philosophical theory that all phenomena can be explained in terms of physical or biological causes .
grammar formalism constraint GRAMMAR FORMALISM is described as a constraint - .
plan representation A PLAN is the internal representation or set of beliefs about how a particular goal may be achieved .
plan act,action,activity
influence diagram bayesian network now-a-days , an INFLUENCE DIAGRAM is a bayesian network extended with utility an influence diagram is solved by computing a strategy yielding the highest .
logic programming constraint constraint
unary constraint constraint a UNARY CONSTRAINT is simply a constraint over a single variable
soft global constraint constraint
cryptarithmetic problem constraint CRYPTARITHMETIC PROBLEM is an interesting constraint .
theorem expression a THEOREM is a syntactically correct expression that is deducible from the given axioms of a deductive system .
causal network bayesian 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.
functional dependency constraint a FUNCTIONAL DEPENDENCY is defined as a constraint between two sets of attributes in a relation from a database .
domain constraint unary 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 .
temporal constraint constraint a TEMPORAL CONSTRAINT is an atomic constraint if it is a fluent literal .
binary constraint constraint a BINARY CONSTRAINT is a constraint on at most two variables , and a binary constraint graph corresponds to a set of binary constraints .
disjoint subset subset
resolution state a RESOLUTION is the state of being resolute .
computer science computing COMPUTER SCIENCE is the science of computing .
array variable an ARRAY is a variable containing multiple values .
robot mechanism a ROBOT is a mechanism that can move automatically .
subset predicate SUBSET are predicates
motion state a MOTION is a state of change .
agent incorrect information AGENT is using incorrect information about the world .
incorrect information data,information
sorting algorithm comparison a SORTING ALGORITHM is comparison based if it uses comparison operators to find the order between two numbers .
computer science principle COMPUTER SCIENCE is the study of principles , applications , and technologies of computing and computers .
computation simulated annealing a COMPUTATION is a simulated annealing a partially random method of search and optimization usually used for combinatorial optimization problems .
anaphor predicate predicate
guarded horn clause horn clause
service function a SERVICE is a function that is provided by one program or machine for another .
dynamic belief network belief network
semi-supervised feature selection feature selection
context sentence CONTEXT are the sentences containing constraints or background information to the question , while answer are that provide solutions .
application expression a APPLICATION is an expression that normally refers to software designed for a specific use such as a word processor . .
temporal constraint disjunction TEMPORAL CONSTRAINT is a disjunction of basic allen primitives , in the probabilistic disjunctive temporal constraint is given a probability , rather than assigning a.
horn clause disjunction a HORN CLAUSE is a disjunction of literals , among which there is at most one positive a de nite horn clause is a horn clause having exactly one positive literal .
competitive ratio performance measure COMPETITIVE RATIO is a performance measure designed to quantify the ability of an algorithm a will be called strongly competitive if its competitive ratio is within a.
disjunction of literal disjunction
deterministic selection fitness-based selection DETERMINISTIC SELECTION is a fitness-based selection , whereby an individual is so , if deterministic selection is used , in each generation , each individual can .
slowest search selection selection
feature selection selection FEATURE SELECTION refers to the selection of an optimum subset of features derived from these input variables .
probability distribution table a PROBABILITY DISTRIBUTION is a table or an equation that links each outcome of a statistical this probability distribution is called the uniform distribution .
probability distribution concept a PROBABILITY DISTRIBUTION is a theoretical concept and many such distributions can be expressed mathematically .
key word slowest search selection KEY WORD is one of the slowest search selections .
heap selection selection
fitness-based selection selection
web application 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 .
power state a POWER is a state powerful enough to influence events throughout the world .
belief network probability formally , a BELIEF NETWORK is a set of probability .
first-order logic axiom a FIRST-ORDER LOGIC is a set of logical axioms and formal inference rules for a first - order language .
situation state a SITUATION is the general state of things .
research development RESEARCH is the development of anytime csg algorithms .
predicate calculus notation a PREDICATE CALCULUS is a notation for representing logical statements which goes beyond propositional calculus in certain ways . .
retrieval operation a RETRIEVAL is the operation of accessing data , either from memory or from a storage device .
control regulation a CONTROL is a regulation or maintenance of a function or action or reflex etc.
selection evaluation SELECTION is the evaluation of an element from the knowledge base .
speedup learning machine learning SPEEDUP LEARNING is a branch of machine learning that studies learning mech - anisms for speeding up problem solvers based on problem solving experience .
semi-supervised learning machine learning SEMI-SUPERVISED LEARNING is a field of machine learning that studies learning from both labeled and unlabeled examples .
reinforcement learning machine learning REINFORCEMENT LEARNING is an area of machine learning which addresses how an autonomous agent can learn long-term successful behavior through interaction with its environment .
support vector machine machine learning SUPPORT VECTOR MACHINE is a new machine learning tech - nique based on the statistical learning theory .
case-based reasoning machine learning CASE-BASED REASONING ( ) is a form of machine learning that uses examples .
inductive logic programming machine learning 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 - .
supervised learning machine 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 .
unsupervised learning machine learning UNSUPERVISED LEARNING is a method of machine learning whereby the algorithm is presented with examples from the input space only and a model is fit to these .
explanation-based learning machine learning EXPLANATION-BASED LEARNING is a branch of machine learning in which prior knowledge of the world is integrated into the process of automatically forming new .
causal graph deterministic finite automaton a CAUSAL GRAPH is a deterministic finite automaton ( ) where states are е equivalence classes , and transitions correspond to actions .
moving process of leaving a MOVING is the process of leaving one dwelling and settling in another .
paradigm model,framework
mathematics science a MATHEMATICS is a science dealing with the logic of quantity and shape and arrangement .
scholarly knowledge knowledge CORE ONTOLOGY
performance measure search node PERFORMANCE MEASURE was search nodes .
learning scholarly knowledge a LEARNING is a profound scholarly knowledge .
process of leaving procedure,process
free variable input a FREE VARIABLE is defined as an input variable that has not yet been assigned a standard deviation .
clause expression a CLAUSE is an expression including a subject and predicate but not constituting a complete sentence .
capacity power a CAPACITY is the power to learn or retain knowledge .
user input input
decision problem partitioning a DECISION PROBLEM is a partitioning of a under some desired properties .
translation moving In Euclidean geometry , a TRANSLATION is moving every point a constant distance in a specified direction .
standardized procedure procedure,process
character attribute a CHARACTER is an attribute that is determined by a gene or group of genes .
deterministic finite automaton finite state machine a DETERMINISTIC FINITE AUTOMATON is a finite state machine where for each pair of state and input symbol there is one and only one transition to a next state .
markov model finite state machine A MARKOV MODEL is a finite state machine with probabilities governing transitions between states and controlling the emission of output symbols .
resolution analysis a RESOLUTION is an analysis into clear-cut components .
hidden markov model markov model a HIDDEN MARKOV MODEL is a statistical markov model in which the system being modeled is assumed to be a markov process with unobserved states .
character person
augmented transition network finite state machine AUGMENTED TRANSITION NETWORK is a finite state machine with variables nodes transitions variables structure of a node name : unique identifier .
partitioning analysis a PARTITIONING is an analysis into mutually exclusive categories .
ai computer virus AI is a computer virus which infects .
test standardized procedure a TEST is any standardized procedure for measuring sensitivity or memory or intelligence or aptitude or personality etc.
planning act,action,activity
connection state a CONNECTION is the state of being connected .
operator mapping An OPERATOR is a mapping from one vector space or module to another .
inference rule rule an INFERENCE RULE is a rule for obtaining a new formula ( ) from a set of a most famous inference rule is modus ponens : -LCB- a , not a or b -RCB- .
operation manner a OPERATION is a process or manner of functioning or operating .
expert system software program a EXPERT SYSTEM is a software program or set of software programs designed to rapidly process data without human intervention . .
size state a SIZE is the actual state of affairs .
factorization resolution a FACTORIZATION is the resolution of an entity into factors such that when multiplied together they give the original entity .
computer virus program 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 .
dynamic programming gradient descent so DYNAMIC PROGRAMMING is also gradient descent ? hmm , i do n't think so , though dynamic programming is frequently used for optimization .
process of formulating procedure,process
planning process of formulating PLANNING is the process of formulating an intended course of action .
operator expression an OPERATOR is a expression (
applicable operator operator
minimum proof graph proof graph
op strips operator operator
abstract operator operator
precision-recall curve curve
deliberate ambiguity operator DELIBERATE AMBIGUITY is a perfectly valid operator , even simpler than that of qsf .
expansion operator operator
silhouette curve curve a SILHOUETTE CURVE is a curve on the surface of the model separating the the silhouette curve is traced by stepping the parametric coordinate of the .
linking curve curve thus , a LINKING CURVE is simply a curve that passes through the axes of the manipulator in order .
dropping condition operator DROPPING CONDITION is an genetic operator for rule learning , to avoid subsumed rules .
program synthesis derivation PROGRAM SYNTHESIS is the systematic derivation of a program from a given a deductive approach to program synthesis is presented for the construction of .
training curve curve
existential quantifier operator EXISTENTIAL QUANTIFIER is a logical operator of predicate logic , written thereis , which makes it possible to express that at least one .
universal quantifier operator UNIVERSAL QUANTIFIER is a logical operator of predicate logic , written all , which makes it possible to express that all entities in the .
theorem proving derivation THEOREM PROVING is the systematic derivation of a mathematical proof from a set of axioms by the use of rules of inference .
logical symbol operator LOGICAL SYMBOL is the operator # .
primitive operator operator a PRIMITIVE OPERATOR is an operator that may be referenced in the definition of a hierarchical operator , but whose definition is not provided within the scope of the .
refinement operator operator
causal graph directed acyclic 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 .
machine learning intelligence MACHINE LEARNING is the subfield of artificial intelligence that is concerned with the design and development of algorithms that allow computers to improve their performance over time based on data , such as from sensor data or databases .
arrangement structure a ARRANGEMENT is an organized structure for arranging or classifying .
proof graph directed acyclic graph a PROOF GRAPH is a directed acyclic graph .
web connectivity a WEB is the connectivity or resources available to computer users . .
template structure 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 .
qualitative probabilistic network directed acyclic graph a QUALITATIVE PROBABILISTIC NETWORK is a directed acyclic graph whose nodes represent random variables and whose edges represent the dependencies between .
computing procedure,process
machine learning design MACHINE LEARNING is concerned with the design and analysis of algorithms that enable computers to automatically find patterns in the data .
decomposition analysis a DECOMPOSITION is the analysis of a vector field .
decision determination a DECISION is a determination of future action . .
computing discipline,study,field of study
task representation a TASK is a symbolic representation of an activity .
polytree directed acyclic graph a POLYTREE is a directed acyclic graph with the property that ignoring the directions on edges yields a graph with no undirected cycles .
dependency analysis directed acyclic graph a DEPENDENCY ANALYSIS is an directed acyclic graph where the words correspond to nodes and depen - dencies to edges .
decision tree arrangement a DECISION TREE is an arrangement of tests that provides an appropriate classification at every step in an analysis .
dependency tree directed acyclic graph a DEPENDENCY TREE is a directed acyclic graph in which all the words in a sentence are connected together by grammatical relations .
substring string 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 .
predicate sentence 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 .
task procedure,process
variable quantity,measure
bsp tree binary tree a BSP TREE is just a binary tree plus the partition that separates both children .
determination quality a DETERMINATION is the quality of being determined to do or achieve something .
derivational morphology morphology
magnitude vector a MAGNITUDE is an of a vector , the norm , most commonly , the two-norm .
formalism computational paradigm a FORMALISM is one of several alternative computational paradigms for a given theory .
determination act,action,activity
circuit device a CIRCUIT is an electrical device that provides a path for electrical current to flow . .
binary space partition binary tree 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 .
computational paradigm paradigm
simulated annealing generalization SIMULATED ANNEALING is a generalization of a monte carlo method for examining the equations of state and frozen states of n-body systems .
conjunction state a CONJUNCTION is the state of being joined together .
undirected graph node 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 .
regulation state a REGULATION is the state of being controlled or governed .
bayesian network graphical model BAYESIAN NETWORK is a graphical model appropriated to represent and to analyze uncertainty , knowledge and beliefs contained implicitly in the data .
cutset vertex 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 .
formula rule a FORMULA is any mathematical rule expressed symbolically .
information retrieval retrieval INFORMATION RETRIEVAL is the study of ranked retrieval of data items based on a natural query .
posterior probability 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 .
predicate calculus generalization PREDICATE CALCULUS is a generalization of propositional calculus .
effect state a EFFECT is the state of being binding and enforceable , as in a rule , policy , or law .
vertex node a VERTEX is a node in a graph .
input array INPUT is an array of intensity values from the camera image .
formula expression a FORMULA is a syntactic expression of a proposition , built up from quantifiers , logical connectives , variables , relation and operation symbols , and , depending on the type of logic , possibly other operators such as modal , temporal , deontic or epistemic ones .
notation act,action,activity
search strategy plan 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 .
decision tree node a DECISION TREE is a connected set of nodes that begins at a root node and ends at one or more leaf nodes .
data mining application DATA MINING refers to the application of algorithms for extracting patterns from data without the additional steps of the kdd process .
digital circuit circuit a DIGITAL CIRCUIT is a circuit that functions on a number of different logic gates .
pattern model,framework
justification statement a JUSTIFICATION is a statement in explanation of some action or belief .
argumentation tree tree
fibonacci heap tree FIBONACCI HEAP is a collection of many trees .
semantic tree tree a SEMANTIC TREE is an ordered tree with nodes labeled with relation and concept names .
epipolar line line
sentence translation SENTENCE ( ) is an acceptable translation of ( ) , but ( ) does not mean the same thing as ( ) .
distance amount a DISTANCE is a considerable amount of space .
feedforward circuit circuit
integer linear programming linear programming
decomposition tree 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 .
state-space search search
search graph tree SEARCH GRAPH is a tree the solution may not be optimal .
sigmoid belief network binary dag a SIGMOID BELIEF NETWORK is a binary dag , with .
interaction graph tree INTERACTION GRAPH is a tree .
link connection a LINK is a physical connection between two nodes in a network .
bottom-up dynamic programming self-constructed test tree BOTTOM-UP DYNAMIC PROGRAMMING is a self-constructed test tree , the algorithm has exponential storage and computational complexity of o ( ) (
searching search a SEARCHING is a search
self-constructed test tree tree
supervised learning data mining a SUPERVISED LEARNING is a class of data mining and machine learning applications and techniques where the system builds a model based on the prediction of a well defined prediction field .
feature extraction tree FEATURE EXTRACTION is a complex mathematical tree that would separate blood cells based on their physical features including the nucleus to cytoplasmic ratio , diameter and density .
minimum spanning tree 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 .
gaussian computational chemistry software program 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 .
pattern property A PATTERN is a property of the system , namely , the property of a subset of these stuctural relations holding .
constraint graph tree CONSTRAINT GRAPH is a tree .
web application software program a WEB APPLICATION is a software program which the user accesses with a web browser .
distance property a DISTANCE is the property created by the space between two objects or points .
spanning tree tree a SPANNING TREE is a tree with v − 1 edges , i.e. a tree that connects all the vertices .
binary heap tree a BINARY HEAP is a tree with keys and associated values that satisfies the heap codition : the key of every node is greater than or equal to the key of its parent , if it .
inductive logic programming data mining INDUCTIVE LOGIC PROGRAMMING is one of data mining 's more powerful techniques because it allows both data .
feed-forward network combinational circuit a FEED-FORWARD NETWORK is a special case of combinational circuits , with the additional feature that the intermediate variables in the network can assume non - .
metric function a METRIC is a function of a topological space that gives , for any two points in the space , a value equal to the distance between them .
computational chemistry software program software program
dialectical tree tree
binary dag dag
utility software program a UTILITY is a software program specifically designed to help manage and tune the computer hardware , operating system or application software , and perform a single task or a small range of tasks
dag tree DAG is a tree , otherwise we may call it dag-like for emphasis .
explanation justification an EXPLANATION is a justification of the system 's beliefs .
abstraction hierarchy tree 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.
assumption statement a ASSUMPTION is a statement that is assumed to be true and from which a conclusion can be drawn .
orthogonal line line
entity tree tree
model tree tree MODEL TREE is the tree of preprocessing operators to be applied to the test \ execution data .
combinational circuit circuit
search node path a SEARCH NODE is a path from state x to the start state ( ) .
access path data path ACCESS PATH is internal to file and data path is external to it .
relaxed problem admissible heuristic RELAXED PROBLEM is an admissible heuristic for the original problem .
process of bringing procedure,process
euclidean distance integer EUCLIDEAN DISTANCE is an integer with bounded magnitude and precision .
electronic circuit path 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 .
qualified existential restriction existential restriction
computer science algorithm 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 .
condition clause a CONDITION is a logical clause or phrase that a conditional statement uses . the phrase can either be true or false .
natural number integer in mathematics , a NATURAL NUMBER is either a positive integer ( ) or a non-negative integer ( ) .
computer science theory COMPUTER SCIENCE is the study of the theory , design , implementation , and the primary professional society for computer science is the association for .
default reasoning knowledge representation DEFAULT REASONING is a method of knowledge representation and reasoning which allows one in this paper we describe why default reasoning is difficult , .
reasoning task instance checking REASONING TASK is also called instance checking .
pattern matching checking in computer science , PATTERN MATCHING is the act of checking some sequence of tokens for the presence of the constituents of some pattern .
semantic network knowledge representation a SEMANTIC NETWORK is a form of knowledge representation .
shortest path path a SHORTEST PATH is any path who 's path weight is equal to the shortest path weight .
computer science model,framework
priority queue data type A PRIORITY QUEUE is an abstract data type in computer programming .
kolmogorov complexity integer so KOLMOGOROV COMPLEXITY is an integer defined up to a constant ! but the .
existential restriction path an EXISTENTIAL RESTRICTION is a path to a variable node in the ed tree
condition data,information
transit path path a TRANSIT PATH is a path of the robot when it is not grasping the object .
transfer path path
computer science discipline,study,field of study
condition test a CONDITION is a comparative test between user-defined values and the actual values of a session request .
epistemic logic modal logic EPISTEMIC LOGIC is a modal logic used to reason about information , including have , because epistemic logic is suited to deal with situations involving more than .
root node root ROOT NODE is the root of the tree .
number theory integer NUMBER THEORY is the study of integers only .
line segment segment
certainty factor integer a CERTAINTY FACTOR is an integer in the range from -100 ( ) to +100 ( ) .
generalization attribute a GENERALIZATION is an attribute of a network whose output for a new input vector tends to be close to outputs for similar input vectors in its training set . .
symbolic planning checking SYMBOLIC PLANNING is based on checking the satisfiability of formulas ( ) .
data path path
content-based image retrieval image retrieval
segment of discourse segment
instance checking checking
static environment environment
episodic environment environment
flow of information capacity a FLOW OF INFORMATION is the capacity to extract information of temporary value out of events and to distribute it widely and quickly .
virtual environment environment
deterministic environment environment
domain-specific search engine search engine
eigenvalue embedding 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 . .
definition act,action,activity
definition source Therefore , a DEFINITION is a promising source for LR relations between the defined concept and the definition terms .
vacuum world simulation environment VACUUM WORLD is a simple simulation environment used to introduce some concepts in artificial intelligence ( ) , but can also be .
bounded optimality capacity BOUNDED OPTIMALITY is the capacity to generate maximally successful behavior given the available information and computational resources .
vacuum environment environment
multiattribute utility utility
node utility utility
image retrieval information retrieval IMAGE RETRIEVAL is an extension to traditional information retrieval .
autonomous driving environment AUTONOMOUS DRIVING is essentially a continuous environment sensing applications producing continuous sensor data that needs to be integrated by .
simulation environment environment
question answering information retrieval QUESTION ANSWERING is a specialised form of information retrieval .
semidynamic environment environment
environment package,software,software system
artificial environment environment
normalized utility utility
dynamic environment environment
embedding methodology,method
continuous environment environment
discrete environment environment
nonepisodic environment environment
curve map a CURVE is a continuous map from a one-dimensional space to a multidimensional space .
boolean function boolean expression a BOOLEAN FUNCTION is a specific boolean expression .
sensor model value a SENSOR MODEL is a set of values , typically held within a lookup table , which governs how the probability of an uncertain measurement taken from a particular .
conditional random field logistic regression CONDITIONAL RANDOM FIELD is a kind of logistic regression .
multiattribute utility theory utility theory
finite state machine state a FINITE STATE MACHINE is a set of states , one of which is the starting state .
place situation a PLACE is a particular situation .
causal semantic semantic
heuristic rule 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 .
function symbol symbol
gradient descent search strategy GRADIENT DESCENT is a search strategy used in continuous search spaces .
compositional semantic semantic
stationary sensor model sensor model
probabilistic sensor model sensor model
heuristic technique,technology,approach
depth-first search best-first search DEPTH-FIRST SEARCH is a special case of best-first search .
place space a PLACE is a space reserved for sitting
logical semantic semantic
probability knowledge PROBABILITY is a way of expressing knowledge or belief that an event will occur or has occurred .
intersective semantic semantic
graphical model probabilistic model a GRAPHICAL MODEL is a probabilistic model for which a graph denotes the conditional independence structure between random variables .
linear input resolution input resolution
hypothesis explanation A HYPOTHESIS is a proposed explanation for a phenomenon .
ratio magnitude a RATIO is the relative magnitudes of two quantities .
manner degree a MANNER is a certain degree or measure
markov chain value a MARKOV CHAIN is a sequence of random values whose probabilities at a time interval depends upon the value of the number at the previous .
complexity quantity,measure
compound statement statement a COMPOUND STATEMENT is a sequence of simple statements . .
knowledge representation notation a KNOWLEDGE REPRESENTATION is the notation or formalism used for coding the knowledge to be stored in a knowledge-based system . .
interpretation semantic semantic
probability mathematics PROBABILITY is the branch of mathematics that studies the possible outcomes of given events together with the outcomes ' relative likelihoods and .
data type definition a DATA TYPE is a definition of the data .
agent-based software engineering software engineering
model-based reasoning semantic 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 .
consequence phenomenon a CONSEQUENCE is a phenomenon that follows and is caused by some previous phenomenon .
disjunction state a DISJUNCTION is a state of being disconnected .
heuristic methodology,method
range substring RANGE is the longest final substring in brange that matches a word-final substring in the diction- ary .
diagram graph a DIAGRAM is a graph or chart .
union value In computer science , a UNION is a value that may have any of several representations or formats
utility service a UTILITY is the service provided by a public utility .
customary method methodology,method
extension inference rule EXTENSION and reduction are sound inference rules .
boolean expression statement a BOOLEAN EXPRESSION is a logical statement that is either true or false .
recognition state a RECOGNITION is the state or quality of being recognized or acknowledged .
manner customary method a MANNER is a customary method of acting
probability event a PROBABILITY is an event that is likely to occur .
probability quantity,measure
mainstay support a MAINSTAY is a chief support .
high-level ontology ontology
brain computational power power
perceptron representational power power
time quantity,measure
augmented transition network recursive 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 .
target ontology ontology
search algorithm rule a SEARCH ALGORITHM is a set of predetermined rules that control how a search engine works .
markov network undirected graph a MARKOV NETWORK is an undirected graph g = ( ) of these random variables together with a set of functions on the spaces induced by variables underlying the .
semantic network ontology a SEMANTIC NETWORK is an ontology that is representable as a graph .
accurate prediction prediction
asynchronous conversation 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 .
general ontology high-level ontology GENERAL ONTOLOGY is a high-level ontology which captures general features of basic contextual entities .
dominance power a DOMINANCE is the power or right to give orders or make decisions .
full power power
conditional random field undirected graph a CONDITIONAL RANDOM FIELD is an undirected graph h whose nodes correspond to xuy
reductio ad absurdum argument in formal logic , the REDUCTIO AD ABSURDUM is actually a legitimate argument , but it is often applied fallaciously .
search algorithm algorithm CORE ONTOLOGY
cross-validation mainstay CROSS-VALIDATION is a mainstay for measuring performance and progress in machine learning .
source ontology 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 .
neural network procedure,process
mereology logic 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 .
training set example character a TRAINING SET is a set of example characters from which a neural network learns to recognize a font during font training . .
boolean logic boolean algebra a BOOLEAN LOGIC is a see boolean algebra . ( ) .
assignment mapping An ASSIGNMENT is a mapping ~ of variables to the elements of some feature alge- bra .
operation act,action,activity
boolean algebra logic a BOOLEAN ALGEBRA is a system of symbolic logic devised by George Boole .
computer algorithm algorithm CORE ONTOLOGY
logical syntax logic 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 .
confirmation theory logic CONFIRMATION THEORY is the study of the logic by which scientific hypotheses may be confirmed or disconfirmed ( ) by evidence .
real-time ai ai
time complexity size TIME COMPLEXITY is proportional to the size of a traversed tree .
bucket sort sorting algorithm BUCKET SORT is a sorting algorithm that works by inserting the elements of the sorting array intro buckets , then , each bucket is sorted individually .
recursively enumerable grammar grammar
open planning architecture architecture
functional programming logic FUNCTIONAL PROGRAMMING is based on logic and could be a basis for logic on its own .
agent architecture architecture
good old-fashioned ai ai
boolean variable place a BOOLEAN VARIABLE is a place in memory where a boolean value may be stored .
closure resolution resolution
input training set INPUT : is the training set .
percept sequence sequence
dynamic logic logic DYNAMIC LOGIC is a logic of actions .
real-time architecture architecture
fastest sorting algorithm sorting algorithm
non-monotonic logic logic A NON-MONOTONIC LOGIC is a formal logic whose consequence relation is not monotonic .
prepositional semantics logic logic
sequence of token sequence
definite clause grammar grammar a DEFINITE CLAUSE GRAMMAR is a way of expressing grammar , either for natural or formal languages , in a logic programming language such as prolog .
sign character a SIGN is a character indicating a relation between quantities .
formal grammar grammar a FORMAL GRAMMAR is a precisely defined grammar , typically used for computer programming languages .
combinational logic 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 .
heap sort fastest sorting algorithm HEAP SORT is one of the fastest sorting algorithms , rivaling such speed-demons as quicksort and mergesort .
acyclic circuit combinational logic an ACYCLIC CIRCUIT is called combinational logic .
matrix factorization factorization specifically , MATRIX FACTORIZATION is the factorization of the latent factor model of n users and m items with a sparse matrix of ratings each user .
model theory logic 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 .
polytree architecture a POLYTREE is an architecture whose underlying undirected graph is a tree ) .
sequence of word sequence
tree-adjoining grammar grammar
hash table lookup 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 .
nonmonotonic logic logic NONMONOTONIC LOGIC is a branch of logic that has been developed to model situations with incomplete information .
actor architecture architecture
prediction sequence sequence
sensor model gaussian SENSOR MODEL is gaussian ... each belief function is uniquely characterized by its mean m and covariance matrix
notation logic logic
input resolution resolution an INPUT RESOLUTION is a resolution in which one of the two parent clauses is an in - put clause .
backward chaining logic BACKWARD CHAINING is a system of logic used by artificial intelligence systems .
combinatory logic logic COMBINATORY LOGIC is a branch of mathematical logic that analyzes certain processes , such as substitution , which are associated with variables .
fuzzy logic logic basically , FUZZY LOGIC is a precise logic of in this paper , fuzzy logic is viewed in a nonstandard nontraditional view of fuzzy logic is that of precisiation .
proof of theorem factorization 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 .
utility theory decision analysis 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 .
source language default in yii , the SOURCE LANGUAGE is default to the application source language while the target language is default to the application language .
generalized logic logic
compiler program a COMPILER is a program that converts another program written in one programming language into another programming language while retaining the semantics specified by the original program .
higher-order logic logic HIGHER-ORDER LOGIC is the logic of quantification over propositional functions , functions whose range consists of propositions .
autoepistemic logic nonmonotonic 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 .
prepositional logic generalized logic PREPOSITIONAL LOGIC is a generalized logic that includes all possible values between 0 and 1 .
example character character
semantic web place in essence , the SEMANTIC WEB is a place where machines can read web pages much as we humans read them , a place where search engines .
linear resolution resolution
software agent program a SOFTWARE AGENT is a program which autonomously acts on behalf of its principal , while carrying out complex information and communication tasks that have .
linear classification place LINEAR CLASSIFICATION is the obvious first place to start , owing to its long history in pattern recognition and its suitability for small-sample classification .
propositional logic logic PROPOSITIONAL LOGIC is the logic of compound statements -- statements that are made propositional logic is one main branch of what is known as symbolic logic .
multistratal grammar grammar
algorithm resolution resolution
default logic non-monotonic logic DEFAULT LOGIC is a non-monotonic logic proposed by raymond reiter to formalize reasoning with default assumptions .
evolutionary programming ai EVOLUTIONARY PROGRAMMING is a branch of ai where the principles of darwinian evolution are used to evolve a modeling process to solve a.
merge sort sorting algorithm 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 .
two-valued logic logic TWO-VALUED LOGIC is the basic logic utilized by humankind since the beginning of language .
language model grammar a LANGUAGE MODEL is a kind of grammar in a speech recognition system .
terminological logic logic
pronoun resolution resolution
training sequence sequence
monotonicity of a logic logic
tag tree-adjoining grammar tree-adjoining grammar
logic of relevance logic
quick sort sorting algorithm QUICK SORT is a well-known sorting algorithm developed by c. a. r. hoare that , on average , makes o ( ) ( ) comparisons to sort n items .
derivative formula a DERIVATIVE is basically a formula for finding the slope of a curve .
modal logic logic MODAL LOGIC is a form of logic which adds to the classical mechanisms of formal logic operators to deal with musical modes , such as major , .
prepositional syntax logic logic
synapse connection a SYNAPSE is the connection between processing elements in a neural network . .
operation procedure,process
pathfinder re-targetable query compiler 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 .
partition structure a PARTITION is a vertical structure that divides or separates
machine learning computer algorithm MACHINE LEARNING is the study of computer algorithms that improve automatically through experience .
boolean function map a BOOLEAN FUNCTION is a map f : bn → b , for some positive integer n called the arity of f. because we only discuss boolean functions , we refer to them simply as .
node structure structure
data mining algorithm algorithm CORE ONTOLOGY
predicate logic sentence sentence
complex structure a COMPLEX is a whole structure made up of interconnected or related structures .
syntactic parsing structure SYNTACTIC PARSING is concerned with assigning grammatical structure to sentences by computer .
machine learning discipline,study,field of study
social network structure a SOCIAL NETWORK is a social structure made up of individuals ( ) called `` nodes '' , which are tied ( ) by one or more specific types of .
resource source a RESOURCE is a source of aid or support that may be drawn upon when needed .
incomplete information decision rule INCOMPLETE INFORMATION is the decision rule , rather than the actual decision or incomplete information is wilson ( ) .2 wilson 's concept of efficiency is defined .
arbitrary first-order sentence first-order sentence
lexical item structure LEXICAL ITEM is a conceptual structure that has been built up and is being built up by its different uses in different situations .
conceptual graph structure a CONCEPTUAL GRAPH is a structure that depicts factual information about a simple conceptual graph is a 3-tuple sg = ( ) where : • s = ( ) is a.
matrix table a MATRIX is a table of data .
subsumption architecture structure until today , SUBSUMPTION ARCHITECTURE is the basic structure for robots and applied ai , not only in those helpful little creatures whose intelligence is limited to .
domain theory structure DOMAIN THEORY is the study of such structures .
hierarchical organization structure A HIERARCHICAL ORGANIZATION is an organizational structure where every entity in the organization , except one , is subordinate to a single other entity .
conversation complex CONVERSATION is a complex , highly context-dependent , behavioral phenomenon .
knowledge map structure 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 .
software architecture structure The SOFTWARE ARCHITECTURE of a system is the set of structures needed to reason about the system , which comprise software elements , relations among them , and properties of both .
tactile sensor structure TACTILE SENSOR is the sandwiched structure that the cncs were inserted between .
priority queue structure a PRIORITY QUEUE is a structure in which regardless of the order of who arrived first , some additional piece of data ( ) has an affect on .
first-order sentence sentence
dynamic system structure 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 .
logical expert system expert system
re-targetable query compiler compiler
problem frame template a PROBLEM FRAME is a template that arranges and describes phenomena in the problem space , whereas a pattern maps forces to a solution in .
signal bolt a SIGNAL is a bolt out of the blue
association data mining algorithm a ASSOCIATION is a category of data mining algorithm that establishes relationships about items that occur together in a given record . .
metalevel reasoning expert system expert system
analytic sentence sentence
propositional sentence sentence
machine learning system MACHINE LEARNING refers to a system capable of acquiring and integrating the knowledge automatically .
semantic network structure a SEMANTIC NETWORK is the most basic structure upon which an identification tree ( ) is based .
predicate type boolean function a PREDICATE TYPE is an arbitrary boolean function supplied by the flux programmer that is applied to the node 's output .
parity function boolean 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 .
medical expert system expert system
generalized phrase structure phrase structure
machine learning methodology,method
case base structure a CASE BASE is a structure where the cases are stored .
algorithm template template
nondeterministic polynomial time polynomial time
basic action theory sentence 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 .
quantified sentence sentence
derived sentence sentence
model checking structure MODEL CHECKING is based on the structure m = ( ) of a labeled state transition graph where .
resource ability a RESOURCE is the ability to deal resourcefully with unusual problems .
b-tree structure a B-TREE is an efficient structure for data sorting , storage and retrieval on direct access storage devices such as magnetic disk .
machine learning science a MACHINE LEARNING is a field of science and technology concerned with building machines that learn .
disjunction compound statement a DISJUNCTION is a compound statement formed by combining two statements using the word or .
representation of knowledge hierarchical organization a popular structural REPRESENTATION OF KNOWLEDGE is hierarchical organization , typically seen in classifications or thesauri , which may be depicted as a graph .
step function cost function a STEP FUNCTION is a cost function in which the .
pattern matching compiler PATTERN MATCHING is the compiler 's ability to compare both the form and the content of two expressions .
discrimination net structure a DISCRIMINATION NET is a tries structure , that is , a tree structure specially conceived for searching patterns , like for example strings -- see the file .
phrase structure structure PHRASE STRUCTURE is a syntactic structure in which phrases are basic and explicit rather than derived and implicit , as in dependency grammar .
epistemic structure structure
direct graph node structure a DIRECT GRAPH is used to describe the node structure in simulation .
ambiguous sentence sentence
natural language expert system expert system
cryptarithmetic problem constraint satisfaction problem CRYPTARITHMETIC PROBLEM is an interesting constraint satisfaction problem for which different algorithms have been given .
logical sentence sentence
support structure a SUPPORT is a supporting structure that holds up or provides a foundation .
g-set structure a G-SET is a structure , where is a group , such that .
intensional predicate predicate logic sentence an INTENSIONAL PREDICATE is a predicate logic sentence that is defined by a set of clauses .
human decision maker decision maker
computer system system CORE ONTOLOGY
structure of discourse structure
cell decomposition partition a CELL DECOMPOSITION is a special kind of partition .
nonterminal symbol structure a NONTERMINAL SYMBOL is the structure that the parser recognizes .
association process of bringing a ASSOCIATION is the process of bringing ideas or events together in memory or imagination .
conditional entropy conditional probability CONDITIONAL ENTROPY is defined as a conditional probability of a class , y , given a value , v , for an attribute ( ) , x. it is defined as .
constraint satisfaction problem structure a CONSTRAINT SATISFACTION PROBLEM is a structure ( ) where .
syntax structure a SYNTAX is the study of the structure of phrases , sentences and language .
machine learning technique,technology,approach
service act,action,activity
morphology structure MORPHOLOGY is the study of the structure and form of words in language or a language , including inflection , derivation , and the formation of compounds .
observation sentence sentence
qualitative calculus structure QUALITATIVE CALCULUS is a cognitive structure that develops or evolves in ways a ( ) qualitative calculus is defined by a non-empty finite set of .
analog web ANALOG is a free web log analysis software program that runs under Windows , Mac OS , Linux , and most Unix-like operating systems .
logical formula structure a LOGICAL FORMULA is a structure or a set of structures put together with `` and `` s , `` or `` s , and `` not `` s. .
machine learning concept MACHINE LEARNING is a broad concept that applies to any artificial intelligence program that has the ability to self-modify .
majority function boolean function MAJORITY FUNCTION is a boolean function , which takes a number n of binary inputs and returns the value which is most common among them .
boltzmann machine graphical model a BOLTZMANN MACHINE is a graphical model which in which every node is % connected to all other nodes , except to itself .
bound computation computation
conjunctive probability probability
metareasoning application 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 .
web mining application WEB MINING is the application of data mining techniques to the content , structure , and means that web mining is of invaluable help in the transformation from .
pattern matching application PATTERN MATCHING is the application of analytical rules to a block of data to identify a feature of that block of data .
scoring function equation in essence , a SCORING FUNCTION is an equation that relates measurable descriptors of binding to ligand receptor affinity .
setting state a SETTING is the state of the environment in which a situation exists .
natural language probability NATURAL LANGUAGE is used to describe probability , it is highly probable that errors will be introduced into the assessment of risk .
process of identifying procedure,process
learning rate parameter LEARNING RATE is one of the parameters which governs how fast a neural network learns and how effective the training is .
certainty factor probability CERTAINTY FACTOR is neither a probability nor a truth value .
search node node a SEARCH NODE is a node in the search tree .
proof tree application a PROOF TREE is a set of applications of inference rules , arranged as a tree with a goal at the root .
lookup table array a LOOKUP TABLE is an array that helps to find data very quickly .
initialization parameter parameter
conditioning cutset cutset
partial regression equation equation
computational biology application COMPUTATIONAL BIOLOGY is the application of computational tools ( ) to automatically ex - tract information and\ or patterns directly from .
sampling rate parameter SAMPLING RATE is the parameter that determines much of the quality of an audio sample .
medium state a MEDIUM is a state that is intermediate between extremes .
computer vision computer science COMPUTER VISION is the branch of computer science concerned with the analysis of images to extract information about the world .
probabilistic network graphical model a PROBABILISTIC NETWORK is a graphical model of a probability distribution over a collection of stochastic variables ( ) and is used for solving .
best-first search search algorithm BEST-FIRST SEARCH is a search algorithm which optimizes breadth-first search by expanding the most promising node chosen according to some rule .
temporal-difference equation equation
cross-correlation operation CROSS-CORRELATION is a mathematical operation that is used to quantify the similarity of two functions for of cross-correlation is very similar to that of convolution .
query answering retrieval QUERY ANSWERING is a direct , simple retrieval of data or knowledge from the knowledge - rich database
probabilistic model technique,technology,approach
matrix multiplication operation MATRIX MULTIPLICATION is a very useful operation in mathematics , matrix multiplication is the operation by which one matrix is .
abstract algebra operation ABSTRACT ALGEBRA is the study of operations , their properties , and the structures that support them .
shape state a SHAPE is the state of health
confidence interval range in statistics , the CONFIDENCE INTERVAL is the range that a population parameter is likely to fall into , for a given probability .
parameterized random variable random variable
priority queue application a PRIORITY QUEUE is a useful application of the heap sort algorithm .
configuration space space in classical mechanics , the CONFIGURATION SPACE is the space of possible positions that a physical system may attain , possibly subject to external constraints .
leak node node a LEAK NODE is simply an extra node that is added to the parent set of a noisy-or or a. noisy-and node .
probabilistic model formalism a PROBABILISTIC MODEL is any formalism to specify a complex probability distribution .
prediction model parameter a PREDICTION is a model parameters can be estimated from prior data .
expanded node 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 space a ROOM is a space '' for '' something , or '' to '' carry out an activity . .
convolution operation CONVOLUTION is a formal mathematical operation , just as multiplication , convolution is used in the mathematics of many fields , such as probability and statistics .
recursive transition network transition network A RECURSIVE TRANSITION NETWORK is a set of transition networks in which the arcs of one network may also be labeled with the names of other networks
machine translation application MACHINE TRANSLATION is the application of computers to the translation of texts from one natural language into another .
artificial intelligence computer science ARTIFICIAL INTELLIGENCE is a branch of computer science that makes the computers capable enough to perform complex tasks , i. artificial intelligence is concerned with the attempt to develop computer programs that will be capable of performing difficult cognitive tasks .
decision node control DECISION NODE is a control node that accepts tokens on one or two incoming edges and selects the notation for a decision node is a diamond-shaped symbol .
probability density probability PROBABILITY DENSITY is probability per unit independent variable , and that : with continuous variables , the probability corresponding to some exact value (
logical implication operation LOGICAL IMPLICATION is an operation on two logical values , typically the values of two propositions , that produces a value of false just in case the .
semantic space euclidean space SEMANTIC SPACE is an Euclidean space where words and entities are put .
conditioning bounded cutset cutset
primitive operator node a PRIMITIVE OPERATOR is a node in the composite operator that takes one or two real numbers , performs a simple operation on them and outputs the result .
decision maker application DECISION MAKER is an application for building and evaluating decision analytic models , or `` decision ( ) trees '' .
prior probability posterior probability PRIOR PROBABILITY is posterior probability μ after the update prior probability μ to ... kind of probability density function .
conditional random field time complexity CONDITIONAL RANDOM FIELD is the comparatively high time complexity for training .
polynomial time time complexity a POLYNOMIAL TIME is a time complexity which is bounded by some polynomial .
expert system computer program a EXPERT SYSTEM is a computer program that mimics the judgment of experts by following sets of chemical-specific knowledge rules derived from measured toxicity data and knowledge of how chemicals cause toxicity in animals and humans .
application of machine learning application
constraint network node a CONSTRAINT NETWORK is a series of nodes linked by constraints .
longitudinal control control
root node a ROOT is the single node of a tree that has no parent .
transition network node A TRANSITION NETWORK is a set of nodes ( ) and a set of directed arcs between the nodes , labeled with symbols from the language
text categorization application TEXT CATEGORIZATION is an important application of machine learning to the field of document information retrieval .
object recognition brain OBJECT RECOGNITION is the brain 's ability to recall an object 's shape and properties .
memory ability a MEMORY is the ability of an organism to record information about things or events with the facility of recalling them later at will .
isa link node ISA LINK is the a node .
vector of probability probability
equivalence class node an EQUIVALENCE CLASS is a set of nodes related by an equivalence relation , which must be reflexive , symmetric , and transitive .
regularization parameter parameter a REGULARIZATION PARAMETER is a parameter used in some non linear iterative methods to suppress undesired solutions , by penalizing those with very high .
leaf node node a LEAF NODE is any node in the treeview s nodes collection that has no child nodes
logical equivalence node LOGICAL EQUIVALENCE refers to nodes that are functionally equivalent , such as all the inputs of a look-up table .
unit resolution application UNIT RESOLUTION is an application of resolution , where one clause is a unit clause also called boolean constraint propagation .
binary relation sort 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. (
markov network graphical model MARKOV NETWORK is a graphical model commonly used in the statistical machine a markov network is defined by a three-tuple : m = ( ) , where v is a set of .
linked list node a LINKED LIST is a sequence of nodes .
linear equation 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 .
real-world application application
theory of computing computer science 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 range 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 .
cooperative computation computation
symbolic differentiation operation in mathematics , SYMBOLIC DIFFERENTIATION is an operation that converts a given arithmetic expression into another arithmetic expression called the derivative .
reactive planning application REACTIVE PLANNING is increasingly becoming applications because it has all the features of a domain , where reactive planning is necessary : 1 ) the agent ( the .
active vision control ACTIVE VISION is the control of the optics and the mechanical structure of cameras to simplify the processing for computer vision .
text computing TEXT means computing a consistent knowledge base .
inductive logic application INDUCTIVE LOGIC is simply the application of probability theory to inductive reasoning .
qualitative probabilistic network graphical model a QUALITATIVE PROBABILISTIC NETWORK is a graphical model of the probabilistic influences among a set of statistical variables , in which each influence is associated .
process of constructing procedure,process
software engineering application a SOFTWARE ENGINEERING is the application of a systematic , disciplined , quantifiable approach to the development , operation , and maintenance of software , and the study of these approaches . that is the application of engineering to software .
application of decision analysis application
terminal node node a TERMINAL NODE is a node with no edges .
artificial intelligence application application
edge detection operation EDGE DETECTION is one of the fundamental operations in computer vision with numerous .
deterministic node 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 .
case-based planning application CASE-BASED PLANNING is the application of the cbr methodology to planning , and as such , it is planning as remembering ( ) .
test goal node 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 .
order state a ORDER is the state of being well arranged .
parent node node a PARENT NODE is any node in the treeview control 's node collection that has .
sensor network array a SENSOR NETWORK is an array of autonomous sensors that communicate with each the main objective of a sensor network is to collect field data from a target .
analysis of algorithm computer science ANALYSIS OF ALGORITHM is a field of computer science that is dedicated to understanding the complexity of algorithms .
regression state a REGRESSION is an abnormal state in which development has stopped prematurely .
computational complexity computer science COMPUTATIONAL COMPLEXITY is the subfield of computer science that rigorously studies the intrinsic difficulty of computational problems .
similarity computation computation
optimization design a OPTIMIZATION is the design and operation of a system or process to make it as good as possible in some defined sense .
model parameter parameter
classification problem posterior probability CLASSIFICATION PROBLEM is exactly the posterior probability .
conditional probability probability a CONDITIONAL PROBABILITY refers to the probability of observing an event a given that you have observed a separate event b. the computer system refers to the component mapping to identify components that are to be configured to implement the received application instructions .
adjoining grammar leaf node ADJOINING GRAMMAR is either a leaf node ( ) or binary branching .
proof theorem PROOF is based on theorem 2.2 .
application of artificial intelligence application
knowledge representation medium a KNOWLEDGE REPRESENTATION is a medium for human expression .
mathematical model equation a MATHEMATICAL MODEL is an equation or a set of equations in which letter represent a mathematical model is often an idealization of the real world situation if .
admissible heuristic node ADMISSIBLE HEURISTIC is unable to prune many nodes .
fuzzy logic application FUZZY LOGIC is simply an application of recognized statistical techniques .
stochastic game optimal control STOCHASTIC GAME is equivalent to the optimal control of a mdp without future reward discount .
least mean square initialization parameter LEAST MEAN SQUARE is sensitive to initialization parameters .
modell of computation computation
ray tracing application 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 .
linear programming application LINEAR PROGRAMMING is one of the main applications of mathematics used in business and the social sciences .
bellman equation equation
decision tree diagram a DECISION TREE is a diagram that a decision maker can create to help select the best of several alternative courses of action .
computer virus computer program a COMPUTER VIRUS is a potentially damaging computer program that infects a computer and negatively affects the way the computer works without the user 's knowledge or permission . .
class probability probability CLASS PROBABILITY is closer to the theoretical probability .
optimal control control
online cost iterative cost ONLINE COST is the iterative cost , which arises from computations involving the modified the online cost is constituted by the parts of eq .
resolution quality a RESOLUTION is the quality of an X-ray crystallography data set .
resolution expression a RESOLUTION is a formal expression by a meeting .
cost function derivative COST FUNCTION is the derivative of ( ) the average cost function .
photogrammetry cost PHOTOGRAMMETRY is a cost efficient surveying method for mapping large areas .
strategy science a STRATEGY is the branch of military science dealing with military command and the planning and conduct of a war .
argument variable a ARGUMENT is a variable in a logical or mathematical expression whose value determines the dependent variable .
conventional sign sign a CONVENTIONAL SIGN is a standard sign used on a map to indicate a particular feature .
multiset variable variable a MULTISET VARIABLE is a variable that will be assigned to a multiset of integer values .
randomization variable RANDOMIZATION is a multiple instrumental variable in the sense that one randomization deﬁnes the parameter of interest expressed as a function of multiple .
iterative cost cost
search cost cost a SEARCH COST is a cost that is associated with acquiring information about a product .
situated agent software agent a SITUATED AGENT is basically a software agent that has the sole purpose of performing design actions .
hidden variable variable
data fusion cost DATA FUSION is cost effective , as it requires no additional primary research , fits into existing analysis systems , and enhances existing data .
construction act,action,activity
maximum expected utility expected utility
guarded horn clause union GUARDED HORN CLAUSE is the union of the guard of the guarded atom and the guard of the original guarded horn clause .
constraint network variable a CONSTRAINT NETWORK is a collection of variables , their domains , and zero or a binary constraint network is called arc-consistent if none of the domains of its .
resolution rule a RESOLUTION is a rule of inference used for automated theorem proving .
class variable variable
construction process of constructing a CONSTRUCTION is the process of constructing .
probability density derivative in mathematics , PROBABILITY DENSITY is the derivative of the cumulative probability .
multi-agent system software agent a MULTI-AGENT SYSTEM is a system of multiple interacting software agents .
static variable variable
depth ability a DEPTH is the intellectual ability to penetrate deeply into ideas .
conjunctive query union consequently , a CONJUNCTIVE QUERY is equivalent to a union of conjunctive queries of a special kind , called terminal conjunctive queries .
metaphysics philosophy 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
optimization algorithm algorithm CORE ONTOLOGY
cross-validation comparison CROSS-VALIDATION is a comparison of validation parameters when two or more bioanalytical methods are used to generate data within the same study or across .
random variable variable a RANDOM VARIABLE is a variable that takes values according to a certain probability more formally , a random variable is a function of the sample space onto r.
latent variable variable
query variable variable
logical positivism philosophy LOGICAL POSITIVISM is a philosophy of knowledge which is both practical and theoretical .
motion act,action,activity
logical variable variable a LOGICAL VARIABLE is an independent variable which can take any value from .
map variable variable
gaussian process variable a GAUSSIAN PROCESS is a collection of random variables , any finite number of which have consistent joint gaussian distributions ( ) .
search method methodology,method
probability model model,framework
computational complexity computational cost COMPUTATIONAL COMPLEXITY is the study of the inherent computational cost ( ) of solving a problem .
reading sign sign
computational cost cost
brain computer virus a BRAIN is a computer virus .
metaphor comparison a METAPHOR is a comparison between two things as if they were the same .
grammar rule a GRAMMAR is a system of rules and principles for speaking and writing a language .
static symbol symbol
ontological engineering knowledge engineering ONTOLOGICAL ENGINEERING is a branch of knowledge engineering which uses ontology to build ontologies .
backed-up value 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 .
generative model model,framework
heuristic function gain ratio HEURISTIC FUNCTION is gain ratio .
noun phrase uninterrupted string a NOUN PHRASE is an uninterrupted string of nomina ( ) .
conditional link 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 .
input signal a INPUT is a signal going into an electronic system .
test result result
axiom belief an AXIOM is a central belief or self-evident principle .
sort algorithm a SORT is an algorithm for sorting a list of items into a particular order .
named entity text string a NAMED ENTITY is a piece of text string which refers to an entity .
training instance record a TRAINING INSTANCE is a record from a data set that is used to construct a model for classification as described herein .
admissible heuristic heuristic an ADMISSIBLE HEURISTIC is a heuristic that for every node never overestimates the actual lowest cost from the given node to a goal .
line quantity,measure
computational learning theory analog COMPUTATIONAL LEARNING THEORY is the analog of complexity analysis applied to machine learning , pattern recognition , and artificial intelligence .
extraction process of capturing 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 . .
classifier person
analog computer program a ANALOG is a computer program that analyzes log files from web servers .
result consequence A RESULT is the final consequence of a sequence of actions or events expressed qualitatively or quantitatively .
graphical model probability model GRAPHICAL MODEL is a probability model for multivariate .
kalman filtering regression KALMAN FILTERING is a linear regression .
decision tree map a DECISION TREE is a map of the reasoning process .
graph search algorithm search algorithm
semi-supervised classification classification SEMI-SUPERVISED CLASSIFICATION is a special form of classification .
taxonomy classification a TAXONOMY is a classification of organisms into groups based on similarities of structure or origin etc.
upper bound bound
derivation function In abstract algebra , a DERIVATION is a function on an algebra which generalizes certain features of the derivative operator .
field value value
comparison quality a COMPARISON is a qualities that are comparable .
computational linguistics engineering a COMPUTATIONAL LINGUISTICS is the engineering of systems that process or analyze written or spoken natural language . .
gradient descent approximation algorithm GRADIENT DESCENT is an approximation algorithm used in optimization prob - lems to .
decision making function DECISION MAKING is the primary function of management .
decision network evaluation evaluation
place equivalence relation a PLACE is an equivalence relation defined on absolute values of an integral domain or field .
ai intelligence a AI is a see artificial intelligence . ( ) .
one-shot decision decision
estimation algorithm algorithm CORE ONTOLOGY
power quantity,measure
clustering result result
abstract sensor value 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 .
symbolic differentiation analog SYMBOLIC DIFFERENTIATION is a computer aided analog to analytical differentiation employing a graph theoretical approach .
taxonomic hierarchy classification a TAXONOMIC HIERARCHY is a classification , really a hypothesis , that can be databased , that can be used as the source for a checklist , .
truth maintenance system result thus , a TRUTH MAINTENANCE SYSTEM is able to share partial results across different branches of a search space .
feature selection method evaluation FEATURE SELECTION METHOD is the evaluation of feature subsets .
simulation result result
logistic regression 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 .
interaction graph string INTERACTION GRAPH is a string the model is equivalent to linear-space non - deterministic turing machines .
equality symbol symbol
input statement a INPUT is a statement that expresses a personal opinion or belief or adds information .
christofides' heuristic heuristic
formal language string 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 .
expected utility value EXPECTED UTILITY is then the subjective value , whereas expected value is the objective value of the gamble ? right .
theoretical result result
uninterrupted string string
confidence factor numerical value CONFIDENCE FACTOR is a numerical value between 0 and .
singular value value
terminal symbol character string a TERMINAL SYMBOL is a character string such as .
error bound bound
bolt mechanism a BOLT is a mechanism used in firearms .
successor-state axiom axiom
least-constraining-value heuristic heuristic
bar code symbol a BAR CODE is a printed symbol placed on a package or an item of merchandise , consisting of vertical bars and spaces that represent information about that .
reinforcement learning heuristic REINFORCEMENT LEARNING is often a sensible heuristic because future rewards are positively correlated with recent rewards in many domains .
semantic package,software,software system
causal support analog CAUSAL SUPPORT is the analog of a prior probability , summarizing the background knowledge lending support to a belief .
time complexity function a TIME COMPLEXITY is a function that describes the amount of time required for a program to run on a computer to perform a particular task .
decomposition phenomenon a DECOMPOSITION is the organic phenomenon of rotting .
connectivity concept In mathematics and computer science , CONNECTIVITY is one of the basic concepts of graph theory .
logical constant symbol in symbolic logic , a LOGICAL CONSTANT is a symbol that has the same semantic value in all models .
connectivity ability a CONNECTIVITY is the ability to make a connection between two or more points in a network .
computational complexity bound COMPUTATIONAL COMPLEXITY is the study of bounds on the various metrics ( ) of computations executed on abstract machine models (
logical constant value a LOGICAL CONSTANT is either the logical value true or false .
beam search heuristic BEAM SEARCH is a standard heuristic for controlling complexity during viterbi decoding , but during forward-backward , standard beam heuristics can be danger - .
difference distance In geometric terms , the DIFFERENCE is a distance .
context-free grammar notation a CONTEXT-FREE GRAMMAR is a notation for describing languages .
order of magnitude value an ORDER OF MAGNITUDE is a range of values between a designated lower value and an upper value ten times as large .
logic variable bound a LOGIC VARIABLE is bound to a likely value , but this binding is tentative pending verification of the rest of the rule .
pseudo-code notation PSEUDO-CODE is notation that looks like a programming language , but that is not executable .
domination of heuristic heuristic
generative model process of growing graph 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 .
root value a ROOT is the set of values that give a true statement when substituted into an equation .
numerical value value
minimal determination determination
conceptual graph notation a CONCEPTUAL GRAPH is a notation for logic based on the existential graphs of charles sanders peirce and the semantic networks of artificial intelligence .
predicate symbol function symbol PREDICATE SYMBOL is also a function symbol .
real number value in mathematics , a REAL NUMBER is a value that represents a quantity along a continuum , such as -5 ( ) , 4\ 3 ( ) , 8.6 .
confidence interval value in regression analysis , the CONFIDENCE INTERVAL is based on a provided value of x for a given level of confidence .
chart data structure a CHART is a data structure used in parsing . it consists of a collection of active arcs
lexical pattern string generally , a LEXICAL PATTERN is a sequence of strings .
gradient descent optimization algorithm GRADIENT DESCENT is a very simple optimization algorithm and is used in many real life examples of optimization .
sequential decision problem decision a SEQUENTIAL DECISION PROBLEM is a sequence of decisions , where for each decision you should consider .
process of capturing procedure,process
monotonicity of a heuristic heuristic
evaluation function heuristic function EVALUATION FUNCTION is a heuristic function , and it is where the domain experts ' knowledge resides .
decision analysis evaluation DECISION ANALYSIS is a quantitative evaluation of the outcomes that result from a set of choices in a specific clinical situation .
text string string
greedy heuristic heuristic
expectimax value value
expectimin value value
relational database database a RELATIONAL DATABASE is a database whose records are organized into tables that can be processed by either relational algebra or relational calculus . .
data mining analysis DATA MINING is the analysis of large observational data sets with the goal of discovering unsuspected or unknown relationships .
process of growing graph procedure,process
object-oriented database database an OBJECT-ORIENTED DATABASE is a database that subscribes to a model with information represented by objects .
search engine database a SEARCH ENGINE is defined as a database of resources extracted from the web through an automated process .
neural network link link
markov decision decision
sort act,action,activity
model checking bound MODEL CHECKING is bound to be the pre-eminent source for research , teaching , model checking is a technique for verifying finite state concurrent systems such .
equivalence relation binary 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 .
logical notation notation
input string string
character string string a CHARACTER STRING is a string of any ebcdic characters ( ) that are used as a value .
conditional entropy value CONDITIONAL ENTROPY is the average value of conditional self-information .
process of finding procedure,process
uniformly weighted heuristic heuristic
acyclic graph directed graph an ACYCLIC GRAPH is a directed graph without cycles .
logic string string
certainty equivalent value 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 .
approximation algorithm estimation algorithm an APPROXIMATION ALGORITHM is an estimation algorithm that can solve an a typical example for an approximation algorithm is the one for .
path cost value PATH COST is a value assigned to each port .
knowledge engineering with uncertainty knowledge engineering
connectivity amount a CONNECTIVITY is the amount of interaction in a system , the structure of the weights in a neural network , or the relative number of edges in a graph . .
constant symbol o-ary function symbol a CONSTANT SYMBOL is a o-ary function symbol .
empirical result result
runtime variable field value a RUNTIME VARIABLE is a field value that is defined by the user at the time of running the report .
inclusion axiom axiom
wordnet database WORDNET is a lexical database that uses conceptualsemantic and lexical relations in order to group lexical items and link them to other groups ( ) .
unit preference heuristic UNIT PREFERENCE is the heuristic of prioritizing resolutions where one parent is a unit clause .
causal link link a CAUSAL LINK is a link from a chance node ( ) or a decision node to a chance node .
longest common substring substring
universal quantifier symbol in symbolic logic , the UNIVERSAL QUANTIFIER is the symbol used to denote universal quantification , and is often informally read as given any or for all .
utility computer program a UTILITY is a type of computer program that 's designed to help you manage the computer , or diagnose or fix problems . .
regular expression string a REGULAR EXPRESSION is a string that is used to describe or match a set of strings according to certain syntax rules .
default value a DEFAULT is a value used when none has been given
composite heuristic heuristic
undirected graph graph an UNDIRECTED GRAPH is a graph where the pairings representing edges are an undirected graph is considered complete if it has the maximum number of .
inconsistent heuristic heuristic
default value value a DEFAULT VALUE is a value that is auto ¬ matically displayed by the computer .
o-ary function symbol function symbol
transformation rule a TRANSFORMATION is a rule describing the conversion of one syntactic structure into another related syntactic structure .
domain closure effect effect
decision analyst program DECISION ANALYST is a program that structures logical decision-making for policy analysis .
gaussian process distribution a GAUSSIAN PROCESS is a distribution over the space of functions , which is usually de - a gaussian process is completely defined by a mean function m ( ) and .
probabilistic interpretation probability distribution PROBABILISTIC INTERPRETATION is a probability distribution over worlds .
binary search search a BINARY SEARCH is a very efficient search when you are dealing with a large table .
indexing system a INDEXING is a system used to assign indexes , such as .
parameter magnitude PARAMETER is the magnitude of the gradient .
long-term memory 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 .
intelligent agent program an INTELLIGENT AGENT is a program that models the information space for a user , and allows the user to specify how the information is to be processed .
sequential search search SEQUENTIAL SEARCH is the simplest form of search .
boyer-moore algorithm knuth-morris-pratt algorithm BOYER-MOORE ALGORITHM is superior to knuth-morris-pratt algorithms and brute force algorithms .
process of determining procedure,process
optimality search search
associative memory memory ASSOCIATIVE MEMORY is memory that is addressed through its contents .
egomotion motion EGOMOTION is defined as the motion of the observer relative to his environment and can be described by 6 parameters
audio recorder easy-to-use program AUDIO RECORDER is a small and easy-to-use program that allows you to record any sound on your computer .
knowledge effect effect
online algorithm probability distribution ONLINE ALGORITHM is a probability distribution over the deterministic algorithms , so it corresponds to a mixed strategy for the algorithm designer .
constructive induction searching so CONSTRUCTIVE INDUCTION is searching for an adequate representation .
conjunctive query conjunction a CONJUNCTIVE QUERY is a conjunction of triple patterns .
symbolic differentiation size SYMBOLIC DIFFERENTIATION is currently the big size of source code for complex distributed models , which is caused by the unrolling of complex loops .
procedural attachment program PROCEDURAL ATTACHMENT is a method of attaching programs to the data structures , such as slots in a frame ( ) , win79 ) ) .
architecture descriptive representation ARCHITECTURE is the set of descriptive representations that are required in order to create an object .
pagerank probability distribution PAGERANK is a probability distribution used to represent the likelihood that a person randomly clicking on links will arrive at any particular page .
disjunctive effect effect
general problem solver program a GENERAL PROBLEM SOLVER is a program that can produce solutions to all sorts of different problems about which it has no specific , designed-in .
sat solver program fast SAT SOLVER is an program , which solves the boolean satisfiability problem using genetic algorithm ( ) .
truth maintenance system program a TRUTH MAINTENANCE SYSTEM is a program that keeps track of dependencies between sentences so that retraction ( ) will be more .
connection process of bringing a CONNECTION is the process of bringing ideas or events together in memory or imagination .
canonical distribution entropy distribution CANONICAL DISTRIBUTION is the maximum entropy distribution for a given expected utility .
non-euclidean geometry shape a NON-EUCLIDEAN GEOMETRY is the study of shapes and constructions that do not map directly to any n-dimensional euclidean system , characterized by a non-vanishing riemann curvature tensor .
algorithmic complexity size a ALGORITHMIC COMPLEXITY is the size of the smallest program that can produce a particular sequence of numbers .
vertex elimination order order
approximation quality a APPROXIMATION is the quality of coming near to identity
kinematics motion KINEMATICS is the study of the geometrically possible motion of a body or system of bodies , without consideration of the forces involved .
parallel search search
model-based recognition search MODEL-BASED RECOGNITION is the search for consistent matches of the model and image features .
artificial agent program an ARTIFICIAL AGENT is a program that acts independently in furtherance of its user 's interests .
optical flow distribution OPTICAL FLOW is the distribution of apparent velocities of movement of brightness patterns in an yet , when it is rotated , the optical flow is zero at all points in the .
constraint satisfaction search CONSTRAINT SATISFACTION is the search for a variable assignment that satis es the .
product rule formula 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.
general search broadest search GENERAL SEARCH is the broadest search available .
execution time program • EXECUTION TIME is program dependent .
regression planning backward state-space search 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 .
mixture model distribution a MIXTURE MODEL is a collection of distributions d. in this role , the mixture model is a robust estimator .
logical query conjunction LOGICAL QUERY is defined as a conjunctions of constraints ci on a single feature ql = c1 ∧ · · · ∧ cn .
configuration space obstacle configuration space
search engine program a SEARCH ENGINE is a program that finds and lists web sites or pages that match some user-selected criteria . .
current-best-hypothesis search search
distribution of agent distribution
dependency-directed backtracking search DEPENDENCY-DIRECTED BACKTRACKING is a powerful search .
gaussian distribution distribution a GAUSSIAN DISTRIBUTION is a theoretical distribution with finite mean and variance .
excitatory synapse 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 .
acquisition tool editor ACQUISITION TOOL is an editor of sorts that provides a structured .
compliant motion motion COMPLIANT MOTION is motion which complies with constraints imposed by the geometry of the task .
order of similarity calculation order
golog program program
branch-and-bound search search BRANCH-AND-BOUND SEARCH is similar to backtrack search , except that only a subtree of the search tree must necessarily be explored .
horn sentence conjunction a HORN SENTENCE is a conjunction of a set of horn clauses .
systems program program a SYSTEMS PROGRAM is a program that controls some aspect of the operation of a computer .
rotary motion 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 .
recognition program program
basic action theory formula BASIC ACTION THEORY is a formula bounded by situation term s which does not mention pred - icate p oss and may refer to past situations through abbreviations ( ) .
constraint satisfaction search search
declarative sentence proposition A DECLARATIVE SENTENCE is a proposition - that is , something to which a truth value can be assigned .
descriptive representation representation CORE ONTOLOGY
equivalence class character an EQUIVALENCE CLASS is a set of characters that collate the same , a primary equivalence class is a set of characters whose primary sort key are all the same
transformation act,action,activity
alignment method similarity measure ALIGNMENT METHOD is based on similarity measure between the component images .
regular expression formula a REGULAR EXPRESSION is a kind of formula that specifies patterns in text strings .
blind search 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 .
normal distribution probability 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 .
parameter quantity,measure
completeness search search
sensor network size a SENSOR NETWORK is a collection of small size , low power , low - cost sensor nodes that has limited computational , communication capability and limited storage .
joint probability distribution probability distribution
basis function gaussian BASIS FUNCTION is a gaussian with diagonal covariance .
progression planning state-space search 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 .
scheme representation a SCHEME is an internal representation of the world .
behavior-based robotics robotics BEHAVIOR-BASED ROBOTICS is a branch of robotics that bridges arti cial intelligence , en - .
entropy distribution distribution
full-width search search
qbf solver software program a QBF SOLVER is a software program to solve the qbf problem .
learning algorithm algorithm CORE ONTOLOGY
engineering room a ENGINEERING is a room in which the engine is located .
boolean formula formula a BOOLEAN FORMULA is a formula of propositional logic , constructed from variables and boolean a boolean formula is satisfiable if there exists some assignment .
automaton program program
scheme chart a SCHEME is a chart or diagram of a system or object .
morphology shape a MORPHOLOGY is a shape , form , external structure , or arrangement , especially as an object of study or classification .
backtracking search state-space search BACKTRACKING SEARCH is a state-space search .
linear program program a LINEAR PROGRAM is a program that can be expressed as : maximize ( ) subject to ( ) .
target compilation language formula a TARGET COMPILATION LANGUAGE is a class of formulas which is tractable for a set of transformations and queries .
representation formalism naturalness REPRESENTATION FORMALISM is naturalness of representation .
approximation technique,technology,approach
iterative deepening searching ITERATIVE DEEPENING is a way of searching for a solution that limits the search depth .
backward state-space search state-space search
bound search search
c configuration space configuration space
easy-to-use program program
inhibitory synapse synapse
knowledge-based program program a KNOWLEDGE-BASED PROGRAM is a program with explicit tests for knowledge .
cost consequence a COST is a negative consequence or loss that occurs or is required to occur .
language model probability distribution a LANGUAGE MODEL is a probability distribution that captures the statistical regularities ( ) of natural language use ( ) .
distribution of class distribution
apparent motion motion APPARENT MOTION is a perceived motion produced by the presentation of sequential but static images containing no physically continuous motion .
transit motion motion
conditional effect effect a CONDITIONAL EFFECT is an effect of an action that depends on the value of other features .
transfer motion motion
consistency checker program 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 .
constraint propagation search CONSTRAINT PROPAGATION is essentially the search for de - terministic information that is implied but not stated explicitly in the input .
scheme concept In mathematics , a SCHEME is an important concept connecting the fields of algebraic geometry , commutative algebra and number theory .
advice taker program ADVICE TAKER is the proposed program for common-sense reasoning .
script program in computer programming , a SCRIPT is a program or sequence of instructions that is interpreted or carried out by another program rather than by the computer .
atomic sentence declarative 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 .
local search search LOCAL SEARCH is any search aimed at finding something within a specific local search is seeking information online with the intention of .
conjunctive query formula 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 .
knuth-morris-pratt algorithm searching KNUTH-MORRIS-PRATT ALGORITHM is searching the string looking for a match of the first letter of the pattern .
informed search 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 .
logic sampling program LOGIC SAMPLING is easy to program ( ) and hence it ( ) logic sampling is an anytime algorithm and can always give an .
dimensionality reduction search DIMENSIONALITY REDUCTION is the search for a small set of features to describe a large set of observed dimensions .
mathematical induction schema mathematical induction
micro-planner systems program MICRO-PLANNER is now a publically accessible systems program in the ai group systems its .
intelligent room room
broadest search search
transformational grammar language analysis TRANSFORMATIONAL GRAMMAR is a form of language analysis that establishes a relationship with the different elements in the sentence of a language and makes .
metric quantity,measure
environment simulator program an ENVIRONMENT SIMULATOR is a program that keeps track of the performance measure for each agent .
conjunctive normal form conjunction CONJUNCTIVE NORMAL FORM is a conjunction of clauses where a clause is a disjunction of literals .
iterative improvement search search
expectiminimax full-width search like minimax , EXPECTIMINIMAX is a full-width search up to a particular look-ahead depth .
editor program a EDITOR is a program designed to perform such editorial functions as rearrangement or modification or deletion of data .
input clause formula an INPUT CLAUSE is a formula of the form .
size ratio SIZE is a ratio of two sizes .
problem solving search 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 .
conjunctive normal form boolean expression CONJUNCTIVE NORMAL FORM is a boolean expression if it is expressed as the product ( ) of sums ( ) .
arbitrary first-order sentence theorem an ARBITRARY FIRST-ORDER SENTENCE is a theorem or not .
state diagram diagram a STATE DIAGRAM is a type of diagram used in computer science and related fields to describe the behavior of systems .
domain of a random variable sample space thus DOMAIN OF A RANDOM VARIABLE is the sample space of an experiment and co - domain as set of real numbers .
sensor node service 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 .
machine learning research research
control act,action,activity
iterative deepening search depth-limited search ITERATIVE DEEPENING SEARCH is depth-limited search with increasing limit .
information gain difference INFORMATION GAIN is defined as the difference between the shannon -- wiener information numbers before and after receipt of data .
detachment state a DETACHMENT is the state of being detached or disconnected
existential graph diagram an EXISTENTIAL GRAPH is a type of diagram .
array vector a ARRAY is a vector .
process of putting procedure,process
memory space space
discourse intention state a DISCOURSE INTENTION is a state of mind that one can describe in terms of domain plans , for .
incompleteness theorem theorem INCOMPLETENESS THEOREM is a theorem of classical mathematics ( )
theorem proving theorem THEOREM PROVING is defined as theorem proving in herbrand logic .
fermat's last theorem theorem
knowledge engineering task KNOWLEDGE ENGINEERING is the task of gathering and inputting information for use in knowledge engineering is a labor-intensive multi-step process .
version space space VERSION SPACE is a space of consistent hypotheses , or models with no error .
process state state
ground resolution theorem theorem
cook's theorem theorem
ontological commitment agreement 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 .
online dating website service 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 .
diameter of a state space space
constructive induction being CONSTRUCTIVE INDUCTION is also being investigated with decision trees .
ontology discipline,study,field of study
viterbi algorithm being VITERBI ALGORITHM is being widely used in many wireless and mobile communication viterbi algorithm is effective in achieving noise tolerance , but the cost is an .
automatic pilot state a AUTOMATIC PILOT is a cognitive state in which you act without self-awareness .
representation theorem theorem in mathematics , a REPRESENTATION THEOREM is a theorem that states that every abstract structure with certain properties is isomorphic to a concrete structure .
initial state state INITIAL STATE will be the state in which all the variables are unassigned .
random field generalization 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 .
human-robot interaction being HUMAN-ROBOT INTERACTION is being studied through the creation of ` socially interactive robots .
agreement state a AGREEMENT is a state whereby several parties share a view or opinion
semi-automatic metric metric
stochastic process phenomenon a STOCHASTIC PROCESS is a statistical phenomenon that evolves in time according to probabilistic laws .
top-down dynamic programming dynamic programming
tree decomposition decomposition TREE DECOMPOSITION is one of the most important decompositions in graph theory .
computation time time
feature space space in pattern recognition a FEATURE SPACE is an abstract space where each pattern sample is represented as a point in n-dimensional space .
fusion state a FUSION is the state of being combined into one body .
breadth-first search graph search algorithm In graph theory , BREADTH-FIRST SEARCH is a graph search algorithm that begins at the root node and explores all the neighboring nodes .
importance quality a IMPORTANCE is the quality of being important and worthy of note .
instance method methodology,method
hidden markov model state a HIDDEN MARKOV MODEL is a set of states with directed edges labeled with transition probabilities that indicate the probability of moving to the state at the end of the directed edge , given that one is now in the state at the start of the edge . the states are also labeled with a function which indicates the probabilities of outputting different symbols if in that state
software technique technique,technology,approach
performance measure metric a PERFORMANCE MEASURE is defined as a metric used to quantify the efficiency and \ or effectiveness of an action .
computational model model,framework
information retrieval task INFORMATION RETRIEVAL is the task of finding information .
mind ability a MIND is the ability to focus the thoughts .
space-efficient dynamic programming dynamic programming
airflow simulation simulation
surface locus a SURFACE is a the locus of an equation in a more-than-two-dimensional space .
diagram representation A DIAGRAM is a two-dimensional geometric symbolic representation of information according to some visualization technique .
tree structure data structure a TREE STRUCTURE refers to a data structure in which a set of elements , here window records , are ordered by some linear order .
analysis of gene expression research ANALYSIS OF GENE EXPRESSION is fundamental to biological research , and detection of differential expression of a gene ( ) between .
f free space space
mind knowledge a MIND is a knowledge and intellectual ability .
kl divergence metric KL DIVERGENCE is a metric that can give you something of a pseudo-distance between one distribution and another assuming they have similar .
phrase expression PHRASE is a potential referring expression .
programming language language CORE ONTOLOGY
asbestos removal service ASBESTOS REMOVAL is a very useful service because it helps to clean your place after it is razed down .
matrix factorization decomposition 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 .
boolean expression expression CORE ONTOLOGY
range distance a RANGE is the distance from a person or sensor to an object , target , emanation , or event .
computer file block 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 .
constraint logic programming generalization CONSTRAINT LOGIC PROGRAMMING is a generalization of logic programming where uni cation is replaced by constraint solving over several computation domains .
mathematical induction proof MATHEMATICAL INDUCTION is a method of mathematical proof typically used to establish that a given statement is true of all natural numbers ( ) .
sorting algorithm algorithm CORE ONTOLOGY
effect phenomenon a EFFECT is a phenomenon that follows and is caused by some previous phenomenon .
sensitivity analysis research SENSITIVITY ANALYSIS is a form of quantitative research .
automated reasoning theorem in this respect , AUTOMATED REASONING is akin to mechanical theorem .
state space space STATE SPACE is an abstract space representing possible states of a system .
knowledge engineering acquisition a KNOWLEDGE ENGINEERING is the acquisition of knowledge from a human expert or similar source and its coding in an expert system . .
mobot service MOBOT is a very unique service , and there is nothing else out there like mobot .
logicism thesis LOGICISM is the thesis that mathematics is reducible to logic , or so it is often said .
interval distance a INTERVAL is the distance between things .
simulation of world simulation
gain ratio metric GAIN RATIO is an alternative metric from quinlan 's 1986 .
sum of squared difference difference
possibility theory being POSSIBILITY THEORY is being developed as an alternative to traditional information theory .
search space space
euclidean space space EUCLIDEAN SPACE is the usual n-dimensional mathematical space , formally , for any non-negative integer n , n-dimensional euclidean space is the set rn .
absence state a ABSENCE is the state of being absent .
g activation function activation function
input text In disambiguation mode , the INPUT is the text whose sentence boundaries have not been marked up yet and need to be disambiguated .
utility space space
knowledge-based technique absence KNOWLEDGE-BASED TECHNIQUE is the absence of training .
programming language code 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 .
exhaustive decomposition decomposition
polynomial space space
knowledge representation intelligence KNOWLEDGE REPRESENTATION is a branch of artificial intelligence that provides access to a structured collection of information and a set of inference rules .
irrationality state a IRRATIONALITY is the state of being irrational .
cognitive modelling development so , COGNITIVE MODELLING is the development of computer models of cognitive processes , and the use of such models to simulate or predict human behavior .
generalized cylinder surface 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 .
expert system system an EXPERT SYSTEM is a system the development of expert system is implemented in clips .
regulation ability a REGULATION is the ability of an early embryo to continue normal development after its structure has been somehow damaged or altered .
real-time dynamic programming asynchronous 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 .
resolution completeness proof proof
compiler computer program a COMPILER is a computer program whose purpose is that of translating high-level-language statements into a form that can directly activate the computer hardware . translates a complete program before any execution . ( ) .
compilation time time
object-oriented programming research OBJECT-ORIENTED PROGRAMMING is an area of current research .
adaptive network gradient descent an ADAPTIVE NETWORK is based on the gradient descent and chain rules .
interpretation assignment An INTERPRETATION is an assignment of meaning to the symbols of a formal language .
process of converting procedure,process
base case state BASE CASE is state of the art mid 2006 .
sorting algorithm depth SORTING ALGORITHM is equal to the depth of the deepest leaf .
perceptron convergence theorem theorem
simulated annealing technique,technology,approach
classification accuracy metric CLASSIFICATION ACCURACY is widely used as a metric for evaluation of machine learning systems .
input generalization generalization
ontology system a ONTOLOGY is a logical system involving theory of classes , developed by stanislaw lesniewski .
reduction procedure,process
run time time a RUN TIME is the time during which a program is executing .
human cognition decision making HUMAN COGNITION is central to clinical decision making .
stochastic process model,framework
contingency state a CONTINGENCY is the state of being contingent on something .
cnf decomposition decomposition
cumulative learning machine learning research CUMULATIVE LEARNING is an area of machine learning research in computer science .
blackboard architecture memory space a BLACKBOARD ARCHITECTURE is a shared memory space which enables agents sending and receiving messages to be decoupled from one .
asynchronous dynamic programming dynamic programming
best-first search technique,technology,approach
default setting A DEFAULT , in computer science , refers to a setting or value automatically assigned to a software application , computer program or device , outside of user intervention .
regression recognition recognition
optical flow state 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 .
real-world setting setting
computation procedure,process
language perception state LANGUAGE PERCEPTION is identical to the l2 initial state , as predicted by the full .
parallel distributed processing distributed processing
reference system system CORE ONTOLOGY
indicator quantity,measure
simulation of intelligence simulation
bel belief about state state
reduction complexity a REDUCTION is the act of reducing complexity .
processor chip a PROCESSOR is the primary chip of the system that oversees all the other components of the system . .
intentional state state an INTENTIONAL STATE is a state which has a certain propositional content .
terminal state state
hypothesis recognition recognition
gaussian process generalization a GAUSSIAN PROCESS is a generalization of gaussian distributions where it is describing the distribution of functions .
operationality state 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 .
expansion of state state
understanding system being an UNDERSTANDING SYSTEM is being built around this model , allowing for unconstrained spoken input in a database retrieval task .
regulation act,action,activity
simulated annealing methodology,method
error difference a ERROR is the difference between a measured or calculated value and a true one .
game theory decision making GAME THEORY is the study of interactive decision making -- that is , in situations where each person 's action affects the outcome for the whole group .
feedback loop service a FEEDBACK LOOP is a service when an isp lets you know if someone of its users complains about your email .
completeness theorem theorem
markov chain stochastic process a MARKOV CHAIN is a special type of stochastic process .
intelligent action fusion INTELLIGENT ACTION is the fusion of research and activity .
replanning agent research REPLANNING AGENT is research with genetic based replanning agent in order to accelerate the optimization speed of path planning technique .
argument situation only ARGUMENT is a situation .
abstract noun state an ABSTRACT NOUN is a state , a quality or feeling that can not be perceived by the senses .
requirement act,action,activity
error of a hypothesis error
psychology mind a PSYCHOLOGY is the study of the human mind .
utility function expression a UTILITY FUNCTION is a mathematical expression that assigns a value to all possible choices .
chip constraint logic programming language CHIP is a constraint logic programming language developed by M. Dincbas in 1985 at ECRC .
search technique technique,technology,approach
simulated annealing algorithm SIMULATED ANNEALING is a generally applicable algorithm that can be used to find near-optimal solutions to a wide variety of combinatorial optimization problems .
artificial intelligence research ARTIFICIAL INTELLIGENCE is an area of research that goes back to the very beginnings of computer science .
blind search service BLIND SEARCH is a service for trying the three main search engines currently in use ( ) .
contour of a state space space
automatic recognition recognition
automatic theorem theorem
iterative dynamic programming dynamic programming
conjunction relation a CONJUNCTION is the grammatical relation between linguistic units that are connected by a conjunction .
goal formulation situation GOAL FORMULATION is based on the current situation & the agent 's performance measures .
stochastic simulation development STOCHASTIC SIMULATION is a development of geostatistics and estimates the conditional cumulative distribution functions at each location .
curve software technique a CURVE is a software technique for image manipulation .
consistent decomposition decomposition
semi-supervised alignment eigenvalue decomposition SEMI-SUPERVISED ALIGNMENT is based on eigenvalue decomposition .
information gain being in machine learning , INFORMATION GAIN is being used as a reward mechanism for reinforcement learning algorithms .
utility function instance method a UTILITY FUNCTION is any instance method that has no dependency on the state of the instance .
natural language processing being NATURAL LANGUAGE PROCESSING is also being developed to create human readable text and to translate between one human language and another .
scene situation a SCENE is a situation treated as an observable object .
proof tree rewrite rule a derivation or PROOF TREE is a compound of rewrite rules , such as .
herbrand's theorem theorem
bayesian network generative model a BAYESIAN NETWORK is a generative model .
modeling construction a MODELING is the construction and use of a computer model of a physical system .
sorting algorithm process of putting a SORTING ALGORITHM is a process of putting a group of objects in a certain list or order .
euclidean space generalization EUCLIDEAN SPACE is the generalization of 2- and 3-dimensional spaces studied by the greek mathematician euclid , to any finite number of dimensions .
hypothesis space space in fact , HYPOTHESIS SPACE is complete space of finite discrete - valued functions .
language analysis being LANGUAGE ANALYSIS is being extended to allow for appropriate disambiguated , bilingual machine translation .
compression data file a COMPRESSION is a data files are often compressed to take up less network bandwidth , memory etc.
intractability state a INTRACTABILITY is the state of being intractable
relationship relation a RELATIONSHIP is a relation between people .
expert system package,software,software system
locus scene a LOCUS is the scene of any event or action
computational biology development COMPUTATIONAL BIOLOGY is defined as the development and application of data - analytical and theoretical methods , mathematical modeling , and computational .
dempster-shafer theory generalization DEMPSTER-SHAFER THEORY is a generalization of bayesian .
optimization process of finding 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 . .
data file computer file A DATA FILE is a computer file which stores data for use by a computer application or system .
recursive dynamic programming dynamic programming
control relation a CONTROL is a relation of constraint of one entity by another .
brain state state
maximum entropy being MAXIMUM ENTROPY is being widely used as a general and powerful technique for reconstructing positive im - ages from noisy and incomplete data .
operations research being OPERATIONS RESEARCH is being defined broadly and includes the use of analytical techniques to achieve better health outcomes , define optimal .
naturalness state a NATURALNESS is the state or quality of being natural .
space complexity space SPACE COMPLEXITY refers to the space used on a given input .
data mining principle DATA MINING is the principle of sorting through large amounts of data and picking out relevant information .
eigenvalue decomposition decomposition
np-completeness statement NP-COMPLETENESS is a statement about coming up with .
kernel function function a KERNEL FUNCTION is any function in input space that corresponds to an inner product ( ) in some feature space .
scoring rule reward function a SCORING RULE is a reward function for eliciting or evaluating forecasts expressed the logarithmic scoring rule is shown to violate the transitivity property , and .
belief network representation a BELIEF NETWORK is a representation of the probabilistic relationships among states of a portion of the world .
obstacle avoidance function OBSTACLE AVOIDANCE is an essential function for any mobile robot .
situated automaton finite state automaton mathematically , a SITUATED AUTOMATON is a finite state automaton in the form of a mealy machine ( ) a 'd t e track .
discontinuous function function a DISCONTINUOUS FUNCTION is a function whose graph has one or more gaps or breaks .
state space modeling STATE SPACE is a method of modeling complex dynamic systems as a set of first order differential equations .
visibility graph graph a VISIBILITY GRAPH is a graph of intervisible locations .
venn diagram graph a VENN DIAGRAM is a graph showing two overlapping circles .
query mapping In descriptive complexity , a QUERY is a mapping from structures of one signature to structures of another vocabulary .
basic action theory action theory
deductive approach assumption DEDUCTIVE APPROACH is based on accepted assumptions from formal decision theory .
termination condition condition
knowledge acquisition function KNOWLEDGE ACQUISITION is a function of different forms , methods and variety of teaching methods ( ) .
connectionism modeling CONNECTIONISM is a style of modeling based upon networks of interconnected simple processing devices .
boolean function expression a BOOLEAN FUNCTION is an expression formed with binary variables , binary operators and an equal boolean function is represented as algebraic expression .
analysis of time analysis
difference concept DIFFERENCE is a key concept of continental philosophy , denoting the process or set of properties by which one entity is distinguished from another within a relational field or a given conceptual system .
graph of predicate graph
neighborhood kernel bubble function NEIGHBORHOOD KERNEL is the bubble function ( ) ( ) which is non-zero for the neighborhood but zero elsewhere .
human-computer interaction analysis a HUMAN-COMPUTER INTERACTION is a analysis of the relationship of computers and humans . .
consistent hypothesis map hypothesis CONSISTENT HYPOTHESIS is a map hypothesis (
similarity measure function a SIMILARITY MEASURE is a function that associates a numeric value with sequences , with the idea that a higher value indicates greater similarity .
breadth first search 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 . .
natural deduction inference rule NATURAL DEDUCTION is a collection of inference rules .
negative literal negation 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 .
semantic network directed graph a SEMANTIC NETWORK is a type of directed graph , but builds on the directed structure to emphasize relationships between units of information ( ) .
induction hypothesis hypothesis
logistic regression analysis LOGISTIC REGRESSION is well-suited to analysis of nondetects because a threshold value is specified to define the response categories and has been successfully applied in prior studies on the risk of groundwater contamination .
stable extension extension
password generation generation
collective decision-making functioning COLLECTIVE DECISION-MAKING is central to the functioning of a society and supported by a system of rules , procedures , power structures and participants .
linear transformation map a LINEAR TRANSFORMATION is a map between vector spaces which respects addition and multiplication .
uniform cost search breadth-first search UNIFORM COST SEARCH is similar to breadth-first search but expands the node with lowest path cost , g ( ) .
automatic programming generation AUTOMATIC PROGRAMMING is the generation of programs by computer , usually based on specifications that are higher-level and easier for humans to specify than .
game theory nash equilibrium GAME THEORY is nash equilibrium .
dependency tree dependency graph a DEPENDENCY TREE is a particular type of dependency graph .
boolean formula function a BOOLEAN FORMULA is a function from some set of boolean variables v = -LCB- v1 , v2 , , vn -RCB- to -LCB- 0,1 -RCB- .
average case analysis analysis
dynamic system dynamical system a DYNAMIC SYSTEM is a dynamical system .
analysis of document corpus analysis
payoff function function a PAYOFF FUNCTION is a function .
process of reducing procedure,process
negation statement a NEGATION is a negative statement .
label propagation scheme LABEL PROPAGATION is a popular scheme for exploiting unlabeled data when a good graph can be constructed by considering the pairwise distances between .
reward function 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 .
multiple inheritance goto MULTIPLE INHERITANCE is the goto of object oriented programming .
transitivity of preference assumption TRANSITIVITY OF PREFERENCE is an assumption made in order to convert paired comparison data to rank order data .
corpus reference system a CORPUS is a reference system based on an electronic collection of texts composed in a certain language .
action theory analysis ACTION THEORY is an analysis of action starting with the individual actor .
backtracking depth-first search 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 .
speech synthesis generation SPEECH SYNTHESIS is the generation of speech by machine .
component analysis analysis
hash function function a HASH FUNCTION is any function of the form h : u → -LCB- 0 , 1 , ... , m − 1 -RCB- , choosing a truly random hash function is completely impractical , but there are several .
goto statement GOTO is a statement found in many computer programming languages .
process of receiving procedure,process
bubble function function
exploration function function
finite state automaton state automaton
nondeterministic environment function a NONDETERMINISTIC ENVIRONMENT is a function : t 2b .
polytree graph basically , a POLYTREE is a type of graph in which there is at most one undirected path between any two verti - ces .
simulation model,framework
analysis of complex scene analysis
sufficient condition condition a SUFFICIENT CONDITION is a condition that guarantees that a statement is true ( ) .
backward chaining depth-first search BACKWARD CHAINING is a depth-first search : in any knowledge base of realistic size , many search paths will result in failure .
agent function function
constraint graph directed graph a CONSTRAINT GRAPH is a directed graph that models the constraints placed on instructions in a multithreaded execution by the memory consistency model , .
gaussian function lineshape function a GAUSSIAN FUNCTION is also a useful lineshape function .
beam search optimization BEAM SEARCH is an optimization of best-first search that reduces its memory requirements .
functional dependency statement informally , a FUNCTIONAL DEPENDENCY is a statement to the effect that the values associated wtth one set of attributes uniquely determine the values associated .
unit resolution inference rule UNIT RESOLUTION is a weak inference rule , and so it is not surprising that the filter - ing algorithm is weak as well .
random graph 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 .
process of becoming procedure,process
induction generation a INDUCTION is the generation of an electric current by a varying magnetic field .
transfer function function
nash equilibrium premise 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 .
feed-forward neural network function FEED-FORWARD NEURAL NETWORK is merely a mathematical function that maps an input vector to a number of outputs ( ) .
reflectance map transfer function 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 .
concise representation representation CORE ONTOLOGY
feed-forward network acyclic graph a FEED-FORWARD NETWORK is an acyclic graph of neurons unambiguously signed ( ) by numbers from r ( ) .
kernel matrix diffusion kernel method 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 .
simulation process of imitating a SIMULATION is the process of imitating a real phenomenon with a set of mathematical formulas . .
world wide web web
locally finite graph graph a LOCALLY FINITE GRAPH is a graph where the degree of each vertex is finite .
cross ratio function CROSS RATIO is a rational function with linear numerator and quadratic here the numerator of the cross ratio is a constant and the denominator is quadratic .
units function function
semantic web web a SEMANTIC WEB is a kind of web which groups information in a manner that both computer and humans are able to comprehend .
undirected weighted graph graph
spectrophotometry analysis a SPECTROPHOTOMETRY is the quantitative analysis of electromagnetic spectra by use of a spectrophotometer
web of datum web
undecidable problem decision 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 .
measure of uncertainty function a MEASURE OF UNCERTAINTY is a function of a probability distribution and we know that a joint probability distribution for all possible measurements does not exist
analysis of information processing system analysis
premise statement a PREMISE is a statement that is assumed to be true and from which a conclusion can be drawn .
process of imitating procedure,process
linear programming optimization LINEAR PROGRAMMING is the study of optimization of linear functions with linear constraints .
utility ability a UTILITY is the ability to play multiple positions .
computer vision analysis COMPUTER VISION is the study of analysis of pictures and videos in order to achieve results similar to those as by people .
measurement act,action,activity
node expansion generation NODE EXPANSION is the generation of all the successors of a given parent node .
regret minimization function in the domain of losses , REGRET MINIMIZATION is a function of the following factors : rm .
support vector machine generation SUPPORT VECTOR MACHINE is a new generation of learning algorithms developed on the basis of statistical theory .
pseudo code explanation PSEUDO CODE is the explanation of program logic in simple english phrases .
flow network function a FLOW NETWORK is a real function with the following three properties for all nodes and .
sweeping statement statement
state automaton automaton
thesis statement a THESIS is a statement supported by arguments .
psychology of computer vision psychology
fuzzy set theory sweeping statement FUZZY SET THEORY is a sweeping statement of set theory .
modification operator function a MODIFICATION OPERATOR is a function m : x → x , where x is the instance space .
lineshape function function
decision node assertion DECISION NODE is an assertion that the chance event will not be observed by the time the decision is made .
fitness function function
finding act,action,activity
prediction statement a PREDICTION is a statement of what will happen in the future .
extension of description logic extension
conceptual graph graph CONCEPTUAL GRAPH is a graph in which nodes are concepts and the edges indicate the relationship between them .
axiom scheme of knowledge scheme
process of using procedure,process
search complexity polynomial function SEARCH COMPLEXITY is a polynomial function of memory order .
affinity graph undirected weighted graph an AFFINITY GRAPH is an undirected weighted graph where each vertex after the instrumented executable finishes , an affinity graph is built and written .
sequential decision problem decision problem
component graph graph
computational technique technique,technology,approach
knowledge representation language representation language
primitive function function
assembly planning generation ASSEMBLY PLANNING is concerned with the generation of a logical sequence of steps each of which is a motion plan .
sigmoid function 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 .
analog quantity,measure
sign function function in mathematics , the SIGN FUNCTION is an odd mathematical function that extracts the sign of a real number .
mental state condition 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 .
index function function
depth-limited search depth-first search DEPTH-LIMITED SEARCH is a special case of the depth-first search , where only nodes with depth not exceeding some bound are examined .
spatial network graph a SPATIAL NETWORK is a special kind of graph , with nodes located in a in this representation , a spatial network is modeled as a list of nodes , and each node .
loss function function a LOSS FUNCTION is a function which expresses numerically the loss produced by a decision or other event .
value function function
rewrite rule function a REWRITE RULE is a function that can be applied to a term using an explicit application function .
representation language language
expected case analysis analysis
language model function a LANGUAGE MODEL is a function , or an algorithm for learning such a function , that captures the salient statistical characteristics of the distribution .
decision rule statement a DECISION RULE is a logical statement of the type `` if ( ) , then ( ) .
logical assertion statement a LOGICAL ASSERTION is a statement that asserts that a certain premise is true , and is useful for statements in proof .
markov property assumption MARKOV PROPERTY is an assumption that allows the system to be analyzed .
incremental learning scheme INCREMENTAL LEARNING is an efficient scheme for reducing computational complexity of batch learning .
transition function function in computing , a TRANSITION FUNCTION is the function that defines the state transitions of a turing machine or a finite-state machine .
context-sensitive grammar password generation CONTEXT-SENSITIVE GRAMMAR is now populated and password generation can begin .
grid map map a GRID MAP is simply a map that has been divided into marked sections .
platform computer system a PLATFORM can refer to a computer systems operating system , , application or server .
web application package,software,software system
separable utility function function SEPARABLE UTILITY FUNCTION is a function of all the nodes at their tails .
null hypothesis statement a NULL HYPOTHESIS is a statement about a population parameter .
architecture for speech recognition speech recognition
association graph graph an ASSOCIATION GRAPH is an abstract graph that is generated from model features in the original image .
bolt event a BOLT is a sudden event , action or emotion .
boolean function assignment a BOOLEAN FUNCTION is an assignment of 0 or 1 to each of these 2n different n - tuples .
state space graph a STATE SPACE is a graph whose nodes are the set of all states , and whose links are actions that take the agent from one state into another .
activation function function in neural networks , an ACTIVATION FUNCTION is the function that describes the output behavior of a neuron . most network architectures start by computing the weighted sum of the inputs then the output of the neuron is 0 , otherwise it is 1 . a common squashing function is the logistic function .
evolution extraction a EVOLUTION is the extraction of a root from a quantity .
conjunctive query decision problem CONJUNCTIVE QUERY entailment is the decision problem corresponding to conjunctive query answering , which is a search problem .
ai discipline,study,field of study
depth first search 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 . .
commitment protocol protocol
probabilistic network directed graph a PROBABILISTIC NETWORK is a directed graph g = ( ) linked to an under - lying probabilistic ( ) model in which probabilistic events ( ) are .
induction of decision tree induction
alpha-beta pruning optimization ALPHA-BETA PRUNING is a sound optimization in that it does not change the score of the result of the algorithm it optimizes .
iterative improvement optimization ITERATIVE IMPROVEMENT is one of the well-established traditional optimization it should be noted that iterative improvement is a local optimization method , and .
refinement strategy function typically , REFINEMENT STRATEGY is a function of both : data quality ( ) and current model quality .
influence diagram acyclic graph an INFLUENCE DIAGRAM is an acyclic graph with three types of nodes .
encoding act,action,activity
theoretical analysis analysis
simulation act,action,activity
binary space partition scheme a BINARY SPACE PARTITION is a scheme for recursively dividing a configuration of a binary space partition is called perfect when none of the objects is cut by the .
satisfiability problem decision 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 .
approximately correct hypothesis hypothesis an APPROXIMATELY CORRECT HYPOTHESIS is therefore the hypothesis that has the probability of error bounded by a small positive constant ε .
utility scale function a UTILITY SCALE is a function u : v → r. the utility scale u is said to fit .
step function function a STEP FUNCTION is a function from the real line to a finite subset of the real line .
utility quantity,measure
computation model model,framework
conditional independence assumption CONDITIONAL INDEPENDENCE is a useful assumption about a domain that is often natural to assess and can be exploited to give a useful representation .
normalization function a NORMALIZATION is an of a function '' is the process of Removable singularity removing a discontinuity
game theory decision problem GAME THEORY is the study of decision problems in competitive situations .
covariance function function
recursive transition network graph A RECURSIVE TRANSITION NETWORK is a graph theoretical schematic used to represent the rules of a context free grammar .
simulation technique,technology,approach
sparse covariance function covariance function
communication system system CORE ONTOLOGY
profile of dependency graph graph
map hypothesis hypothesis
constraint satisfaction decision problem CONSTRAINT SATISFACTION is a decision problem that involves finite choices .
context indicator CONTEXT is a promising indicator of the real quality ofθ .
modal logic extension MODAL LOGIC is a natural extension of propositional logic .
link two-way radio communication system a LINK is a two-way radio communication system
theory resolution scheme THEORY RESOLUTION is a scheme to exploit information about the meaning now the propositional schema for total theory resolution is as follows : let t be a theory .
biconditional compound statement 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 .
recursive algorithm algorithm CORE ONTOLOGY
logical implication statement a LOGICAL IMPLICATION is a statement that relates two propositions .
acoustic signal signal
feature vector generation a FEATURE VECTOR refers to the generation of at least two features .
two-way radio communication system communication system
difference quality a DIFFERENCE is the quality of being unlike or dissimilar .
access function function an ACCESS FUNCTION is a short public function whose job is to return the value of a private member variable .
hypothesis space hypothesis HYPOTHESIS SPACE is the set of all hypotheses the learning algorithm is designed to entertain .
cognitive psychology psychology COGNITIVE PSYCHOLOGY is the branch of experimental psychology that deals with mental processes , such as perception , language comprehension , or skilled movement .
learning curve graph a LEARNING CURVE is a graph showing the rate of learning
background assumption assumption
finite state machine computation model 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 .
input method function an INPUT METHOD is a set of functions that translates key strokes into character strings in the code set specified by your locale .
multi-agent planning generation MULTI-AGENT PLANNING is fundamental to the generation of cooperative ac - tivities .
classification function function in general , a CLASSIFICATION FUNCTION is a function defined on feature vectors and taking values in a set of class labels .
dependency graph directed graph a DEPENDENCY GRAPH is essentially a directed graph of org .
software specification statement a SOFTWARE SPECIFICATION is a statement of what the software has to do .
analysis of verb analysis
process of discovering procedure,process
service composition extension SERVICE COMPOSITION is a natural extension of web services paradigm .
finite state machine computational model a FINITE STATE MACHINE is an abstract computational model based on automata theory .
probabilistic transition function a PROBABILISTIC TRANSITION is defined to be a function t : ω × fω → ( ) such that for each θ ∈ fω , .
linear classifier function a LINEAR CLASSIFIER is a linear function of x and y , .
refutation graph graph a REFUTATION GRAPH is a graph whose nodes are literals ( ) and its edges connect complementary literals .
linear order function LINEAR ORDER is a function of asymmetric c-command relations ( ) .
halting problem decision 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 .
natural language processing analysis NATURAL LANGUAGE PROCESSING is an analysis of current or colloquial language usage without the sometimes misleading effect of formal grammars .
diffusion kernel method kernel method
decision rule function in decision theory , a DECISION RULE is a function which maps an observation to an appropriate action .
inductive learning generation INDUCTIVE LEARNING is based on the generation and testing of rules .
morphology analysis analysis
explicit representation map an EXPLICIT REPRESENTATION is a map from a known parameter space for in - stance the unit cube to 3d-space .
flow network directed graph a FLOW NETWORK is a directed graph d = ( ) with two distinguished vertices s and t called the source and the sink , respectively .
causal diagram directed graph 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 ( ) .
functional decomposition analysis 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 .
bounded indeterminacy indeterminacy
script instruction a SCRIPT is a set of instructions written to control a computer , computer program , or system .
natural language text text
attempt act,action,activity
hierarchical representation representation CORE ONTOLOGY
acquisition act,action,activity
integration act,action,activity
sense disambiguation task the word SENSE DISAMBIGUATION is a non trivial task within an information retrieval system .
conditional planning planning CONDITIONAL PLANNING is planning based on unknown information .
software agent computer system a SOFTWARE AGENT is a computer system that is capable of flexible autonomous action in dynamic , unpredictable , typically multi-agent domains .
algorithmic representation representation CORE ONTOLOGY
cognitive architecture design a COGNITIVE ARCHITECTURE is a design for a computational system for simulating some aspect of human cognition .
artificial intelligence intelligence ARTIFICIAL INTELLIGENCE is the intelligence of machines and the branch of computer science that aims to create it .
union data structure a UNION is a data structure that can store any of various items , but only one at a time .
role act,action,activity
qualitative spatial reasoning spatial reasoning
increase amount a INCREASE is an amount by which a quantity is increased .
gaussian process generative model a GAUSSIAN PROCESS is a generative model in which the weights of the target function are drawn according to a gaussian distribution .
logic programming computer program LOGIC PROGRAMMING is the study of computer programs that implement logic .
advantageous quality quality CORE ONTOLOGY
iterative deepening search strategy ITERATIVE DEEPENING is a complete search strategy , which combines depth-first with hence time complexity of iterative deepening is still o ( ) .
textual entailment task 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 .
constraint logic programming declarative programming language CONSTRAINT LOGIC PROGRAMMING is a new class of declarative programming languages whose primitive operations are based on constraints (
breadth-first search search method BREADTH-FIRST SEARCH is another search method that is less likely to exhibit such behavior .
jordan curve theorem construction JORDAN CURVE THEOREM is the construction of a path joining two points and missing a curve .
capacity ability a CAPACITY is the ability to hold , receive or absorb .
logical agent encapsulation a LOGICAL AGENT is an encapsulation of state and behavior , developed during the system design process , which may not even be independently actualizable .
search engine computer program a SEARCH ENGINE is typically a computer program that retrieves documents , files or data from a database or from a computer network , such as the internet , usually based on keywords input by a user .
application domain mechanism APPLICATION DOMAIN is a mechanism to isolate executed software a common language run time application domain is contained within an .
communication channel mechanism a COMMUNICATION CHANNEL is a mechanism for communication between a transmitter and a receiver , where the information flow transits the ntcb partition .
case-based reasoning principle CASE-BASED REASONING is a principle of constructivism that can be used to support advanced learning in an ill-structured domain .
process of applying procedure,process
sensing action reduction SENSING ACTION is the reduction in entropy of the posterior distribution that is induced by the measurement .
knowledge representation representation CORE ONTOLOGY
scaled orthographic projection order approximation SCALED ORTHOGRAPHIC PROJECTION is a first order approximation of the perspective projection .
finite automaton algorithm a FINITE AUTOMATON is an algorithm with a finite memory which scans through an input string or text .
spatial network pattern 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 .
derivation background process In categorial semantics , DERIVATION is a background process that builds up logical forms , but is not explicitly represented in the semantic formalism .
speech acts planning planning
motion planning planning
simplest method methodology,method
region knowledge domain,knowledge base,domain
hidden markov model stochastic process a HIDDEN MARKOV MODEL is a double embedded stochastic process with two hierarchy levels .
heap specialized tree-based data structure In computer science , a HEAP is a specialized tree-based data structure that satisfies the heap property : if B is a child node of A , then key ≥ key .
laser range finder distance LASER RANGE FINDER is an digital distance measuring device capable of providing accurate distance measure for 2 to 60ft or approximately 0.55 .
dfs depth a DFS is a depth first search . .
incremental learning increase INCREMENTAL LEARNING is likely to increase when professionals are frequently another important factor influencing individual incremental learning is the time and .
abstraction planning planning
information retrieval science INFORMATION RETRIEVAL is the science of searching for documents , for information within documents , and for metadata about documents , as well as that of searching relational databases and the world wide web .
process of replacing procedure,process
unsupervised learning learning scheme UNSUPERVISED LEARNING is the learning scheme used by systems that do not require a ` trainer ' .
deductive system system CORE ONTOLOGY
mobile robot robot a MOBILE ROBOT is a type of robot with its own engine or power able to move without constraints on its path . .
decision-theoretic planning planning
oriented pattern pattern
consistent plan plan
derivation tree mechanism 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 .
parallel text resource PARALLEL TEXT is one of the most valuable resources for development of statistical machine translation systems and other nlp applications .
background process procedure,process
satisfiability problem task SATISFIABILITY PROBLEM is the task to establish either a given cnf logical formula admits a model or not .
creating act,action,activity
notational system system CORE ONTOLOGY
situation space planning planning
kernel scheme-like language a KERNEL is a Scheme-like language .
gain ratio distance GAIN RATIO is distance traveled divided by the circular distance traveled by a pedal .
robotics intelligence ROBOTICS is the science of creating artificial intelligence .
knowledge engineering act,action,activity
bounded-error planning planning
learning architecture design a LEARNING ARCHITECTURE is a strategic design for learning to meet a particular business goal in a particular situation .
encapsulation ability a ENCAPSULATION is the ability to provide users with a well-defined interface to a set of functions in a way which hides their internal workings .
search tree representation a SEARCH TREE is representation of all possible computation paths .
natural deduction instruction a NATURAL DEDUCTION is an instruction on how to use binary logic to move from every natural deduction , is one of the tautologies of propositional logic .
knowledge-based system reduction KNOWLEDGE-BASED SYSTEM is a reduction of the operating costs .
similarity relation a SIMILARITY is the relation of sharing properties .
ordinary differential equation differential equation
spatial relation distance SPATIAL RELATION is defined as the distance of an object located in space in relation to a certain reference object .
uninformed search algorithm search algorithm
context-free grammar definition a CONTEXT-FREE GRAMMAR is a formal definition of a language defined by some rules , each specifying how a single symbol can be replaced by one of a selection of .
decision rule gain DECISION RULE is a gain in search depth .
production system computer program 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 .
intercausal reasoning inference pattern INTERCAUSAL REASONING is a common inference pattern involving probabilistic .
inference pattern pattern
input pattern pattern
hierarchical decomposition planning planning
fully instantiated plan plan
semantic grammar definition 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 .
bang-bang control feedback mechanism BANG-BANG CONTROL is a positive ( ) feedback mechanism .
line orthogonality pattern orthogonality pattern
belief network construction construction
web mining task WEB MINING is the task of analyzing this data and extracting information and knowledge for many different purposes .
machine learning algorithm learning algorithm
encapsulation process of enclosing a ENCAPSULATION is the process of enclosing
polygon representation a POLYGON is a representation of a TARGETs in computer graphics .
dimensionality reduction transformation DIMENSIONALITY REDUCTION is the transformation of high-dimensional data into a .
unsupervised learning similarity UNSUPERVISED LEARNING is based on the similarities and differences among the a third alternative , much closer to supervised than unsupervised learning , is .
remote agent computer program a REMOTE AGENT is a computer program aboard a spacecraft that controls the spacecraft .
compiler person
syntax principle In linguistics , SYNTAX is the study of the principles and rules for constructing sentences in natural languages .
game robot robot
weighted heuristics mechanism mechanism
derivative quantity,measure
regular expression pattern a REGULAR EXPRESSION is any pattern for text matching or searching , frequently offering more or less functionality than a theoretical regular expression .
robotics robot ROBOTICS is the study of robots .
rate ratio In mathematics , a RATE is a ratio between two measurements , often with different units .
functioning manner a FUNCTIONING is a process or manner of functioning or operating .
mixture model probabilistic model in statistics , a MIXTURE MODEL is a probabilistic model for representing the a typical finite-dimensional mixture model is a hierarchical model consisting of the .
information retrieval search approach INFORMATION RETRIEVAL is a search approach which is based on a direct analysis of the content objects of a digital library .
capacity quantity,measure
software engineering construction SOFTWARE ENGINEERING is about the sound construction of computer systems for today and tomorrow .
regression relation a REGRESSION is the relation between selected values of x and observed values of y
interval-valued definition definition
decision tree classifier DECISION TREE is a classifier in the form of a tree structure .
composite object encapsulation a COMPOSITE OBJECT is an encapsulation of a group of other objects that together provide a commonly useful graphical representation .
search spaces planning planning
computational resource resource
compiler package,software,software system
expository text text EXPOSITORY TEXT is text that is written to communicate information .
incremental search mechanism INCREMENTAL SEARCH is a mechanism in visual studio 2010 by which you can search and focus on the searched keyword without any ui blocking from the user end .
actuator mechanism a ACTUATOR is a mechanism that puts something into automatic action .
arithmetic notation programming language ARITHMETIC NOTATION is a programming language
knowledge-based system computer program therefore , a KNOWLEDGE-BASED SYSTEM is a group of computer programs that tries to emulate , and even outdo in some situations , a human .
cognitive psychology mind COGNITIVE PSYCHOLOGY is the study of the human mind and mental processes
deferred planning planning
mobot robot a MOBOT is a mobile autonomous robot , especially one used in artificial intelligence research , or as a toy .
expression pattern pattern
markov chain procedure,process
modeling representation a MODELING is the representation of depth in a two-dimensional image .
data mining methodology,method
operator reduction reduction
satisfiability checking consistency checking SATISFIABILITY CHECKING is equivalent to consistency checking ) but uses the same model construction .
bidirectional search graph search algorithm BIDIRECTIONAL SEARCH is a graph search algorithm that finds a shortest path from an initial the idea behind bidirectional search is to simultaneously search both .
two-valued logic sort TWO-VALUED LOGIC is the sort of logic sports fans use : `` my team is good .
memory limitation limitation
process of enclosing procedure,process
declarative programming language programming language
beam search search algorithm BEAM SEARCH is a search algorithm that is an optimization of best-first search .
epistemic logic principle EPISTEMIC LOGIC is the study of the principles of inference and the formal semantics of knowledge , belief , and other epistemic notions .
process of searching procedure,process
orthogonality pattern pattern
constraint logic programming language logic programming language
similarity network construction 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 .
htn planning 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 .
coreference resolution task COREFERENCE RESOLUTION is the task of grouping all the mentions of entities into equivalence classes so that each class represents a discourse entity .
additive utility function utility function
regression model approximation ultimately , a REGRESSION MODEL is an approximation to a more realistic statistical model and a constant term is the first term in any approximation .
morphology principle MORPHOLOGY is concerned with the principles that regulate word structure in language , and how that structure relates to other components (
compact geometric representation representation CORE ONTOLOGY
reach distance a REACH is the distance from the center of the robot to the fullest extension of the robotic arm .
training algorithm algorithm CORE ONTOLOGY
robot box robot
increase process of becoming a INCREASE is a process of becoming larger or longer or more numerous or more important .
combinatorial auction mechanism 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 computer program LOGIC THEORIST is a computer program written in 1955 and 1956 by ( ) , ( ) and ( ) .
bilingual lexicon resource BILINGUAL LEXICON is a crucial resource for cross-lingual ap - plications of natural language processing ( ) including machine translation ( ) , .
backtracking search uninformed search algorithm BACKTRACKING SEARCH is basic uninformed search algorithm for csps .
computer language language CORE ONTOLOGY
shallow parser computer program a SHALLOW PARSER is a computer program which can determine the boundaries of phrases in a sentence , but not the complete structure .
binary tree data structure 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 .
cooperative coevolution mechanism COOPERATIVE COEVOLUTION is quite an elaborate mechanism .
temporal reasoning intelligence TEMPORAL REASONING is a branch of artificial intelligence ( ) and involves the formal represen - tation of time and a computational reasoning system for it .
reasoning with uncertainty intelligence REASONING WITH UNCERTAINTY is the branch of artificial intelligence one approach to reasoning with uncertainty is to use higher-order nonmonotonic .
fine-motion planning planning
utterance ability a UTTERANCE is the ability to speak .
input data,information
psychology science PSYCHOLOGY is an empirical science .
homeomorphism similarity a HOMEOMORPHISM is a similarity in the crystal structure of unrelated compounds .
knowledge engineering knowledge domain,knowledge base,domain
linear plan plan
parallel architecture processor a PARALLEL ARCHITECTURE is a set of processors arranged into an unoriented graph pattern by communication lines that connect them .
skolemization transformation SKOLEMIZATION is a syntactic transformation routinely used in automatic inference systems in which existential variables are replaced by ` new ' functions - function .
dependency-directed backtracking search strategy DEPENDENCY-DIRECTED BACKTRACKING is a powerful search strategy .
training pattern pattern
holonomic robot 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 .
deduction system system CORE ONTOLOGY
information processing process of receiving INFORMATION PROCESSING is the process of receiving information through the senses analyzing and making it meaningfull .
cognitive psychology information processing COGNITIVE PSYCHOLOGY is the study of human information processing , including perception , attention , memory , language , reasoning , and thinking .
indirect speech act speech act
fuzzy logic principle FUZZY LOGIC is a set of mathematical principles for knowledge representation based on the membership function .
regression act,action,activity
sign property In mathematics , the word SIGN refers to the property of being positive or negative .
information processing science a INFORMATION PROCESSING is the sciences concerned with gathering , manipulating , storing , retrieving , and classifying recorded information .
execution monitoring robot EXECUTION MONITORING is the robot 's process of observing the world for discrepancies between the actual world and its internal representation of it , .
dimensionality reduction discriminant analysis a DIMENSIONALITY REDUCTION is a discriminant analysis .
joint of a robot robot
learning scheme sort 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 .
principle of database system principle
transition function homeomorphism 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 .
software development translation a SOFTWARE DEVELOPMENT is the translation of a user need or marketing goal into a software product .
iterative algorithm algorithm CORE ONTOLOGY
derivative expression a DERIVATIVE is an expression that characterizes how the output of a function changes as the input is varied .
parse tree hierarchical representation a PARSE TREE is a hierarchical representation of .
logical definition definition
gain quantity,measure
machine translation computer program MACHINE TRANSLATION is a computer program which automatically analyzes the meaning of a sentence and attempts to produce a sentence in a different language .
binary tree methodology,method
adaptive control theory control theory
execution mechanism mechanism
well-established technique technique,technology,approach
hidden markov model probabilistic model a HIDDEN MARKOV MODEL is a probabilistic model of the joint probability of a collection of random variables -LCB- .
data mining technique,technology,approach
gene expression pattern expression pattern
non-metric distance distance
blocks world planning planning
user response instruction a USER RESPONSE is an instruction you issue to the computer by replying to a question posed by a computer program , such as do you want to save the change you .
indeterminacy quality a INDETERMINACY is the quality of being vague and poorly defined .
relation-independent pattern pattern
word sense disambiguation task WORD SENSE DISAMBIGUATION is the task of identifying the correct sense for the word in a given context among a finite set of possible senses , and plays an important role in many natural language processing applications such as machine translation , document classification , and information retrieval .
temporal reasoning task TEMPORAL REASONING is an important task in many areas of computer science including planning , scheduling , temporal databases and instruction optimisation for .
pattern mining task PATTERN MINING is the task of finding existing patterns in data .
sample pattern pattern
sparse coding generative model SPARSE CODING is a statistical generative model where the natural images are linear the original sparse coding is a generative model and ev - ery time the new .
nonlinear plan plan
indeterminacy source INDETERMINACY is the source of the mantra that nonaddi - tive genetic and common environmental variance parameters can not simultaneously be estimated in the .
cognitive robotics robot COGNITIVE ROBOTICS is concerned with enabling robots to perform higher level cog - nitive functions sucha as perception , reasoning and action in complex , .
scheme-like language language CORE ONTOLOGY
robot motion planning motion planning
parallel corpus resource PARALLEL CORPUS is a very essential resource for developing many machine translation systems , particularly for those that are based on statistical learning algorithms .
configuration space compact geometric representation CONFIGURATION SPACE is a complete and compact geometric representation of part motions and part interactions that supports the core mechanism design tasks of .
axiomatic definition definition
linear classifier distance LINEAR CLASSIFIER is the minimal distance of any training point to the hyperplane .
limitation quality a LIMITATION is the quality of being limited or restricted .
logic programming language notational system a LOGIC PROGRAMMING LANGUAGE is a notational system for writing logical statements together with specified algorithms for implementing inference rules .
procedural algorithm algorithm CORE ONTOLOGY
spatial reasoning intelligence 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 .
software architecture design SOFTWARE ARCHITECTURE is the design of the major components of complex information systems , and how they interact to form a coherent whole .
context-free grammar generative model a CONTEXT-FREE GRAMMAR is a generative model denoted by a 4-tuple : g = ( ) where : α is a terminal alphabet , ( ) .
genetic algorithm computer program a GENETIC ALGORITHM is a computer program that tries potential solutions and evaluates them .
specialized tree-based data structure data structure CORE ONTOLOGY
adjective phrase reduction an ADJECTIVE PHRASE is a reduction of an adjective clause .
kernel discriminant analysis transformation KERNEL DISCRIMINANT ANALYSIS is based on a conceptual transformation from the input space into a nonlinear high - dimensional feature space .
qualitative reasoning intelligence QUALITATIVE REASONING is an area of artificial intelligence that creates representations for continuous aspects of the world to support reasoning with .
bar code pattern a BAR CODE is a pattern of bars ( ) and spaces .
search approach technique,technology,approach
confidence interval 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 .
completeness of a plan plan
partial instantiation transformation PARTIAL INSTANTIATION is the transformation in which the only part of features from its meta-model ( ) is selected and variant features are derived from .
constraint logic programming language language CORE ONTOLOGY
additivity of utility function utility function
optical flow approximation OPTICAL FLOW is the approximation of the motion field which can be computed from time-varying image sequences .
anaphora resolution task ANAPHORA RESOLUTION is a central task in natural language understanding systems .
gaussian process stochastic process in probability theory and statistics , a GAUSSIAN PROCESS is a stochastic process whose realisations consist of random values associated with every point in a.
input resolution definition INPUT RESOLUTION is simply a definition of space .
distance function distance a DISTANCE FUNCTION is a particular way of calculating distance , such as the euclidean distance between two vectors . .
nondeterministic planning decision-theoretic planning NONDETERMINISTIC PLANNING is similar to decision-theoretic planning in that it considers actions with multiple outcomes , allows plan execution to include .
unbounded indeterminacy indeterminacy
block distance a BLOCK is the distance from one street to another in a city that is built to a grid pattern .
gain advantageous quality a GAIN is the advantageous quality of being beneficial .
inheritance with exception pattern INHERITANCE WITH EXCEPTION is a semantic pattern that is very often useful .
with domain knowledge domain,knowledge base,domain
baum-welch algorithm reach 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 .
lexical database resource a LEXICAL DATABASE is a lexical resource which has an associated software environment database which permits access to its contents .
case-based planning planning CASE-BASED PLANNING is planning as remembering ( ) , and involves reusing .
alpha-beta pruning search algorithm 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 .
program synthesis transformation PROGRAM SYNTHESIS is the transformation of a specification of a user 's problem into a computer program .
computational efficiency limitation COMPUTATIONAL EFFICIENCY is an important limitation in object tracking algorithms and different efficient techniques , such as the projected-out optimization , have been proposed .
cryptography principle CRYPTOGRAPHY is defined as the principles , means , and methods for rendering information unintelligible , and for restoring the encrypted information back into intelligible form .
room feature ROOM is a feature that is on when the agent is in a room .
intelligence method methodology,method
functionality ability a FUNCTIONALITY is the ability to perform a task or function
recursive definition definition a RECURSIVE DEFINITION is a definition of a function from which values of the function can be calculated in a finite number of steps .
computational complexity resource COMPUTATIONAL COMPLEXITY is the study of the resources needed for the computational solution of problems , with these resources usually being time and space ( ) .
linearization approximation LINEARIZATION is the approximation of a nonlinear system as a linear system , based on the assumption that the system is almost linear within a certain range of .
unsupervised manner manner
bilingual dictionary resource a BILINGUAL DICTIONARY is a great resource for you to master foreign languages .
probabilistic scheme library PROBABILISTIC SCHEME is a library for implementing prob - ability models in the central concept in probabilistic scheme is that of a probability .
exponential increase increase
sign event a SIGN is an event that is experienced as indicating important things to come .
selection process procedure,process
virtual reality computer program VIRTUAL REALITY is a computer program that allows you to interact with it and one way to use virtual reality is to create `` virtual objects '' that have properties like .
chess automaton mechanism a CHESS AUTOMATON is a mechanism that purports to play .
similarity quality a SIMILARITY is the quality of being similar .
bayesian network technique,technology,approach
conceptual clustering summarizing CONCEPTUAL CLUSTERING is an important way of summarizing and explaining data .
formalization planning planning
fortran programming language FORTRAN is one of the oldest programming languages around .
decision tree tree structure a DECISION TREE is a tree structure representing the various decisions that need to be made by the query optimiser .
trajectory model,framework
multiplicative utility function utility function
sequential search search algorithm in computer science , SEQUENTIAL SEARCH is a search algorithm for searching a list of unsorted data items for a particular value and is one of the .
system gain gain
appealing technique technique,technology,approach
classification task task
acquisition ability a ACQUISITION is an ability that has been acquired by training .
problem frame pattern a PROBLEM FRAME is a kind of pattern .
hierarchical representation methodology,method
adl formalism planning planning
artificial intelligence programming language programming language
variable planning planning
knowledge representation discipline,study,field of study
information retrieval discipline,study,field of study
background knowledge experience BACKGROUND KNOWLEDGE is the experience and knowledge that a student brings to classroom learning .
word sense disambiguation sense disambiguation
shape representation a SHAPE is a concrete representation of an otherwise nebulous concept .
sensor model algorithmic representation a SENSOR MODEL is an algorithmic representation of a sensor in its state at the time of image collection .
situation calculus planning planning
syntactic pattern pattern a SYNTACTIC PATTERN is a pattern based on syntax rules .
bilingual parallel corpus parallel corpus
string matching task 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 (
multiple processor processor
humanoid robot robot a HUMANOID ROBOT is a robot that is based on the general structure of a human , such as a robot that walks on two legs and has an upper torso , or a robot that has .
autonomous robot robot an AUTONOMOUS ROBOT is a robot that can sense the surrounding environment , navigate since the operating environment of the autonomous robot is constantly .
feedback mechanism mechanism
markov chain model,framework
bayesian model,framework
software agent package,software,software system
cleaning robot robot
commonsense ontology construction COMMONSENSE ONTOLOGY is a cultural construction , just as the concepts that articulate scientific theories are cultural constructions : `` theory may be deliberate , .
value-function approximation approximation
ease-based planning planning
vehicle entity a VEHICLE is an entity to achieve an end .
order inference ORDER is a frequent inference of WTH .
limitation act,action,activity
consequence relation binary relation a CONSEQUENCE RELATION is a binary relation ∼ between sentences of classical propositional logic .
predicate logic deduction system PREDICATE LOGIC is a formal deduction system whose atomic formulas are propositional functions .
process of removing procedure,process
automaton mechanism a AUTOMATON is a mechanism that can move automatically .
metaphor pattern a METAPHOR is a pattern equating two seemingly unlike objects .
cognitive science mind COGNITIVE SCIENCE is the study of the human mind and brain , focusing on how the mind represents and manipulates knowledge and how mental representations .
text corpus knowledge source TEXT CORPUS is an important knowledge source of it .
decision process procedure,process
topic model generative model a TOPIC MODEL is a generative model for documents : it specifies a simple probabilistic procedure by which documents can be generated .
dynamic weighting mechanism DYNAMIC WEIGHTING is a mechanism to assign importance to a theory .
markov chain procedural algorithm MARKOV CHAIN is a procedural algorithm used to make coherent chains of values , instead of just random noise .
decision theory principle DECISION THEORY is the study of principles and algorithms for making correct decisions -- that is , decisions that allow an agent to achieve better .
nonholonomic robot robot similarly , a NONHOLONOMIC ROBOT is defined as a robot , that has one or more nonholonomic kinematic constraints ( ) .
navigation robot robot
protection interval interval
separable utility function utility function
word segmentation task WORD SEGMENTATION is an important task in natural language processing ( ) for languages without word delimiters ( ) .
categorization task task
robot architecture principle a ROBOT ARCHITECTURE is a set of guiding principles used to structure a robot 's control system .
formation feature a FORMATION is the geological features of the earth .
order approximation approximation
version space hierarchical representation a VERSION SPACE is a hierarchical representation of knowledge that keeps track of all the useful information supplied by a sequence of learning examples without .
knowledge representation system system CORE ONTOLOGY
human user resource 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 .
library resource In computer science , a LIBRARY is a collection of resources used to develop software .
neural network learning task 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 .
neural information processing information processing
total order planning planning
decision making selection process in contrast , DECISION MAKING is a selection process where one of two or more possible solutions is chosen to reach a desired goal .
formal semantics technique,technology,approach
correlation analysis model,framework
decision-theoretic agent agent
conceptual graph representation a CONCEPTUAL GRAPH is a representation of a part of knowledge under an ontology or a canon (
computational learning theory complexity COMPUTATIONAL LEARNING THEORY is concerned with the complexity of such a process , but one of the key areas in computational learning theory is the probably .
family of inference relation relation
bucket sort algorithm BUCKET SORT is an ideal algorithm if the elements to sort can be represented as a sequence of numbers ( ) .
dialogue act act,action,activity
linear programming discipline,study,field of study
source enterprise software development software development
planning algorithm algorithm
probabilistic reasoning reasoning PROBABILISTIC REASONING is concerned with the uncertain reasoning about well defined events or concepts such as symptom-a and illness-x .
influence diagram graphical device an INFLUENCE DIAGRAM is a graphical device showing the relationships among the decisions , the chance events , and the consequences .
backus-naur form meta language sir , BACKUS-NAUR FORM is a meta language used to formally describe the syntax of a language .
growth process of becoming a GROWTH is a process of becoming larger or longer or more numerous or more important .
categorial grammar technique,technology,approach
math science a MATH is a science dealing with the logic of quantity and shape and arrangement .
alpha-beta pruning technique,technology,approach
flow network model,framework
hash function cryptographic algorithm a HASH FUNCTION is a cryptographic algorithm that accepts input , .
prim's algorithm algorithm
question answering component technology QUESTION ANSWERING is a key component technology .
minimax decision act,action,activity
web mining integration WEB MINING is the integration of information gathered by traditional data mining methodologies and techniques with information gathered over the world wide .
logic programming computer language a LOGIC PROGRAMMING is a computer language designed in Europe to support natural language processing .
model-based agent agent
search process procedure,process
behavior act,action,activity
software verification discipline,study,field of study
planning system system CORE ONTOLOGY
base relation relation a BASE RELATION is a relation corresponding to an entity in the conceptual schema , whose tuples are physically stored in the database .
incremental dynamic programming procedure procedure,process
information property property CORE ONTOLOGY
knowledge acquisition extraction a KNOWLEDGE ACQUISITION is the extraction and formulation of knowledge derived from various sources , especially from experts . .
item of information data,information
inductive inference reasoning INDUCTIVE INFERENCE is reasoning that justifies change from one state of full belief or absolute certainty to another by adding new information to the initial state that .
kruskal's algorithm algorithm
domain theory descriptive theory a DOMAIN THEORY is a descriptive theory of the development of capabilities along to teaching that work better for each student , a domain theory is neither a.
chronological backtracking algorithm CHRONOLOGICAL BACKTRACKING is a very simple algorithm , pro- gressively theorem 1 , we can conclude that chronological backtracking is complete .
automatic programming translation so , AUTOMATIC PROGRAMMING is the automatic translation of the -LCB- ( ) → ( ) -RCB- transformation into the local transition function f.
automatic programming use ofsearch technique AUTOMATIC PROGRAMMING is the use ofsearch techniques to nd programs thatsolve a problem .
distributed processing functionality DISTRIBUTED PROCESSING is a functionality that exists within the ftk 3 application that allows users to create a distributed processing cluster with .
mathematical relation relation
transformational grammar procedure,process
asymptotic analysis methodology,method
tiling algorithm algorithm
execution time quantity,measure
completeness of resolution consequence COMPLETENESS OF RESOLUTION is an immediate consequence of this theorem .
natural language interface graphical user interface a NATURAL LANGUAGE INTERFACE is a specially designed graphical user interface for dealing with natural language input and output .
pragmatic source enterprise software development PRAGMATIC is a global open source enterprise software development , consulting and training company .
ontological engineering discipline,study,field of study
operator schema generalised representation an OPERATOR SCHEMA is the generalised representation of a state-transition .
adaptive dynamic programming on-line tuning method ADAPTIVE DYNAMIC PROGRAMMING is an on-line tuning method .
recursive definition representation a RECURSIVE DEFINITION is a mathematical representation of the way a value is generated .
propagation procedure procedure,process
information value theory decision analytic approach INFORMATION VALUE THEORY is a decision analytic approach to calculating the economic value of new information .
abstract algebra mathematics ABSTRACT ALGEBRA is a branch of mathematics concerned with the study of algebraic abstract algebra is a branch of mathematics concerned with the study of .
back-propagation training algorithm 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 process of pointing NEGATIVE FEEDBACK is the process of pointing out what someone is doing poorly and telling him how to change it .
cluster assignment matrix matrix
stochastic simulation technique,technology,approach
description logic language a DESCRIPTION LOGIC is a formal language for knowledge represen - .
ordering constraint clause ORDERING CONSTRAINT is a set of clauses .
pagerank quantity,measure
knowledge-based approach technique,technology,approach
complete proof procedure procedure,process
merge sort methodology,method
actor model of computation model,framework
rule of thumb rule
point-based algorithm vector algorithm POINT-BASED ALGORITHM is the parallel vector algorithm .
addition of knowledge knowledge
backward chaining methodology,method
partial mapping mapping
temporal relation relation a TEMPORAL RELATION is a relation of earlier than or later than to a certain degree .
sequential voting rule rule
source domain knowledge domain,knowledge base,domain
information extraction language processing 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 procedure,process
conditional random field discriminative maximum entropy model a CONDITIONAL RANDOM FIELD is a discriminative maximum entropy model that uses features on each line ( ) to determine what label to assign .
thesis marker-passing algorithm In essence , the THESIS describes marker-passing algorithms used to select between possible candidates for disambiguation .
telepathic communication language TELEPATHIC COMMUNICATION is the universal language among animals .
approximate counting probabilistic algorithm APPROXIMATE COUNTING is a probabilistic algorithm proposed by r. morris ( ) that allows an approximate count in the interval 1 to n using only .
production rule rule PRODUCTION RULE is a rule which describes the fuzzy relation between two propositions .
hypothetical algorithm algorithm CORE ONTOLOGY
existential introduction rule EXISTENTIAL INTRODUCTION is the opposite rule in which you applied .
propagation algorithm algorithm
minimax search algorithm MINIMAX SEARCH is the oldest algorithm in game theory or multi-agent systems : zermelo used it in 1913 to prove that there were optimal .
knowledge source source KNOWLEDGE SOURCE is a leading source of healthcare business information and analyses services for executives who seek a competitive edge .
locally structured system system
random restart simplest method RANDOM RESTART is perhaps the simplest method to use .
psychological model theory a PSYCHOLOGICAL MODEL is a theory which explains the phenomena of a condition .
target language computer language a TARGET LANGUAGE is a computer language into which something written in another computer language is to be translated .
turing machine model,framework
conflict resolution methodology,method
first-order language act,action,activity
hybrid approach technique,technology,approach
regular grammar rule a REGULAR GRAMMAR is a set of rules such that the regular expressions of the rules recognize pairwise disjoint languages .
artificial intelligence research with domain ARTIFICIAL INTELLIGENCE RESEARCH is typically associated with domains such as speech synthesis and recognition , language translation , image recognition , and .
finite-state automaton abstraction a FINITE-STATE AUTOMATON is a mathematical abstraction sometimes used to design digital logic or computer programs .
utility theory theory CORE ONTOLOGY
process of measuring procedure,process
model-based reasoning reasoning MODEL-BASED REASONING is a practical way of reasoning about .
unsatisfied clause clause
agent-based software engineering paradigm AGENT-BASED SOFTWARE ENGINEERING is a new paradigm that consists of autonomous software entities that execute in a local environment and carries out its .
face recognition feature FACE RECOGNITION is a new feature among digital cameras .
object recognition feature OBJECT RECOGNITION is a key feature for building robots capa - ble of moving and performing tasks in human environments .
chronological backtracking methodology,method
process of acquiring procedure,process
model-based reasoning concept MODEL-BASED REASONING is a central concept in current research into intelligent diagnostic systems .
meta-comment communication META-COMMENT is communication about communication , as in .
speech understanding communication SPEECH UNDERSTANDING is key to communication .
hierarchical task network planning system a HIERARCHICAL TASK NETWORK is a planning system that uses a hierarchy of primitive and compound tasks to define a planning domain .
cardinal direction calculus calculus
approximate counting technique,technology,approach
obstacle avoidance robotic discipline OBSTACLE AVOIDANCE is a robotic discipline with the objective of moving vehicles on the basis of the sensorial information .
convex hull data structure CONVEX HULL is a very important data structure of computational geometry design .
optical character recognition procedure,process
naive method methodology,method
extraction process procedure,process
multi-document summarization procedure,process
branching factor ratio BRANCHING FACTOR is just the ratio of how long it takes to search ply n +1 branching factor is used when describing tree structures (
syntactic parsing process of constructing SYNTACTIC PARSING is the process of constructing a syntactic parse tree for an input .
ontological commitment theory ONTOLOGICAL COMMITMENT is relative to a theory : `` to be is to be the value of a bound variable '' does n't tell us what theory to choose .
reference ontology theory a REFERENCE ONTOLOGY is analogous to a scientific theory
mathematical theory of computation theory
data mining technique technique,technology,approach
speech recognition systems ability SPEECH RECOGNITION refers to the systems ability to recognise the words spoken not the speaker ) .
discriminant analysis procedure,process
truth maintenance ability the name TRUTH MAINTENANCE is due to the ability of these systems to restore consistency .
incomplete information data,information
regular path query query
graphical user interface user interface a gui or GRAPHICAL USER INTERFACE is an user interface , that talks to the user using graphics .
adjective phrase phrase an ADJECTIVE PHRASE is a prepositional or verbal phrase that functions as an adjective .
random walk model,framework
execution time platform EXECUTION TIME is platform dependent -- the same algorithm may require different times for the same input on different machines .
integer linear programming technique,technology,approach
differential equation expression a DIFFERENTIAL EQUATION is an expression that relates quantities and their rates of the solution to a differential equation is not simply a number
propositional logic language PROPOSITIONAL LOGIC is the logical language of propositions .
reactive planning technique,technology,approach
description logic model,framework
merging framework model,framework
horn logic predicate logic HORN LOGIC is a subset of predicate logic that allows efficient reasoning , orthogonal to description logics
hash table data structure In computer science , a HASH TABLE or hash map is a data structure that uses a hash function to map identifying values , known as keys , to their associated values .
distance method methodology,method
parse forest concise representation a PARSE FOREST is a concise representation of a number of parse trees for .
feature extraction technique,technology,approach
disambiguation process of retaining DISAMBIGUATION is the process of retaining relevant translation and removing the disambiguation is performed by selecting the equivalent whose sentence .
binary classification technique,technology,approach
probabilistic grammar data modelling technique PROBABILISTIC GRAMMAR is a data modelling technique playing an increasing in this study , the probabilistic grammar is built on the patterns model extracted by .
logical inference inference
text categorization procedure,process
graph mining discipline,study,field of study
discourse coherence scalar phenomenon DISCOURSE COHERENCE is a scalar phenomenon , however .
logical positivism technique,technology,approach
checkers learning learning
word segmentation technique,technology,approach
sensor node platform platform
randomized algorithm deterministic algorithm a RANDOMIZED ALGORITHM is a deterministic algorithm with the extra ability of making random choices during the computation that are independent of the .
term rewriting appealing technique TERM REWRITING is an appealing technique for performing program analysis and program in this paper , many-sorted first-order term rewriting is extended with .
natural language processing methodology,method
majority function system a MAJORITY FUNCTION is a system that will assert when there are more 1 's than 0 's on the inputs .
polynomial-time algorithm algorithm a POLYNOMIAL-TIME ALGORITHM is an algorithm whose execution time is either givenby a polynomial on the size of the input , or can be bounded by such a polynomial .
grammar formalism theory a GRAMMAR FORMALISM is a theory of a particular class of languages .
intercausal inference inference
semi-supervised learning technique,technology,approach
cognitive robotics discipline,study,field of study
breadth first search strategy BREADTH FIRST SEARCH is a complete strategy : given enough time and memory , it will so , breadth first search is guaranteed to find a solution ( ) , but it .
graph representation representation CORE ONTOLOGY
fuzzy logic reasoning system FUZZY LOGIC is a reasoning system based on a foundation of fuzzy set theory , itself fuzzy logic is a relatively new discipline in which major advances have been .
distributed processing phrase DISTRIBUTED PROCESSING is a phrase used to refer to a variety of computer systems that use more than one computer ( ) to run an application .
informed search evolution INFORMED SEARCH is an evolution of search that applies heuristics to the search algorithm , given the problem space , to make the algorithm more efficient .
temporal logic language TEMPORAL LOGIC is a language for expressing relationships between the order of events occurring over time .
random field assignment a RANDOM FIELD is an assignment of a probability measure to points in the p − dimensional space .
patrol algorithm algorithm
ontological engineering technique,technology,approach
priority queue data structure a PRIORITY QUEUE is a data structure that consists of several queues each assigned a specific priority , and the data is stored and retrieved according to their .
protocol code a PROTOCOL is an accepted code of conduct
certainty factor methodology,method
functional description attribute 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 .
monte-carlo search search method MONTE-CARLO SEARCH is search method to use not random player but monte-carlo player in simulation .
artificial agent non-human entity an ARTIFICIAL AGENT is a non-human entity that is ( ) autonomous , interacts with its environment , and adapts itself as a function of its .
heuristic search search technique a HEURISTIC SEARCH is a search technique that applies heuristics to reduce the size of a problem domain . .
text interpretation interpretation
semantic tree data structure a SEMANTIC TREE is a data structure for assignments to the atomic propositions of a formula .
b-tree data structure consequently , a B-TREE is an ideal data structure for situations where all data the search operation on a b-tree is analogous to a search on a binary tree .
markov network model,framework
rational decision testing a RATIONAL DECISION is based on testing and data and an understanding of the mechanics underneath the system you 're working on .
causal link expression CAUSAL LINK is a new expression for me , that 's why i misread it .
parallel distributed processing model,framework
parallel processing technique,technology,approach
local consistency paradigm LOCAL CONSISTENCY is often a suitable paradigm for solving constraint satisfaction problems .
q-learning technique,technology,approach
cognitive architecture advantage a COGNITIVE ARCHITECTURE is able to take advantage of this structural regularity and retrieve additional information about the constituents from memory .
process of dividing procedure,process
means-ends analysis technique,technology,approach
pattern recognition assignment in machine learning , PATTERN RECOGNITION is the assignment of some sort of output value ( ) to a given input value ( ) , according to some specific algorithm .
cross-correlation technique,technology,approach
cell decomposition technique,technology,approach
short-term memory expression SHORT-TERM MEMORY is an expression used by psychologists when they realized this memory type .
heap property property
summarizing process of condensing SUMMARIZING is a process of condensing or expressing in short something you have read , watched or heard .
robot system system
hardness quality a HARDNESS is the quality of being difficult to do .
mathematical theory of evidence theory
benchmark routine a BENCHMARK is a set of routines or actions used to evaluate computer performance .
confidence interval measurement in statistics a CONFIDENCE INTERVAL is a measurement of how good , or how accurate a certain parameter is .
robot motion planning discipline,study,field of study
computational learning theory learning COMPUTATIONAL LEARNING THEORY is the study of learning from the viewpoint of the theory of computation .
machine translation technique,technology,approach
mechanical device device
occurrence of event event
pattern matching feature PATTERN MATCHING is an extremely powerful feature supported by f# .
sequential testing algorithm algorithm CORE ONTOLOGY
compliant motion model,framework
software architecture discipline,study,field of study
computing system system CORE ONTOLOGY
discrete event technique,technology,approach
rating matrix matrix
genetic engineering discipline,study,field of study
coherence relation relation A COHERENCE RELATION is a relation among clauses or sentences , such as elaboration , support , cause , or exemplification .
blocks-world learning learning
robotic device device
conditional action vhdl process a CONDITIONAL ACTION is equivalent to a vhdl process or a verilog always process .
information extraction act,action,activity
fuzzy set model,framework
complete algorithm algorithm
statistical relational learning discipline,study,field of study
tractability of inference inference
algorithm of figure algorithm
support knowledge domain,knowledge base,domain
goal-driven approach technique,technology,approach
turing machine finite automaton a TURING MACHINE is similar to a finite automaton with supply of unlimited memory .
psycholinguistic study discipline,study,field of study
temporal logic formalism TEMPORAL LOGIC is a powerful formalism for expressing the biological properties of a living system , such as state reachability , checkpoints , stability , oscillations , .
two-tailed t-test 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 .
refinement strategy technique,technology,approach
information gain quantity,measure
use ofsearch technique technique,technology,approach
principal component analysis discipline,study,field of study
rule-based system encoding 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 package,software,software system
immortal agent agent
straightforward implementation fdtd approach a STRAIGHTFORWARD IMPLEMENTATION is the fdtd approach .
reactive planning methodology,method
linear combination vector a LINEAR COMBINATION is a vector in rn created by adding together scalar multiples of other vectors in .
state variable property 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 .
nonparametric technique technique,technology,approach
automated reasoning technique,technology,approach
constraint propagation technique,technology,approach
propositional logic mathematics PROPOSITIONAL LOGIC is a branch of mathematics and philosophy that is based on studying propositions or statements and the logical relationships they create .
evidential corpus corpus
language understanding technique,technology,approach
dewey decimal system system
formal language language a FORMAL LANGUAGE is a language in which everything is precisely defined , so that there can not be any ambiguity about any expression in that language .
fuzzy set data set FUZZY SET refers to the data set which does not have separate , distinct clusters , and they contain data elements whose membership degrees are between 0. a fuzzy set is an extension of a classical set .
automaton pruning pruning
empirical evaluation knowledge EMPIRICAL EVALUATION is a necessarytool forobtainingthis knowledge .
atomic concept representation 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 rational agent
complexity analysis most technique COMPLEXITY ANALYSIS is one of the most techniques and therefore we consider it to architecture of a modern corporate .
computer vision technique,technology,approach
decision trees learning methodology,method
pattern recognition process of recognizing 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 .
service composition functionality SERVICE COMPOSITION is the functionality in soc that can be defined as the process of discovering , integrating , and executing a set of related services in order to .
programmer person
iterative refinement algorithm algorithm CORE ONTOLOGY
forward checking propagation procedure FORWARD CHECKING is a propagation procedure that guarantees that at each step of the search , all the constraints between already assigned .
passive learning process of acquiring PASSIVE LEARNING is the process of acquiring knowledge or skill where the acquisition of the knowledge or skill was not deliberately intended by .
description logic predicate logic DESCRIPTION LOGIC is a simplified predicate logic .
top-down learning learning
algorithmic compatibility property ALGORITHMIC COMPATIBILITY is the property of data distributions of matrix a , matrix b , and matrix .
deterministic algorithm algorithm CORE ONTOLOGY
game tree representation a GAME TREE is an abstract representation of an actual game .
indexing scheme methodology,method
policy iteration algorithm POLICY ITERATION is an algorithm for the exact solving of op - timization and game theory problems , formulated as equations on min max affine expressions .
theory resolution methodology,method
dependency-directed backtracking technique,technology,approach
case-based reasoning technique,technology,approach
grammar formalism model,framework
process of ensuring procedure,process
discriminative model probability 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 .
standard deviation quantity,measure
iterative improvement strategy in production software , ITERATIVE IMPROVEMENT is a nearly universal strategy , either as a postprocessing re - finement to other methods or as a method in itself .
similarity measure quantity,measure
syntax discipline,study,field of study
procedural semantics backward-chaining technique finally , PROCEDURAL SEMANTICS is a top-down or backward-chaining technique .
target compilation language compilation language
situation calculus order language SITUATION CALCULUS is a first order language with following key concepts : situation = possible world history , which is a sequence of actions .
component technology technique,technology,approach
public key encryption algorithm PUBLIC KEY ENCRYPTION is an asymmetric key algorithm .
unsupervised learning process of reducing UNSUPERVISED LEARNING is the process of reducing the complexity of a gene list using nothing more than the expression values obtained across your samples .
text classification technique,technology,approach
rsa encryption methodology,method
feature of a state feature
expressive power quantity,measure
acoustic-phonetic rule rule
knowledge-based learning learning
viterbi algorithm decoding algorithm VITERBI ALGORITHM is an efficient decoding algorithm for decoding convolution codes .
memory-based model model,framework
logical implication relation LOGICAL IMPLICATION is a semantic relation , but it still is possible to describe a syntactic relation that holds between sentences in a formal language that mirrors this .
low-level process procedure,process
natural deduction methodology,method
stochastic dominance importance STOCHASTIC DOMINANCE is of practical importance in this context as it guarantees that a policy that optimizes expected seek distance also guarantees optimal seek .
conceptual clustering technique,technology,approach
inductive logic system an INDUCTIVE LOGIC is a system for reasoning that derives conclusions which .
meta language language CORE ONTOLOGY
policy iteration technique,technology,approach
process of updating procedure,process
intelligence test test an INTELLIGENCE TEST is a psychological or educational test designed to measure intellectual operations , functions , and general abilities .
kinematics discipline,study,field of study
pre-trained classifier classifier
nested monte-carlo search algorithm NESTED MONTE-CARLO SEARCH is an algorithm that uses no domain specific knowledge and which is widely applicable .
interleaving feature INTERLEAVING is a feature of broadband technology which uses powerful error - correction algorithms to improve broadband speed and stability on long or noisy .
stochastic simulation methodology,method
process of testing procedure,process
order language language CORE ONTOLOGY
logical consequence concept LOGICAL CONSEQUENCE is a fundamental concept in logic .
noncomputability formulation 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 representation CORE ONTOLOGY
belief propagation iterative algorithm BELIEF PROPAGATION is an iterative algorithm , which tries to .
computational complexity theory complexity COMPUTATIONAL COMPLEXITY THEORY is the study of the complexity of problems -- that is , the difficulty of solving them .
forward-backward algorithm 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 algorithm 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 methodology,method
lattice theory theory LATTICE THEORY is a theory about preorders .
merge sort recursive algorithm MERGE SORT is a recursive algorithm that makes use of two helper functions split and merge .
speaker identification process of identifying SPEAKER IDENTIFICATION is the process of identifying different speakers usually , speaker identification is done by one of the following methods .
transformational grammar theory a TRANSFORMATIONAL GRAMMAR is a theory about the symbols and rules that may govern natural human languages , and are central to chomsky 's approach to .
adjacency matrix matrix an ADJACENCY MATRIX is a matrix which describes a graph by if $ g $ is a graph of order $ n $ , then its adjacency matrix is an $ n times n $ square .
constructive induction procedure,process
hierarchical clustering technique,technology,approach
beam search methodology,method
automated debugging technique,technology,approach
quantificational calculus calculus
graphical property property CORE ONTOLOGY
condition-action rule expression a CONDITION-ACTION RULE is an expression of form `` if enable s '' or `` if change state to f '' or where .
conversation act,action,activity
temporal logic rule TEMPORAL LOGIC is a system of rules , symbolism , reasoning and propositions pertaining to time .
brain ability a BRAIN is a mental ability .
gold standard test a GOLD STANDARD is a test or measure of comparison that is considered ultimate or ideal .
discourse understanding process of updating • DISCOURSE UNDERSTANDING is a process of updating a dialogue state by a user utterance .
speech act interpretation interpretation
generalised representation representation CORE ONTOLOGY
nearest neighbor data mining technique a NEAREST NEIGHBOR is a data mining technique that performs prediction by finding the prediction value of records similar to the record to be predicted . .
probabilistic updating procedure procedure,process
autonomous agent computer simulation an AUTONOMOUS AGENT is a computer simulation that is based on concepts from artificial life research .
optimally efficient algorithm algorithm
data matrix density 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 data structure 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 .
active agent agent
case-based reasoning methodology,method
incremental process procedure,process
objective function expression OBJECTIVE FUNCTION is a mathematical expression describing a relationship of the optimization parameters or the result of an operation ( ) that .
consistency checking act,action,activity
pattern recognition methodology,method
well-established method methodology,method
classification accuracy ability 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 .
boolean query 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 . .
mathematical induction reasoning 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 .
anytime algorithm trajectory ANYTIME ALGORITHM is a smooth trajectory that complies with the dynamic constraints of the robot and can therefore be tracked by the robot with high precision .
resolve expression a RESOLVE is a formal expression by a meeting .
scanner in chart parsing parsing
compression process of reducing COMPRESSION is the process of reducing the size of a file by encoding its data information more efficiently .
knowledge source importance KNOWLEDGE SOURCE is operationally defined as the perceived importance of information acquired from a source internal or external to the firm for the purpose of .
linear regression glm regression algorithm LINEAR REGRESSION is the glm regression algorithm supported by oracle data mining .
combined indexing indexing
protocol procedure,process
weight vector vector
mathematical model idealized representation MATHEMATICAL MODEL is an idealized representation expressed in mathematical symbols and expressions .
translation of language translation
temporal logic system In logic , the term TEMPORAL LOGIC is used to describe any system of rules and symbolism for representing , and reasoning about , propositions qualified in terms of time .
qualitative reasoning act,action,activity
telepathic communication ability TELEPATHIC COMMUNICATION is an ability we are all born with .
proof graph representation a PROOF GRAPH is a representation of a proof .
user interface system a USER INTERFACE is the system by which people ( ) interact with a machine .
statistical approach technique,technology,approach
model checking technique,technology,approach
active learning learning ACTIVE LEARNING is learning by `` doing .
correlation analysis methodology,method
if-then rule expression an IF-THEN RULE is an expression of the form .
orthography methodology,method
image reconstruction technique,technology,approach
data-driven inference inference
error rate rate
excellence quality a EXCELLENCE is the quality of being excellent
semantic indexing indexing
np-completeness theory NP-COMPLETENESS is a theory , not a fact , about the complexity of computational problems .
field of research knowledge domain,knowledge base,domain
artificial intelligence quality 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 .
kolmogorov complexity theory KOLMOGOROV COMPLEXITY is a theory of the inherent information content of an kolmogorov complexity is of deep significance to linguistic theory .
lookup table feature LOOKUP TABLE is a new feature in obiee 11g .
syntactic parsing technique,technology,approach
visibility graph methodology,method
selection sorting algorithm SELECTION SORTING is an algorithm for sorting lists of data and is specifically an in place comparison sort .
logical entailment relation 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 chart
vector of variable vector
formal semantics discipline,study,field of study
composite decision process decision process
motion planning complexity complexity
htn model model,framework
boltzmann machine model,framework
decision-making agent agent
ability of agent ability
natural language language in computing , NATURAL LANGUAGE refers to a human language such as english , russian , german , or japanese as distinct from the typically artificial command or programming language with which one usually talks to a computer .
analogical mapping matching process ANALOGICAL MAPPING is a matching process that is sensitive to three main .
applied statistic fraction 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 ? .
nondeterminism algorithm NONDETERMINISM is a algorithm to solve a problem by just defining it .
input vector vector a INPUT VECTOR is a vector presented to the network . .
matching algorithm algorithm
adaptive control control method 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 .
macroscopic phenomenon phenomenon CORE ONTOLOGY
reasoning system computing system a REASONING SYSTEM is a computing system that can solve a reasoning task ( ) .
dynamic logic system DYNAMIC LOGIC is a formal system for reasoning about programs .
communication protocol rule a COMMUNICATION PROTOCOL is a set of rules that must be adhered to by two or more processes ( ) during their communication .
logical formalism formalism
debugging bug DEBUGGING is finding bugs in our software and correcting them as necessary .
cognitive psychology technique,technology,approach
matching process procedure,process
ratio of efficiency ratio
optical character recognition translation OPTICAL CHARACTER RECOGNITION is the electronic or mechanical translation of scanned images of text that may be handwritten , typewritten or printed , into machine .
decoding algorithm algorithm CORE ONTOLOGY
interleaving procedure,process
behavior-based system system CORE ONTOLOGY
adaptive control control system a ADAPTIVE CONTROL is a form of control system whose parameters may be changed dynamically in order to adapt to a changing environment .
inverse resolution algorithm INVERSE RESOLUTION is a complete algorithm for learning first-order theories ( ) .
inference procedure procedure,process
iterative dynamic programming methodology,method
probabilistic planning markov decision process PROBABILISTIC PLANNING is based on markov decision processes .
bayesian updating well-established technique BAYESIAN UPDATING is a well-established technique .
constrained shortest path finding finding
data extraction act,action,activity
satellite-based navigation system system CORE ONTOLOGY
decision analysis technique,technology,approach
unsupervised learning extraction UNSUPERVISED LEARNING is the extraction of information from unlabelled data .
coreference resolution process of determining COREFERENCE RESOLUTION is the process of determining whether two expressions in natural language refer to the same entity in the world .
logical equivalence concept LOGICAL EQUIVALENCE is an important concept in set-builder notation : big .
dolev-yao model model,framework
representation of document representation
communication channel methodology,method
learning process procedure,process
fcrfs model model,framework
satisfiability checking core algorithm SATISFIABILITY CHECKING is a core algorithm in almost all approaches to verification and testing .
knowledge property property
relative clause subordinate 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 .
protocol language a PROTOCOL is a language and a set of rules that allow computers to interact in a well-defined way .
process of retaining procedure,process
rsa encryption public-key encryption algorithm RSA ENCRYPTION is a public-key encryption algorithm .
goal-oriented theory theory CORE ONTOLOGY
complexity analysis technique,technology,approach
reductio ad absurdum methodology,method
omniscient agent agent
ray tracing methodology,method
d-separation graphical property D-SEPARATION is a graphical property of bayesian networks and has the following implication : if two sets of nodes x and y are d-separated in .
parsing technique,technology,approach
merging process procedure,process
exchange of information data,information
hybrid model expression a HYBRID MODEL refers to an expression of a state transition such as the one shown in fig .
prior knowledge data,information
learning system system
probabilistic algorithm algorithm CORE ONTOLOGY
speech synthesis process of converting SPEECH SYNTHESIS is the process of converting the text into spoken language .
material handling science MATERIAL HANDLING is a science of motion , managing and storing of content for the period of transportation .
prior probability concept PRIOR PROBABILITY is a really complicated concept to understand , but it basically is a way of determining what the probability of a specific event occurring before any data is collected .
laser range finder device a LASER RANGE FINDER is one of the most important devices for measuring distances .
iterative deepening search method in general , ITERATIVE DEEPENING is the preferred search method when there is a large search space and the depth of the solution is not known .
conditional event event a CONDITIONAL EVENT is an event in a reduced sample space .
stopword removal technique,technology,approach
neural network learning search process NEURAL NETWORK LEARNING is a search process for the minimization of a criterion or error function .
spectral kernel kernel
natural language source NATURAL LANGUAGE is a source of inferentially powerful syntax .
graph data structure data structure CORE ONTOLOGY
greedy agent agent
evolutionary programming intelligence method EVOLUTIONARY PROGRAMMING is artificial intelligence method for optimization based on the mechanics of natural selection , such as mutation , recombination , .
metonymy intradomain phenomenon METONYMY is an intradomain phenomenon .
simplification rule rule
herbrand base model,framework
boolean formula parenthesized expression 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 .
linear programming technique,technology,approach
probabilistic network model,framework
binary heap 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 .
q-learning incremental dynamic programming procedure Q-LEARNING is an incremental dynamic programming procedure that determines the optimal policy in a step-by-step manner .
information gain data,information
compilation language language
abstract argumentation framework monotonic deductive system an ABSTRACT ARGUMENTATION FRAMEWORK is based on a monotonic deductive system ( ) , where v is a formal language and r is a set of inference rules .
representation of causality representation
dealing methodology,method
model-based reasoning inference method In artificial intelligence , MODEL-BASED REASONING refers to an inference method used in expert systems based on a model of the physical world .
problem formulation process of deciding PROBLEM FORMULATION is the process of deciding what actions and states to consider .
symbolic integration integration
maximum entropy procedure,process
natural deduction technique,technology,approach
scalar phenomenon phenomenon CORE ONTOLOGY
photogrammetry with relation PHOTOGRAMMETRY deals with relations that exist between the object and the image spaces .
public key encryption encryption methodology PUBLIC KEY ENCRYPTION is the encryption methodology used in pki and was initially proposed by diffie and hellman in 1976 .
model of knowledge model,framework
forward checking simplest method FORWARD CHECKING is the simplest method for doing this .
behaviour of agent agent
non-human entity entity
process of condensing procedure,process
source of datum source
explanation-based learning machine-learning approach 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 . .
dotted rule data structure a DOTTED RULE is a data structure used in top-down parsing to record parital solutions towards discovering a constituent .
computer simulation technique,technology,approach
functional programming paradigm FUNCTIONAL PROGRAMMING is a paradigm that treats computer programs as mathematical functions .
sensitivity analysis technique,technology,approach
machine-learning approach technique,technology,approach
default rule rule the term DEFAULT RULE is used to describe a rule with a query scope of all .
rule-based architecture technique,technology,approach
two-level morphology system TWO-LEVEL MORPHOLOGY is a system which relates lexical representations of ( ) ( ) two-level morphology is not phonology -- but rather ( ) morphology or ( ) it .
integer factorization process of breaking in number theory , INTEGER FACTORIZATION is the process of breaking down a composite number into smaller non-trivial divisors , which when .
conditional event expression a CONDITIONAL EVENT is an expression of the kind .
discretization technique,technology,approach
single entity entity
model-based approach technique,technology,approach
sequential search algorithm 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 .
utility theory methodology,method
theory resolution model,framework
bayesian learning methodology,method
min-conflicts appealing technique MIN-CONFLICTS is an appealing technique described in ( ) .
gaussian elimination methodology,method
environment property 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 procedure,process
program synthesis technique,technology,approach
adaptive planning package,software,software system
value iteration methodology,method
cooperative coevolution technique,technology,approach
web mining process of analyzing WEB MINING is the process of analyzing an assortment of behavioral , demographic , lifestyle , transactional , internet and geographic information .
state variable quantity,measure
software architecture belief SOFTWARE ARCHITECTURE is the belief that since some sort of diagram representing the software can be drawn after the software has been .
breadth first search tree search tree
feature subscription feature 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 procedure,process
pragmatic interpretation interpretation
contingency planning technique,technology,approach
context-free grammar system a CONTEXT-FREE GRAMMAR is a formal system that describes a language by specifying how any legal text can be derived from a distinguished symbol called the .
logical consequence relation LOGICAL CONSEQUENCE is the relation between premises and conclusion of a valid piece of reasoning ( ) .
object-oriented programming creating a OBJECT-ORIENTED PROGRAMMING is a creating a program that can use and support objects .
matching methodology distance method MATCHING METHODOLOGY is a superficial minimum distance method .
conversation utterance Superficially , a CONVERSATION is a sequence of utterances
transformational grammar technique,technology,approach
quantization procedure,process
obstacle avoidance ability OBSTACLE AVOIDANCE is a fundamental ability of a mobile robot .
machine evolution evolution
process of producing procedure,process
agent-based software engineering technique,technology,approach
string matching technique,technology,approach
formal grammar ability FORMAL GRAMMAR is the ability to describe the language .
nlp model,framework
regret minimization technique,technology,approach
mesh generation process of dividing MESH GENERATION is the process of dividing the analysis continuum into a number of discrete parts or finite elements .
natural language processing strategy a NATURAL LANGUAGE PROCESSING is the study of strategies for computer programs to recognize and understand language in spoken and written form .
machine intelligence with computational technique MACHINE INTELLIGENCE is concerned with computational techniques for representing and reasoning about complex objects .
stochastic dominance quantity,measure
computational linguistics science COMPUTATIONAL LINGUISTICS is the science that tries to make machines understand language .
model-based recognition goal-driven approach 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 stochastic matrix CONDITIONAL PROBABILITY TABLE is a right stochastic matrix which means that each row consists of non-negative real numbers and is summing to 1 .
autoepistemic logic formalism AUTOEPISTEMIC LOGIC is a formalism concerned with the notion of ` knowledge ' and allows introspection of knowledge bases -- that is , asking what a knowledge .
edge base knowledge domain,knowledge base,domain
depth first search tree search tree
experimental evaluation act,action,activity
head of a clause clause
game theory strategy GAME THEORY is the science of strategy .
software engineering discipline,study,field of study
dcg software development DCG is an international software development consulting firm helping companies frustrated with development costs , hampered by poor quality or struggling to .
ray tracing technique,technology,approach
prior knowledge 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 .
figure of speech language a FIGURE OF SPEECH is a language used in a figurative or nonliteral sense .
bit of information data,information
vector quantization technique,technology,approach
script orthography a SCRIPT is a particular orthography or writing system .
exponential growth growth a EXPONENTIAL GROWTH is the growth in the value of a quantity , in which the rate of growth is proportional to the instantaneous value of the quantity
description logic formalism a DESCRIPTION LOGIC is a formalism for knowledge representation that comprises two parts .
vhdl process procedure,process
web mining extraction WEB MINING is the extraction of interesting and potentially useful patterns and implicit information from artifacts or activity related to the world wide web .
probabilistic network concise representation a PROBABILISTIC NETWORK is a concise representation of a joint probability distribution on a set of statistical vari - ables ( ) .
processing system system CORE ONTOLOGY
control theory theory CONTROL THEORY is the first scientific theory that can handle all these phenomena within a single testable concept of how living systems work .
game theory mathematics GAME THEORY is a branch of applied mathematics that is used in the social sciences , most notably in economics , as well as in biology , engineering , political science , international relations , computer science , social psychology , philosophy and management .
optimization model model,framework
dempster-shafer theory technique,technology,approach
knowledge map concept KNOWLEDGE MAP is a concept of knowledge searching , which constructs the related between different knowledge .
linguistic expression expression
standard deviation measurement 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 .
data fusion technique,technology,approach
family of programming language language
linked list technique,technology,approach
kernel method technique,technology,approach
algorithmic complexity complexity ALGORITHMIC COMPLEXITY is complexity in space and computation complexity is complexity in time ( ) .
normalization procedure,process
alpha-beta pruning methodology,method
fibonacci heap heap a FIBONACCI HEAP is a very efficient heap .
nested monte-carlo search monte-carlo search
vector-space model abstraction VECTOR-SPACE MODEL is a similarly limited abstraction of the graph structure , into a representation on which straightforward classification techniques can be built .
completeness of a search algorithm algorithm
diagnostic rule rule
constraint optimization model,framework
loss function quantity,measure
program agent agent
robotic agent agent
kernel learning paradigm KERNEL LEARNING is a paradigm in the eld of machine learning that generalizes the use of inner products to compute similarities between arbitrary .
classification accuracy ratio CLASSIFICATION ACCURACY is the ratio of the number of correctly classified images to with the modified cpn and the classification accuracy is noted .
accurate classifier classifier
tokenization process of replacing TOKENIZATION is the process of replacing some piece of sensitive data with a value that is not considered sensitive in the context of the environment that consumes the token and the original sensitive data .
string matching algorithm STRING MATCHING is an algorithm based on artificial intelligence , and various string matching methods have been disclosed to date .
fuzzy logic technique,technology,approach
computational model of discourse computational model
activation function output activity 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 .
lexicalized formalism formalism
mereology theory MEREOLOGY is a theory of the relation of part to whole , one that deviates gently mereology is boolean algebra with 1 but no 0 , set theory with a universal set but .
symmetric matrix matrix a SYMMETRIC MATRIX is a square matrix that is its own transpose , and is symmetric about the main diagonal .
empirical study report an EMPIRICAL STUDY is a report of original research in which an hypothesis is tested
knowledge-based agent model-based agent a KNOWLEDGE-BASED AGENT is essentially a model-based agent : knowledge representation .
value iteration technique,technology,approach
robotic discipline discipline,study,field of study
maximum entropy technique,technology,approach
information theory mathematics a INFORMATION THEORY is a branch of applied mathematics and engineering involving the quantification of information sent over a communication channel , disregarding the meaning of the sent messages , exemplified by the noisy-channel coding theorem .
cognitive psychology discipline,study,field of study
robot trajectory trajectory
hash table table HASH TABLE is a table that contains both key value and mapped value .
irrational behavior behavior
supervised method methodology,method
domain of discourse knowledge domain,knowledge base,domain
symbolic planning feature SYMBOLIC PLANNING is an important feature responsible for any robotics system to exhibit an intelligent behavior whenever dealing with non completely structured .
bigram model simplification BIGRAM MODEL is a simple and popular simplification , which makes the following approximation .
cryptography technique,technology,approach
control theory discipline,study,field of study
control system system CORE ONTOLOGY
expectimax minimax algorithm EXPECTIMAX is a variation of the minimax algorithm that combines the minimization and maximization nodes of minimax search with chance .
tlplan system system CORE ONTOLOGY
non-deterministic domain knowledge domain,knowledge base,domain
truth-functionality ability intuitively , TRUTH-FUNCTIONALITY is the ability to compute a result from some input data , i. e. to combine information to obtain new information .
inheritance relation INHERITANCE is a relation between two classes .
polynomial time boolean query POLYNOMIAL TIME is the set of boolean queries expressible in first-order logic extended by the ability to define new relations by induction .
unit resolution feature UNIT RESOLUTION is a key feature of state of the art sat solvers ( ) ( ) ( ) , where it speeds up the search for solutions and inconsistencies .
regular expression expression in programming , a REGULAR EXPRESSION is an expression that explains a pattern for a string .
polygonal model model,framework
software specification technique,technology,approach
cryptographic algorithm algorithm CORE ONTOLOGY
grammar formalism language a GRAMMAR FORMALISM is a language used for expressing grammars .
proving approach technique,technology,approach
belief propagation methodology,method
source of knowledge source
loom knowledge representation language LOOM or LOOM is a knowledge representation language developed by researchers in the Artificial Intelligence research group at the University of Southern California 's Information Sciences Institute .
estimation process of making a ESTIMATION is the process of making an estimate .
support vector machine methodology,method
local consistency algorithm consistency algorithm
minimax search depth a MINIMAX SEARCH is always depth first .
induction algorithm learning 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 graphic representation a TASK NETWORK is a graphic representation of the task flow for a project .
graceful degradation process of using 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 attempt 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 clustering method HIERARCHICAL CLUSTERING is one of the clustering methods which allows to group objects to clusters and build hierarchy of clusters .
training corpus corpus
maximum likelihood procedure,process
pac learning learning
control knowledge tlplan system CONTROL KNOWLEDGE is the tlplan system by bacchus .
optical flow relation OPTICAL FLOW is the relation of the motion field .
normative theory goal-oriented theory a NORMATIVE THEORY is a goal-oriented theory that represents real world situations , not as they are , but as they should be .
decision analysis methodology,method
formulation act,action,activity
greedy algorithm optimization 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 .
well-formed formula expression 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 .
background knowledge data,information
core language engine domainindependent system The CORE LANGUAGE ENGINE ( ) ( ) is a domainindependent system developed at SRI Cambridge , which translates English sentences into formal representations .
similarity metric technique,technology,approach
algorithmic complexity concept ALGORITHMIC COMPLEXITY is a concept that was introduced by kolmogorov to avoid thus , algorithmic complexity is a especially useful quantity for obtaining the .
optical flow technique,technology,approach
event calculus formalism EVENT CALCULUS is a specific formalism for reasoning about events , described here : http : \ \ en.wikipedia.org \ wiki\ event calculus .
linear equation expression a LINEAR EQUATION is an expression that makes a linear graph .
engineering discipline,study,field of study
diagnostic inference inference
invariant shape representation representation
extractive activity act,action,activity
item of knowledge knowledge
kernel discriminant analysis nonparametric technique KERNEL DISCRIMINANT ANALYSIS is a nonparametric technique that offers greater flexibility at the cost of increased com - plexity .
linked list data structure a LINKED LIST is a simple linear data structure , each of whose nodes includes pointers to the previous and subsequent nodes in the list , enabling traversal of the structure from any starting point .
nondeterminism computational property a NONDETERMINISM is a computational property that may have more than one result . .
heuristic search concept HEURISTIC SEARCH is a fundamental concepts in ai to enhance solution path finding in implicit problem graphs ( ) .
logistic regression technique,technology,approach
cross-correlation quantity,measure
wordnet reference system WORDNET is an on-line lexical reference system whose design is inspired by current psycholinguistic theories of human lexical memory .
description logic theory DESCRIPTION LOGIC is the mathematical theory ( ) that is at the basis of some of the technologies defined .
synthesis of algorithm algorithm
belief function bayesian 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 representation
multi-agent platform platform
routine procedure,process
random variable concept RANDOM VARIABLE is an important concept in probability theory , and its applications to .
process of deciding procedure,process
prototypical implementation source a PROTOTYPICAL IMPLEMENTATION is available including source .
human cognition act,action,activity
autonomous vehicle driverless system an AUTONOMOUS VEHICLE is a driverless system which can derive information about the environment from its on-board sensors , make decisions based on the .
syntactic ambiguity information property SYNTACTIC AMBIGUITY is information property consistent with sentences which may be parsed digital more that one way .
expectiminimax complexity complexity
coreference resolution process of identifying COREFERENCE RESOLUTION is the process of identifying when two noun phrases ( ) refer to the same entity .
linear classifier algorithm A LINEAR CLASSIFIER is an algorithm to find a linear function that best separates the data .
software specification methodology,method
script act,action,activity
on-line tuning method methodology,method
natural language processing computational technique NATURAL LANGUAGE PROCESSING is a range of computational techniques for analyzing and representing naturally occurring texts at one or more levels of linguistic .
backtracking methodology,method
long-distance dependency source LONG-DISTANCE DEPENDENCY is one of the major sources of problems in the process of detecting syntacti - cally related associations .
content-based image retrieval technique,technology,approach
inference algorithm algorithm CORE ONTOLOGY
machine translation process of receiving MACHINE TRANSLATION refers to the process of receiving an input string in a source language and automatically generating an output string in a target language .
experimental vehicle vehicle
dijkstra's algorithm algorithm
autonomous agent computer system an AUTONOMOUS AGENT is a computer system that is capable of independent action on behalf of its owner or user .
matrix factorization technique,technology,approach
qualitative spatial reasoning technique,technology,approach
data matrix code DATA MATRIX is the preferred code for direct part marking , an explanation of the advantages of using data matrix including high information density , 360 degree .
computational property emergent property COMPUTATIONAL PROPERTY is actually an emergent property of hundreds of thousands of neurons cooperating to produce the amazing processing .
gaussian kernel kernel a GAUSSIAN KERNEL is a kernel with the shape of a gaussian ( ) curve .
grammar attribute attribute
genetic algorithm model,framework
intrinsic property member-name property the name INTRINSIC PROPERTY is a member-name property .
multi-document summarization technique,technology,approach
sensory stimulus stimulus
goal-based agent agent
experience knowledge a EXPERIENCE is the knowledge thus gathered .
subsumption architecture technique,technology,approach
built-in knowledge knowledge
collaborative filtering technique,technology,approach
successor function representation 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 algorithm TREE SEARCH is one of the central algorithms of any game playing program .
consistency algorithm algorithm
dynamic symbol feature a DYNAMIC SYMBOL is the defining feature of our current ampang-kl strategy .
reflex agent model,framework
sift feature feature
domain theory model,framework
process monitoring methodology,method
vacuum agent agent
logical reasoning process of using LOGICAL REASONING is the process of using a rational , systematic series of steps based on sound mathematical procedures and given statements to arrive at a.
algorithmic complexity length ALGORITHMIC COMPLEXITY is the length of the minimal program that would yield the observed output in a computer simulation .
question answering act,action,activity
prepositional phrase phrase
normalization rule a NORMALIZATION is a set of rules for creating tables in a relational database .
statistical relational learning intersection STATISTICAL RELATIONAL LEARNING is the intersection of research in graphic models , logic representations and probabilistic theories .
active vision technique,technology,approach
unsupervised learning algorithm learning algorithm
relative error ratio 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 .
morphology discipline,study,field of study
process of selecting procedure,process
pagerank system PAGERANK is a system that helps google to organize its search result pages .
syntactic parser module a SYNTACTIC PARSER is an important module of various kinds of natural language processing systems .
knowledge-based system 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 algorithm
logic programming technique,technology,approach
first-order language language CORE ONTOLOGY
artificial intelligence computer system a ARTIFICIAL INTELLIGENCE is a computer system or software package which is artificially intelligent .
assumption-based system system
speech act utterance a SPEECH ACT is an utterance that is grammatically similar to a statement but is neither true nor false , though it is perfectly meaningful .
conditional independence concept CONDITIONAL INDEPENDENCE is a hugely important concept in probability theory - to cite just one example , without conditional independence , the .
dynamical system concept A DYNAMICAL SYSTEM is a concept in mathematics where a fixed rule describes the time dependence of a point in a geometrical space .
utility-based agent agent
computer vision science a COMPUTER VISION is the science and technology of machines that see , concerned with the theory for building artificial systems that obtain information from images , such as a video sequence , views from multiple cameras , or multi-dimensional data from a medical scanner .
quotient ratio a QUOTIENT is the ratio of two quantities to be divided .
causal model model,framework
discretization process of converting DISCRETIZATION is the process of converting real gene expression data into a typically small number of finite values ( ) .
em algorithm algorithm
declarative approach technique,technology,approach
refinement matrix matrix
conceptual graph knowledge representation language CONCEPTUAL GRAPH is a knowledge representation language .
training event event CORE ONTOLOGY
constraint based theory theory CORE ONTOLOGY
hidden markov model algorithm HIDDEN MARKOV MODEL is one of the most important algorithms in computational biology .
extrinsic property property an EXTRINSIC PROPERTY is a property defined solely in terms of functional relations , i.e. it is a property that is described with respect to something .
truth maintenance technique,technology,approach
tree decomposition representation a TREE DECOMPOSITION is a representation of a complete set of vertex separators of a graph .
event calculus theory EVENT CALCULUS is indeed the proper theory to treat a group of phenomena including .
fuzzy logic theory FUZZY LOGIC is based on the theory of fuzzy sets , a theory which relates fuzzy logic is a logical system , which is an extension of multi-valued logic ( ) .
linear regression relation a LINEAR REGRESSION is the relation between variables when the regression equation is linear : e.g. , y = ax + b.
causation belief a CAUSATION is the belief that events occur in predictable ways and that one event leads to another . .
chart parser parsing algorithm a CHART PARSER is a variety of parsing algorithm that maintains a table of well-formed substrings found so far in the sentence being parsed .
policy iteration methodology,method
information theory learning a INFORMATION THEORY is the branch of learning concerned with quantitative measures of information .
pattern matching process of finding PATTERN MATCHING is the process of finding some or all of the occurrences of a target pattern in a source pattern .
iterative deepening search strategy 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 .
color property 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 classifier
decision maker resolve 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 .
benchmarking act,action,activity
autonomous robot ability an AUTONOMOUS ROBOT is the ability to learn new reflexes .
local consistency concept LOCAL CONSISTENCY is one of the oldest and most fundamental concepts of constraint solving and the simplest and most widely used form of local consistency is .
constraint propagation feature CONSTRAINT PROPAGATION is the main feature of any constraint solver .
inflectional morphology phenomenon INFLECTIONAL MORPHOLOGY is the phenomenon whereby the grammatical properties of a word ( ) are expressed by realizing the word in a particular form .
compilation complexity complexity
spelling correction feature SPELLING CORRECTION is an important feature in many different types of software applications , such as word processing applications and email applications .
trigger act,action,activity
incorporation phenomenon a INCORPORATION is a linguistic phenomenon .
k-dl decision list decision list
cryptography methodology,method
virtual agent agent
document corpus corpus
signal processing technique,technology,approach
action-utility table table
support vector machine training algorithm SUPPORT VECTOR MACHINE is a training algorithm -LCB- we have learned nearest neighbor , identification tree , genetic algorithm and neural net -RCB- for learning classification .
dynamical system system CORE ONTOLOGY
strong connectivity algorithm algorithm
distance metric learning parametric technique DISTANCE METRIC LEARNING is a parametric technique defined under the supervised setting .
hidden markov model bayesian a HIDDEN MARKOV MODEL is a simple dynamic bayesian net - work that is characterized by initial state probabilities , state transition probabilities , and emission .
process of selecting feature procedure,process
image edge feature IMAGE EDGE is an important feature of image .
pruning technique,technology,approach
resource requirement requirement
label propagation technique,technology,approach
annealing technique,technology,approach
maximum likelihood methodology,method
pagerank algorithm PAGERANK is a family of algorithms for assigning numerical weightings to hyperlinked documents ( ) indexed by a search engine .
data-directed inference inference
user requirement requirement
cognitive modelling discipline,study,field of study
software engineering technique,technology,approach
short-term memory ability SHORT-TERM MEMORY is the ability to ` hold in mind ' information .
theory resolution procedure,process
stability of sorting algorithm algorithm
graph coloring register allocation algorithm GRAPH COLORING is a register allocation algorithm that works by creating a graphical representation of the program .
speech synthesis process of producing SPEECH SYNTHESIS is the process of producing vocal signal using machines , based on the phonetical transcription of messages" .
logic sampling iterative algorithm LOGIC SAMPLING is an iterative algorithm that converges .
training datum system TRAINING DATUM is available to the system , whose the desired output is known .
natural language processing technique,technology,approach
process of dealing procedure,process
web service communication a WEB SERVICE is a method of communication between two electronic devices over a network .
pattern recognition discipline,study,field of study
sensitivity analysis process of determining SENSITIVITY ANALYSIS is the process of determining how small pertubations of model inputs affect model outputs .
goal predicate act,action,activity
first-order probabilistic logic knowledge representation language FIRST-ORDER PROBABILISTIC LOGIC is a powerful knowledge representation language .
behavioral theory theory CORE ONTOLOGY
game theory discipline,study,field of study
web mining discipline,study,field of study
software verification process of ensuring SOFTWARE VERIFICATION is the process of ensuring that a program meets its intended specification ( ) .
cost function relationship a COST FUNCTION is any mathematical relationship between an activity and its cost .
web mining moving WEB MINING is moving the world wide web toward a more useful environment in which users can quickly and easily find the information they need .
support vector vector a SUPPORT VECTOR refers to a characteristic vector si on the optimal identification hyperplane .
training sample sample input vector a TRAINING SAMPLE is a pair of a sample input vector and a desired output vector .
connectionism technique,technology,approach
parallel processing ability PARALLEL PROCESSING is the ability of an entity to carry out multiple operations or tasks simultaneously .
convex polygon 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 system
modell of event event
computational complexity amount COMPUTATIONAL COMPLEXITY refers to the amount of processing required by client computer system 506 to decode the encoded macroblock .
autonomous vehicle underwater autonomous vehicle
state diagram model,framework
hacker programmer 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 .
computational complexity theory theory COMPUTATIONAL COMPLEXITY THEORY is a branch of the theory of computation in computer science that investigates the problems related to the resources required to run algorithms , and the inherent difficulty in providing algorithms that are efficient fo .
intersection representation a INTERSECTION is a representation of common ground between theories or phenomena .
dependency tree representation 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 .
game-theoretic consideration consideration
prioritized sweeping model,framework
iterative deepening quality ITERATIVE DEEPENING is a well-known quality of results .
node search feature NODE SEARCH is a very useful feature and is function available or has it been deemed not necessary .
rational agent agent
cognitive science knowledge COGNITIVE SCIENCE is the study of human knowledge , of which one aspect is the study of how knowledge is acquired , stored , and represented in the mind , including the mind&rsquo .
version-space learning incremental process 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 rule REWRITE RULE is one of the rules governing the possible forms that a sentence 's phrase structure can take .
advantage quality a ADVANTAGE is the quality of having a superior or more favorable position .
data modelling technique technique,technology,approach
bayesian updating probabilistic updating procedure 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 .
adjacency list methodology,method
matrix multiplication benchmark MATRIX MULTIPLICATION is a classical benchmark for experimenting with techniques used to exploit machine architecture and to overcome the limitations of .
constraint calculus calculus
possibility theory interpretation POSSIBILITY THEORY is an interpretation of fuzziness that assigns possibility theory is intrinsically more compatible with subjective ( ) and heuristic .
finite element method technique,technology,approach
lattice theory mathematics LATTICE THEORY is the branch of mathematics that deals in precise mathematical language with the relation of different parts of the same whole to each other .
domain knowledge representation DOMAIN KNOWLEDGE is a formal representation of expert information in a particular field .
neural network hardware device NEURAL NETWORK HARDWARE is usually devices designed to implement neural to present the state of the art in neural network .
feature extraction finding then FEATURE EXTRACTION is equivalent to finding a subspace , w , if feature extraction is directed specifically at classification , a criterion .
active learning strategy ACTIVE LEARNING is an attractive strategy for robot learners because it has the potential to improve the accuracy and the speed of learning , but it can cause issues from an interaction perspective .
uncertain rule rule
fraction quotient a FRACTION is the quotient of two rational numbers .
optical character recognition technique,technology,approach
multiattribute utility theory methodology,method
specularly reflected light color SPECULARLY REFLECTED LIGHT is the same color as the source .
evolutionary programming computational technique EVOLUTIONARY PROGRAMMING is a computational technique pioneered by .
cryptography mathematics CRYPTOGRAPHY is the science of using mathematics to encrypt and decrypt information .
taxonomic information data,information
relational database relation a RELATIONAL DATABASE is a set of relations .
collaborative filtering methodology,method
situated planning agent planning agent
reactive planner system a REACTIVE PLANNER is a system that builds or changes its .
fault quality a FAULT is the quality of being inadequate or falling short of perfection .
hierarchical decomposition process of decomposing HIERARCHICAL DECOMPOSITION is the process of decomposing a system in a top down fashion .
baseline data,information
computational learning theory discipline,study,field of study
version space region VERSION SPACE is the region of feature space defined as the intersection of the unit sphere and the polyhedral cone of the feature space .
similarity measure methodology,method
execution monitoring technique,technology,approach
recommender system technique,technology,approach
situated language language
acquisition of knowledge feature ACQUISITION OF KNOWLEDGE is the key feature that distinguishes education ( ) at any level from all other activities .
relation phrase phrase
decision list representation 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.
quantum theory language QUANTUM THEORY is the language of all particle theories .
ground term variable-free tree structure a GROUND TERM is a variable-free tree structure built by operators from leaves .
recommender system package,software,software system
sentiment lexicon phenomenon SENTIMENT LEXICON is a common phenomenon when users are getting excited .
discriminative maximum entropy model model,framework
goal-directed reasoning reasoning
graph mining technique,technology,approach
vector algorithm algorithm CORE ONTOLOGY
number theory mathematics 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 process of discovering UNSUPERVISED LEARNING is the process of discovering significant patterns or features in the input data when no certain output or response categories ( ) are .
semantic interpretation process of converting SEMANTIC INTERPRETATION is the process of converting the raw text of spoken utterances into a representation of data that is more easily .
vector quantization quantization VECTOR QUANTIZATION is simply the quantization of a vector , an ordered set of real numbers .
binary search algorithm BINARY SEARCH is an algorithm in which a data structure , such as an array or a list , known to be in sorted order is searched efficiently for a.
forward chaining technique,technology,approach
associative memory system 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 .
associative relation relation an ASSOCIATIVE RELATION is a relation that is also an associative operation .
multilayer neural network system a MULTILAYER NEURAL NETWORK is defined as a system that consist of neurons of the above type and connections with a layered structure .
decision theory theory CORE ONTOLOGY
domain adaptation importance DOMAIN ADAPTATION is of practical importance in many areas of applied machine learning , ranging from computational biology ( ) to natural language .
fdtd approach technique,technology,approach
connection method methodology,method
hierarchical planning source HIERARCHICAL PLANNING is one of the sources of inflexibility .
information extraction process of identifying INFORMATION EXTRACTION is the process of identifying relevant information where the criteria for relevance are predefined by the user in the form of a template that is to be filled .
speech feature feature
identity relation relation in logic , the IDENTITY RELATION is normally defined as the relation that holds only between a thing and itself .
summarizing ability SUMMARIZING is defined as the ability to produce a comprehensive but condensed summarizing is important because it benefits both you and the student .
knowledge engineer person
non-euclidean geometry posteriori knowledge NON-EUCLIDEAN GEOMETRY is a form of a posteriori knowledge , and most scientists believe the same about space (
optimal solution system an OPTIMAL SOLUTION is an integrated system for detecting attacks on several levels .
block region a BLOCK is a region of code in a program that acts as a single unit , such as a function or loop .
problem-solving system system
production system system CORE ONTOLOGY
constraint network model,framework
hierarchical abstraction methodology,method
diagnostic knowledge knowledge
with computational technique computational technique
event detection technique,technology,approach
cross-indexing technique,technology,approach
maximum entropy model,framework
normalization process of removing NORMALIZATION is the process of removing redundant data from your tables in order to improve storage efficiency , data integrity and scalability .
instructional method methodology,method
variable-free tree structure tree structure
logic programming theory LOGIC PROGRAMMING is a theory behind the prolog .
noun compound expression a NOUN COMPOUND is an expression which is made up of more than one word and which functions in the clause as a noun .
formal grammar discipline,study,field of study
role of domain knowledge role
analogical language language ANALOGICAL LANGUAGE is language , and the use of language , to suggest ideas by comparisons .
planning agent agent
encryption methodology methodology,method
marker-passing algorithm algorithm CORE ONTOLOGY
modal operator expression 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 theory CONDITIONAL PROBABILITY is a theory of how to model these intuitions .
role inclusion expression similarly , a ROLE INCLUSION is an expression of the form .
psychological reasoning reasoning
semi-supervised learning supervised method finally , SEMI-SUPERVISED LEARNING is actually a supervised method that avoids labeling a large number of instances .
kernel function smoothing technique KERNEL FUNCTION is one of the smoothing techniques .
orthogonal relation relation
cognitive architecture model,framework
belief network inference inference
descriptive theory behavioral theory a DESCRIPTIVE THEORY is a behavioral theory of what people actually do when facing a decision .
forward chaining intelligence method FORWARD CHAINING is a artificial intelligence method of reasoning which uses inference rules to create new sentences from existing facts .
dependency analysis process of identifying DEPENDENCY ANALYSIS is the process of identifying processes which can be executed simultaneously and those which must be executed in sequential order ( ) .
support vector machine learning algorithm a SUPPORT VECTOR MACHINE is a learning algorithm typically used for classification problems (
information extraction technique,technology,approach
convex hull polygon a CONVEX HULL refers to a polygon composed of the convex hull lines .
sensor measurement measurement
artificial agent agent an ARTIFICIAL AGENT is an agent that is implemented in software , or a robot .
output activity act,action,activity
multiagent system technique,technology,approach
inference method base language method an INFERENCE METHOD is just a simple base language method marked with an annotation '' @ inferencemethod '' .
np-completeness property NP-COMPLETENESS is a property of decision problems .
unsupervised learning learning UNSUPERVISED LEARNING is sometimes called learning without teacher .
kalman filtering recursive algorithm KALMAN FILTERING is a recursive algorithm , which has been proposed as an attractive alternative to correct overlapping interferences in icp-aes .
most transparent model model,framework
query mining mining
hash function technique,technology,approach
causal rule expression a CAUSAL RULE is an expression of the form f ? g , where f and g are propositional formulas .5 these formulas are called the head and the body .
interval algebra relation INTERVAL ALGEBRA is based on thirteen basic relations that can hold between intervals
statistical-relational learning learning
game theory math GAME THEORY is a branch of applied math which looks at competitive situations where 2 or more people have conflicting interests .
interleaving methodology,method
driverless system system CORE ONTOLOGY
iterative deepening search search technique ITERATIVE DEEPENING SEARCH is the best search technique as the branching factor is unknown and the depth factor is unknown
monotonic deductive system deductive system
discriminant analysis technique,technology,approach
adjacency list representation in graph theory , an ADJACENCY LIST is the representation of all edges or arcs in in computer science , an adjacency list is a data structure for representing graphs .
process of pointing procedure,process
cognitive architecture system a COGNITIVE ARCHITECTURE is an integrated system capable of supporting intelligence .
decision procedure procedure,process
wacky agent agent
tree decomposition concept TREE DECOMPOSITION is a well-known concept from graph theory .
member-name property property CORE ONTOLOGY
metropolis algorithm algorithm
conceptual clustering 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 .
problem-solving heuristic technique,technology,approach
event detection trigger EVENT DETECTION is the trigger that sets in motion the process of consequence .
parallel processing methodology,method
control method methodology,method
integrability quality a INTEGRABILITY is the quality of being integrable .
terminal test test
knowledge acquisition learning KNOWLEDGE ACQUISITION is a method of learning , first proposed by aristotle in his seminal work `` organon '' .
multi-core processor processing system a MULTI-CORE PROCESSOR is a processing system composed of two or more or more individual processors , called cores , integrated onto a single chip package .
decision analysis procedure,process
relevance-based learning learning
linear transformation concept a LINEAR TRANSFORMATION is an important concept in mathematics because many real world phenomena can be approximated by linear models .
operations research technique,technology,approach
bayesian learning system BAYESIAN LEARNING is a system to identify patterns .
graphic representation representation CORE ONTOLOGY
nondeterministic algorithm hypothetical algorithm in the theory of computation , a NONDETERMINISTIC ALGORITHM is a hypothetical algorithm where computation can branch , choosing among different execution paths .
knowledge engineer computer system a KNOWLEDGE ENGINEER is a computer systems expert who is trained in the field of expert systems .
object-oriented database property OBJECT-ORIENTED DATABASE is an important property of our work .
process of forming procedure,process
dynamical system act,action,activity
silhouette method graphical cluster validation technique SILHOUETTE METHOD is a graphical cluster validation technique , which can be used to select the number of clusters .
rate of convergence rate
surface error quantity,measure
speech recognition technique,technology,approach
anytime algorithm iterative refinement 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 expression CORE ONTOLOGY
schema rule rule
diagnostic method methodology,method
semi-supervised feature selection concept SEMI-SUPERVISED FEATURE SELECTION is a new concept that combines the feature selection and semi-supervised learning techniques ( ) .
belief network inference complexity complexity
propositional logic deductive system a PROPOSITIONAL LOGIC is a formal deductive system in which formulae representing propositions can be formed by combining atomic propositions using logical connectives .
divide and conquer algorithm 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 ability COGNITIVE SKILL is the ability to judge the number , order and identity of individual sounds in the language .
proof sketch data structure a PROOF SKETCH is the central data structure which represents the state of a proof .
kernel method algorithm a KERNEL METHOD is an algorithm that depends on the data only through dot - products .
core algorithm algorithm CORE ONTOLOGY
product rule technique,technology,approach
operations research discipline,study,field of study
behavior-based robotics methodology,method
knowledge compilation process of transforming KNOWLEDGE COMPILATION is the process of transforming a domain theory into a form specialized for the solution of a given problem set .
markov decision process decision process
speedup learning learning SPEEDUP LEARNING is a form of learning in which an inefficient problem solver is transformed into an efficient one .
algebra of feature feature
systems ability ability CORE ONTOLOGY
deterministic finite automaton model,framework
question-answering system system
pattern matching process of identifying PATTERN MATCHING is the process of identifying groupings of matching nodes and edges .
combinatory categorial grammar lexicalized formalism COMBINATORY CATEGORIAL GRAMMAR is a lexicalized formalism that excels in dealing with long and short-range dependencies .
cross validation methodology,method
degree of consistency degree
answer set programming technique,technology,approach
domain of value knowledge domain,knowledge base,domain
production rule expression 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 .
problem formulation model,framework
new predicates learning learning
contingency quality a CONTINGENCY is the quality of being contingent
agent design act,action,activity
blind search technique,technology,approach
telepresence turning video communication TELEPRESENCE is turning video communications into a near in-person experience .
unconditional probability quantity,measure
logic program clause a LOGIC PROGRAM is a set of clauses with the restriction that there is exactly one positive literal in each clause .
memory rule rule
part-of-speech tagger system a PART-OF-SPEECH TAGGER is a system which automat - ically assigns the part .
qualitative calculus calculus QUALITATIVE CALCULUS is calculus of qualitative variables with values taken from the domain -LCB- - , 0 , + -RCB- .
generalized resolution rule GENERALIZED RESOLUTION is the following rule of inference : a1 & a2 & ... & am = ) b1 v b2 v ... v bk .
structural relationship relationship
turing test test a TURING TEST is a test proposed by alan turing in which a machine would be judged `` intelligent '' if the software could use conversation to fool a human into thinking it was talking with a person instead of a machine . .
production rule algorithm a PRODUCTION RULE is an algorithm computing one or more target properties of an object , taking one or more source properties as an input .
case-based planning problem-solving method 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 .
utility function learning learning
process of recognizing procedure,process
commonsense rule rule
activation level quantity,measure
lookup table data structure In computer science , a LOOKUP TABLE is a data structure , usually an array or associative array , often used to replace a runtime computation with a simpler array indexing operation .
computational complexity theory mathematics COMPUTATIONAL COMPLEXITY THEORY is the branch of mathematics that endeavors to show that certain problems are so hard to compute that they are essentially .
parametric technique technique,technology,approach
process of decomposing procedure,process
mesh generation requirement MESH GENERATION is the first requirement in the finite element analysis and there are many different approaches in mesh generation .
probabilistic projection reasoning PROBABILISTIC PROJECTION is a special case of reasoning about continuously changing quantities involving partial orders and other sorts of incomplete information .
conceptual clustering learning CONCEPTUAL CLUSTERING is a type of learning by observation that is particularly suitable for summarising and explaining data .
backjumping technique,technology,approach
logistic regression methodology,method
interleaving technique,technology,approach
role of heuristic role
rule of combination rule
goal representation representation
deterministic automaton concept DETERMINISTIC AUTOMATON is a concept of automata theory in which the outcome of a transition from one state to another given a certain input can be predicted for .
least commitment concept LEAST COMMITMENT is a useful concept for analyzing when decisions should be made in any search problem .
completeness of a proof procedure procedure,process
graphical device device
dependency grammar theory 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 device a FORCE SENSOR is a device that is used to measure the vector quantity of force .
automation of reasoning reasoning
inductive learning process learning process
rational action act,action,activity
minimax algorithm algorithm CORE ONTOLOGY
arithmetic operation dealing an ARITHMETIC OPERATION is dealing with data in a computational manner , adding subtracting , etca logical operation would normally be regarded a a comparison .
depth first search recursive algorithm DEPTH FIRST SEARCH is a recursive algorithm .
graceful degradation ability GRACEFUL DEGRADATION is the ability of a computer , machine , electronic system or network to the purpose of graceful degradation is to prevent catastrophic failure .
report data,information
truth maintenance methodology,method
sparse coding unsupervised learning algorithm 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 .
blocks world theory BLOCKS WORLD is a theory of the first-order predicate calculus with equality .
neural computation macroscopic phenomenon NEURAL COMPUTATION is a macroscopic phenomenon that results from the interaction between ensembles of interacting neurons .
convolution technique,technology,approach
probabilistic reasoning formation PROBABILISTIC REASONING is the formation of probability judgments and of subjective beliefs about the likelihoods of outcomes and the frequencies of events .
cryptography discipline,study,field of study
process of eliminating procedure,process
role hierarchy representation ROLE HIERARCHY is the structural representation of roles that reflects the organizational work break down structure .
user preference user requirement USER PREFERENCE is one of the important user requirements .
indefinite domain knowledge domain,knowledge base,domain
knowledge compilation technique,technology,approach
qualitative reasoning reasoning QUALITATIVE REASONING is the practice of reasoning with qualities rather than an example of qualitative reasoning is the use of predicate calculus to provide .
annealing process of heating 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 .
active vision methodology,method
multiagent system system a MULTIAGENT SYSTEM is a distributed system consisting of multiple software agents , which form `` a loosely coupled network , called a multiagent system ( ) , to .
motivation act,action,activity
multi-agent system 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 procedure,process
multiple inheritance feature MULTIPLE INHERITANCE refers to a feature of some object-oriented programming languages in which a class can inherit behaviors and features from more than one superclass .
theorem proving technique,technology,approach
web mining technique,technology,approach
decision lists learning learning
diagonal matrix symmetric matrix a DIAGONAL MATRIX is a symmetric matrix with all of its entries equal to zero except may be the ones on the diagonal .
detachment act,action,activity
actuator device an ACTUATOR is a mechanical device for moving or controlling a mechanism or system .
normalization technique,technology,approach
knowledge compilation learning KNOWLEDGE COMPILATION is learning in which existing knowledge is converted into new forms , to improve problem-solving efficiency .
subsumption architecture methodology,method
language model model,framework
adaptive planning technique,technology,approach
problem-solving agent agent
mean square error quantity,measure
inductive logic programming search method INDUCTIVE LOGIC PROGRAMMING is an appealing local search method as it allows .
bounded optimality technique,technology,approach
belief propagation inference algorithm BELIEF PROPAGATION is an inference algorithm for graphical models that has been widely and successfully applied in a great variety of domains , .
analog process procedure,process
theory of information value theory
process of heating procedure,process
probabilistic planning with domain PROBABILISTIC PLANNING is concerned with domains where an agent seeks to achieve a goal given uncertain knowledge , in the form of probability distributions , .
qbf solver algorithm QBF SOLVER is an algorithm that determines the truth value of such formulas .
edge detection technique,technology,approach
algorithmic complexity theory moreover , ALGORITHMIC COMPLEXITY is based on a systematic theory of models , .
integer factorization process of determining INTEGER FACTORIZATION is the process of determining which prime numbers divide a given positive integer .
kolmogorov complexity quantity,measure
symbolic approach dolev-yao model SYMBOLIC APPROACH is based on dolev-yao model ( ) which relies on a formal model : bitstrings are abstracted by formal expressions , the .
model checking well-established technique artifacts , MODEL CHECKING is a well-established technique in single system development .
correlation coefficient methodology,method
principal component analysis technique,technology,approach
case-based reasoning model,framework
logic variable abstraction a LOGIC VARIABLE is an abstraction of uncertainty .
mobile device device
support vector machine technique,technology,approach
language processing memory-based model LANGUAGE PROCESSING is a memory-based model .
glm regression algorithm algorithm CORE ONTOLOGY
linear programming mathematics a LINEAR PROGRAMMING is the branch of mathematics concerned with the minimization or maximization of a linear function of several variables and inequalities
active learning instructional method ACTIVE LEARNING is generally defined as any instructional method that engages students in the learning process .
domain of application knowledge domain,knowledge base,domain
uniform convergence theory theory
cluster ensemble methodology,method
parse tree tree structure 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 event a HAPPENING is an event that happens .
open class training event an OPEN CLASS is a training event scheduled at various locations wherein all crews are welcome to attend .
dimensionality reduction technique,technology,approach
semantic network model,framework
problem-solving method methodology,method
cross-entropy based filter technique technique,technology,approach
data driven technique technique,technology,approach
posteriori knowledge knowledge CORE ONTOLOGY
c-buridan algorithm 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 query
conversational agent knowledge domain,knowledge base,domain
ockham algorithm algorithm
interpropositional relation relation CORE ONTOLOGY
epistemic logic theory EPISTEMIC LOGIC is the theory of arbitrary individual or social learning mechanisms .
fortran system a FORTRAN is a formula translating system : a programming language widely used for many years in scientific applications . .
logistic regression model,framework
theory of inheritance theory a THEORY OF INHERITANCE is a theory of how characteristics of one generation are derived from earlier generations .
connectionism theory CONNECTIONISM is a theory of information processing developed by rumelhart & mclelland which models learning by the parallel processing of sub-symbolic .
data fusion methodology,method
integer linear programming paradigm INTEGER LINEAR PROGRAMMING is also a powerful paradigm into which to cast approximation algorithms .
unary notation language UNARY NOTATION is a perfectly fine language you still need a human to decide if a representation is .
program synthesis discipline,study,field of study
passive agent agent
measure of uncertainty model,framework
with relation relation CORE ONTOLOGY
cognitive science discipline,study,field of study
linear regression model,framework
anaphora phenomenon 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 quantity,measure
inheritance ability 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 simulation-based method REINFORCEMENT LEARNING is a simulation-based method rooted in dynamic programming .
passive learning learning PASSIVE LEARNING is described as learning that is `` caught , rather than taught , '' and is characterized as `` typi - cally effortless , responsive to animated stimuli , .
constraint satisfaction procedure,process
linear regression methodology,method
ontology language language an ONTOLOGY LANGUAGE is an artificial language that expresses knowledge about the structure of human communication and that is suitable to .
process of grasping procedure,process
speech act act,action,activity
analogical reasoning 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 methodology,method
tropistic agent agent
metalevel reasoning reasoning
reinforcement learning machine learning algorithm REINFORCEMENT LEARNING is a category of machine learning algorithms including q learning , temporal difference , and sarsa algorithm [ 7–9 ] .
decision-making process procedure,process
theory of language theory
cross validation process of testing CROSS VALIDATION is the process of testing a model on more than one sample .
planning under uncertainty ability PLANNING UNDER UNCERTAINTY is a critical ability for au - tonomous robots operating in uncontrolled environments , such as homes or offices .
web service package,software,software system
tree-based indexing indexing
beam search technique,technology,approach
subsumption architecture ability SUBSUMPTION ARCHITECTURE is the ability of higher layers to observe and inter - .
skolemization process of eliminating SKOLEMIZATION is the process of eliminating existential quantifiers from a formula thus , skolemization is an equisatisfiable transformation .
nlp excellence NLP is the study of human excellence .
score rule system SCORE RULE is a new system in the school .
dependency analysis technique,technology,approach
graceful degradation feature GRACEFUL DEGRADATION is an added feature
situation-action rule rule
memory requirement requirement
uncertain reasoning diagnostic method UNCERTAIN REASONING is the main diagnostic method .
means-ends analysis methodology,method
ontology matching process of finding ONTOLOGY MATCHING is the process of finding correspondences between .
maximum likelihood technique,technology,approach
model tree data driven technique 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 technique,technology,approach
incorporation act,action,activity
sketch recognition process of identifying 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 process of selecting feature a LOGICAL QUERY is the process of selecting features whose attributes meet specific logical criteria (
encoded message model model,framework
value iteration unguided algorithm 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 inference
knowledge-based system technique,technology,approach
acoustic model model,framework
apposition quality 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 .
cluster ensemble technique,technology,approach
probability vector vector a PROBABILITY VECTOR is a vector with nonnegative entries that add up to 1 .
visual feature feature
ground clause clause a GROUND CLAUSE is a clause which does not contain any variables .
skolemization methodology,method
base language method methodology,method
data set data,information
fuzzy logic reasoning a FUZZY LOGIC is a form of reasoning , derived from fuzzy set theory , whereby a truth value need not be exactly zero or one
multiagent reasoning reasoning
decision tree learning inductive learning process DECISION TREE LEARNING is an inductive learning process which is based on example learning , focusing on pushing out rules of decision tree 's representation form .
perspective projection theory PERSPECTIVE PROJECTION is the theory of how to display and move 2d coordinates in relation to each other to make the illusion of 3d space on a.
face recognition biometric method FACE RECOGNITION is one of biometric methods , to identify given face image using main features of face .
recommender system system RECOMMENDER SYSTEM is a system that helps users to find their wanted items by making recommendations based on either the content of the recommended .
alpha-beta search methodology,method
abstract noun quality an ABSTRACT NOUN is the name of a quality , action or state which is not physical and can not be touched .
intradomain phenomenon phenomenon CORE ONTOLOGY
unguided algorithm algorithm CORE ONTOLOGY
logic sampling technique,technology,approach
boruvka's algorithm algorithm
experience act,action,activity
normalization relation a NORMALIZATION is an of international relations between states , expressed in diplomatic relations , trade relations , culture , tourism and various collaborations . .
causal relation interpropositional relation a CAUSAL RELATION is an interpropositional relation in which the situation expressed by some proposition(s ) is communicated as bringing about .
biometric method methodology,method
collective decision-making feature COLLECTIVE DECISION-MAKING is a familiar feature of our soc read more .
conversational agent human-computer dialogue system a CONVERSATIONAL AGENT is human-computer dialogue system that interacts with the user turn by turn using natural language .
electronic circuits domain knowledge domain,knowledge base,domain
belief network learning learning
vector quantization methodology,method
oft-touted property property CORE ONTOLOGY
clever indexing indexing
existential elimination procedure,process
benchmarking process of identifying BENCHMARKING is the process of identifying `` best practice '' in relation to both products ( ) and the processes by which those products are created and .
distributed processing discipline,study,field of study
domain knowledge rule DOMAIN KNOWLEDGE refers to the rules of expressing the relation among classification classes between specific examples , and it can be realized as a set of rules which produce combination of another example having specific relation with such classes and classification classes which this example should have , by applying specific operation to the given example and also to the example given from classification classes ancillary thereto .
learning agent mapping in supervised learning , a LEARNING AGENT is given mappings of inputs to desired outputs .
perceptron model,framework
minimum description length length
tokenization act,action,activity
machine translation system MACHINE TRANSLATION is the study of designing systems that translate from one machine translation is an important sub-discipline of the wider field of artificial .
dependency grammar technique,technology,approach
naive agent agent
unit clause clause a UNIT CLAUSE is a clause containing only one literal ( ) , while a binary clause con - tains exactly two literals .
testing machine learning algorithm a TESTING is a machine learning algorithms are trained on a collection of instances or patterns . once training is complete , it is usual to test the trained system on a collection of test instances or test patterns which were not used when training the system , in order to find out to what degree the system is able to generalise beyond its training data . .
parallel relation relation a PARALLEL RELATION is a relation between the branches , with each branch receiving the same total potential and their individual branched currents adding together .
dcop algorithm algorithm
differential equation algebraic relation a DIFFERENTIAL EQUATION is an algebraic relation between variables that includes the rates of change of the variables as well as their .
visibility graph technique,technology,approach
action model model,framework
ontological engineering methodology,method
unsupervised learning methodology,method
logical equivalence relation LOGICAL EQUIVALENCE is a relation between two or more statement , and as we have just shown , we can use truth tables to determine whether or not two truth - .
feature selection technique,technology,approach
autonomous land vehicle vehicle
beam search dfs BEAM SEARCH is close to dfs in nodes traversed and time of execution , but generates too much search space .
bayes' rule rule
robotics discipline,study,field of study
coalitional game system a COALITIONAL GAME is system .
mining extractive activity a MINING is any extractive activity .
time expression expression
multi-document summarization process of dealing MULTI-DOCUMENT SUMMARIZATION is the process of dealing with a large amount of information present in multiple related source documents by comprises only the .
cognitive science ability COGNITIVE SCIENCE is the study of mental abilities such as perception , action , speech , memory , thinking , and language , and their bases in the brain , using scientific methods of experimentation , computational modeling , and brain imaging .
language analysis methodology,method
atomic event assignment an ATOMIC EVENT is an assignment of particular values to all the variables -- in other words , a complete specification of the state of the domain .
foliation process of forming a FOLIATION is the process of forming into a leaf or leaves .
support quantity,measure
automaton system a AUTOMATON is a formal system , such as finite automaton .
binary classification methodology,method
figure of speech device a FIGURE OF SPEECH is a literary device which employs language figuratively ( ) , in order to create a certain .
computational complexity theory hardness COMPUTATIONAL COMPLEXITY THEORY is the study of the inherent hardness or easiness of computational tasks .
web mining process of discovering WEB MINING refers to the process of discovering potentially useful and previously unknown information or knowledge from web data .
image retrieval importance IMAGE RETRIEVAL is gaining importance as a support tool for diagnosis , research and education in medical domain ( ) .
distributed processing system a DISTRIBUTED PROCESSING is a system in which each computer or node in network performs its own processing and manages some of its data while network facilitates communications between nodes . .
target concept concept
pseudo code 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 .
pronunciation learning learning
higher-order logic formalism HIGHER-ORDER LOGIC is a formalism that allows a natural expression of program specifica - tions and of mathematics .
procedural attachment technique,technology,approach
prepositional logic agent agent
linear program optimization model a LINEAR PROGRAM is a mathematical optimization model that has a linear objective function and a set of linear constraints .
knowledge level quantity,measure
algorithm of adaptation algorithm
computational efficiency amount COMPUTATIONAL EFFICIENCY refers to the amount of processing required to achieve a given accuracy .
decision theory model,framework
sequential search technique,technology,approach
branch-and-bound search algorithm BRANCH-AND-BOUND SEARCH is a basic algorithm for solv - ing combinatorial optimization problems .
resolution strategy sequential testing algorithm 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 system
neighbour classifier classifier
disjoint set data structure a DISJOINT SET is a data structure that contains non-overlapping elements , with the definition of overlapping being a parameter of the data structure
program synthesis methodology,method
sample complexity quantity,measure
ordinary differential equation relationship an ORDINARY DIFFERENTIAL EQUATION is any relationship between a function ( ) ) and its derivatives up to some order : f ( x , y , dy dx .
contingency planning process of identifying CONTINGENCY PLANNING is the process of identifying risks from disruption of operations and services .
human-computer dialogue system system CORE ONTOLOGY
kalman filtering methodology,method
domainindependent system system CORE ONTOLOGY
source language language a SOURCE LANGUAGE is the language used by the speaker , or the written language a document is written in that will be interpreted or translated into another .
organisation of knowledge knowledge
uncertainty model model,framework
anaphora resolution process of determining ANAPHORA RESOLUTION is the process of determining whether two expressions in natural language refer to the same real world entity .
deterministic finite automaton finite automaton
dempster-shafer theory formalism DEMPSTER-SHAFER THEORY is a formalism for reasoning under uncertainty which may be viewed as a generalisation of probability theory with special advantages in .
baseline procedure,process
computational learning theory attempt 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 system a HYBRID SYSTEM is a dynamic system that exhibits both continuous and discrete dynamic behavior -- a system that can both flow (
tree decomposition mapping in graph theory , a TREE DECOMPOSITION is a mapping of a graph into a tree that can be used to speed up show synopsis high quality content by wikipedia .
pattern recognition technique,technology,approach
linear classifier model,framework
structured programming construct construct
cooperative agent technique,technology,approach
referential transparency oft-touted property REFERENTIAL TRANSPARENCY is an oft-touted property of ( ) functional languages , which makes it easier to reason about the behavior of .
source of information source
randomization process of making a RANDOMIZATION is the process of making random .
linear separability concept LINEAR SEPARABILITY is an important concept in neural networks .
language origin theory LANGUAGE ORIGIN is the theory that explains how human acquired language at the first time .
markov blanket cross-entropy based filter technique MARKOV BLANKET is a cross-entropy based filter technique capable of identifying both redundant and irrelevant features .
sparse coding technique,technology,approach
degree of similarity degree
cost function representation a COST FUNCTION is a mathematical representation of how a cost changes with changes in the level of an activity relating to that cost .
linearization model,framework
computability science COMPUTABILITY is the science of determining what can and can not be computed .
algebraic relation relation CORE ONTOLOGY
acquisition of adaptation knowledge knowledge
cluster ensemble model,framework
model-based reasoning methodology,method
public-key encryption algorithm algorithm CORE ONTOLOGY
local encoding encoding
stochastic dominance technique,technology,approach
simplification complexity a SIMPLIFICATION is the act of reducing complexity .
heuristic search computer algorithm HEURISTIC SEARCH is the study of computer algorithms designed for problem solving , based on trial-and-error exploration of possible solutions .
stochastic dominance methodology,method
rule-based system system RULE-BASED SYSTEM is an expert system that contains a general rule-base and an inference engine .
decision analysis discipline,study,field of study
naturalness quality a NATURALNESS is the quality of innocent naivete .
matrix factorization methodology,method
feature space representation FEATURE SPACE is the representation of features in euclidean space , each feature plotted on an axis perpendicular to each other axis .
causal theory rule a CAUSAL THEORY is a set of casual rules of the form : φ ⇒ ψ , where φ and ψ are propositional formulas .
asbestos removal process of removing ASBESTOS REMOVAL is the process of removing asbestos containing materials ( ) from a building or structure .
assistive technology technique,technology,approach
introspection methodology,method
communicating agent proactive agent a COMMUNICATING AGENT is a proactive agent that introduces new function - alities of communication .
expected utility model,framework
truth-preserving inference inference
term rewriting decision procedure TERM REWRITING is one of the standard decision procedures for varieties .
rhetorical relation relation CORE ONTOLOGY
pattern matching process of searching PATTERN MATCHING refers to the process of searching for known byte patterns in a stream of data .
incomplete information feature INCOMPLETE INFORMATION is also the main feature of the model below , but our approach , and some of our results , differ from those of backus-driffill and .
fuzzy logic calculus FUZZY LOGIC is a logical calculus which operates with many truth values (
inductive learning 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 .
motion parallax methodology,method
default reasoning formalism DEFAULT REASONING is one of the leading formalisms known in artificial intelligence for non-monotonic reasoning , and modal logics of knowledge have been .
principal component analysis well-established method PRINCIPAL COMPONENT ANALYSIS is a well-established method of data analysis .
consistency checking test CONSISTENCY CHECKING is a test for the reliability of the one form of consistency checking is data consistency checking is e ective in reducing the prob - .
constraint propagation inference CONSTRAINT PROPAGATION is a form of inference , not search , and as such is more constraint propagation is a very general concept that appears under different .
density property a DENSITY is the spatial property of being crowded together .
knowledge-based agent knowledge domain,knowledge base,domain
input method system INPUT METHOD is system to help user 's keyboard input .
temporal logic technique,technology,approach
spatial relationship vector a SPATIAL RELATIONSHIP is a vector .
decision tree learning methodology,method
decision analytic approach technique,technology,approach
mathematical model model,framework
behavioral module behavior-based system BEHAVIORAL MODULE is a behavior-based system (
covariance matrix matrix In probability theory and statistics , a COVARIANCE MATRIX is a matrix whose element in the i , j position is the covariance between the
nlp discipline,study,field of study
language understanding process of grasping LANGUAGE UNDERSTANDING is a process of grasping .
qualitative reasoning technique,technology,approach
low-level action act,action,activity
computational biology discipline,study,field of study
formal grammar rule 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 .
incidence list graph data structure 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 .
decision tree pruning methodology,method
cosine similarity vector COSINE SIMILARITY is a common vector based similarity measure similar to dice coefficient .
mobile sensor sensor node platform MOBILE SENSOR is based on the popular sensor node platform .
logical reasoning ability LOGICAL REASONING is the ability to combine multiple cognitive processes such as memory , attention , processing speed , and flexibility to be able to recognize .
data matrix matrix DATA MATRIX is a matrix ( ) bar code which may be here is that data matrix is composed of fields which have a ladder shape ( ) .
clustering act,action,activity
signal processing process of measuring SIGNAL PROCESSING is the process of measuring , manipulating or analyzing elec3104 digital signal processing is an introductory signal processing course .
dempster's rule rule
decision rule procedure,process
backward-chaining technique technique,technology,approach
hybrid model polygonal model a HYBRID MODEL is a polygonal model that uses rapid surfacing and traditional solid modeling techniques .
semantics of logic program logic program
artificial intelligence science ARTIFICIAL INTELLIGENCE is sometimes defined as the science of making computers artificial intelligence is a scientific field whose goal is to understand intelligent .
distributed encoding encoding
knowledge compilation methodology,method
linear programming methodology,method
knowledge acquisition act,action,activity
semantic space indefinite domain SEMANTIC SPACE is an indefinite domain of possible expression to which the current text bears some active and particular relationship .
grammatical formalism technique,technology,approach
partial regression technique,technology,approach
horn clause 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 .
collaborative filtering algorithm COLLABORATIVE FILTERING is an algorithm successfully and widely used in recommender system .
passive adp agent agent
simulation-based method methodology,method
linearization process of reducing LINEARIZATION is the process of reducing a homogeneous polynomial into a multilinear map over a commutative ring .
table-based indexing indexing
forward checking search method FORWARD CHECKING is a highly regarded search method used to solve constraint mal forward checking is implemented as a marriage of incremental forward .
irrationality quality a IRRATIONALITY is the quality or state of being irrational
greedy algorithm methodology,method
functional dependency relationship a FUNCTIONAL DEPENDENCY is a relationship between or among attributes such that the values of one attribute depend on , or are determined by , the values of the .
incremental algorithm algorithm an INCREMENTAL ALGORITHM is an algorithm that includes several ( ) our incremental algorithm is compared experimentally to an .
transition model model,framework
image annotation descriptive information 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 agent
gps satellite-based navigation system GPS is a satellite-based navigation system originally developed for military purposes and is maintained and controlled by the united states department of .
pruning strategy strategy
descriptive information data,information
domain transition graph graph representation a DOMAIN TRANSITION GRAPH is a graph representation of a state variable and shows the possible ways in which values can change .
planning problem constrained shortest path finding PLANNING PROBLEM is essentially constrained shortest path finding .
path consistency property PATH CONSISTENCY is a property similar to arc consistency , but considers pairs of variables instead of only one .
speech recognition process of converting SPEECH RECOGNITION is the process of converting spoken words into data .
syntactic theory of knowledge theory
inverse resolution technique,technology,approach
hybrid mst algorithm algorithm
charge-coupled device system CHARGE-COUPLED DEVICE is a system that converts the light signals to digital data .
perceptron learning rule most transparent model PERCEPTRON LEARNING RULE is one of the most transparent models for learning in .
cognitive robotics reasoning COGNITIVE ROBOTICS is concerned with integrating reasoning , perception , and action within a uniform theoretical and implementation framework (
unsupervised learning technique,technology,approach
basic action theory theory a BASIC ACTION THEORY is a logical theory in the situation calculus that describes what holds initially in the world as well as how the world evolves under the effects .
inverse method methodology,method
shallow parser package,software,software system
gene expression pattern indicator GENE EXPRESSION PATTERN is an indicator of the state of the cell , and abnormal cellular states can be inferred by comparing expression profiles .
proof tree representation a PROOF TREE is a representation of a proof of a query .
genetic engineering technique,technology,approach
debugging process of discovering a DEBUGGING is the process of discovering and correcting errors in computer hardware and software .
block quantity,measure
reinforcement learning agent learning agent
debugging methodology,method
effective branching factor quantity,measure
control rule rule
register allocation algorithm algorithm CORE ONTOLOGY
sample input vector input vector
logical interpretation translation LOGICAL INTERPRETATION is a translation from terms that denote signs to terms that denote phonological entities .
module procedure,process
domain theory mathematics DOMAIN THEORY is a branch of mathematics that studies special kinds of partially ordered sets ( ) commonly called domains .
automated reasoning process of searching AUTOMATED REASONING is the process of searching for a chain of rules which connect certain facts with given conclusions .
linear regression technique,technology,approach
anaphora expression ANAPHORA are expressions whose specification is context-dependent .
multiple agent agent
metareasoning reasoning METAREASONING is reasoning about reasoning -- in its broadest sense , any computational process concerned with the operation of some other computational process .
auv system an AUV is a system that is too difficult to control .
htn planning knowledge domain,knowledge base,domain
lexical-functional grammar constraint based theory LEXICAL-FUNCTIONAL GRAMMAR is a constraint based theory of language , whose basic syntactic architecture distiguishes two levels of representation : c-structure .
automatic programming ability AUTOMATIC PROGRAMMING is an ability of a computer to develop a program all by itself , once the problem has been stated in some specified domain using some .
pattern matching technique,technology,approach
proactive agent agent
kernel method vector KERNEL METHOD is based on vector , the 2-order statistical quantity is a matrix .
information theory theory CORE ONTOLOGY
collective computation analog process COLLECTIVE COMPUTATION is an analog process , not a digital process .
demodulation process of filtering DEMODULATION is the process of filtering out the actual transferred information from the received signal .
pathmax concept 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 .
image formation formation
time constraint feature in master data , the TIME CONSTRAINT is a definite feature of the infotype or subtype .
non-formal language language CORE ONTOLOGY
incidence matrix 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 .
target domain source domain TARGET DOMAIN is source domain -- this is the basic formula for metaphor
decision tree pruning process of replacing 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 .
robotic network robotic agent a ROBOTIC NETWORK is a group of robotic agents moving in space and endowed with communication capabilities .
kl-one knowledge representation system KL-ONE is a well known knowledge representation system in the tradition of semantic networks and frames .
graceful degradation technique,technology,approach
taxonomy science TAXONOMY is a branch of biological science involved with classifying organisms based on characteristics they share in common .
recommender system methodology,method
graphical cluster validation technique technique,technology,approach
depth-limited search dfs DEPTH-LIMITED SEARCH is dfs with an imposed maximum path depth cutoff .
model checking methodology,method
mathematical statement communication
functioning procedure,process
model state evolution evolution
binary decision diagram concise representation a BINARY DECISION DIAGRAM is a concise representation of the shannon decom - position of a boolean function ( ) .
incremental search search method INCREMENTAL SEARCH is the search method in firefox and chrome , vc + + , emacs and eclipse
object recognition ability OBJECT RECOGNITION is the ability to recognize an object .
recommender system data,information
fibonacci heap data structure a FIBONACCI HEAP is a data structure that supports the three binomial heap min fibonacci heap : is a collection of min trees
text categorization technique,technology,approach
causal model quantity,measure
constructive induction methodology,method
mixed inference inference
regular expression language a REGULAR EXPRESSION is a domain specific language for matching text .
parsing algorithm algorithm CORE ONTOLOGY
worst case analysis technique,technology,approach
cross-indexing methodology,method
role hierarchy technique,technology,approach
logic programming creating a LOGIC PROGRAMMING is a creating a program that enables the computer to reason logically .
turning video communication communication CORE ONTOLOGY
automated reasoning methodology,method
clustering method methodology,method
decision tree learning technique,technology,approach
intelligent agent computer system an INTELLIGENT AGENT is a computer system capable of flexible .
tokenization process of using 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 .
definite clause grammar rewriting system DEFINITE CLAUSE GRAMMAR is a convenient rewriting system with an arrow .
natural language processing procedure,process
pure inductive inference inductive inference
modal logic reasoning MODAL LOGIC is a form of reasoning that allows us to qualify the truth of a judgment in our system .
probabilistic inference technique,technology,approach
feature selection process of selecting 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 data,information
pattern matching language PATTERN MATCHING is fundamental to languages such as haskell , scala pattern matching is , at least in haskell , deeply tied to the concept of .
hierarchical planning methodology,method
rewriting system system CORE ONTOLOGY
correspondence theory theory
nondeterminism concept NONDETERMINISM is a central concept in computer science .
cluster ensemble estimation CLUSTER ENSEMBLE is the estimation of the probabilities p with which data points belong to the combined clusters .
effective branching factor branching factor
analytical expression expression In mathematics , an ANALYTICAL EXPRESSION is a mathematical expression , constructed using well-known operations that lend themselves readily to calculation .
behavior-based robotics technique,technology,approach
inference relation relation an INFERENCE RELATION is a relation between existing knowledge and the .
graph algorithm algorithm a GRAPH ALGORITHM is an algorithm ( ) that takes one or more graphs as inputs .
maximum entropy methodology,method
leak node source 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 technique,technology,approach
model-free method methodology,method
image processing technique,technology,approach
forward-chaining agent agent
quantum theory theory a QUANTUM THEORY is a physical theory that certain properties occur only in discrete amounts
optimality of a search algorithm algorithm
implication rule expression formally , an IMPLICATION RULE is an expression of the form furthermore , let us assume that this implication rule is valid only in a certain .
binary decision diagram data structure mathematically , a BINARY DECISION DIAGRAM is data structure used for representation of boolean functions in the form of rooted directed acyclic graph .
stationarity in pac learning pac learning
dynamic logic language DYNAMIC LOGIC is a language for specifying programming languages and gives a the original work on dynamic logic is by pratt ( ) and by harel .
game theory theory GAME THEORY is a mathematical theory that applies to certain situations in which there game theory is a significant branch of operations research and is closely .
generalization hierarchy abstraction 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 loom a JACQUARD LOOM is a mechanical loom , used to weave complex textile patterns .
assistive technology device ASSISTIVE TECHNOLOGY is a device or service that helps a person with a disability in his or her daily activities .
cross-validation test CROSS-VALIDATION is a test of validity for a regression model that involves using comparable data to check the validity of an original estimation .
truth maintenance system knowledge representation system a TRUTH MAINTENANCE SYSTEM is a knowledge representation system that can represent both beliefs and their dependencies .
bayesian learning process of determining BAYESIAN LEARNING is the process of determining probability distributions over each dataset 's possible values given the gold standard .
heuristic rule commonsense rule a HEURISTIC RULE is a commonsense rule intended to increase the probability of solving some problem .
atomic event happening informally , an ATOMIC EVENT is a happening ( ) to which each web site ( ) may decide .
stimulus data,information
evolutionary programming search technique EVOLUTIONARY PROGRAMMING is a probabilistic , global search technique that starts with a population of randomly generated candidate solutions .
empirical evaluation act,action,activity
stochastic matrix matrix a STOCHASTIC MATRIX is a matrix having the property that the entries in each column are non-negative , real and sum to 1 .
backward chaining search technique a BACKWARD CHAINING is a search technique used in production systems that begins with the action clause of a rule and works backward through a chain of rules in an attempt to find a verifiable set of condition clauses . .
constraint propagation process of applying CONSTRAINT PROPAGATION is the process of applying constraints to either pin solution cell values or eliminate solution cell candidate values .
photometry science PHOTOMETRY is the branch of science that deals with the measurement of light intensity .
problem solving process of applying PROBLEM SOLVING is the process of applying previously acquired knowledge to obtain a satisfactory solution to new and unfamiliar problems .
pseudo-code non-formal language 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 quantity,measure
process of filtering procedure,process
knuth-bendix algorithm algorithm
subordinate clause clause a SUBORDINATE CLAUSE is a dependent clause that adds some extra information to the main clause .
smoothing technique technique,technology,approach
ontological engineering finding ONTOLOGICAL ENGINEERING is concerned with finding the right answers to the ontological engineering is quite similar , except that the domains of analysis can be .
system of communication system
temporal differencing model-free method TEMPORAL DIFFERENCING is an efficient model-free method that saves on storage space since no model of the environment is explicitly stored .
benchmarking technique,technology,approach
physical system system
bug fault a BUG is a fault or defect in a computer program , system , or machine .
role hierarchy relation ROLE HIERARCHY is a relation among roles .
expressive power motivation EXPRESSIVE POWER is the motivation for designing new planning languages .
human-computer interaction discipline,study,field of study