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