abstraction entity
event abstraction
act,action,activity event
knowledge abstraction
procedure,process act,action,activity
knowledge domain,knowledge base,domain knowledge
system abstraction
representation knowledge
property abstraction
quantity,measure abstraction
algorithm procedure,process
methodology,method knowledge domain,knowledge base,domain
communication abstraction
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 ( ) .
model,framework representation
technique,technology,approach knowledge domain,knowledge base,domain
data,information abstraction
concept property
amount quantity,measure
quality property
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
theory knowledge domain,knowledge base,domain
data structure knowledge domain,knowledge base,domain
degree amount a DEGREE is the amount that an entity possesses a certain property
rule degree RULE is the degree of consistency for the rule .
phenomenon procedure,process
expression communication
instruction act,action,activity
statement instruction a STATEMENT is an instruction in a computer program .
reasoning inference a REASONING is the act of using inference to lead to a conclusion based on existing knowledge and\ or data . .
code communication
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 .
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 .
structure model,framework
function act,action,activity
process of making procedure,process
agent incorrect information AGENT is using incorrect information about the world .
source code code CORE ONTOLOGY
incorrect information data,information
source source code a SOURCE is a source code .
mapping process of making a MAPPING is the process of making maps .
process of breaking procedure,process
logic reasoning a LOGIC is a system of reasoning .
mechanism theory a MECHANISM is the philosophical theory that all phenomena can be explained in terms of physical or biological causes .
analysis process of breaking a ANALYSIS is the process of breaking down a substance into its constituent parts , or the result of this process .
ability quality
database data,information
program data,information
moving process of leaving a MOVING is the process of leaving one dwelling and settling in another .
translation moving In Euclidean geometry , a TRANSLATION is moving every point a constant distance in a specified direction .
search care SEARCH in and\ or graphs is able to take care of loops .
care state a CARE is the state of being cared for by others .
process of leaving procedure,process
process of formulating procedure,process
planning process of formulating PLANNING is the process of formulating an intended course of action .
vector methodology,method
sequence succession a SEQUENCE is a succession of geological events .
correction quantity,measure
string database a STRING is a database and web resource of known and predicted protein-protein interactions .
succession act,action,activity
equation correction a EQUATION is a small correction to observed values to remove the effects of systematic errors in an observation .
relation abstraction
discipline,study,field of study knowledge domain,knowledge base,domain
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 .
value state a VALUE is the state of an object .
emergent property phenomenon an EMERGENT PROPERTY is an unexpected collective phenomenon that arises from a system consisting of interacting parts .
language communication
intelligence emergent property INTELLIGENCE is an emergent property .
scholarly knowledge knowledge CORE ONTOLOGY
learning scholarly knowledge a LEARNING is a profound scholarly knowledge .
sentence translation SENTENCE ( ) is an acceptable translation of ( ) , but ( ) does not mean the same thing as ( ) .
operator mapping An OPERATOR is a mapping from one vector space or module to another .
length feature In phonetics , LENGTH or quantity is a feature of sounds that are distinctively longer than other sounds .
environment affine a ENVIRONMENT is an affine an equation that can be written in terms of matrix-vector multiplication and vector addition . .
pattern model,framework
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 .
affine equation a AFFINE is an equation that can be written in terms of matrix-vector multiplication and vector addition . .
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 .
node representation a NODE is the representation of a computational device in the Unified Modeling Language .
inference rule intelligence INFERENCE RULE refers to intelligence that ties concepts together .
robot mechanism a ROBOT is a mechanism that can move automatically .
tree length TREE is the length of its longest branch .
network digraph a NETWORK is a type of digraph in graph theory .
probability distribution concept a PROBABILITY DISTRIBUTION is a theoretical concept and many such distributions can be expressed mathematically .
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 .
digraph directed graph a DIGRAPH is a directed graph .
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 .
variable quantity,measure
application expression a APPLICATION is an expression that normally refers to software designed for a specific use such as a word processor . .
task procedure,process
instrumentality entity
magnitude vector a MAGNITUDE is an of a vector , the norm , most commonly , the two-norm .
device instrumentality
ratio magnitude a RATIO is the relative magnitudes of two quantities .
consequence phenomenon a CONSEQUENCE is a phenomenon that follows and is caused by some previous phenomenon .
definition source Therefore , a DEFINITION is a promising source for LR relations between the defined concept and the definition terms .
table methodology,method
resource source a RESOURCE is a source of aid or support that may be drawn upon when needed .
standardized procedure procedure,process
plan act,action,activity
determination act,action,activity
search algorithm algorithm CORE ONTOLOGY
science discipline,study,field of study
generalization inference rule In mathematical logic , GENERALIZATION is an inference rule of predicate calculus .
clause expression a CLAUSE is an expression including a subject and predicate but not constituting a complete sentence .
matrix table a MATRIX is a table of data .
distance amount a DISTANCE is a considerable amount of space .
process of constructing procedure,process
test standardized procedure a TEST is any standardized procedure for measuring sensitivity or memory or intelligence or aptitude or personality etc.
motion act,action,activity
formula rule a FORMULA is any mathematical rule expressed symbolically .
construction process of constructing a CONSTRUCTION is the process of constructing .
probability event a PROBABILITY is an event that is likely to occur .
person entity
distribution probability distribution a DISTRIBUTION is a probability distribution
aggregate analysis a AGGREGATE is an analysis , a technique used in amortized analysis in computer science , especially in analysis of algorithm .
semantic string a SEMANTIC is a string attached to a shader .
assignment mapping An ASSIGNMENT is a mapping ~ of variables to the elements of some feature alge- bra .
generation aggregate a GENERATION is the aggregate of the functions and phenomena which attend reproduction .
resolution quality a RESOLUTION is the quality of an X-ray crystallography data set .
optimization algorithm algorithm CORE ONTOLOGY
indexing system a INDEXING is a system used to assign indexes , such as .
decomposition phenomenon a DECOMPOSITION is the organic phenomenon of rotting .
development state a DEVELOPMENT is a state in which things are improving .
process of identifying procedure,process
neural network network a NEURAL NETWORK is any network of neurons or nuclei that function together to perform some function in the body .
essence feature a ESSENCE is a significant feature of something .
notation act,action,activity
principle essence a PRINCIPLE is a fundamental essence , particularly one producing a given quality .
result consequence A RESULT is the final consequence of a sequence of actions or events expressed qualitatively or quantitatively .
assumption statement a ASSUMPTION is a statement that is assumed to be true and from which a conclusion can be drawn .
complexity quantity,measure
parameter quantity,measure
operation procedure,process
software technique technique,technology,approach
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 .
justification statement a JUSTIFICATION is a statement in explanation of some action or belief .
alphanumeric string string
computing procedure,process
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 .
constraint path A CONSTRAINT is a path used to specify that particular function symbols must appear at particular places in a term .
effect state a EFFECT is the state of being binding and enforceable , as in a rule , policy , or law .
evaluation determination a EVALUATION is a determination of the value of a variable or expression .
curve software technique a CURVE is a software technique for image manipulation .
hypothesis explanation A HYPOTHESIS is a proposed explanation for a phenomenon .
process of putting procedure,process
expert system system an EXPERT SYSTEM is a system the development of expert system is implemented in clips .
text computing TEXT means computing a consistent knowledge base .
metric quantity,measure
decision-making method methodology,method
utility function instance method a UTILITY FUNCTION is any instance method that has no dependency on the state of the instance .
computer system system CORE ONTOLOGY
symbol alphanumeric string A SYMBOL is an alphanumeric string headed by .
architecture descriptive representation ARCHITECTURE is the set of descriptive representations that are required in order to create an object .
sort algorithm a SORT is an algorithm for sorting a list of items into a particular order .
interpretation assignment An INTERPRETATION is an assignment of meaning to the symbols of a formal language .
gradient descent optimization algorithm GRADIENT DESCENT is a very simple optimization algorithm and is used in many real life examples of optimization .
descriptive representation representation CORE ONTOLOGY
sorting algorithm process of putting a SORTING ALGORITHM is a process of putting a group of objects in a certain list or order .
calculus decision-making method a CALCULUS is a decision-making method , especially one appropriate for a specialised realm .
paradigm model,framework
explanation justification an EXPLANATION is a justification of the system 's beliefs .
classifier person
instance method methodology,method
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 .
computation simulated annealing a COMPUTATION is a simulated annealing a partially random method of search and optimization usually used for combinatorial optimization problems .
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 .
power notation a POWER is a mathematical notation indicating the number of times a quantity is multiplied by itself .
graph search algorithm search algorithm
simulation process of imitating a SIMULATION is the process of imitating a real phenomenon with a set of mathematical formulas . .
platform computer system a PLATFORM can refer to a computer systems operating system , , application or server .
context sentence CONTEXT are the sentences containing constraints or background information to the question , while answer are that provide solutions .
time quantity,measure
process of using procedure,process
ontology system a ONTOLOGY is a logical system involving theory of classes , developed by stanislaw lesniewski .
learning algorithm algorithm CORE ONTOLOGY
place space a PLACE is a space reserved for sitting
depth-first search best-first search DEPTH-FIRST SEARCH is a special case of best-first search .
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 .
process of determining procedure,process
communication system system CORE ONTOLOGY
query mapping In descriptive complexity , a QUERY is a mapping from structures of one signature to structures of another vocabulary .
process of imitating procedure,process
link two-way radio communication system a LINK is a two-way radio communication system
compound statement statement a COMPOUND STATEMENT is a sequence of simple statements . .
ai computer virus AI is a computer virus which infects .
phrase expression PHRASE is a potential referring expression .
decision problem partitioning a DECISION PROBLEM is a partitioning of a under some desired properties .
data type definition a DATA TYPE is a definition of the data .
first-order logic logic FIRST-ORDER LOGIC is a system of symbolic logic that can be attributed largely to the work of gottlob frege .
two-way radio communication system communication system
requirement act,action,activity
difference quality a DIFFERENCE is the quality of being unlike or dissimilar .
approximation technique,technology,approach
corpus reference system a CORPUS is a reference system based on an electronic collection of texts composed in a certain language .
circuit device a CIRCUIT is an electrical device that provides a path for electrical current to flow . .
reference system system CORE ONTOLOGY
decision determination a DECISION is a determination of future action . .
being state a BEING is the state or fact of existing .
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 . .
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 .
condition test a CONDITION is a comparative test between user-defined values and the actual values of a session request .
proposition formula PROPOSITION is equivalent to the formula in question .
process of becoming procedure,process
service act,action,activity
encoding act,action,activity
extension inference rule EXTENSION and reduction are sound inference rules .
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
research development RESEARCH is the development of anytime csg algorithms .
recognition state a RECOGNITION is the state or quality of being recognized or acknowledged .
cost consequence a COST is a negative consequence or loss that occurs or is required to occur .
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 .
concise representation representation CORE ONTOLOGY
size ratio SIZE is a ratio of two sizes .
partitioning analysis a PARTITIONING is an analysis into mutually exclusive categories .
map function a MAP is a continuous function .
attempt act,action,activity
sign event a SIGN is an event that is experienced as indicating important things to come .
reduction procedure,process
design plan a DESIGN is a plan for the structure and functions of an artifact , building or system .
rate ratio In mathematics , a RATE is a ratio between two measurements , often with different units .
attribute quality a ATTRIBUTE is a characteristic or quality of a thing .
data mining algorithm algorithm CORE ONTOLOGY
algorithmic representation representation CORE ONTOLOGY
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. (
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 .
vertex node a VERTEX is a node in a graph .
connectivity ability a CONNECTIVITY is the ability to make a connection between two or more points in a network .
decision tree arrangement a DECISION TREE is an arrangement of tests that provides an appropriate classification at every step in an analysis .
role act,action,activity
computational technique technique,technology,approach
acquisition ability a ACQUISITION is an ability that has been acquired by training .
software development translation a SOFTWARE DEVELOPMENT is the translation of a user need or marketing goal into a software product .
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 .
graphical model distribution a GRAPHICAL MODEL is a family of distributions that is restricted to be markov with respect to a certain graph .
situation state a SITUATION is the general state of things .
line quantity,measure
process of capturing procedure,process
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 .
diagram graph a DIAGRAM is a graph or chart .
computational paradigm paradigm
bound value a BOUND is a value which is known to be greater or smaller than a given set of values .
modeling construction a MODELING is the construction and use of a computer model of a physical system .
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 . .
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 . .
connection process of bringing a CONNECTION is the process of bringing ideas or events together in memory or imagination .
sensor model algorithmic representation a SENSOR MODEL is an algorithmic representation of a sensor in its state at the time of image collection .
process of enclosing procedure,process
process of growing graph procedure,process
search method methodology,method
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 .
interval distance a INTERVAL is the distance between things .
processor chip a PROCESSOR is the primary chip of the system that oversees all the other components of the system . .
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 . .
scheme-like language language CORE ONTOLOGY
connected network network
relationship relation a RELATIONSHIP is a relation between people .
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 .
limitation quality a LIMITATION is the quality of being limited or restricted .
process of bringing procedure,process
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 .
strategy science a STRATEGY is the branch of military science dealing with military command and the planning and conduct of a war .
web connectivity a WEB is the connectivity or resources available to computer users . .
region knowledge domain,knowledge base,domain
vehicle entity a VEHICLE is an entity to achieve an end .
constraint logic programming language logic programming language
process of finding procedure,process
formalism computational paradigm a FORMALISM is one of several alternative computational paradigms for a given theory .
order inference ORDER is a frequent inference of WTH .
function symbol symbol
control regulation a CONTROL is a regulation or maintenance of a function or action or reflex etc.
input text In disambiguation mode , the INPUT is the text whose sentence boundaries have not been marked up yet and need to be disambiguated .
deductive system system CORE ONTOLOGY
compact geometric representation representation CORE ONTOLOGY
state-space search search
disjunction compound statement a DISJUNCTION is a compound statement formed by combining two statements using the word or .
package,software,software system code
decision process procedure,process
notational system system CORE ONTOLOGY
increase process of becoming a INCREASE is a process of becoming larger or longer or more numerous or more important .
boolean function assignment a BOOLEAN FUNCTION is an assignment of 0 or 1 to each of these 2n different n - tuples .
kernel scheme-like language a KERNEL is a Scheme-like language .
segment path a SEGMENT is a straight path between two points that is the shortest distance between them .
evolution extraction a EVOLUTION is the extraction of a root from a quantity .
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 .
measurement act,action,activity
regulation ability a REGULATION is the ability of an early embryo to continue normal development after its structure has been somehow damaged or altered .
arrangement structure a ARRANGEMENT is an organized structure for arranging or classifying .
search tree representation a SEARCH TREE is representation of all possible computation paths .
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 .
classification association a CLASSIFICATION is an association of an input vector with a particular target vector . .
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 .
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 .
machine learning technique,technology,approach
chip constraint logic programming language CHIP is a constraint logic programming language developed by M. Dincbas in 1985 at ECRC .
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 .
process of converting procedure,process
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 .
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 .
encapsulation process of enclosing a ENCAPSULATION is the process of enclosing
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 .
synapse connection a SYNAPSE is the connection between processing elements in a neural network . .
formal semantics technique,technology,approach
bounded indeterminacy indeterminacy
decision-theoretic agent agent
natural language text text
conceptual graph representation a CONCEPTUAL GRAPH is a representation of a part of knowledge under an ontology or a canon (
integration act,action,activity
family of inference relation relation
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 .
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 .
dialogue act act,action,activity
source enterprise software development software development
optimality search search
linear programming discipline,study,field of study
termination condition condition
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 .
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 .
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 .
vacuum environment environment
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 .
unary constraint constraint a UNARY CONSTRAINT is simply a constraint over a single variable
flow network model,framework
hash function cryptographic algorithm a HASH FUNCTION is a cryptographic algorithm that accepts input , .
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 .
question answering component technology QUESTION ANSWERING is a key component technology .
prim's algorithm algorithm
minimax decision act,action,activity
sensing action reduction SENSING ACTION is the reduction in entropy of the posterior distribution that is induced by the measurement .
diameter of a state space space
model-based agent agent
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 .
tree-adjoining grammar grammar
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 .
search process procedure,process
behavior act,action,activity
planning system system CORE ONTOLOGY
incremental dynamic programming procedure procedure,process
information property property CORE ONTOLOGY
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 .
item of information data,information
kruskal's algorithm algorithm
chronological backtracking algorithm CHRONOLOGICAL BACKTRACKING is a very simple algorithm , pro- gressively theorem 1 , we can conclude that chronological backtracking is complete .
acquisition tool editor ACQUISITION TOOL is an editor of sorts that provides a structured .
automatic programming use ofsearch technique AUTOMATIC PROGRAMMING is the use ofsearch techniques to nd programs thatsolve a problem .
high-level ontology ontology
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
application of machine learning application
multiple inheritance goto MULTIPLE INHERITANCE is the goto of object oriented programming .
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 .
asymptotic analysis methodology,method
completeness of resolution consequence COMPLETENESS OF RESOLUTION is an immediate consequence of this theorem .
tiling algorithm algorithm
monotonicity of a logic logic
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 .
belief network construction construction
pragmatic source enterprise software development PRAGMATIC is a global open source enterprise software development , consulting and training company .
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 .
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 .
vector of probability probability
segment of discourse segment
remote agent computer program a REMOTE AGENT is a computer program aboard a spacecraft that controls the spacecraft .
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 .
op strips operator operator
cluster assignment matrix matrix
node structure structure
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 .
ordering constraint clause ORDERING CONSTRAINT is a set of clauses .
composite object encapsulation a COMPOSITE OBJECT is an encapsulation of a group of other objects that together provide a commonly useful graphical representation .
existential quantifier operator EXISTENTIAL QUANTIFIER is a logical operator of predicate logic , written thereis , which makes it possible to express that at least one .
analysis of gene expression research ANALYSIS OF GENE EXPRESSION is fundamental to biological research , and detection of differential expression of a gene ( ) between .
morphology shape a MORPHOLOGY is a shape , form , external structure , or arrangement , especially as an object of study or classification .
knowledge-based approach technique,technology,approach
complete proof procedure procedure,process
actor model of computation model,framework
rule of thumb rule
searching search a SEARCHING is a search
arithmetic notation programming language ARITHMETIC NOTATION is a programming language
point-based algorithm vector algorithm POINT-BASED ALGORITHM is the parallel vector algorithm .
addition of knowledge knowledge
partial mapping mapping
mobot robot a MOBOT is a mobile autonomous robot , especially one used in artificial intelligence research , or as a toy .
representation formalism naturalness REPRESENTATION FORMALISM is naturalness of representation .
temporal relation relation a TEMPORAL RELATION is a relation of earlier than or later than to a certain degree .
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 .
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 .
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 .
hypothetical algorithm algorithm CORE ONTOLOGY
phonological context context
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 .
orthogonality pattern pattern
world wide web web
existential introduction rule EXISTENTIAL INTRODUCTION is the opposite rule in which you applied .
units function function
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 .
case base structure a CASE BASE is a structure where the cases are stored .
knowledge source source KNOWLEDGE SOURCE is a leading source of healthcare business information and analyses services for executives who seek a competitive edge .
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 .
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 .
knowledge engineering with uncertainty knowledge engineering
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 .
mathematical induction schema mathematical induction
target language computer language a TARGET LANGUAGE is a computer language into which something written in another computer language is to be translated .
computer language language CORE ONTOLOGY
interaction graph tree INTERACTION GRAPH is a tree .
natural language expert system expert system
multiply connected network connected network
hybrid approach technique,technology,approach
first-order language act,action,activity
utterance ability a UTTERANCE is the ability to speak .
regular grammar rule a REGULAR GRAMMAR is a set of rules such that the regular expressions of the rules recognize pairwise disjoint languages .
deliberate ambiguity operator DELIBERATE AMBIGUITY is a perfectly valid operator , even simpler than that of qsf .
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 .
probability model model,framework
process of measuring procedure,process
unsatisfied clause clause
training pattern pattern
finding act,action,activity
decision analyst program DECISION ANALYST is a program that structures logical decision-making for policy analysis .
process of acquiring procedure,process
meta-comment communication META-COMMENT is communication about communication , as in .
complex structure a COMPLEX is a whole structure made up of interconnected or related structures .
speech understanding communication SPEECH UNDERSTANDING is key to communication .
cardinal direction calculus calculus
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 .
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 .
obstacle avoidance robotic discipline OBSTACLE AVOIDANCE is a robotic discipline with the objective of moving vehicles on the basis of the sensorial information .
iterative algorithm algorithm CORE ONTOLOGY
convex hull data structure CONVEX HULL is a very important data structure of computational geometry design .
optical character recognition procedure,process
real-world setting setting
naive method methodology,method
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 .
extraction process procedure,process
value function function
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 (
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 .
temporal-difference equation equation
syntactic parsing process of constructing SYNTACTIC PARSING is the process of constructing a syntactic parse tree for an input .
reference ontology theory a REFERENCE ONTOLOGY is analogous to a scientific theory
kinematics motion KINEMATICS is the study of the geometrically possible motion of a body or system of bodies , without consideration of the forces involved .
mathematical theory of computation theory
minimum proof graph proof graph
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.
data mining technique technique,technology,approach
discriminant analysis procedure,process
speech recognition systems ability SPEECH RECOGNITION refers to the systems ability to recognise the words spoken not the speaker ) .
graphical user interface user interface a gui or GRAPHICAL USER INTERFACE is an user interface , that talks to the user using graphics .
regular path query query
random walk model,framework
expansion of state state
adjective phrase phrase an ADJECTIVE PHRASE is a prepositional or verbal phrase that functions as an adjective .
execution time platform EXECUTION TIME is platform dependent -- the same algorithm may require different times for the same input on different machines .
understanding system being an UNDERSTANDING SYSTEM is being built around this model , allowing for unconstrained spoken input in a database retrieval task .
integer linear programming technique,technology,approach
association graph graph an ASSOCIATION GRAPH is an abstract graph that is generated from model features in the original image .
description logic model,framework
merging framework model,framework
generalized logic logic
higher-order logic logic HIGHER-ORDER LOGIC is the logic of quantification over propositional functions , functions whose range consists of propositions .
multistratal grammar grammar
latent perceptron perceptron
horn logic predicate logic HORN LOGIC is a subset of predicate logic that allows efficient reasoning , orthogonal to description logics
gain advantageous quality a GAIN is the advantageous quality of being beneficial .
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 .
line segment segment
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 .
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 .
text categorization procedure,process
utility scale function a UTILITY SCALE is a function u : v → r. the utility scale u is said to fit .
logical inference inference
brain computer virus a BRAIN is a computer virus .
refinement operator operator
discourse coherence scalar phenomenon DISCOURSE COHERENCE is a scalar phenomenon , however .
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
logical positivism technique,technology,approach
boolean algebra logic a BOOLEAN ALGEBRA is a system of symbolic logic devised by George Boole .
similarity quality a SIMILARITY is the quality of being similar .
checkers learning learning
logical semantic semantic
sensor node platform platform
stochastic simulation development STOCHASTIC SIMULATION is a development of geostatistics and estimates the conditional cumulative distribution functions at each location .
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 .
majority function system a MAJORITY FUNCTION is a system that will assert when there are more 1 's than 0 's on the inputs .
domination of heuristic heuristic
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 .
numerical value value
intercausal inference inference
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 .
terminal node node a TERMINAL NODE is a node with no edges .
graph representation representation CORE ONTOLOGY
application of decision analysis application
easy-to-use program program
background assumption assumption
patrol algorithm algorithm
certainty factor methodology,method
monte-carlo search search method MONTE-CARLO SEARCH is search method to use not random player but monte-carlo player in simulation .
multiple processor processor
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 .
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 .
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 .
text interpretation interpretation
computational complexity computer science COMPUTATIONAL COMPLEXITY is the subfield of computer science that rigorously studies the intrinsic difficulty of computational problems .
analysis of verb analysis
process of discovering procedure,process
markov network model,framework
value-function approximation approximation
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 .
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 .
parallel distributed processing model,framework
local consistency paradigm LOCAL CONSISTENCY is often a suitable paradigm for solving constraint satisfaction problems .
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
data file computer file A DATA FILE is a computer file which stores data for use by a computer application or system .
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 .
space complexity space SPACE COMPLEXITY refers to the space used on a given input .
explicit representation map an EXPLICIT REPRESENTATION is a map from a known parameter space for in - stance the unit cube to 3d-space .
robot motion planning discipline,study,field of study
retrieval operation a RETRIEVAL is the operation of accessing data , either from memory or from a storage device .
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 ( ) .
mechanical device device
ontological engineering knowledge engineering ONTOLOGICAL ENGINEERING is a branch of knowledge engineering which uses ontology to build ontologies .
scoring function equation in essence , a SCORING FUNCTION is an equation that relates measurable descriptors of binding to ligand receptor affinity .
occurrence of event event
probabilistic interpretation probability distribution PROBABILISTIC INTERPRETATION is a probability distribution over worlds .
heuristic function gain ratio HEURISTIC FUNCTION is gain ratio .
sequential testing algorithm algorithm CORE ONTOLOGY
noun phrase uninterrupted string a NOUN PHRASE is an uninterrupted string of nomina ( ) .
computing system system CORE ONTOLOGY
discrete event technique,technology,approach
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 .
rating matrix matrix
natural deduction inference rule NATURAL DEDUCTION is a collection of inference rules .
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 .
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 .
coherence relation relation A COHERENCE RELATION is a relation among clauses or sentences , such as elaboration , support , cause , or exemplification .
blocks-world learning learning
dynamic environment environment
robotic device device
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 .
stable extension extension
conditional action vhdl process a CONDITIONAL ACTION is equivalent to a vhdl process or a verilog always process .
sequence of word sequence
fuzzy set model,framework
agreement state a AGREEMENT is a state whereby several parties share a view or opinion
motion planning planning
complete algorithm algorithm
medical expert system expert system
tractability of inference inference
compositional semantic semantic
stationary sensor model sensor model
algorithm of figure algorithm
turing machine finite automaton a TURING MACHINE is similar to a finite automaton with supply of unlimited memory .
creating act,action,activity
goal-driven approach technique,technology,approach
psycholinguistic study discipline,study,field of study
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 .
prepositional logic generalized logic PREPOSITIONAL LOGIC is a generalized logic that includes all possible values between 0 and 1 .
refinement strategy technique,technology,approach
transitivity of preference assumption TRANSITIVITY OF PREFERENCE is an assumption made in order to convert paired comparison data to rank order data .
action theory analysis ACTION THEORY is an analysis of action starting with the individual actor .
use ofsearch technique technique,technology,approach
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 .
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 .
polygon representation a POLYGON is a representation of a TARGETs in computer graphics .
nonparametric technique technique,technology,approach
joint probability distribution probability distribution
nondeterministic environment function a NONDETERMINISTIC ENVIRONMENT is a function : t 2b .
evidential corpus corpus
polytree graph basically , a POLYTREE is a type of graph in which there is at most one undirected path between any two verti - ces .
weighted heuristics mechanism mechanism
least-constraining-value heuristic heuristic
dewey decimal system system
conventional sign sign a CONVENTIONAL SIGN is a standard sign used on a map to indicate a particular feature .
automaton pruning pruning
surface locus a SURFACE is a the locus of an equation in a more-than-two-dimensional space .
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 .
expository text text EXPOSITORY TEXT is text that is written to communicate information .
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 .
actuator mechanism a ACTUATOR is a mechanism that puts something into automatic action .
decision trees learning methodology,method
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 .
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 .
expression pattern pattern
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 .
inhibitory synapse synapse
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 .
dag tree DAG is a tree , otherwise we may call it dag-like for emphasis .
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 .
prediction sequence sequence
philosophy inquiry a PHILOSOPHY is an inquiry into the nature of things based on logical reasoning rather than empirical methods . ( ) ( ) .
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 .
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 .
indexing scheme methodology,method
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 .
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 .
absence state a ABSENCE is the state of being absent .
theory resolution methodology,method
proof theorem PROOF is based on theorem 2.2 .
step function cost function a STEP FUNCTION is a cost function in which the .
grammar formalism model,framework
process of ensuring procedure,process
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 .
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 .
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 .
decision tree expressiveness decision tree
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.
environment simulator program an ENVIRONMENT SIMULATOR is a program that keeps track of the performance measure for each agent .
causal link link a CAUSAL LINK is a link from a chance node ( ) or a decision node to a chance node .
least mean square initialization parameter LEAST MEAN SQUARE is sensitive to initialization parameters .
procedural semantics backward-chaining technique finally , PROCEDURAL SEMANTICS is a top-down or backward-chaining technique .
fine-motion planning planning
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 .
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
parallel architecture processor a PARALLEL ARCHITECTURE is a set of processors arranged into an unoriented graph pattern by communication lines that connect them .
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 .
psychology of computer vision psychology
text classification technique,technology,approach
feature of a state feature
fitness function function
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
low-level process procedure,process
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 , .
egomotion motion EGOMOTION is defined as the motion of the observer relative to his environment and can be described by 6 parameters
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 .
accurate prediction prediction
knowledge representation language representation language
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 .
logical definition definition
inductive logic system an INDUCTIVE LOGIC is a system for reasoning that derives conclusions which .
test result result
meta language language CORE ONTOLOGY
index function function
intelligence test test an INTELLIGENCE TEST is a psychological or educational test designed to measure intellectual operations , functions , and general abilities .
process of updating procedure,process
temporal reasoning task TEMPORAL REASONING is an important task in many areas of computer science including planning , scheduling , temporal databases and instruction optimisation for .
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 .
general ontology high-level ontology GENERAL ONTOLOGY is a high-level ontology which captures general features of basic contextual entities .
process of testing procedure,process
logical consequence concept LOGICAL CONSEQUENCE is a fundamental concept in logic .
order language language CORE ONTOLOGY
access path data path ACCESS PATH is internal to file and data path is external to it .
search node path a SEARCH NODE is a path from state x to the start state ( ) .
terminal state state
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 .
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 .
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 .
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 .
subset predicate SUBSET are predicates
error difference a ERROR is the difference between a measured or calculated value and a true one .
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 .
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 .
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 .
temporal logic rule TEMPORAL LOGIC is a system of rules , symbolism , reasoning and propositions pertaining to time .
gold standard test a GOLD STANDARD is a test or measure of comparison that is considered ultimate or ideal .
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 .
discourse understanding process of updating • DISCOURSE UNDERSTANDING is a process of updating a dialogue state by a user utterance .
input resolution definition INPUT RESOLUTION is simply a definition of space .
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 .
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 , .
speech act interpretation interpretation
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 . .
generalised representation representation CORE ONTOLOGY
feature selection method evaluation FEATURE SELECTION METHOD is the evaluation of feature subsets .
probabilistic updating procedure procedure,process
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 .
autonomous agent computer simulation an AUTONOMOUS AGENT is a computer simulation that is based on concepts from artificial life research .
search technique technique,technology,approach
optimally efficient algorithm algorithm
theoretical analysis analysis
partitioned semantic network semantic network
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 .
intelligence method methodology,method
object recognition brain OBJECT RECOGNITION is the brain 's ability to recall an object 's shape and properties .
active agent agent
automatic theorem theorem
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 .
computation model model,framework
bolt mechanism a BOLT is a mechanism used in firearms .
bilingual dictionary resource a BILINGUAL DICTIONARY is a great resource for you to master foreign languages .
behavior-based robotics robotics BEHAVIOR-BASED ROBOTICS is a branch of robotics that bridges arti cial intelligence , en - .
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
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 .
sparse covariance function covariance function
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 . .
system gain gain
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 .
resolve expression a RESOLVE is a formal expression by a meeting .
scanner in chart parsing parsing
combined indexing indexing
linear regression glm regression algorithm LINEAR REGRESSION is the glm regression algorithm supported by oracle data mining .
scene situation a SCENE is a situation treated as an observable object .
protocol procedure,process
weight vector vector
mathematical model idealized representation MATHEMATICAL MODEL is an idealized representation expressed in mathematical symbols and expressions .
fastest sorting algorithm sorting algorithm
text string string
translation of language translation
expectimin value value
telepathic communication ability TELEPATHIC COMMUNICATION is an ability we are all born with .
object-oriented database database an OBJECT-ORIENTED DATABASE is a database that subscribes to a model with information represented by objects .
bilingual parallel corpus parallel corpus
metalevel reasoning expert system expert system
user interface system a USER INTERFACE is the system by which people ( ) interact with a machine .
proof graph representation a PROOF GRAPH is a representation of a proof .
analytic sentence sentence
statistical approach technique,technology,approach
logical notation notation
inquiry search a INQUIRY is a search for truth , information , or knowledge
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 .
correlation analysis methodology,method
if-then rule expression an IF-THEN RULE is an expression of the form .
orthography methodology,method
quantified sentence sentence
process of removing procedure,process
automaton mechanism a AUTOMATON is a mechanism that can move automatically .
dempster-shafer theory generalization DEMPSTER-SHAFER THEORY is a generalization of bayesian .
image reconstruction technique,technology,approach
error rate rate
data-driven inference inference
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 .
excellence quality a EXCELLENCE is the quality of being excellent
dynamic weighting mechanism DYNAMIC WEIGHTING is a mechanism to assign importance to a theory .
semantic indexing indexing
navigation robot robot
field of research knowledge domain,knowledge base,domain
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 ( ) .
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 .
spanning tree tree a SPANNING TREE is a tree with v − 1 edges , i.e. a tree that connects all the vertices .
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
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 .
diffusion kernel method kernel method
vector of variable vector
formation feature a FORMATION is the geological features of the earth .
composite decision process decision process
composite heuristic heuristic
motion planning complexity complexity
htn model model,framework
boltzmann machine model,framework
eigenvalue decomposition decomposition
decision-making agent agent
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 .
ability of agent ability
arbitrary first-order sentence theorem an ARBITRARY FIRST-ORDER SENTENCE is a theorem or not .
analogical mapping matching process ANALOGICAL MAPPING is a matching process that is sensitive to three main .
setting state a SETTING is the state of the environment in which a situation exists .
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 ? .
sense disambiguation task the word SENSE DISAMBIGUATION is a non trivial task within an information retrieval system .
input vector vector a INPUT VECTOR is a vector presented to the network . .
nondeterminism algorithm NONDETERMINISM is a algorithm to solve a problem by just defining it .
matching algorithm algorithm
boyer-moore algorithm knuth-morris-pratt algorithm BOYER-MOORE ALGORITHM is superior to knuth-morris-pratt algorithms and brute force algorithms .
macroscopic phenomenon phenomenon CORE ONTOLOGY
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 .
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 .
reasoning system computing system a REASONING SYSTEM is a computing system that can solve a reasoning task ( ) .
machine learning research research
qualitative spatial reasoning spatial reasoning
connectionism modeling CONNECTIONISM is a style of modeling based upon networks of interconnected simple processing devices .
communication protocol rule a COMMUNICATION PROTOCOL is a set of rules that must be adhered to by two or more processes ( ) during their communication .
debugging bug DEBUGGING is finding bugs in our software and correcting them as necessary .
logical formalism formalism
information gain difference INFORMATION GAIN is defined as the difference between the shannon -- wiener information numbers before and after receipt of data .
logical symbol operator LOGICAL SYMBOL is the operator # .
matching process procedure,process
knowledge effect effect
conditioning cutset cutset
graph of predicate graph
ratio of efficiency ratio
decoding algorithm algorithm CORE ONTOLOGY
interleaving procedure,process
behavior-based system system CORE ONTOLOGY
inverse resolution algorithm INVERSE RESOLUTION is a complete algorithm for learning first-order theories ( ) .
linking curve curve thus , a LINKING CURVE is simply a curve that passes through the axes of the manipulator in order .
inference procedure procedure,process
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 .
process of applying procedure,process
iterative dynamic programming methodology,method
probabilistic planning markov decision process PROBABILISTIC PLANNING is based on markov decision processes .
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 .
constrained shortest path finding finding
automatic pilot state a AUTOMATIC PILOT is a cognitive state in which you act without self-awareness .
semi-automatic metric metric
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 .
computational linguistics engineering a COMPUTATIONAL LINGUISTICS is the engineering of systems that process or analyze written or spoken natural language . .
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 .
combinatory logic logic COMBINATORY LOGIC is a branch of mathematical logic that analyzes certain processes , such as substitution , which are associated with variables .
average case analysis analysis
parallel text resource PARALLEL TEXT is one of the most valuable resources for development of statistical machine translation systems and other nlp applications .
one-shot decision decision
background process procedure,process
satellite-based navigation system system CORE ONTOLOGY
payoff function function a PAYOFF FUNCTION is a function .
data value value
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 .
order of similarity calculation order
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 .
dolev-yao model model,framework
logical equivalence concept LOGICAL EQUIVALENCE is an important concept in set-builder notation : big .
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 .
representation of document representation
communication channel methodology,method
spatial relation distance SPATIAL RELATION is defined as the distance of an object located in space in relation to a certain reference object .
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 .
process of retaining procedure,process
goto statement GOTO is a statement found in many computer programming languages .
theoretical result result
rsa encryption public-key encryption algorithm RSA ENCRYPTION is a public-key encryption algorithm .
bubble function function
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 .
exploration function function
goal-oriented theory theory CORE ONTOLOGY
terminal symbol character string a TERMINAL SYMBOL is a character string such as .
compiler person
computational model model,framework
omniscient agent agent
mind ability a MIND is the ability to focus the thoughts .
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 .
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 .
grammar induction inductive logic programming GRAMMAR INDUCTION is a subset of inductive logic programming ( ) , and as such , have primarily depended on ilp techniques .
computational resource resource
f free space space
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 .
parsing technique,technology,approach
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 .
merging process procedure,process
exchange of information data,information
minimal determination determination
probabilistic algorithm algorithm CORE ONTOLOGY
learning system system
material handling science MATERIAL HANDLING is a science of motion , managing and storing of content for the period of transportation .
artificial intelligence application application
induction generation a INDUCTION is the generation of an electric current by a varying magnetic field .
expectimax value value
stopword removal technique,technology,approach
spectral kernel kernel
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 . .
signal bolt a SIGNAL is a bolt out of the blue
simulation of world simulation
graph data structure data structure CORE ONTOLOGY
analysis of algorithm computer science ANALYSIS OF ALGORITHM is a field of computer science that is dedicated to understanding the complexity of algorithms .
greedy agent agent
sum of squared difference difference
metonymy intradomain phenomenon METONYMY is an intradomain phenomenon .
character string string a CHARACTER STRING is a string of any ebcdic characters ( ) that are used as a value .
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 .
uniformly weighted heuristic heuristic
logic string string
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 .
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 .
knowledge-based technique absence KNOWLEDGE-BASED TECHNIQUE is the absence of training .
compilation language language
training algorithm algorithm CORE ONTOLOGY
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 .
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 .
representation of causality representation
static variable variable
dealing methodology,method
problem formulation process of deciding PROBLEM FORMULATION is the process of deciding what actions and states to consider .
compilation time time
symbolic integration integration
linear plan plan
sweeping statement statement
photogrammetry with relation PHOTOGRAMMETRY deals with relations that exist between the object and the image spaces .
scalar phenomenon phenomenon CORE ONTOLOGY
factorization resolution a FACTORIZATION is the resolution of an entity into factors such that when multiplied together they give the original entity .
fuzzy set theory sweeping statement FUZZY SET THEORY is a sweeping statement of set theory .
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 .
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 .
model of knowledge model,framework
behaviour of agent agent
extension of description logic extension
semantic tree tree a SEMANTIC TREE is an ordered tree with nodes labeled with relation and concept names .
non-human entity entity
causal semantic semantic
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 .
search complexity polynomial function SEARCH COMPLEXITY is a polynomial function of memory order .
process of condensing procedure,process
dropping condition operator DROPPING CONDITION is an genetic operator for rule learning , to avoid subsumed rules .
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 . .
source of datum source
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
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 .
lookup table array a LOOKUP TABLE is an array that helps to find data very quickly .
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 .
domain theory structure DOMAIN THEORY is the study of such structures .
self-constructed test tree tree
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 .
tactile sensor structure TACTILE SENSOR is the sandwiched structure that the cncs were inserted between .
conditional event expression a CONDITIONAL EVENT is an expression of the kind .
single entity entity
model-based approach technique,technology,approach
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 .
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 .
min-conflicts appealing technique MIN-CONFLICTS is an appealing technique described in ( ) .
fitness-based selection selection
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 .
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
propositional sentence sentence
web mining process of analyzing WEB MINING is the process of analyzing an assortment of behavioral , demographic , lifestyle , transactional , internet and geographic information .
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
procedural algorithm algorithm CORE ONTOLOGY
pragmatic interpretation interpretation
object-oriented programming creating a OBJECT-ORIENTED PROGRAMMING is a creating a program that can use and support objects .
target ontology ontology
matching methodology distance method MATCHING METHODOLOGY is a superficial minimum distance method .
qualitative reasoning intelligence QUALITATIVE REASONING is an area of artificial intelligence that creates representations for continuous aspects of the world to support reasoning with .
estimation algorithm algorithm CORE ONTOLOGY
quantization procedure,process
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 .
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 .
machine evolution evolution
brain computational power power
process of producing procedure,process
agent-based software engineering technique,technology,approach
inheritance with exception pattern INHERITANCE WITH EXCEPTION is a semantic pattern that is very often useful .
error of a hypothesis error
induction of decision tree induction
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 .
pronoun resolution resolution
training sequence sequence
alignment method similarity measure ALIGNMENT METHOD is based on similarity measure between the component images .
contour of a state space space
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 .
machine intelligence with computational technique MACHINE INTELLIGENCE is concerned with computational techniques for representing and reasoning about complex objects .
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 .
relaxed problem admissible heuristic RELAXED PROBLEM is an admissible heuristic for the original problem .
unsupervised manner manner
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 .
depth first search tree search tree
edge base knowledge domain,knowledge base,domain
head of a clause clause
experimental evaluation act,action,activity
multiplicative utility function utility function
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 , .
map hypothesis hypothesis
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 .
dcg software development DCG is an international software development consulting firm helping companies frustrated with development costs , hampered by poor quality or struggling to .
sequential decision problem decision a SEQUENTIAL DECISION PROBLEM is a sequence of decisions , where for each decision you should consider .
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 .
logic programming constraint constraint
figure of speech language a FIGURE OF SPEECH is a language used in a figurative or nonliteral sense .
background knowledge experience BACKGROUND KNOWLEDGE is the experience and knowledge that a student brings to classroom learning .
greedy heuristic heuristic
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 .
bit of information data,information
classification function function in general , a CLASSIFICATION FUNCTION is a function defined on feature vectors and taking values in a set of class labels .
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
bayesian model,framework
vhdl process procedure,process
commonsense ontology construction COMMONSENSE ONTOLOGY is a cultural construction , just as the concepts that articulate scientific theories are cultural constructions : `` theory may be deliberate , .
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 .
neural network efficiency neural network
computational biology development COMPUTATIONAL BIOLOGY is defined as the development and application of data - analytical and theoretical methods , mathematical modeling , and computational .
optimization model model,framework
knuth-morris-pratt algorithm searching KNUTH-MORRIS-PRATT ALGORITHM is searching the string looking for a match of the first letter of the pattern .
adjoining grammar leaf node ADJOINING GRAMMAR is either a leaf node ( ) or binary branching .
linguistic expression expression
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 . .
micro-planner systems program MICRO-PLANNER is now a publically accessible systems program in the ai group systems its .
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 .
broadest search search
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 .
family of programming language language
brain state state
inclusion axiom axiom
linked list technique,technology,approach
autonomous driving environment AUTONOMOUS DRIVING is essentially a continuous environment sensing applications producing continuous sensor data that needs to be integrated by .
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.
operations research being OPERATIONS RESEARCH is being defined broadly and includes the use of analytical techniques to achieve better health outcomes , define optimal .
iterative improvement search search
normalization procedure,process
slowest search selection selection
soft global constraint constraint
default value a DEFAULT is a value used when none has been given
order approximation approximation
logical formula structure a LOGICAL FORMULA is a structure or a set of structures put together with `` and `` s , `` or `` s , and `` not `` s. .
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 .
optimal control control
library resource In computer science , a LIBRARY is a collection of resources used to develop software .
cross-validation mainstay CROSS-VALIDATION is a mainstay for measuring performance and progress in machine learning .
neural information processing information processing
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 .
completeness of a search algorithm algorithm
digital circuit circuit a DIGITAL CIRCUIT is a circuit that functions on a number of different logic gates .
conjunctive normal form boolean expression CONJUNCTIVE NORMAL FORM is a boolean expression if it is expressed as the product ( ) of sums ( ) .
partition structure a PARTITION is a vertical structure that divides or separates
diagnostic rule rule
constraint optimization model,framework
state diagram diagram a STATE DIAGRAM is a type of diagram used in computer science and related fields to describe the behavior of systems .
discontinuous function function a DISCONTINUOUS FUNCTION is a function whose graph has one or more gaps or breaks .
predicate logic sentence sentence
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 .
venn diagram graph a VENN DIAGRAM is a graph showing two overlapping circles .
union data structure a UNION is a data structure that can store any of various items , but only one at a time .
loss function quantity,measure
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 .
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 .
human-computer interaction analysis a HUMAN-COMPUTER INTERACTION is a analysis of the relationship of computers and humans . .
discourse intention state a DISCOURSE INTENTION is a state of mind that one can describe in terms of domain plans , for .
accurate classifier classifier
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 .
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 .
fuzzy logic technique,technology,approach
computational model of discourse computational model
abstract algebra operation ABSTRACT ALGEBRA is the study of operations , their properties , and the structures that support them .
anaphor predicate predicate
lexicalized formalism formalism
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 .
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 .
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 .
symmetric matrix matrix a SYMMETRIC MATRIX is a square matrix that is its own transpose , and is symmetric about the main diagonal .
upper bound bound
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 .
uniform cost search breadth-first search UNIFORM COST SEARCH is similar to breadth-first search but expands the node with lowest path cost , g ( ) .
empirical study report an EMPIRICAL STUDY is a report of original research in which an hypothesis is tested
hidden markov model stochastic process a HIDDEN MARKOV MODEL is a double embedded stochastic process with two hierarchy levels .
robotic discipline discipline,study,field of study
search engine program a SEARCH ENGINE is a program that finds and lists web sites or pages that match some user-selected criteria . .
process of replacing procedure,process
cognitive psychology discipline,study,field of study
robot trajectory trajectory
irrational behavior behavior
probability density probability PROBABILITY DENSITY is probability per unit independent variable , and that : with continuous variables , the probability corresponding to some exact value (
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 .
clustering result result
epistemic structure structure
compliant motion motion COMPLIANT MOTION is motion which complies with constraints imposed by the geometry of the task .
expectimax minimax algorithm EXPECTIMAX is a variation of the minimax algorithm that combines the minimization and maximization nodes of minimax search with chance .
control system system CORE ONTOLOGY
tlplan system system CORE ONTOLOGY
computation time time
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 .
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 .
uninformed search algorithm search algorithm
user input input
polygonal model model,framework
cryptographic algorithm algorithm CORE ONTOLOGY
bang-bang control feedback mechanism BANG-BANG CONTROL is a positive ( ) feedback mechanism .
line orthogonality pattern orthogonality pattern
proving approach technique,technology,approach
process of receiving procedure,process
machine learning algorithm learning algorithm
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 .
source of knowledge source
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 .
singular value value
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 .
syntax principle In linguistics , SYNTAX is the study of the principles and rules for constructing sentences in natural languages .
equivalence class node an EQUIVALENCE CLASS is a set of nodes related by an equivalence relation , which must be reflexive , symmetric , and transitive .
fibonacci heap tree FIBONACCI HEAP is a collection of many trees .
estimation process of making a ESTIMATION is the process of making an estimate .
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 .
support vector machine methodology,method
local consistency algorithm consistency algorithm
causal support analog CAUSAL SUPPORT is the analog of a prior probability , summarizing the background knowledge lending support to a belief .
agent function function
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
target compilation language formula a TARGET COMPILATION LANGUAGE is a class of formulas which is tractable for a set of transformations and queries .
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 ( ) (
maximum likelihood procedure,process
pac learning learning
control knowledge tlplan system CONTROL KNOWLEDGE is the tlplan system by bacchus .
semidynamic environment environment
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 .
query variable variable
c configuration space configuration space
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 .
two-valued logic sort TWO-VALUED LOGIC is the sort of logic sports fans use : `` my team is good .
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 .
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 .
feed-forward network acyclic graph a FEED-FORWARD NETWORK is an acyclic graph of neurons unambiguously signed ( ) by numbers from r ( ) .
logicism thesis LOGICISM is the thesis that mathematics is reducible to logic , or so it is often said .
core language engine domainindependent system The CORE LANGUAGE ENGINE ( ) ( ) is a domainindependent system developed at SRI Cambridge , which translates English sentences into formal representations .
parent node node a PARENT NODE is any node in the treeview control 's node collection that has .
gain ratio metric GAIN RATIO is an alternative metric from quinlan 's 1986 .
similarity metric technique,technology,approach
apparent motion motion APPARENT MOTION is a perceived motion produced by the presentation of sequential but static images containing no physically continuous motion .
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 .
construct concept a CONSTRUCT is a concept or model .
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 .
spectrophotometry analysis a SPECTROPHOTOMETRY is the quantitative analysis of electromagnetic spectra by use of a spectrophotometer
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 .
g activation function activation function
web of datum web
diagnostic inference inference
engineering discipline,study,field of study
premise statement a PREMISE is a statement that is assumed to be true and from which a conclusion can be drawn .
invariant shape representation representation
exhaustive decomposition decomposition
extractive activity act,action,activity
item of knowledge knowledge
first-order logic semantics first-order logic
kernel discriminant analysis nonparametric technique KERNEL DISCRIMINANT ANALYSIS is a nonparametric technique that offers greater flexibility at the cost of increased com - plexity .
recurrent neural network neural network a RECURRENT NEURAL NETWORK is a neural network where the connections between the units form a directed cycle .
cryptarithmetic problem constraint satisfaction problem CRYPTARITHMETIC PROBLEM is an interesting constraint satisfaction problem for which different algorithms have been given .
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 .
binary dag dag
base case state BASE CASE is state of the art mid 2006 .
markov decision problem markov chain a MARKOV DECISION PROBLEM is a markov chain with the addition of an action model and a performance criterion .
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
indirect speech act speech act
random variable concept RANDOM VARIABLE is an important concept in probability theory , and its applications to .
axiom scheme of knowledge scheme
confirmation theory logic CONFIRMATION THEORY is the study of the logic by which scientific hypotheses may be confirmed or disconfirmed ( ) by evidence .
process of deciding procedure,process
network of relation network
cnf decomposition decomposition
prototypical implementation source a PROTOTYPICAL IMPLEMENTATION is available including source .
human cognition act,action,activity
initialization parameter parameter
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 .
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 .
sampling rate parameter SAMPLING RATE is the parameter that determines much of the quality of an audio sample .
syntactic ambiguity information property SYNTACTIC AMBIGUITY is information property consistent with sentences which may be parsed digital more that one way .
mathematics science a MATHEMATICS is a science dealing with the logic of quantity and shape and arrangement .
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
root node root ROOT NODE is the root of the tree .
markov property assumption MARKOV PROPERTY is an assumption that allows the system to be analyzed .
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 .
embedding 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 .
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 .
content-based image retrieval technique,technology,approach
inference algorithm algorithm CORE ONTOLOGY
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 . .
experimental vehicle vehicle
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 .
dijkstra's algorithm algorithm
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 .
specialized tree-based data structure data structure CORE ONTOLOGY
architecture for speech recognition speech recognition
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 .
gaussian kernel kernel a GAUSSIAN KERNEL is a kernel with the shape of a gaussian ( ) curve .
computational property emergent property COMPUTATIONAL PROPERTY is actually an emergent property of hundreds of thousands of neurons cooperating to produce the amazing processing .
grammar attribute attribute
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 .
completeness theorem theorem
intrinsic property member-name property the name INTRINSIC PROPERTY is a member-name property .
goal-based agent agent
existential restriction path an EXISTENTIAL RESTRICTION is a path to a variable node in the ed tree
sensory stimulus stimulus
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 .
built-in knowledge knowledge
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 .
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 .
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
static environment environment
process monitoring methodology,method
goal formulation situation GOAL FORMULATION is based on the current situation & the agent 's performance measures .
vacuum agent agent
selection process procedure,process
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.
prepositional phrase phrase
statistical relational learning intersection STATISTICAL RELATIONAL LEARNING is the intersection of research in graphic models , logic representations and probabilistic theories .
profile of dependency graph graph
active vision technique,technology,approach
unsupervised learning algorithm learning algorithm
semi-supervised alignment eigenvalue decomposition SEMI-SUPERVISED ALIGNMENT is based on eigenvalue decomposition .
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 .
variable planning planning
process of selecting procedure,process
pagerank system PAGERANK is a system that helps google to organize its search result pages .
closure resolution resolution
dynamic conditional random field conditional random field
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
non-monotonic logic logic A NON-MONOTONIC LOGIC is a formal logic whose consequence relation is not monotonic .
distribution of class distribution
assumption-based system system
qualified existential restriction existential restriction
advice taker program ADVICE TAKER is the proposed program for common-sense reasoning .
locus scene a LOCUS is the scene of any event or action
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 .
utility-based agent agent
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 .
quotient ratio a QUOTIENT is the ratio of two quantities to be divided .
separable utility function utility function
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
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 .
constraint satisfaction problem structure a CONSTRAINT SATISFACTION PROBLEM is a structure ( ) where .
linear order function LINEAR ORDER is a function of asymmetric c-command relations ( ) .
refinement matrix matrix
observation sentence sentence
morphology analysis analysis
reductio ad absurdum argument in formal logic , the REDUCTIO AD ABSURDUM is actually a legitimate argument , but it is often applied fallaciously .
training event event CORE ONTOLOGY
constraint based theory theory CORE ONTOLOGY
transformation rule a TRANSFORMATION is a rule describing the conversion of one syntactic structure into another related syntactic structure .
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 .
tree decomposition representation a TREE DECOMPOSITION is a representation of a complete set of vertex separators of a graph .
belief network representation a BELIEF NETWORK is a representation of the probabilistic relationships among states of a portion of the world .
event calculus theory EVENT CALCULUS is indeed the proper theory to treat a group of phenomena including .
conditional planning planning CONDITIONAL PLANNING is planning based on unknown information .
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 .
deductive approach assumption DEDUCTIVE APPROACH is based on accepted assumptions from formal decision theory .
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 .
advantageous quality quality CORE ONTOLOGY
memory space space
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 .
incompleteness theorem theorem INCOMPLETENESS THEOREM is a theorem of classical mathematics ( )
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 .
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 . .
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 .
percept sequence sequence
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 .
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
trigger act,action,activity
spelling correction feature SPELLING CORRECTION is an important feature in many different types of software applications , such as word processing applications and email applications .
incorporation phenomenon a INCORPORATION is a linguistic phenomenon .
k-dl decision list decision list
vertex elimination order order
virtual agent agent
document corpus corpus
human-robot interaction being HUMAN-ROBOT INTERACTION is being studied through the creation of ` socially interactive robots .
generalized phrase structure phrase structure
top-down dynamic programming dynamic programming
search cost cost a SEARCH COST is a cost that is associated with acquiring information about a product .
action-utility table table
character person
negation statement a NEGATION is a negative statement .
robotics intelligence ROBOTICS is the science of creating artificial intelligence .
strong connectivity algorithm algorithm
golog program program
node utility utility
mainstay support a MAINSTAY is a chief support .
distance metric learning parametric technique DISTANCE METRIC LEARNING is a parametric technique defined under the supervised setting .
fusion state a FUSION is the state of being combined into one body .
process of selecting feature procedure,process
image edge feature IMAGE EDGE is an important feature of image .
simulation result result
pruning technique,technology,approach
resource requirement requirement
label propagation technique,technology,approach
intercausal reasoning inference pattern INTERCAUSAL REASONING is a common inference pattern involving probabilistic .
input pattern pattern
declarative sentence proposition A DECLARATIVE SENTENCE is a proposition - that is , something to which a truth value can be assigned .
data-directed inference inference
user requirement requirement
cognitive modelling discipline,study,field of study
short-term memory ability SHORT-TERM MEMORY is the ability to ` hold in mind ' information .
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" .
applicable operator operator
finite state automaton state automaton
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 .
euclidean distance integer EUCLIDEAN DISTANCE is an integer with bounded magnitude and precision .
training datum system TRAINING DATUM is available to the system , whose the desired output is known .
unit resolution application UNIT RESOLUTION is an application of resolution , where one clause is a unit clause also called boolean constraint propagation .
process of dealing procedure,process
airflow simulation simulation
software engineering construction SOFTWARE ENGINEERING is about the sound construction of computer systems for today and tomorrow .
web service communication a WEB SERVICE is a method of communication between two electronic devices over a network .
sensitivity analysis process of determining SENSITIVITY ANALYSIS is the process of determining how small pertubations of model inputs affect model outputs .
real-world application application
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 - .
goal predicate act,action,activity
cooperative computation computation
morphological context context
behavioral theory theory CORE ONTOLOGY
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
range distance a RANGE is the distance from a person or sensor to an object , target , emanation , or event .
lexical pattern string generally , a LEXICAL PATTERN is a sequence of strings .
software verification process of ensuring SOFTWARE VERIFICATION is the process of ensuring that a program meets its intended specification ( ) .
support vector vector a SUPPORT VECTOR refers to a characteristic vector si on the optimal identification hyperplane .
data mining methodology,method
operator reduction reduction
sequence of token sequence
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 .
training sample sample input vector a TRAINING SAMPLE is a pair of a sample input vector and a desired output vector .
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
neural network link link
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
transit motion motion
search space space
autonomous vehicle underwater autonomous vehicle
transfer motion motion
additive utility function utility function
nondeterministic polynomial time polynomial time
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 .
reach distance a REACH is the distance from the center of the robot to the fullest extension of the robotic arm .
intersection representation a INTERSECTION is a representation of common ground between theories or phenomena .
hidden variable variable
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 .
polynomial space space
game-theoretic consideration consideration
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 ( ) .
prioritized sweeping model,framework
backtracking search uninformed search algorithm BACKTRACKING SEARCH is basic uninformed search algorithm for csps .
disjoint subset subset
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 .
cooperative coevolution mechanism COOPERATIVE COEVOLUTION is quite an elaborate mechanism .
terminological logic logic
rational agent agent
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 .
artificial environment environment
advantage quality a ADVANTAGE is the quality of having a superior or more favorable position .
state automaton automaton
data modelling technique technique,technology,approach
input clause formula an INPUT CLAUSE is a formula of the form .
record data value a RECORD is a set of related data values in a.
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 .
modification operator function a MODIFICATION OPERATOR is a function m : x → x , where x is the instance space .
matrix multiplication benchmark MATRIX MULTIPLICATION is a classical benchmark for experimenting with techniques used to exploit machine architecture and to overcome the limitations of .
adjacency list methodology,method
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 .
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 .
combinational circuit circuit
decision node assertion DECISION NODE is an assertion that the chance event will not be observed by the time the decision is made .
finite element method technique,technology,approach
neural network hardware device NEURAL NETWORK HARDWARE is usually devices designed to implement neural to present the state of the art in neural network .
domain knowledge representation DOMAIN KNOWLEDGE is a formal representation of expert information in a particular field .
natural language probability NATURAL LANGUAGE is used to describe probability , it is highly probable that errors will be introduced into the assessment of risk .
uncertain rule rule
precision-recall curve curve
fraction quotient a FRACTION is the quotient of two rational numbers .
multiattribute utility theory methodology,method
training curve curve
specularly reflected light color SPECULARLY REFLECTED LIGHT is the same color as the source .
taxonomic information data,information
functional programming logic FUNCTIONAL PROGRAMMING is based on logic and could be a basis for logic on its own .
component graph graph
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 .
reactive planner system a REACTIVE PLANNER is a system that builds or changes its .
situated planning agent planning agent
fault quality a FAULT is the quality of being inadequate or falling short of perfection .
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 .
hierarchical decomposition process of decomposing HIERARCHICAL DECOMPOSITION is the process of decomposing a system in a top down fashion .
execution mechanism mechanism
singly connected network connected network
similarity measure methodology,method
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 .
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 .
prepositional semantics logic logic
sample pattern pattern
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.
ground term variable-free tree structure a GROUND TERM is a variable-free tree structure built by operators from leaves .
general search broadest search GENERAL SEARCH is the broadest search available .
argumentation tree tree
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 .
hypothesis recognition recognition
sentiment lexicon phenomenon SENTIMENT LEXICON is a common phenomenon when users are getting excited .
mixture model distribution a MIXTURE MODEL is a collection of distributions d. in this role , the mixture model is a robust estimator .
discriminative maximum entropy model model,framework
goal-directed reasoning reasoning
sigmoid belief network binary dag a SIGMOID BELIEF NETWORK is a binary dag , with .
feedback loop service a FEEDBACK LOOP is a service when an isp lets you know if someone of its users complains about your email .
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 .
example character character
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 .
priority queue data type A PRIORITY QUEUE is an abstract data type in computer programming .
additivity of utility function utility function
intelligent action fusion INTELLIGENT ACTION is the fusion of research and activity .
vector quantization quantization VECTOR QUANTIZATION is simply the quantization of a vector , an ordered set of real numbers .
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 . .
replanning agent research REPLANNING AGENT is research with genetic based replanning agent in order to accelerate the optimization speed of path planning technique .
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 .
systems program program a SYSTEMS PROGRAM is a program that controls some aspect of the operation of a computer .
decision theory theory CORE ONTOLOGY
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 .
associative relation relation an ASSOCIATIVE RELATION is a relation that is also an associative operation .
abstract noun state an ABSTRACT NOUN is a state , a quality or feeling that can not be perceived by the senses .
perceptron representational power power
with domain knowledge domain,knowledge base,domain
domain adaptation importance DOMAIN ADAPTATION is of practical importance in many areas of applied machine learning , ranging from computational biology ( ) to natural language .
longitudinal control control
lexical database resource a LEXICAL DATABASE is a lexical resource which has an associated software environment database which permits access to its contents .
fdtd approach technique,technology,approach
connection method methodology,method
hierarchical planning source HIERARCHICAL PLANNING is one of the sources of inflexibility .
gaussian process variable a GAUSSIAN PROCESS is a collection of random variables , any finite number of which have consistent joint gaussian distributions ( ) .
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 .
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 - .
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 .
automatic recognition recognition
full-width search search
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 .
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 .
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 .
problem-solving system system
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 .
recursively enumerable grammar grammar
logical constant value a LOGICAL CONSTANT is either the logical value true or false .
constraint network model,framework
hierarchical abstraction methodology,method
hierarchical representation methodology,method
vacuum world simulation environment VACUUM WORLD is a simple simulation environment used to introduce some concepts in artificial intelligence ( ) , but can also be .
diagnostic knowledge knowledge
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 .
with computational technique computational technique
maximum entropy model,framework
access function function an ACCESS FUNCTION is a short public function whose job is to return the value of a private member variable .
instructional method methodology,method
variable-free tree structure tree structure
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 .
hypothesis space hypothesis HYPOTHESIS SPACE is the set of all hypotheses the learning algorithm is designed to entertain .
learning curve graph a LEARNING CURVE is a graph showing the rate of learning
situation calculus planning planning
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 .
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 (
analogical language language ANALOGICAL LANGUAGE is language , and the use of language , to suggest ideas by comparisons .
role of domain knowledge role
planning agent agent
encryption methodology methodology,method
similarity computation computation
software agent package,software,software system
predicate logic deduction system PREDICATE LOGIC is a formal deduction system whose atomic formulas are propositional functions .
consequence relation binary relation a CONSEQUENCE RELATION is a binary relation ∼ between sentences of classical propositional logic .
marker-passing algorithm algorithm CORE ONTOLOGY
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 .
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 .
deterministic environment environment
role inclusion expression similarly , a ROLE INCLUSION is an expression of the form .
psychological reasoning reasoning
constant symbol o-ary function symbol a CONSTANT SYMBOL is a o-ary function symbol .
semi-supervised learning supervised method finally , SEMI-SUPERVISED LEARNING is actually a supervised method that avoids labeling a large number of instances .
nonholonomic robot robot similarly , a NONHOLONOMIC ROBOT is defined as a robot , that has one or more nonholonomic kinematic constraints ( ) .
recursive dynamic programming dynamic programming
kernel function smoothing technique KERNEL FUNCTION is one of the smoothing techniques .
orthogonal relation relation
depth ability a DEPTH is the intellectual ability to penetrate deeply into ideas .
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 .
transfer path path
sensor measurement measurement
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 .
editor program a EDITOR is a program designed to perform such editorial functions as rearrangement or modification or deletion of data .
output activity act,action,activity
multiagent system technique,technology,approach
inconsistent heuristic heuristic
total order planning planning
inference method base language method an INFERENCE METHOD is just a simple base language method marked with an annotation '' @ inferencemethod '' .
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 .
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
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 .
episodic environment environment
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 .
expansion operator operator
statistical-relational learning learning
interval algebra relation INTERVAL ALGEBRA is based on thirteen basic relations that can hold between intervals
game theory math GAME THEORY is a branch of applied math which looks at competitive situations where 2 or more people have conflicting interests .
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 .
existential graph diagram an EXISTENTIAL GRAPH is a type of diagram .
driverless system system CORE ONTOLOGY
monotonic deductive system deductive system
process of pointing procedure,process
decision procedure procedure,process
process state state
wacky agent agent
cook's theorem theorem
member-name property property CORE ONTOLOGY
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 .
induction hypothesis hypothesis
dependency analysis directed acyclic graph a DEPENDENCY ANALYSIS is an directed acyclic graph where the words correspond to nodes and depen - dencies to edges .
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 .
metropolis algorithm algorithm
analog computer program a ANALOG is a computer program that analyzes log files from web servers .
password generation generation
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 .
control method methodology,method
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
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 .
integrability quality a INTEGRABILITY is the quality of being integrable .
dfs depth a DFS is a depth first search . .
terminal test test
stochastic process phenomenon a STOCHASTIC PROCESS is a statistical phenomenon that evolves in time according to probabilistic laws .
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 .
knowledge acquisition learning KNOWLEDGE ACQUISITION is a method of learning , first proposed by aristotle in his seminal work `` organon '' .
decision-theoretic planning planning
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 .
consistent plan plan
situation space planning planning
conditioning bounded cutset cutset
process of reducing procedure,process
linear transformation concept a LINEAR TRANSFORMATION is an important concept in mathematics because many real world phenomena can be approximated by linear models .
relevance-based learning learning
bounded-error planning planning
linear resolution resolution
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 .
simulation environment environment
human decision maker decision maker
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 .
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 .
transit path path a TRANSIT PATH is a path of the robot when it is not grasping the object .
inference pattern pattern
equality symbol symbol
dynamical system act,action,activity
process of forming procedure,process
hierarchical decomposition planning planning
silhouette method graphical cluster validation technique SILHOUETTE METHOD is a graphical cluster validation technique , which can be used to select the number of clusters .
root node a ROOT is the single node of a tree that has no parent .
fully instantiated plan plan
surface error quantity,measure
rate of convergence rate
boolean expression statement a BOOLEAN EXPRESSION is a logical statement that is either true or false .
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
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 . .
performance measure metric a PERFORMANCE MEASURE is defined as a metric used to quantify the efficiency and \ or effectiveness of an action .
boolean logic boolean algebra a BOOLEAN LOGIC is a see boolean algebra . ( ) .
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 .
leaf node node a LEAF NODE is any node in the treeview s nodes collection that has no child nodes
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 .
sufficient condition condition a SUFFICIENT CONDITION is a condition that guarantees that a statement is true ( ) .
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
search spaces planning planning
shortest path path a SHORTEST PATH is any path who 's path weight is equal to the shortest path weight .
gaussian function lineshape function a GAUSSIAN FUNCTION is also a useful lineshape function .
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 .
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 .
markov decision process decision process
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 .
deferred planning planning
algebra of feature feature
speedup learning learning SPEEDUP LEARNING is a form of learning in which an inefficient problem solver is transformed into an efficient one .
backward state-space search state-space search
re-targetable query compiler compiler
systems ability ability CORE ONTOLOGY
bound search search
deterministic finite automaton model,framework
evaluation function heuristic function EVALUATION FUNCTION is a heuristic function , and it is where the domain experts ' knowledge resides .
question-answering system system
combinatory categorial grammar lexicalized formalism COMBINATORY CATEGORIAL GRAMMAR is a lexicalized formalism that excels in dealing with long and short-range dependencies .
degree of consistency degree
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 .
answer set programming technique,technology,approach
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 .
domain of value knowledge domain,knowledge base,domain
heap sort fastest sorting algorithm HEAP SORT is one of the fastest sorting algorithms , rivaling such speed-demons as quicksort and mergesort .
declarative programming language programming language
acyclic circuit combinational logic an ACYCLIC CIRCUIT is called combinational logic .
continuous environment environment
new predicates learning learning
agent design act,action,activity
i-dt decision tree decision tree
actor architecture architecture
acyclic graph directed graph an ACYCLIC GRAPH is a directed graph without cycles .
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
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 .
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 . .
empirical result result
utility function learning learning
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 .
process of recognizing procedure,process
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 .
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 .
polynomial function function a POLYNOMIAL FUNCTION is any function whose value is the solution of a polynomial .
commonsense rule rule
expectiminimax full-width search like minimax , EXPECTIMINIMAX is a full-width search up to a particular look-ahead depth .
activation level quantity,measure
parametric technique technique,technology,approach
process of decomposing procedure,process
probabilistic projection reasoning PROBABILISTIC PROJECTION is a special case of reasoning about continuously changing quantities involving partial orders and other sorts of incomplete information .
lineshape function function
entity tree tree
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 .
backjumping technique,technology,approach
neural network expressiveness neural network
role of heuristic role
rule of combination rule
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 .
goal representation representation
least commitment concept LEAST COMMITMENT is a useful concept for analyzing when decisions should be made in any search problem .
computer algorithm algorithm CORE ONTOLOGY
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 .
cumulative learning machine learning research CUMULATIVE LEARNING is an area of machine learning research in computer science .
automation of reasoning reasoning
dominance power a DOMINANCE is the power or right to give orders or make decisions .
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 .
inductive learning process learning process
rational action act,action,activity
minimax 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 .
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 .
dynamic belief network belief network
medium state a MEDIUM is a state that is intermediate between extremes .
language perception state LANGUAGE PERCEPTION is identical to the l2 initial state , as predicted by the full .
report data,information
truth maintenance methodology,method
disjunctive effect effect
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 .
non-metric distance distance
blocks world theory BLOCKS WORLD is a theory of the first-order predicate calculus with equality .
indicator quantity,measure
neural computation macroscopic phenomenon NEURAL COMPUTATION is a macroscopic phenomenon that results from the interaction between ensembles of interacting neurons .
expected case analysis analysis
relation-independent pattern pattern
decision rule statement a DECISION RULE is a logical statement of the type `` if ( ) , then ( ) .
canonical distribution entropy distribution CANONICAL DISTRIBUTION is the maximum entropy distribution for a given expected utility .
cryptography discipline,study,field of study
probabilistic model technique,technology,approach
algorithmic complexity size a ALGORITHMIC COMPLEXITY is the size of the smallest program that can produce a particular sequence of numbers .
intentional state state an INTENTIONAL STATE is a state which has a certain propositional content .
parameterized random variable random variable
process of eliminating procedure,process
context-sensitive grammar password generation CONTEXT-SENSITIVE GRAMMAR is now populated and password generation can begin .
user preference user requirement USER PREFERENCE is one of the important user requirements .
indefinite domain knowledge domain,knowledge base,domain
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 .
argument variable a ARGUMENT is a variable in a logical or mathematical expression whose value determines the dependent variable .
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 .
configuration space obstacle configuration space
genetic algorithm computer program a GENETIC ALGORITHM is a computer program that tries potential solutions and evaluates them .
decision network evaluation evaluation
null hypothesis statement a NULL HYPOTHESIS is a statement about a population parameter .
motivation act,action,activity
intersective semantic semantic
gaussian distribution distribution a GAUSSIAN DISTRIBUTION is a theoretical distribution with finite mean and variance .
bar code pattern a BAR CODE is a pattern of bars ( ) and spaces .
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
decision lists learning learning
detachment act,action,activity
distance function distance a DISTANCE FUNCTION is a particular way of calculating distance , such as the euclidean distance between two vectors . .
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 .
default logic non-monotonic logic DEFAULT LOGIC is a non-monotonic logic proposed by raymond reiter to formalize reasoning with default assumptions .
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 .
constraint satisfaction search search
subsumption architecture methodology,method
language model model,framework
adaptive planning technique,technology,approach
problem-solving agent agent
mean square error quantity,measure
manner customary method a MANNER is a customary method of acting
completeness search search
bounded optimality technique,technology,approach
conjunction relation a CONJUNCTION is the grammatical relation between linguistic units that are connected by a conjunction .
analog process procedure,process
process of heating procedure,process
theory of information value theory
qbf solver algorithm QBF SOLVER is an algorithm that determines the truth value of such formulas .
cost function derivative COST FUNCTION is the derivative of ( ) the average cost function .
successor-state axiom axiom
edge detection technique,technology,approach
chess automaton mechanism a CHESS AUTOMATON is a mechanism that purports to play .
kolmogorov complexity quantity,measure
assertion statement a ASSERTION is a statement in a program asserting a condition expected to be true at a particular point , used in debugging .
search graph tree SEARCH GRAPH is a tree the solution may not be optimal .
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 .
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 .
open planning architecture architecture
appealing technique technique,technology,approach
classification task task
consistent decomposition decomposition
correlation coefficient methodology,method
adl formalism planning planning
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 .
logical implication statement a LOGICAL IMPLICATION is a statement that relates two propositions .
acoustic signal signal
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 .
logic variable abstraction a LOGIC VARIABLE is an abstraction of uncertainty .
mobile device device
decision analysis evaluation DECISION ANALYSIS is a quantitative evaluation of the outcomes that result from a set of choices in a specific clinical situation .
language processing memory-based model LANGUAGE PROCESSING is a memory-based model .
belief quality a BELIEF is the quality or state of believing .
glm regression algorithm algorithm CORE ONTOLOGY
normalized utility utility
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
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 .
feedback mechanism mechanism
uniform convergence theory theory
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 .
heap selection selection
probabilistic transition function a PROBABILISTIC TRANSITION is defined to be a function t : ω × fω → ( ) such that for each θ ∈ fω , .
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 .
semantic network model,framework
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 .
linear input resolution input resolution
problem-solving method methodology,method
application of artificial intelligence application
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 . .
knowledge representation medium a KNOWLEDGE REPRESENTATION is a medium for human expression .
refutation graph graph a REFUTATION GRAPH is a graph whose nodes are literals ( ) and its edges connect complementary literals .
stochastic game optimal control STOCHASTIC GAME is equivalent to the optimal control of a mdp without future reward discount .
structure of discourse structure
cell decomposition partition a CELL DECOMPOSITION is a special kind of partition .
cross-entropy based filter technique technique,technology,approach
data driven technique technique,technology,approach
posteriori knowledge knowledge CORE ONTOLOGY
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 .
robot architecture principle a ROBOT ARCHITECTURE is a set of guiding principles used to structure a robot 's control system .
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
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 .
o-ary function symbol function symbol
ockham algorithm algorithm
np-completeness statement NP-COMPLETENESS is a statement about coming up with .
interpropositional relation relation CORE ONTOLOGY
static symbol symbol
fortran system a FORTRAN is a formula translating system : a programming language widely used for many years in scientific applications . .
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 .
theory of inheritance theory a THEORY OF INHERITANCE is a theory of how characteristics of one generation are derived from earlier generations .
data fusion methodology,method
time complexity size TIME COMPLEXITY is proportional to the size of a traversed tree .
state space modeling STATE SPACE is a method of modeling complex dynamic systems as a set of first order differential equations .
learning rate parameter LEARNING RATE is one of the parameters which governs how fast a neural network learns and how effective the training is .
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
analysis of time analysis
neighborhood kernel bubble function NEIGHBORHOOD KERNEL is the bubble function ( ) ( ) which is non-zero for the neighborhood but zero elsewhere .
fermat's last theorem theorem
with relation relation CORE ONTOLOGY
measure of uncertainty model,framework
constraint logic programming declarative programming language CONSTRAINT LOGIC PROGRAMMING is a new class of declarative programming languages whose primitive operations are based on constraints (
ground resolution theorem theorem
jordan curve theorem construction JORDAN CURVE THEOREM is the construction of a path joining two points and missing a curve .
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 .
constraint satisfaction procedure,process
finite automaton algorithm a FINITE AUTOMATON is an algorithm with a finite memory which scans through an input string or text .
initial state state INITIAL STATE will be the state in which all the variables are unassigned .
process of grasping procedure,process
ontology language language an ONTOLOGY LANGUAGE is an artificial language that expresses knowledge about the structure of human communication and that is suitable to .
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 act act,action,activity
speech acts planning planning
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
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 .
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 .
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 . .
oriented pattern pattern
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 .
tree-based indexing indexing
learning architecture design a LEARNING ARCHITECTURE is a strategic design for learning to meet a particular business goal in a particular situation .
intensional predicate predicate logic sentence an INTENSIONAL PREDICATE is a predicate logic sentence that is defined by a set of clauses .
nonterminal symbol structure a NONTERMINAL SYMBOL is the structure that the parser recognizes .
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 .
nlp excellence NLP is the study of human excellence .
skolemization process of eliminating SKOLEMIZATION is the process of eliminating existential quantifiers from a formula thus , skolemization is an equisatisfiable transformation .
score rule system SCORE RULE is a new system in the school .
christofides' heuristic heuristic
situation-action rule rule
orthogonal line line
confidence factor numerical value CONFIDENCE FACTOR is a numerical value between 0 and .
memory requirement requirement
game robot robot
uncertain reasoning diagnostic method UNCERTAIN REASONING is the main diagnostic method .
means-ends analysis methodology,method
multiset variable variable a MULTISET VARIABLE is a variable that will be assigned to a multiset of integer values .
ontology matching process of finding ONTOLOGY MATCHING is the process of finding correspondences between .
analysis of complex scene analysis
dynamic decision network network
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
space-efficient dynamic programming dynamic programming
sample space space
interval-valued definition definition
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 (
maximum expected utility expected utility
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
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 .
visual feature feature
probability vector vector a PROBABILITY VECTOR is a vector with nonnegative entries that add up to 1 .
ground clause clause a GROUND CLAUSE is a clause which does not contain any variables .
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 .
base language method methodology,method
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 .
data set data,information
multiagent reasoning reasoning
transfer function function
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 .
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 .
face recognition biometric method FACE RECOGNITION is one of biometric methods , to identify given face image using main features of face .
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.
alpha-beta search methodology,method
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 .
conditional effect effect a CONDITIONAL EFFECT is an effect of an action that depends on the value of other features .
undirected weighted graph graph
intradomain phenomenon phenomenon CORE ONTOLOGY
unguided algorithm algorithm CORE ONTOLOGY
logic sampling technique,technology,approach
probabilistic first-order logic first-order logic
classification problem posterior probability CLASSIFICATION PROBLEM is exactly the posterior probability .
boruvka's algorithm algorithm
experience act,action,activity
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
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 .
interpretation semantic semantic
electronic circuits domain knowledge domain,knowledge base,domain
runtime variable field value a RUNTIME VARIABLE is a field value that is defined by the user at the time of running the report .
belief network learning learning
resolution completeness proof proof
longest common substring substring
oft-touted property property CORE ONTOLOGY
modell of computation computation
clever indexing indexing
existential elimination procedure,process
homeomorphism similarity a HOMEOMORPHISM is a similarity in the crystal structure of unrelated compounds .
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 .
logic of relevance logic
dependency-directed backtracking search strategy DEPENDENCY-DIRECTED BACKTRACKING is a powerful search strategy .
learning agent mapping in supervised learning , a LEARNING AGENT is given mappings of inputs to desired outputs .
default value value a DEFAULT VALUE is a value that is auto ¬ matically displayed by the computer .
perceptron model,framework
deduction system system CORE ONTOLOGY
input generalization generalization
minimum description length length
conjunctive probability probability
prediction statement a PREDICTION is a statement of what will happen in the future .
domain closure effect effect
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 .
naive agent agent
regression act,action,activity
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 . .
unit clause clause a UNIT CLAUSE is a clause containing only one literal ( ) , while a binary clause con - tains exactly two literals .
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 .
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 .
dcop algorithm algorithm
action model model,framework
iterative cost cost
contingency state a CONTINGENCY is the state of being contingent on something .
blackboard architecture memory space a BLACKBOARD ARCHITECTURE is a shared memory space which enables agents sending and receiving messages to be decoupled from one .
principle of database system principle
asynchronous dynamic programming dynamic programming
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 .
partial regression equation equation
autonomous land vehicle vehicle
regression recognition recognition
bayes' rule rule
adaptive control theory control theory
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 .
named entity text string a NAMED ENTITY is a piece of text string which refers to an entity .
coalitional game system a COALITIONAL GAME is system .
latent variable variable
blocks world planning planning
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 .
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 .
foliation process of forming a FOLIATION is the process of forming into a leaf or leaves .
language analysis methodology,method
nonlinear plan plan
bel belief about state state
parallel search search
binary classification methodology,method
grid map map a GRID MAP is simply a map that has been divided into marked sections .
computational complexity theory hardness COMPUTATIONAL COMPLEXITY THEORY is the study of the inherent hardness or easiness of computational tasks .
field value value
image retrieval importance IMAGE RETRIEVAL is gaining importance as a support tool for diagnosis , research and education in medical domain ( ) .
target concept concept
virtual environment environment
derived sentence sentence
distribution of agent distribution
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 .
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 .
completeness of a plan plan
pronunciation learning learning
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 .
direct graph node structure a DIRECT GRAPH is used to describe the node structure in simulation .
prior probability posterior probability PRIOR PROBABILITY is posterior probability μ after the update prior probability μ to ... kind of probability density function .
procedural attachment technique,technology,approach
prepositional logic agent agent
g-set structure a G-SET is a structure , where is a group , such that .
bsp tree binary tree a BSP TREE is just a binary tree plus the partition that separates both children .
linear program optimization model a LINEAR PROGRAM is a mathematical optimization model that has a linear objective function and a set of linear constraints .
algorithm resolution resolution
knowledge level quantity,measure
unbounded indeterminacy indeterminacy
algorithm of adaptation algorithm
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
functionality ability a FUNCTIONALITY is the ability to perform a task or function
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
sample complexity quantity,measure
isa link node ISA LINK is the a node .
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 .
basis function gaussian BASIS FUNCTION is a gaussian with diagonal covariance .
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 .
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
entropy distribution distribution
domainindependent system system CORE ONTOLOGY
probabilistic sensor model sensor model
recursive transition network graph A RECURSIVE TRANSITION NETWORK is a graph theoretical schematic used to represent the rules of a context free grammar .
organisation of knowledge knowledge
uncertainty model model,framework
automaton program program
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 .
baseline procedure,process
trajectory model,framework
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 (
symbolic differentiation operation in mathematics , SYMBOLIC DIFFERENTIATION is an operation that converts a given arithmetic expression into another arithmetic expression called the derivative .
first-order sentence sentence
artificial intelligence programming language programming language
structured programming construct construct
feature vector generation a FEATURE VECTOR refers to the generation of at least two features .
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 .
randomization process of making a RANDOMIZATION is the process of making random .
source of information source
neuron neural network a NEURON is a see neural network , also mcculloch-pitts .
herbrand's theorem theorem
real-time architecture architecture
linear separability concept LINEAR SEPARABILITY is an important concept in neural networks .
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.
map variable variable
syntactic pattern pattern a SYNTACTIC PATTERN is a pattern based on syntax rules .
language origin theory LANGUAGE ORIGIN is the theory that explains how human acquired language at the first time .
multi-agent planning generation MULTI-AGENT PLANNING is fundamental to the generation of cooperative ac - tivities .
disjunction of literal disjunction
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 .
markov blanket cross-entropy based filter technique MARKOV BLANKET is a cross-entropy based filter technique capable of identifying both redundant and irrelevant features .
degree of similarity degree
ease-based planning planning
notation logic logic
computability science COMPUTABILITY is the science of determining what can and can not be computed .
service composition extension SERVICE COMPOSITION is a natural extension of web services paradigm .
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 .
algebraic relation relation CORE ONTOLOGY
acquisition of adaptation knowledge knowledge
public-key encryption algorithm algorithm CORE ONTOLOGY
path cost value PATH COST is a value assigned to each port .
local encoding encoding
reasoning task instance checking REASONING TASK is also called instance checking .
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 .
markov chain procedural algorithm MARKOV CHAIN is a procedural algorithm used to make coherent chains of values , instead of just random noise .
dimensionality reduction search DIMENSIONALITY REDUCTION is the search for a small set of features to describe a large set of observed dimensions .
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 .
naturalness quality a NATURALNESS is the quality of innocent naivete .
unit preference heuristic UNIT PREFERENCE is the heuristic of prioritizing resolutions where one parent is a unit clause .
feature space representation FEATURE SPACE is the representation of features in euclidean space , each feature plotted on an axis perpendicular to each other axis .
asbestos removal process of removing ASBESTOS REMOVAL is the process of removing asbestos containing materials ( ) from a building or structure .
causal theory rule a CAUSAL THEORY is a set of casual rules of the form : φ ⇒ ψ , where φ and ψ are propositional formulas .
word segmentation task WORD SEGMENTATION is an important task in natural language processing ( ) for languages without word delimiters ( ) .
assistive technology technique,technology,approach
dialectical tree tree
introspection methodology,method
communicating agent proactive agent a COMMUNICATING AGENT is a proactive agent that introduces new function - alities of communication .
bellman equation equation
knowledge representation system system CORE ONTOLOGY
expected utility model,framework
truth-preserving inference inference
rhetorical relation relation CORE ONTOLOGY
term rewriting decision procedure TERM REWRITING is one of the standard decision procedures for varieties .
discrete environment environment
bound computation computation
binary search search a BINARY SEARCH is a very efficient search when you are dealing with a large table .
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 .
proof tree application a PROOF TREE is a set of applications of inference rules , arranged as a tree with a goal at the root .
full power power
conversation complex CONVERSATION is a complex , highly context-dependent , behavioral phenomenon .
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 .
array vector a ARRAY is a vector .
logic programming computer program LOGIC PROGRAMMING is the study of computer programs that implement logic .
good old-fashioned ai ai
motion parallax methodology,method
consistent hypothesis map hypothesis CONSISTENT HYPOTHESIS is a map hypothesis (
principal component analysis well-established method PRINCIPAL COMPONENT ANALYSIS is a well-established method of data analysis .
computer vision computer science COMPUTER VISION is the branch of computer science concerned with the analysis of images to extract information about the world .
density property a DENSITY is the spatial property of being crowded together .
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 .
capacity ability a CAPACITY is the ability to hold , receive or absorb .
knowledge-based agent knowledge domain,knowledge base,domain
input method system INPUT METHOD is system to help user 's keyboard input .
spatial relationship vector a SPATIAL RELATIONSHIP is a vector .
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 .
logical variable variable a LOGICAL VARIABLE is an independent variable which can take any value from .
decision analytic approach technique,technology,approach
behavioral module behavior-based system BEHAVIORAL MODULE is a behavior-based system (
scaled orthographic projection order approximation SCALED ORTHOGRAPHIC PROJECTION is a first order approximation of the perspective projection .
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
nonepisodic environment environment
language understanding process of grasping LANGUAGE UNDERSTANDING is a process of grasping .
low-level action act,action,activity
simplest method methodology,method
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 .
incremental learning increase INCREMENTAL LEARNING is likely to increase when professionals are frequently another important factor influencing individual incremental learning is the time and .
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 .
abstraction planning planning
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 .
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 .
analysis of document corpus analysis
class variable variable
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 .
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 .
clustering act,action,activity
dempster's rule rule
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
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 .
component analysis analysis
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 .
distributed encoding encoding
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 .
computational cost cost
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 .
error bound bound
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 .
semantic space indefinite domain SEMANTIC SPACE is an indefinite domain of possible expression to which the current text bears some active and particular relationship .
feedforward circuit circuit
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 , .
grammatical formalism technique,technology,approach
collaborative filtering algorithm COLLABORATIVE FILTERING is an algorithm successfully and widely used in recommender system .
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 .
simulation-based method methodology,method
passive adp agent agent
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
predicate symbol function symbol PREDICATE SYMBOL is also a function symbol .
irrationality quality a IRRATIONALITY is the quality or state of being irrational
boolean variable place a BOOLEAN VARIABLE is a place in memory where a boolean value may be stored .
abstract operator operator
incremental algorithm algorithm an INCREMENTAL ALGORITHM is an algorithm that includes several ( ) our incremental algorithm is compared experimentally to an .
monotonicity of a heuristic heuristic
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 .
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 .
feed-forward neural network function FEED-FORWARD NEURAL NETWORK is merely a mathematical function that maps an input vector to a number of outputs ( ) .
memory limitation limitation
descriptive information data,information
pruning strategy strategy
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 .
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.
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 .
syntactic theory of knowledge theory
instance checking checking
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 .
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 (
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 .
model parameter parameter
epipolar line line
algorithm template template
inverse method methodology,method
utility space space
analysis of information processing system analysis
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 .
robot box robot
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 .
bilingual lexicon resource BILINGUAL LEXICON is a crucial resource for cross-lingual ap - plications of natural language processing ( ) including machine translation ( ) , .
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 .
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 .
genetic engineering technique,technology,approach
logical sentence sentence
support structure a SUPPORT is a supporting structure that holds up or provides a foundation .
reinforcement learning agent learning agent
node expansion generation NODE EXPANSION is the generation of all the successors of a given parent node .
effective branching factor quantity,measure
control rule rule
computational chemistry software program software program
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
perceptron convergence theorem theorem
automated reasoning process of searching AUTOMATED REASONING is the process of searching for a chain of rules which connect certain facts with given conclusions .
information processing process of receiving INFORMATION PROCESSING is the process of receiving information through the senses analyzing and making it meaningfull .
multiple agent agent
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 .
auv system an AUV is a system that is too difficult to control .
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 .
run time time a RUN TIME is the time during which a program is executing .
adaptive network network an ADAPTIVE NETWORK is network of nodes and directional links .
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 .
proactive agent agent
information theory theory CORE ONTOLOGY
collective computation analog process COLLECTIVE COMPUTATION is an analog process , not a digital process .
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 .
demodulation process of filtering DEMODULATION is the process of filtering out the actual transferred information from the received signal .
agent architecture architecture
image formation formation
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 .
time constraint feature in master data , the TIME CONSTRAINT is a definite feature of the infotype or subtype .
well-established technique technique,technology,approach
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 .
logical expert system expert system
target domain source domain TARGET DOMAIN is source domain -- this is the basic formula for metaphor
free variable input a FREE VARIABLE is defined as an input variable that has not yet been assigned a standard deviation .
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 .
representation language language
simulation of intelligence simulation
query answering retrieval QUERY ANSWERING is a direct , simple retrieval of data or knowledge from the knowledge - rich database
pattern mining task PATTERN MINING is the task of finding existing patterns in data .
robotic network robotic agent a ROBOTIC NETWORK is a group of robotic agents moving in space and endowed with communication capabilities .
logical assertion statement a LOGICAL ASSERTION is a statement that asserts that a certain premise is true , and is useful for statements in proof .
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.
data path path
kl-one knowledge representation system KL-ONE is a well known knowledge representation system in the tradition of semantic networks and frames .
shape state a SHAPE is the state of health
recommender system methodology,method
taxonomy science TAXONOMY is a branch of biological science involved with classifying organisms based on characteristics they share in common .
graphical cluster validation technique technique,technology,approach
semi-supervised classification classification SEMI-SUPERVISED CLASSIFICATION is a special form of classification .
axiomatic definition definition
depth-limited search dfs DEPTH-LIMITED SEARCH is dfs with an imposed maximum path depth cutoff .
functioning procedure,process
mathematical statement communication
binary decision diagram concise representation a BINARY DECISION DIAGRAM is a concise representation of the shannon decom - position of a boolean function ( ) .
model state evolution evolution
incremental search search method INCREMENTAL SEARCH is the search method in firefox and chrome , vc + + , emacs and eclipse
context-free grammar generative model a CONTEXT-FREE GRAMMAR is a generative model denoted by a 4-tuple : g = ( ) where : α is a terminal alphabet , ( ) .
constructive induction methodology,method
mixed inference inference
current-best-hypothesis search search
natural number integer in mathematics , a NATURAL NUMBER is either a positive integer ( ) or a non-negative integer ( ) .
parsing algorithm algorithm CORE ONTOLOGY
worst case analysis technique,technology,approach
cross-indexing methodology,method
domain-specific search engine search engine
search approach technique,technology,approach
role hierarchy technique,technology,approach
turning video communication communication CORE ONTOLOGY
clustering method methodology,method
horn sentence conjunction a HORN SENTENCE is a conjunction of a set of horn clauses .
commitment protocol protocol
recognition program program
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 .
psychology mind a PSYCHOLOGY is the study of the human mind .
definite clause grammar rewriting system DEFINITE CLAUSE GRAMMAR is a convenient rewriting system with an arrow .
pure inductive inference inductive inference
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 .
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
approximately correct hypothesis hypothesis an APPROXIMATELY CORRECT HYPOTHESIS is therefore the hypothesis that has the probability of error bounded by a small positive constant ε .
uninterrupted string string
prepositional syntax logic logic
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 .
metaphor comparison a METAPHOR is a comparison between two things as if they were the same .
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 .
rewriting system system CORE ONTOLOGY
correspondence theory theory
cluster ensemble estimation CLUSTER ENSEMBLE is the estimation of the probabilities p with which data points belong to the combined clusters .
covariance function function
real-time ai ai
analytical expression expression In mathematics , an ANALYTICAL EXPRESSION is a mathematical expression , constructed using well-known operations that lend themselves readily to calculation .
formalization planning planning
inference relation relation an INFERENCE RELATION is a relation between existing knowledge and the .
situated agent software agent a SITUATED AGENT is basically a software agent that has the sole purpose of performing design actions .
graph algorithm algorithm a GRAPH ALGORITHM is an algorithm ( ) that takes one or more graphs as inputs .
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
partially observable markov decision problem markov decision problem
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 .
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 .
recursive algorithm algorithm CORE ONTOLOGY
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 .
comparison evaluation a COMPARISON is an evaluation of the similarities and differences of one or more things relative to some other or each-other .
chart data structure a CHART is a data structure used in parsing . it consists of a collection of active arcs
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 .
customary method methodology,method
knowledge-based program program a KNOWLEDGE-BASED PROGRAM is a program with explicit tests for knowledge .
reading sign sign
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
markov decision decision
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 .
dependency graph directed graph a DEPENDENCY GRAPH is essentially a directed graph of org .
input string string
nonmonotonic logic logic NONMONOTONIC LOGIC is a branch of logic that has been developed to model situations with incomplete information .
atomic event happening informally , an ATOMIC EVENT is a happening ( ) to which each web site ( ) may decide .
stimulus data,information
cleaning robot robot
scheme concept In mathematics , a SCHEME is an important concept connecting the fields of algebraic geometry , commutative algebra and number theory .
key word slowest search selection KEY WORD is one of the slowest search selections .
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 .
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 .
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 .
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
text corpus knowledge source TEXT CORPUS is an important knowledge source of it .
knuth-bendix algorithm algorithm
subordinate clause clause a SUBORDINATE CLAUSE is a dependent clause that adds some extra information to the main clause .
intelligent room room
smoothing technique technique,technology,approach
system of communication system
ambiguous sentence sentence
multiattribute utility utility
protection interval interval
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 .
derivational morphology morphology
physical system system
bug fault a BUG is a fault or defect in a computer program , system , or machine .
categorization task task
tag tree-adjoining grammar tree-adjoining grammar
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 .
expressive power motivation EXPRESSIVE POWER is the motivation for designing new planning languages .
class probability probability CLASS PROBABILITY is closer to the theoretical probability .
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 .