Glossary of artificial intelligence: Difference between revisions

Content deleted Content added

Inline

Revision as of 14:47, 19 February 2019

Most of the terms listed in Wikipedia glossaries are already defined and explained within Wikipedia itself. However, glossaries like this one are useful for looking up, comparing and reviewing large numbers of terms together. You can help enhance this page by adding new terms or writing definitions for existing ones.

This glossary of artificial intelligence terms is about artificial intelligence, its sub-disciplines, and related fields.

A

Abductive logic programming – Abductive logic programming (ALP) is a high-level knowledge-representation framework that can be used to solve problems declaratively based on abductive reasoning. It extends normal logic programming by allowing some predicates to be incompletely defined, declared as abducible predicates.
Abductive reasoning – Abductive reasoning (also called abduction,^[1] abductive inference,^[1] or retroduction^[2]) is a form of logical inference which starts with an observation or set of observations then seeks to find the simplest and most likely explanation. This process, unlike deductive reasoning, yields a plausible conclusion but does not positively verify it.
Abstract data type – is a mathematical model for data types, where a data type is defined by its behavior (semantics) from the point of view of a user of the data, specifically in terms of possible values, possible operations on data of this type, and the behavior of these operations.
Abstraction – is the process of removing physical, spatial, or temporal details^[3] or attributes in the study of objects or systems in order to more closely attend to other details of interest^[4]
Accelerating change – is a perceived increase in the rate of technological change throughout history, which may suggest faster and more profound change in the future and may or may not be accompanied by equally profound social and cultural change.
Action language – is a language for specifying state transition systems, and is commonly used to create formal models of the effects of actions on the world.^[5] Action languages are commonly used in the artificial intelligence and robotics domains, where they describe how actions affect the states of systems over time, and may be used for automated planning.
Action model learning – is an area of machine learning concerned with creation and modification of software agent's knowledge about effects and preconditions of the actions that can be executed within its environment. This knowledge is usually represented in logic-based action description language and used as the input for automated planners.
Action selection – is a way of characterizing the most basic problem of intelligent systems: what to do next. In artificial intelligence and computational cognitive science, "the action selection problem" is typically associated with intelligent agents and animats—artificial systems that exhibit complex behaviour in an agent environment.
Activation function – In artificial neural networks, the activation function of a node defines the output of that node, or "neuron," given an input or set of inputs. This output is then used as input for the next node and so on until a desired solution to the original problem is found.^[6]
Adaptive algorithm – an algorithm that changes its behavior at the time it is run, based on a priori defined reward mechanism or criterion.
Adaptive neuro fuzzy inference system – or adaptive network-based fuzzy inference system (ANFIS) is a kind of artificial neural network that is based on Takagi–Sugeno fuzzy inference system. The technique was developed in the early 1990s.^[7]^[8] Since it integrates both neural networks and fuzzy logic principles, it has potential to capture the benefits of both in a single framework. Its inference system corresponds to a set of fuzzy IF–THEN rules that have learning capability to approximate nonlinear functions.^[9] Hence, ANFIS is considered to be a universal estimator.^[10] For using the ANFIS in a more efficient and optimal way, one can use the best parameters obtained by genetic algorithm.^[11]^[12]
Admissible heuristic – In computer science, specifically in algorithms related to pathfinding, a heuristic function is said to be admissible if it never overestimates the cost of reaching the goal, i.e. the cost it estimates to reach the goal is not higher than the lowest possible cost from the current point in the path.^[13]
Affective computing – (sometimes called artificial emotional intelligence, or emotion AI)^[14] is the study and development of systems and devices that can recognize, interpret, process, and simulate human affects. It is an interdisciplinary field spanning computer science, psychology, and cognitive science.^[15]
Agent architecture – in computer science is a blueprint for software agents and intelligent control systems, depicting the arrangement of components. The architectures implemented by intelligent agents are referred to as cognitive architectures.^[16]
AI accelerator – is a class of microprocessor^[17] or computer system^[18] designed as hardware acceleration for artificial intelligence applications, especially artificial neural networks, machine vision and machine learning.
AI-complete – In the field of artificial intelligence, the most difficult problems are informally known as AI-complete or AI-hard, implying that the difficulty of these computational problems is equivalent to that of solving the central artificial intelligence problem—making computers as intelligent as people, or strong AI.^[19] To call a problem AI-complete reflects an attitude that it would not be solved by a simple specific algorithm.
Algorithm – is an unambiguous specification of how to solve a class of problems. Algorithms can perform calculation, data processing and automated reasoning tasks.
Algorithmic efficiency – is a property of an algorithm which relates to the number of computational resources used by the algorithm. An algorithm must be analyzed to determine its resource usage, and the efficiency of an algorithm can be measured based on usage of different resources. Algorithmic efficiency can be thought of as analogous to engineering productivity for a repeating or continuous process.
Algorithmic probability – In algorithmic information theory, algorithmic probability, also known as Solomonoff probability, is a mathematical method of assigning a prior probability to a given observation. It was invented by Ray Solomonoff in the 1960s.^[20]
AlphaGo – is a computer program that plays the board game Go.^[21] It was developed by Alphabet Inc.'s Google DeepMind in London. AlphaGo has several versions including AlphaGo Zero, AlphaGo Master, AlphaGo Lee, etc.^[22] In October 2015, AlphaGo became the first computer Go program to beat a human professional Go player without handicaps on a full-sized 19×19 board.^[23]^[24]
Ambient intelligence – (AmI) refers to electronic environments that are sensitive and responsive to the presence of people.
Analysis of algorithms – is the determination of the computational complexity of algorithms, that is the amount of time, storage and/or other resources necessary to execute them. Usually, this involves determining a function that relates the length of an algorithm's input to the number of steps it takes (its time complexity) or the number of storage locations it uses (its space complexity).
Analytics – the discovery, interpretation, and communication of meaningful patterns in data.
Answer set programming – (ASP) is a form of declarative programming oriented towards difficult (primarily NP-hard) search problems. It is based on the stable model (answer set) semantics of logic programming. In ASP, search problems are reduced to computing stable models, and answer set solvers—programs for generating stable models—are used to perform search.
Anytime algorithm – an algorithm that can return a valid solution to a problem even if it is interrupted before it ends.
Application programming interface – (API) is a set of subroutine definitions, communication protocols, and tools for building software. In general terms, it is a set of clearly defined methods of communication among various components. A good API makes it easier to develop a computer program by providing all the building blocks, which are then put together by the programmer. An API may be for a web-based system, operating system, database system, computer hardware, or software library.
Approximate string matching – (often colloquially referred to as fuzzy string searching) is the technique of finding strings that match a pattern approximately (rather than exactly). The problem of approximate string matching is typically divided into two sub-problems: finding approximate substring matches inside a given string and finding dictionary strings that match the pattern approximately.
Approximation error – The approximation error in some data is the discrepancy between an exact value and some approximation to it.
Argumentation framework – or argumentation system, is a way to deal with contentious information and draw conclusions from it. In an abstract argumentation framework,^[25] entry-level information is a set of abstract arguments that, for instance, represent data or a proposition. Conflicts between arguments are represented by a binary relation on the set of arguments. In concrete terms, you represent an argumentation framework with a directed graph such that the nodes are the arguments, and the arrows represent the attack relation. There exist some extensions of the Dung's framework, like the logic-based argumentation frameworks^[26] or the value-based argumentation frameworks.^[27]
Artificial immune system – Artificial immune systems (AIS) are a class of computationally intelligent, rule-based machine learning systems inspired by the principles and processes of the vertebrate immune system. The algorithms are typically modeled after the immune system's characteristics of learning and memory for use in problem-solving.
Artificial intelligence – (AI), sometimes called machine intelligence, is intelligence demonstrated by machines, in contrast to the natural intelligence displayed by humans and other animals. In computer science AI research is defined as the study of "intelligent agents": any device that perceives its environment and takes actions that maximize its chance of successfully achieving its goals.^[28] Colloquially, the term "artificial intelligence" is applied when a machine mimics "cognitive" functions that humans associate with other human minds, such as "learning" and "problem solving".^[29]
Artificial Intelligence Markup Language – is an XML dialect for creating natural language software agents.
Artificial neural network – (ANN) or connectionist systems are computing systems vaguely inspired by the biological neural networks that constitute animal brains.^[30] The neural network itself is not an algorithm, but rather a framework for many different machine learning algorithms to work together and process complex data inputs.^[31]
Association for the Advancement of Artificial Intelligence – (AAAI) is an international, nonprofit, scientific society devoted to promote research in, and responsible use of, artificial intelligence. AAAI also aims to increase public understanding of artificial intelligence (AI), improve the teaching and training of AI practitioners, and provide guidance for research planners and funders concerning the importance and potential of current AI developments and future directions.^[32]
Asymptotic computational complexity – In computational complexity theory, asymptotic computational complexity is the usage of asymptotic analysis for the estimation of computational complexity of algorithms and computational problems, commonly associated with the usage of the big O notation.
Attributional calculus – is a logic and representation system defined by Ryszard S. Michalski. It combines elements of predicate logic, propositional calculus, and multi-valued logic. Attributional calculus provides a formal language for natural induction, an inductive learning process whose results are in forms natural to people.
Augmented reality – (AR) is an interactive experience of a real-world environment where the objects that reside in the real-world are "augmented" by computer-generated perceptual information, sometimes across multiple sensory modalities, including visual, auditory, haptic, somatosensory, and olfactory.^[33]^[34]
Automata theory – is the study of abstract machines and automata, as well as the computational problems that can be solved using them. It is a theory in theoretical computer science and discrete mathematics (a subject of study in both mathematics and computer science).
Automated planning and scheduling – sometimes denoted as simply AI Planning,^[35] is a branch of artificial intelligence that concerns the realization of strategies or action sequences, typically for execution by intelligent agents, autonomous robots and unmanned vehicles. Unlike classical control and classification problems, the solutions are complex and must be discovered and optimized in multidimensional space. Planning is also related to decision theory.
Automated reasoning – is an area of computer science and mathematical logic dedicated to understanding different aspects of reasoning. The study of automated reasoning helps produce computer programs that allow computers to reason completely, or nearly completely, automatically. Although automated reasoning is considered a sub-field of artificial intelligence, it also has connections with theoretical computer science, and even philosophy.
Autonomic computing – (also known as AC) refers to the self-managing characteristics of distributed computing resources, adapting to unpredictable changes while hiding intrinsic complexity to operators and users. Initiated by IBM in 2001, this initiative ultimately aimed to develop computer systems capable of self-management, to overcome the rapidly growing complexity of computing systems management, and to reduce the barrier that complexity poses to further growth.^[36]
Autonomous car – A self-driving car, also known as a robot car, autonomous car, auto, or driverless car,^[37]^[38] is a vehicle that is capable of sensing its environment and moving with little or no human input.^[39]
Autonomous robot – is a robot that performs behaviors or tasks with a high degree of autonomy. Autonomous robotics is usually considered to be a subfield of artificial intelligence, robotics, and information engineering.^[40]

B

Backpropagation – is a method used in artificial neural networks to calculate a gradient that is needed in the calculation of the weights to be used in the network.^[41] Backpropagation is shorthand for "the backward propagation of errors," since an error is computed at the output and distributed backwards throughout the network’s layers.^[42] It is commonly used to train deep neural networks,^[43] a term referring to neural networks with more than one hidden layer.^[44]
Backpropagation through time – (BPTT) is a gradient-based technique for training certain types of recurrent neural networks. It can be used to train Elman networks. The algorithm was independently derived by numerous researchers^[45]^[46]^[47]
Backward chaining – (or backward reasoning) is an inference method described colloquially as working backward from the goal. It is used in automated theorem provers, inference engines, proof assistants, and other artificial intelligence applications.^[48]
Bag-of-words model – is a simplifying representation used in natural language processing and information retrieval (IR). In this model, a text (such as a sentence or a document) is represented as the bag (multiset) of its words, disregarding grammar and even word order but keeping multiplicity. The bag-of-words model has also been used for computer vision.^[49] The bag-of-words model is commonly used in methods of document classification where the (frequency of) occurrence of each word is used as a feature for training a classifier^[50].
Bag-of-words model in computer vision – In computer vision, the bag-of-words model (BoW model) can be applied to image classification, by treating image features as words. In document classification, a bag of words is a sparse vector of occurrence counts of words; that is, a sparse histogram over the vocabulary. In computer vision, a bag of visual words is a vector of occurrence counts of a vocabulary of local image features.
Batch normalization – is a technique for improving the performance and stability of artificial neural networks. It is a technique to provide any layer in a neural network with inputs that are zero mean/unit variance.^[51] Batch normalization was introduced in a 2015 paper.^[52]^[53] It is used to normalize the input layer by adjusting and scaling the activations.^[54]
Bayesian programming – is a formalism and a methodology for having a technique to specify probabilistic models and solve problems when less than the necessary information is available. Bayes’ Theorem is the central concept behind this programming approach, which states that the probability of something occurring in the future can be inferred by past conditions related to the event.^[55]
Bees algorithm – is a population-based search algorithm which was developed by Pham, Ghanbarzadeh and et al. in 2005.^[56] It mimics the food foraging behaviour of honey bee colonies. In its basic version the algorithm performs a kind of neighbourhood search combined with global search, and can be used for both combinatorial optimization and continuous optimization. The only condition for the application of the bees algorithm is that some measure of distance between the solutions is defined. The effectiveness and specific abilities of the bees algorithm have been proven in a number of studies.^[57]^[58]^[59]^[60]
Behavior informatics – (BI) is the informatics of behaviors so as to obtain behavior intelligence and behavior insights.^[61]
Behavior tree – A Behavior Tree (BT) is a mathematical model of plan execution used in computer science, robotics, control systems and video games. They describe switchings between a finite set of tasks in a modular fashion. Their strength comes from their ability to create very complex tasks composed of simple tasks, without worrying how the simple tasks are implemented. BTs present some similarities to hierarchical state machines with the key difference that the main building block of a behavior is a task rather than a state. Its ease of human understanding make BTs less error prone and very popular in the game developer community. BTs have shown to generalize several other control architectures.^[62] ^[63]
Belief-desire-intention software model –
Bias–variance tradeoff –
Big data – is a term used to refer to data sets that are too large or complex for traditional data-processing application software to adequately deal with. Data with many cases (rows) offer greater statistical power, while data with higher complexity (more attributes or columns) may lead to a higher false discovery rate.^[64]
Big O notation – is a mathematical notation that describes the limiting behavior of a function when the argument tends towards a particular value or infinity. It is a member of a family of notations invented by Paul Bachmann,^[65] Edmund Landau,^[66] and others, collectively called Bachmann–Landau notation or asymptotic notation.
Binary tree – is a tree data structure in which each node has at most two children, which are referred to as the left child and the right child. A recursive definition using just set theory notions is that a (non-empty) binary tree is a tuple (L, S, R), where L and R are binary trees or the empty set and S is a singleton set.^[67] Some authors allow the binary tree to be the empty set as well.^[68]
Bio-inspired computing –
Blackboard system – is an artificial intelligence approach based on the blackboard architectural model,^[69]^[70]^[71]^[72] where a common knowledge base, the "blackboard", is iteratively updated by a diverse group of specialist knowledge sources, starting with a problem specification and ending with a solution. Each knowledge source updates the blackboard with a partial solution when its internal constraints match the blackboard state. In this way, the specialists work together to solve the problem.
Boltzmann machine –
Boolean satisfiability problem –
Brain technology – or self-learning know-how systems, defines a technology that employs latest findings in neuroscience. The term was first introduced by the Artificial Intelligence Laboratory in Zurich, Switzerland, in the context of the Roboy project.^[73] Brain Technology can be employed in robots,^[74] know-how management systems^[75] and any other application with self-learning capabilities. In particular, Brain Technology applications allow the visualization of the underlying learning architecture often coined as “know-how maps”.
Branching factor – In computing, tree data structures, and game theory, the branching factor is the number of children at each node, the outdegree. If this value is not uniform, an average branching factor can be calculated.
Brute-force search – or exhaustive search, also known as generate and test, is a very general problem-solving technique and algorithmic paradigm that consists of systematically enumerating all possible candidates for the solution and checking whether each candidate satisfies the problem's statement.

C

Capsule neural network – A Capsule Neural Network (CapsNet) is a machine learning system that is a type of artificial neural network (ANN) that can be used to better model hierarchical relationships. The approach is an attempt to more closely mimic biological neural organization.^[76]
Case-based reasoning – (CBR), broadly construed, is the process of solving new problems based on the solutions of similar past problems.
Chatbot – (also known as a smartbots, talkbot, chatterbot, Bot, IM bot, interactive agent, Conversational interface or Artificial Conversational Entity) is a computer program or an artificial intelligence which conducts a conversation via auditory or textual methods.^[77]
Cloud robotics – is a field of robotics that attempts to invoke cloud technologies such as cloud computing, cloud storage, and other Internet technologies centred on the benefits of converged infrastructure and shared services for robotics. When connected to the cloud, robots can benefit from the powerful computation, storage, and communication resources of modern data center in the cloud, which can process and share information from various robots or agent (other machines, smart objects, humans, etc.). Humans can also delegate tasks to robots remotely through networks. Cloud computing technologies enable robot systems to be endowed with powerful capability whilst reducing costs through cloud technologies. Thus, it is possible to build lightweight, low cost, smarter robots have intelligent "brain" in the cloud. The "brain" consists of data center, knowledge base, task planners, deep learning, information processing, environment models, communication support, etc.^[78]^[79]^[80]^[81]
Cluster analysis – or clustering is the task of grouping a set of objects in such a way that objects in the same group (called a cluster) are more similar (in some sense) to each other than to those in other groups (clusters). It is a main task of exploratory data mining, and a common technique for statistical data analysis, used in many fields, including machine learning, pattern recognition, image analysis, information retrieval, bioinformatics, data compression, and computer graphics.
Cobweb – is an incremental system for hierarchical conceptual clustering. COBWEB was invented by Professor Douglas H. Fisher, currently at Vanderbilt University.^[82]^[83] COBWEB incrementally organizes observations into a classification tree. Each node in a classification tree represents a class (concept) and is labeled by a probabilistic concept that summarizes the attribute-value distributions of objects classified under the node. This classification tree can be used to predict missing attributes or the class of a new object.^[84]
Cognitive architecture – The Institute of Creative Technologies defines cognitive architecture as: "hypothesis about the fixed structures that provide a mind, whether in natural or artificial systems, and how they work together – in conjunction with knowledge and skills embodied within the architecture – to yield intelligent behavior in a diversity of complex environments."^[85]
Cognitive computing – In general, the term cognitive computing has been used to refer to new hardware and/or software that mimics the functioning of the human brain^[86]^[87]^[88]^[89]^[90]^[91]and helps to improve human decision-making.^[92]^[93] In this sense, CC is a new type of computing with the goal of more accurate models of how the human brain/mind senses, reasons, and responds to stimulus.
Cognitive science – is the interdisciplinary, scientific study of the mind and its processes.^[94]
Combinatorial optimization – In Operations Research, applied mathematics and theoretical computer science, combinatorial optimization is a topic that consists of finding an optimal object from a finite set of objects.^[95]
Committee machine – is a type of artificial neural network using a divide and conquer strategy in which the responses of multiple neural networks (experts) are combined into a single response.^[96] The combined response of the committee machine is supposed to be superior to those of its constituent experts. Compare with ensembles of classifiers.
Commonsense knowledge – In artificial intelligence research, commonsense knowledge consists of facts about the everyday world, such as "Lemons are sour", that all humans are expected to know. The first AI program to address common sense knowledge was Advice Taker in 1959 by John McCarthy ^[97].
Commonsense reasoning – is one of the branches of artificial intelligence that is concerned with simulating the human ability to make presumptions about the type and essence of ordinary situations they encounter every day.^[98]
Computational chemistry – is a branch of chemistry that uses computer simulation to assist in solving chemical problems.
Computational complexity theory – focuses on classifying computational problems according to their inherent difficulty, and relating these classes to each other. A computational problem is a task solved by a computer. A computation problem is solvable by mechanical application of mathematical steps, such as an algorithm.
Computational creativity – (also known as artificial creativity, mechanical creativity, creative computing or creative computation) is a multidisciplinary endeavour that includes the fields of artificial intelligence, cognitive psychology, philosophy, and the arts.
Computational cybernetics – is the integration of cybernetics and computational intelligence techniques.
Computational humor – is a branch of computational linguistics and artificial intelligence which uses computers in humor research.^[99]
Computational intelligence – (CI), usually refers to the ability of a computer to learn a specific task from data or experimental observation.
Computational learning theory – In computer science, computational learning theory (or just learning theory) is a subfield of artificial intelligence devoted to studying the design and analysis of machine learning algorithms.^[100]
Computational linguistics – is an interdisciplinary field concerned with the statistical or rule-based modeling of natural language from a computational perspective, as well as the study of appropriate computational approaches to linguistic questions.
Computational mathematics – the mathematical research in areas of science where computing plays an essential role.
Computational neuroscience – (also known as theoretical neuroscience or mathematical neuroscience) is a branch of neuroscience which employs mathematical models, theoretical analysis and abstractions of the brain to understand the principles that govern the development, structure, physiology and cognitive abilities of the nervous system.^[101]^[102]^[103]^[104]
Computational number theory – also known as algorithmic number theory, it is the study of algorithms for performing number theoretic computations.
Computational problem – In theoretical computer science, a computational problem is a mathematical object representing a collection of questions that computers might be able to solve.
Computational statistics – or statistical computing, is the interface between statistics and computer science.
Computer-automated design –
Computer science – is the theory, experimentation, and engineering that form the basis for the design and use of computers. It involves the study of algorithms that process, store, and communicate digital information. A computer scientist specializes in the theory of computation and the design of computational systems.^[105]
Computer vision – is an interdisciplinary scientific field that deals with how computers can be made to gain high-level understanding from digital images or videos. From the perspective of engineering, it seeks to automate tasks that the human visual system can do.^[106]^[107]^[108]
Concept drift – In predictive analytics and machine learning, the concept drift means that the statistical properties of the target variable, which the model is trying to predict, change over time in unforeseen ways. This causes problems because the predictions become less accurate as time passes.
Connectionism – is an approach in the fields of cognitive science, that hopes to explain mental phenomena using artificial neural networks (ANN).^[109]
Consistent heuristic – In the study of path-finding problems in artificial intelligence, a heuristic function is said to be consistent, or monotone, if its estimate is always less than or equal to the estimated distance from any neighboring vertex to the goal, plus the cost of reaching that neighbor.
Constrained conditional model –
Constraint logic programming – is a form of constraint programming, in which logic programming is extended to include concepts from constraint satisfaction. A constraint logic program is a logic program that contains constraints in the body of clauses. An example of a clause including a constraint is A(X,Y) :- X+Y>0, B(X), C(Y). In this clause, X+Y>0 is a constraint; A(X,Y), B(X), and C(Y) are literals as in regular logic programming. This clause states one condition under which the statement A(X,Y) holds: X+Y is greater than zero and both B(X) and C(Y) are true.
Constraint programming – is a programming paradigm wherein relations between variables are stated in the form of constraints. Constraints differ from the common primitives of imperative programming languages in that they do not specify a step or sequence of steps to execute, but rather the properties of a solution to be found.
Constructed language – (sometimes called a conlang) is a language whose phonology, grammar, and vocabulary are, instead of having developed naturally, consciously devised. Constructed languages may also be referred to as artificial, planned or invented languages^[110]
Control theory – in control systems engineering is a subfield of mathematics that deals with the control of continuously operating dynamical systems in engineered processes and machines. The objective is to develop a control model for controlling such systems using a control action in an optimum manner without delay or overshoot and ensuring control stability.
Convolutional neural network – In deep learning, a convolutional neural network (CNN, or ConvNet) is a class of deep neural networks, most commonly applied to analyzing visual imagery. CNNs use a variation of multilayer perceptrons designed to require minimal preprocessing.^[111] They are also known as shift invariant or space invariant artificial neural networks (SIANN), based on their shared-weights architecture and translation invariance characteristics.^[112]^[113]
Crossover – In genetic algorithms and evolutionary computation, crossover, also called recombination, is a genetic operator used to combine the genetic information of two parents to generate new offspring. It is one way to stochastically generate new solutions from an existing population, and analogous to the crossover that happens during sexual reproduction in biology. Solutions can also be generated by cloning an existing solution, which is analogous to asexual reproduction. Newly generated solutions are typically mutated before being added to the population.

D

Darkforest – is a computer go program developed by Facebook, based on deep learning techniques using a convolutional neural network. Its updated version Darkfores2 combines the techniques of its predecessor with Monte Carlo tree search.^[114]^[115] The MCTS effectively takes tree search methods commonly seen in computer chess programs and randomizes them.^[116] With the update, the system is known as Darkfmcts3.^[117]
Dartmouth workshop – The Dartmouth Summer Research Project on Artificial Intelligence was the name of a 1956 summer workshop now considered by many^[118]^[119] (though not all^[120]) to be the seminal event for artificial intelligence as a field.
Data fusion – is the process of integrating multiple data sources to produce more consistent, accurate, and useful information than that provided by any individual data source.^[121]
Data integration – involves combining data residing in different sources and providing users with a unified view of them.^[122] This process becomes significant in a variety of situations, which include both commercial (such as when two similar companies need to merge their databases) and scientific (combining research results from different bioinformatics repositories, for example) domains. Data integration appears with increasing frequency as the volume (that is, big data^[123]) and the need to share existing data explodes.^[124] It has become the focus of extensive theoretical work, and numerous open problems remain unsolved.
Data mining –
Data science – is an interdisciplinary field that uses scientific methods, processes, algorithms and systems to extract knowledge and insights from data in various forms, both structured and unstructured,^[125]^[126] similar to data mining. Data science is a "concept to unify statistics, data analysis, machine learning and their related methods" in order to "understand and analyze actual phenomena" with data.^[127] It employs techniques and theories drawn from many fields within the context of mathematics, statistics, information science, and computer science.
Data set – (or dataset) is a collection of data. Most commonly a data set corresponds to the contents of a single database table, or a single statistical data matrix, where every column of the table represents a particular variable, and each row corresponds to a given member of the data set in question. The data set lists values for each of the variables, such as height and weight of an object, for each member of the data set. Each value is known as a datum. The data set may comprise data for one or more members, corresponding to the number of rows.
Data warehouse – (DW or DWH), also known as an enterprise data warehouse (EDW), is a system used for reporting and data analysis.^[128] DWs are central repositories of integrated data from one or more disparate sources. They store current and historical data in one single place^[129]
Datalog – is a declarative logic programming language that syntactically is a subset of Prolog. It is often used as a query language for deductive databases. In recent years, Datalog has found new application in data integration, information extraction, networking, program analysis, security, and cloud computing.^[130]
Decision boundary –
Decision support system – (DSS), is an information system that supports business or organizational decision-making activities. DSSs serve the management, operations and planning levels of an organization (usually mid and higher management) and help people make decisions about problems that may be rapidly changing and not easily specified in advance—i.e. unstructured and semi-structured decision problems. Decision support systems can be either fully computerized or human-powered, or a combination of both.
Decision theory – (or the theory of choice) is the study of the reasoning underlying an agent's choices.^[131] Decision theory can be broken into two branches: normative decision theory, which gives advice on how to make the best decisions given a set of uncertain beliefs and a set of values, and descriptive decision theory which analyzes how existing, possibly irrational agents actually make decisions.
Decision tree learning – uses a decision tree (as a predictive model) to go from observations about an item (represented in the branches) to conclusions about the item's target value (represented in the leaves). It is one of the predictive modeling approaches used in statistics, data mining and machine learning.
Declarative programming – is a programming paradigm—a style of building the structure and elements of computer programs—that expresses the logic of a computation without describing its control flow.^[132]
Deductive classifier – is a type of artificial intelligence inference engine. It takes as input a set of declarations in a frame language about a domain such as medical research or molecular biology. For example, the names of classes, sub-classes, properties, and restrictions on allowable values. Compared to rule-based inference engines, which can only apply triggers like OFF or IF-THEN when a condition is not met, these classifiers seek to mimic human deductive logic.^[133]
Deep Blue – was a chess-playing computer developed by IBM. It is known for being the first computer chess-playing system to win both a chess game and a chess match against a reigning world champion under regular time controls.
Deep learning –
Default logic – is a non-monotonic logic proposed by Raymond Reiter to formalize reasoning with default assumptions.
Description logic – Description logics (DL) are a family of formal knowledge representation languages. Many DLs are more expressive than propositional logic but less expressive than first-order logic. In contrast to the latter, the core reasoning problems for DLs are (usually) decidable, and efficient decision procedures have been designed and implemented for these problems. There are general, spatial, temporal, spatiotemporal, and fuzzy descriptions logics, and each description logic features a different balance between DL expressivity and reasoning complexity by supporting different sets of mathematical constructors.^[134]
Developmental robotics –
Diagnosis –
Dialog system –
Dimensionality reduction –
Discrete system –
Distributed artificial intelligence –
Dynamic epistemic logic –

E

Eager learning – is a learning method in which the system tries to construct a general, input-independent target function during training of the system, as opposed to lazy learning, where generalization beyond the training data is delayed until a query is made to the system. ^[135]
Ebert test – gauges whether a computer-based synthesized voice^[136]^[137] can tell a joke with sufficient skill to cause people to laugh.^[138] It was proposed by film critic Roger Ebert at the 2011 TED conference as a challenge to software developers to have a computerized voice master the inflections, delivery, timing, and intonations of a speaking human.^[136] The test is similar to the Turing test proposed by Alan Turing in 1950 as a way to gauge a computer's ability to exhibit intelligent behavior by generating performance indistinguishable from a human being.^[139]
Echo state network – The echo state network (ESN),^[140]^[141] is a recurrent neural network with a sparsely connected hidden layer (with typically 1% connectivity). The connectivity and weights of hidden neurons are fixed and randomly assigned. The weights of output neurons can be learned so that the network can (re)produce specific temporal patterns. The main interest of this network is that although its behaviour is non-linear, the only weights that are modified during training are for the synapses that connect the hidden neurons to output neurons. Thus, the error function is quadratic with respect to the parameter vector and can be differentiated easily to a linear system.
Embodied agent –
Embodied cognitive science –
Error-driven learning –
Ensemble averaging –
Ethics of artificial intelligence –
Evolutionary algorithm –
Evolutionary computation –
Evolving classification function –
Existential risk –
Expert systems –

F

Fast-and-frugal trees – is a type of classification tree. Fast-and-frugal trees can be used as decision-making tools which operate as lexicographic classifiers, and, if required, associate an action (decision) to each class or category.^[142]
Feature extraction –
Feature learning –
Feature selection –
First-order logic – —also known as first-order predicate calculus and predicate logic—is a collection of formal systems used in mathematics, philosophy, linguistics, and computer science. First-order logic uses quantified variables over non-logical objects and allows the use of sentences that contain variables, so that rather than propositions such as Socrates is a man one can have expressions in the form "there exists X such that X is Socrates and X is a man" and there exists is a quantifier while X is a variable.^[143] This distinguishes it from propositional logic, which does not use quantifiers or relations.^[144]
Fluent –
Formal language –
Forward chaining – (or forward reasoning) is one of the two main methods of reasoning when using an inference engine and can be described logically as repeated application of modus ponens. Forward chaining is a popular implementation strategy for expert systems, business and production rule systems. The opposite of forward chaining is backward chaining. Forward chaining starts with the available data and uses inference rules to extract more data (from an end user, for example) until a goal is reached. An inference engine using forward chaining searches the inference rules until it finds one where the antecedent (If clause) is known to be true. When such a rule is found, the engine can conclude, or infer, the consequent (Then clause), resulting in the addition of new information to its data.^[145]
Frame –
Frame language –
Frame problem –
Friendly artificial intelligence –
Futures studies –
Fuzzy control system –
Fuzzy logic –
Fuzzy rule –
Fuzzy set –

G

H

Heuristic – is a technique designed for solving a problem more quickly when classic methods are too slow, or for finding an approximate solution when classic methods fail to find any exact solution. This is achieved by trading optimality, completeness, accuracy, or precision for speed. In a way, it can be considered a shortcut. A heuristic function, also called simply a heuristic, is a function that ranks alternatives in search algorithms at each branching step based on available information to decide which branch to follow. For example, it may approximate the exact solution.^[146]
Hidden layer – an internal layer of neurons in an artificial neural network, not dedicated to input or output
Hidden unit – an neuron in a hidden layer in an artificial neural network
Hyper-heuristic – is a heuristic search method that seeks to automate, often by the incorporation of machine learning techniques, the process of selecting, combining, generating or adapting several simpler heuristics (or components of such heuristics) to efficiently solve computational search problems. One of the motivations for studying hyper-heuristics is to build systems which can handle classes of problems rather than solving just one problem.^[147]^[148]^[149]

I

IEEE Computational Intelligence Society –
Incremental learning –
Inference engine –
Information integration –
Information Processing Language –
Intelligence amplification –
Intelligence explosion –
Intelligent agent –
Intelligent control –
Intelligent personal assistant –
Interpretation –
Issue trees –

J

Junction tree algorithm – (also known as 'Clique Tree') is a method used in machine learning to extract marginalization in general graphs. In essence, it entails performing belief propagation on a modified graph called a junction tree. The graph is called a tree because it branches into different sections of data; nodes of variables are the branches.^[150]

K

Kernel method –
KL-ONE –
Knowledge acquisition –
Knowledge-based systems –
Knowledge engineering –
Knowledge extraction –
Knowledge Interchange Format –
Knowledge representation and reasoning –

L

M

N

O

P

Partial order reduction –
Partially observable Markov decision process –
Particle swarm optimization –
Pathfinding –
Pattern recognition –
Planner –
Predicate logic –
Predictive analytics –
Principal component analysis –
Principle of rationality –
Probabilistic programming language –
Production Rule Representation –
Production system –
Programming language –
Prolog –
Propositional calculus –
Python –

Q

R

S

T

U

Unsupervised learning –

V

Vision processing unit –

W

Watson –
Weak AI –
World Wide Web Consortium –

X

Y

Z

References and notes

^ ^a ^b For example: Josephson, John R.; Josephson, Susan G., eds. (1994). Abductive Inference: Computation, Philosophy, Technology. Cambridge, UK; New York: Cambridge University Press. doi:10.1017/CBO9780511530128. ISBN 978-0521434614. OCLC 28149683.
^ "Retroduction | Dictionary | Commens". Commens – Digital Companion to C. S. Peirce. Mats Bergman, Sami Paavola & João Queiroz. Retrieved 24 August 2014.
^ Colburn, Timothy; Shute, Gary (5 June 2007). "Abstraction in Computer Science". Minds and Machines. 17 (2): 169–184. doi:10.1007/s11023-007-9061-7. ISSN 0924-6495.
^ Kramer, Jeff (1 April 2007). "Is abstraction the key to computing?". Communications of the ACM. 50 (4): 36–42. CiteSeerX 10.1.1.120.6776. doi:10.1145/1232743.1232745. ISSN 0001-0782.
^ Michael Gelfond, Vladimir Lifschitz (1998) "Action Languages", Linköping Electronic Articles in Computer and Information Science, vol 3, nr 16.
^ "What is an Activation Function?". deepai.org. {{cite web}}: Cite has empty unknown parameter: |dead-url= (help)
^ Jang, Jyh-Shing R (1991). Fuzzy Modeling Using Generalized Neural Networks and Kalman Filter Algorithm (PDF). Proceedings of the 9th National Conference on Artificial Intelligence, Anaheim, CA, USA, July 14–19. Vol. 2. pp. 762–767.
^ Jang, J.-S.R. (1993). "ANFIS: adaptive-network-based fuzzy inference system". IEEE Transactions on Systems, Man and Cybernetics. 23 (3): 665–685. doi:10.1109/21.256541.
^ Abraham, A. (2005), "Adaptation of Fuzzy Inference System Using Neural Learning", in Nedjah, Nadia; de Macedo Mourelle, Luiza (eds.), Fuzzy Systems Engineering: Theory and Practice, Studies in Fuzziness and Soft Computing, vol. 181, Germany: Springer Verlag, pp. 53–83, CiteSeerX 10.1.1.161.6135, doi:10.1007/11339366_3, ISBN 978-3-540-25322-8
^ Jang, Sun, Mizutani (1997) – Neuro-Fuzzy and Soft Computing – Prentice Hall, pp 335–368, ISBN 0-13-261066-3
^ Tahmasebi, P. (2012). "A hybrid neural networks-fuzzy logic-genetic algorithm for grade estimation" (PDF). Computers & Geosciences. 42: 18–27. doi:10.1016/j.cageo.2012.02.004. PMC 4268588. PMID 25540468.
^ Tahmasebi, P. (2010). "Comparison of optimized neural network with fuzzy logic for ore grade estimation". Australian Journal of Basic and Applied Sciences. 4: 764–772.
^ Russell, S.J.; Norvig, P. (2002). Artificial Intelligence: A Modern Approach. Prentice Hall. ISBN 978-0-13-790395-5.
^ Template:Cite article
^ Tao, Jianhua; Tieniu Tan (2005). "Affective Computing: A Review". Affective Computing and Intelligent Interaction. Vol. LNCS 3784. Springer. pp. 981–995. doi:10.1007/11573548. {{cite conference}}: Unknown parameter |booktitle= ignored (|book-title= suggested) (help)
^ Comparison of Agent Architectures Archived August 27, 2008, at the Wayback Machine
^ "Intel unveils Movidius Compute Stick USB AI Accelerator". 21 July 2017.
^ "Inspurs unveils GX4 AI Accelerator". 21 June 2017.
^ Shapiro, Stuart C. (1992). Artificial Intelligence In Stuart C. Shapiro (Ed.), Encyclopedia of Artificial Intelligence (Second Edition, pp. 54–57). New York: John Wiley. (Section 4 is on "AI-Complete Tasks".)
^ Solomonoff, R., "A Preliminary Report on a General Theory of Inductive Inference", Report V-131, Zator Co., Cambridge, Ma. (Nov. 1960 revision of the Feb. 4, 1960 report).
^ "Artificial intelligence: Google's AlphaGo beats Go master Lee Se-dol". BBC News. 12 March 2016. Retrieved 17 March 2016.
^ "AlphaGo | DeepMind". DeepMind.
^ "Research Blog: AlphaGo: Mastering the ancient game of Go with Machine Learning". Google Research Blog. 27 January 2016.
^ "Google achieves AI 'breakthrough' by beating Go champion". BBC News. 27 January 2016.
^ See Dung (1995)
^ See Besnard and Hunter (2001)
^ see Bench-Capon (2002)
^
Definition of AI as the study of intelligent agents:
- Poole, Mackworth & Goebel 1998, p. 1, which provides the version that is used in this article. Note that they use the term "computational intelligence" as a synonym for artificial intelligence.
- Russell & Norvig (2003) (who prefer the term "rational agent") and write "The whole-agent view is now widely accepted in the field" (Russell & Norvig 2003, p. 55).
- Nilsson 1998
- Legg & Hutter 2007.
^ Russell & Norvig 2009, p. 2.
^ "Artificial Neural Networks as Models of Neural Information Processing | Frontiers Research Topic". Retrieved 20 February 2018.
^ "Build with AI | DeepAI". DeepAI. Retrieved 6 October 2018.
^ "AAAI Corporate Bylaws".
^ "The Lengthy History of Augmented Reality". Huffington Post. 15 May 2016.
^ Schueffel, Patrick (2017). The Concise Fintech Compendium. Fribourg: School of Management Fribourg/Switzerland.
^ Ghallab, Malik; Nau, Dana S.; Traverso, Paolo (2004), Automated Planning: Theory and Practice, Morgan Kaufmann, ISBN 978-1-55860-856-6
^ Kephart, J.O.; Chess, D.M. (2003), "The vision of autonomic computing", Computer, 36: 41–52, CiteSeerX 10.1.1.70.613, doi:10.1109/MC.2003.1160055
^ [1]
^ Thrun, Sebastian (2010). "Toward Robotic Cars". Communications of the ACM. 53 (4): 99–106. doi:10.1145/1721654.1721679.
^ Gehrig, Stefan K.; Stein, Fridtjof J. (1999). Dead reckoning and cartography using stereo vision for an automated car. IEEE/RSJ International Conference on Intelligent Robots and Systems. Vol. 3. Kyongju. pp. 1507–1512. doi:10.1109/IROS.1999.811692. ISBN 0-7803-5184-3.
^ "Information Engineering Main/Home Page". www.robots.ox.ac.uk. Retrieved 3 October 2018.
^ Goodfellow, Ian; Bengio, Yoshua; Courville, Aaaron (2016) Deep Learning. MIT Press. p. 196. ISBN 9780262035613
^ "What is Backpropagation?". deepai.org. {{cite web}}: Cite has empty unknown parameter: |dead-url= (help)
^ Nielsen, Michael A. (2015). "Chapter 6". Neural Networks and Deep Learning.
^ "Deep Networks: Overview - Ufldl". ufldl.stanford.edu. Retrieved 4 August 2017.
^ Mozer, M. C. (1995). "A Focused Backpropagation Algorithm for Temporal Pattern Recognition". In Chauvin, Y.; Rumelhart, D. (eds.). Backpropagation: Theory, architectures, and applications. Hillsdale, NJ: Lawrence Erlbaum Associates. pp. 137–169. Retrieved 21 August 2017. {{cite book}}: |website= ignored (help)
^ Robinson, A. J.; Fallside, F. (1987). The utility driven dynamic error propagation network (Technical report). Cambridge University, Engineering Department. CUED/F-INFENG/TR.1. {{cite tech report}}: Unknown parameter |lastauthoramp= ignored (|name-list-style= suggested) (help)
^ Werbos, Paul J. (1988). "Generalization of backpropagation with application to a recurrent gas market model". Neural Networks. 1 (4): 339–356. doi:10.1016/0893-6080(88)90007-x.
^ Feigenbaum, Edward (1988). The Rise of the Expert Company. Times Books. p. 317. ISBN 978-0-8129-1731-4.
^ Sivic, Josef (April 2009). "Efficient visual search of videos cast as text retrieval" (PDF). IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, VOL. 31, NO. 4. IEEE. pp. 591–605. {{cite conference}}: Unknown parameter |booktitle= ignored (|book-title= suggested) (help)
^ McTear et al 2016, p. 167.
^ "Understanding the backward pass through Batch Normalization Layer". kratzert.github.io. Retrieved 24 April 2018.
^ Ioffe, Sergey; Szegedy, Christian (2015). "Batch Normalization: Accelerating Deep Network Training b y Reducing Internal Covariate Shift". arXiv:1502.03167. {{cite journal}}: Cite journal requires |journal= (help)
^ "Glossary of Deep Learning: Batch Normalisation". medium.com. 27 June 2017. Retrieved 24 April 2018.
^ "Batch normalization in Neural Networks". towardsdatascience.com. 20 October 2017. Retrieved 24 April 2018.
^ "Bayesian versus Frequentist Probability". deepai.org. {{cite web}}: Cite has empty unknown parameter: |dead-url= (help)
^ Pham DT, Ghanbarzadeh A, Koc E, Otri S, Rahim S and Zaidi M. The Bees Algorithm. Technical Note, Manufacturing Engineering Centre, Cardiff University, UK, 2005.
^ Pham, D.T., Castellani, M. (2009), The Bees Algorithm – Modelling Foraging Behaviour to Solve Continuous Optimisation Problems. Proc. ImechE, Part C, 223(12), 2919-2938.
^ Pham, D. T.; Castellani, M. (2014). "Benchmarking and comparison of nature-inspired population-based continuous optimisation algorithms". Soft Computing. 18 (5): 871–903. doi:10.1007/s00500-013-1104-9.
^ Pham, Duc Truong; Castellani, Marco (2015). "A comparative study of the Bees Algorithm as a tool for function optimisation". Cogent Engineering. 2. doi:10.1080/23311916.2015.1091540.
^ Nasrinpour, H. R., Massah Bavani, A., Teshnehlab, M., (2017), Grouped Bees Algorithm: A Grouped Version of the Bees Algorithm, Computers 2017, 6(1), 5; (doi: 10.3390/computers6010005)
^ Cao, Longbing (2010). "In-depth Behavior Understanding and Use: the Behavior Informatics Approach". Information Science. 180 (17): 3067–3085. doi:10.1016/j.ins.2010.03.025.
^ Colledanchise Michele, and Ögren Petter 2016. How Behavior Trees Modularize Hybrid Control Systems and Generalize Sequential Behavior Compositions, the Subsumption Architecture, and Decision Trees. In IEEE Transactions on Robotics vol.PP, no.99, pp.1-18 (2016)
^ Colledanchise Michele, and Ögren Petter 2017. Behavior Trees in Robotics and AI: An Introduction.
^ Breur, Tom (July 2016). "Statistical Power Analysis and the contemporary "crisis" in social sciences". Journal of Marketing Analytics. 4 (2–3): 61–65. doi:10.1057/s41270-016-0001-3. ISSN 2050-3318.
^ Bachmann, Paul (1894). Analytische Zahlentheorie [Analytic Number Theory] (in German). Vol. 2. Leipzig: Teubner.
^ Landau, Edmund (1909). Handbuch der Lehre von der Verteilung der Primzahlen [Handbook on the theory of the distribution of the primes] (in German). Leipzig: B. G. Teubner. p. 883.
^ Rowan Garnier; John Taylor (2009). Discrete Mathematics: Proofs, Structures and Applications, Third Edition. CRC Press. p. 620. ISBN 978-1-4398-1280-8.
^ Steven S Skiena (2009). The Algorithm Design Manual. Springer Science & Business Media. p. 77. ISBN 978-1-84800-070-4.
^ Erman, L. D.; Hayes-Roth, F.; Lesser, V. R.; Reddy, D. R. (1980). "The Hearsay-II Speech-Understanding System: Integrating Knowledge to Resolve Uncertainty". ACM Computing Surveys. 12 (2): 213. doi:10.1145/356810.356816.
^ Corkill, Daniel D. (September 1991). "Blackboard Systems" (PDF). AI Expert. 6 (9): 40–47.
^ * Nii, H. Yenny (1986). Blackboard Systems (PDF) (Technical report). Department of Computer Science, Stanford University. STAN-CS-86-1123. Retrieved 12 April 2013.
^ Hayes-Roth, B. (1985). "A blackboard architecture for control". Artificial Intelligence. 26 (3): 251–321. doi:10.1016/0004-3702(85)90063-3.
^ NZZ- Die Zangengeburt eines möglichen Stammvaters. Website Neue Zürcher Zeitung. Seen 16. August 2013.
^ Official Homepage Roboy Archived 2013-08-03 at the Wayback Machine. Website Roboy. Seen 16. August 2013.
^ Official Homepage Starmind. Website Starmind. Seen 16. August 2013.
^ Sabour, Sara; Frosst, Nicholas; Hinton, Geoffrey E. (26 October 2017). "Dynamic Routing Between Capsules". arXiv:1710.09829 [cs.CV].
^ "What is a chatbot?". techtarget.com. Retrieved 30 January 2017.
^ "Cloud Robotics and Automation A special issue of the IEEE Transactions on Automation Science and Engineering". IEEE. Retrieved 7 December 2014.
^ "RoboEarth".
^ Goldberg, Ken. "Cloud Robotics and Automation".
^ Li, R. "Cloud Robotics-Enable cloud computing for robots". Retrieved 7 December 2014.
^ Fisher, Douglas (1987). "Knowledge acquisition via incremental conceptual clustering" (PDF). Machine Learning. 2 (2): 139–172. doi:10.1007/BF00114265.
^ Fisher, Douglas H. (July 1987). "Improving inference through conceptual clustering". Proceedings of the 1987 AAAI Conferences. AAAI Conference. Seattle Washington. pp. 461–465. {{cite conference}}: Unknown parameter |booktitle= ignored (|book-title= suggested) (help)
^ William Iba and Pat Langley (27 January 2011). "Cobweb models of categorization and probabilistic concept formation". In Emmanuel M. Pothos and Andy J. Wills (ed.). Formal approaches in categorization. Cambridge: Cambridge University Press. pp. 253–273. ISBN 9780521190480.
^ Refer to the ICT website: http://cogarch.ict.usc.edu/
^ "Hewlett Packard Labs".
^ Terdiman, Daniel (2014) .IBM's TrueNorth processor mimics the human brain.http://www.cnet.com/news/ibms-truenorth-processor-mimics-the-human-brain/
^ Knight, Shawn (2011). IBM unveils cognitive computing chips that mimic human brain TechSpot: August 18, 2011, 12:00 PM
^ Hamill, Jasper (2013). Cognitive computing: IBM unveils software for its brain-like SyNAPSE chips The Register: August 8, 2013
^ Denning. P.J. (2014). "Surfing Toward the Future". Communications of the ACM. 57 (3): 26–29. doi:10.1145/2566967.
^ Dr. Lars Ludwig (2013). "Extended Artificial Memory. Toward an integral cognitive theory of memory and technology" (pdf). Technical University of Kaiserslautern. Retrieved 7 February 2017. {{cite journal}}: Cite journal requires |journal= (help)
^ "Research at HP Labs".
^ "Automate Complex Workflows Using Tactical Cognitive Computing: Coseer". thesiliconreview.com. Retrieved 31 July 2017.
^ Cognitive science is an interdisciplinary field of researchers from Linguistics, psychology, neuroscience, philosophy, computer science, and anthropology that seek to understand the mind. How We Learn: Ask the Cognitive Scientist
^ Schrijver, Alexander (February 1, 2006). A Course in Combinatorial Optimization (PDF), page 1.
^ HAYKIN, S. Neural Networks - A Comprehensive Foundation. Second edition. Pearson Prentice Hall: 1999.
^ "PROGRAMS WITH COMMON SENSE". www-formal.stanford.edu. Retrieved 11 April 2018.
^ Ernest Davis; Gary Marcus (2015). "Commonsense reasoning". Communications of the ACM. Vol. 58, no. 9. pp. 92–103. doi:10.1145/2701413.
^ Hulstijn, J, and Nijholt, A. (eds.). Proceedings of the International Workshop on Computational Humor. Number 12 in Twente Workshops on Language Technology, Enschede, Netherlands. University of Twente, 1996.
^ "ACL - Association for Computational Learning".
^ Trappenberg, Thomas P. (2002). Fundamentals of Computational Neuroscience. United States: Oxford University Press Inc. p. 1. ISBN 978-0-19-851582-1.
^ What is computational neuroscience? Patricia S. Churchland, Christof Koch, Terrence J. Sejnowski. in Computational Neuroscience pp.46-55. Edited by Eric L. Schwartz. 1993. MIT Press "Archived copy". Archived from the original on 4 June 2011. Retrieved 11 June 2009. {{cite web}}: Unknown parameter |deadurl= ignored (|url-status= suggested) (help)CS1 maint: archived copy as title (link)
^ Press, The MIT. "Theoretical Neuroscience". The MIT Press. Retrieved 24 May 2018.
^ Gerstner, W.; Kistler, W.; Naud, R.; Paninski, L. (2014). Neuronal Dynamics. Cambridge, UK: Cambridge University Press. ISBN 9781107447615.
^ "WordNet Search—3.1". Wordnetweb.princeton.edu. Retrieved 14 May 2012.
^ Dana H. Ballard; Christopher M. Brown (1982). Computer Vision. Prentice Hall. ISBN 0-13-165316-4.
^ Huang, T. (1996-11-19). Vandoni, Carlo, E, ed. Computer Vision : Evolution And Promise (PDF). 19th CERN School of Computing. Geneva: CERN. pp. 21–25. doi:10.5170/CERN-1996-008.21. ISBN 978-9290830955.
^ Milan Sonka; Vaclav Hlavac; Roger Boyle (2008). Image Processing, Analysis, and Machine Vision. Thomson. ISBN 0-495-08252-X.
^ Garson, James (27 November 2018). Zalta, Edward N. (ed.). The Stanford Encyclopedia of Philosophy. Metaphysics Research Lab, Stanford University – via Stanford Encyclopedia of Philosophy.
^ "Ishtar for Belgium to Belgrade". European Broadcasting Union. Retrieved 19 May 2013.
^ LeCun, Yann. "LeNet-5, convolutional neural networks". Retrieved 16 November 2013.
^ Zhang, Wei (1988). "Shift-invariant pattern recognition neural network and its optical architecture". Proceedings of annual conference of the Japan Society of Applied Physics.
^ Zhang, Wei (1990). "Parallel distributed processing model with local space-invariant interconnections and its optical architecture". Applied Optics. 29 (32): 4790–7. Bibcode:1990ApOpt..29.4790Z. doi:10.1364/AO.29.004790. PMID 20577468.,
^ Tian, Yuandong; Zhu, Yan (2015). "Better Computer Go Player with Neural Network and Long-term Prediction". arXiv:1511.06410v1 [cs.LG].
^ "How Facebook's AI Researchers Built a Game-Changing Go Engine". MIT Technology Review. 4 December 2015. Retrieved 3 February 2016.
^ "Facebook AI Go Player Gets Smarter With Neural Network And Long-Term Prediction To Master World's Hardest Game". Tech Times. 28 January 2016. Retrieved 24 April 2016.
^ "Facebook's artificially intelligent Go player is getting smarter". VentureBeat. 27 January 2016. Retrieved 24 April 2016.
^ Solomonoff, R.J.The Time Scale of Artificial Intelligence; Reflections on Social Effects, Human Systems Management, Vol 5 1985, Pp 149-153
^ Moor, J., The Dartmouth College Artificial Intelligence Conference: The Next Fifty years, AI Magazine, Vol 27, No., 4, Pp. 87-9, 2006
^ Kline, Ronald R., Cybernetics, Automata Studies and the Dartmouth Conference on Artificial Intelligence, IEEE Annals of the History of Computing, October–December, 2011, IEEE Computer Society
^ Haghighat, Mohammad; Abdel-Mottaleb, Mohamed; Alhalabi, Wadee (2016). "Discriminant Correlation Analysis: Real-Time Feature Level Fusion for Multimodal Biometric Recognition". IEEE Transactions on Information Forensics and Security. 11 (9): 1984–1996. doi:10.1109/TIFS.2016.2569061.
^ Maurizio Lenzerini (2002). "Data Integration: A Theoretical Perspective" (PDF). PODS 2002. pp. 233–246. {{cite conference}}: Unknown parameter |booktitle= ignored (|book-title= suggested) (help)
^ Big Data Integration
^ Frederick Lane (2006). "IDC: World Created 161 Billion Gigs of Data in 2006".
^ Dhar, V. (2013). "Data science and prediction". Communications of the ACM. 56 (12): 64–73. doi:10.1145/2500499.
^ Jeff Leek (12 December 2013). "The key word in "Data Science" is not Data, it is Science". Simply Statistics.
^ Hayashi, Chikio (1 January 1998). "What is Data Science? Fundamental Concepts and a Heuristic Example". In Hayashi, Chikio; Yajima, Keiji; Bock, Hans-Hermann; Ohsumi, Noboru; Tanaka, Yutaka; Baba, Yasumasa (eds.). Data Science, Classification, and Related Methods. Studies in Classification, Data Analysis, and Knowledge Organization. Springer Japan. pp. 40–51. doi:10.1007/978-4-431-65950-1_3. ISBN 9784431702085.
^ Dedić, Nedim; Stanier, Clare (2016). Hammoudi, Slimane; Maciaszek, Leszek; Missikoff, Michele M. Missikoff; Camp, Olivier; Cordeiro, José (eds.). An Evaluation of the Challenges of Multilingualism in Data Warehouse Development. International Conference on Enterprise Information Systems, 25–28 April 2016, Rome, Italy. Proceedings of the 18th International Conference on Enterprise Information Systems (ICEIS 2016). Vol. 1. SciTePress. pp. 196–206. doi:10.5220/0005858401960206. ISBN 978-989-758-187-8. {{cite conference}}: External link in |conferenceurl= (help); Unknown parameter |conferenceurl= ignored (|conference-url= suggested) (help)
^ "9 Reasons Data Warehouse Projects Fail". blog.rjmetrics.com. Retrieved 30 April 2017.
^ Huang, Green, and Loo, "Datalog and Emerging applications", SIGMOD 2011 (PDF), UC Davis{{citation}}: CS1 maint: multiple names: authors list (link).
^ Steele, Katie and Stefánsson, H. Orri, "Decision Theory", The Stanford Encyclopedia of Philosophy (Winter 2015 Edition), Edward N. Zalta (ed.), URL = [2]
^ Lloyd, J.W., Practical Advantages of Declarative Programming
^ "What is a Deductive Classifier?". deepai.org. {{cite web}}: Cite has empty unknown parameter: |dead-url= (help)
^ Sikos, Leslie F. (2017). Description Logics in Multimedia Reasoning. Cham: Springer International Publishing. doi:10.1007/978-3-319-54066-5. ISBN 978-3-319-54066-5.
^ Hendrickx, Iris; Van den Bosch, Antal (October 2005). "Hybrid algorithms with Instance-Based Classification". Machine Learning: ECML2005. Springer. pp. 158–169. {{cite conference}}: Unknown parameter |booktitle= ignored (|book-title= suggested) (help)
^ ^a ^b Adam Ostrow (5 March 2011). "Roger Ebert's Inspiring Digital Transformation". Mashable Entertainment. Retrieved 12 September 2011. With the help of his wife, two colleagues and the Alex-equipped MacBook that he uses to generate his computerized voice, famed film critic Roger Ebert delivered the final talk at the TED conference on Friday in Long Beach, California.... {{cite news}}: Italic or bold markup not allowed in: |publisher= (help)
^ JENNIFER 8. LEE (7 March 2011). "Roger Ebert Tests His Vocal Cords, and Comedic Delivery". The New York Times. Retrieved 12 September 2011. Now perhaps, there is the Ebert Test, a way to see if a synthesized voice can deliver humor with the timing to make an audience laugh.... He proposed the Ebert Test as a way to gauge the humanness of a synthesized voice. {{cite news}}: Italic or bold markup not allowed in: |publisher= (help)CS1 maint: numeric names: authors list (link)
^ "Roger Ebert's Inspiring Digital Transformation". Tech News. 5 March 2011. Retrieved 12 September 2011. Meanwhile, the technology that enables Ebert to "speak" continues to see improvements – for example, adding more realistic inflection for question marks and exclamation points. In a test of that, which Ebert called the "Ebert test" for computerized voices, {{cite news}}: Italic or bold markup not allowed in: |publisher= (help)
^ Alex_Pasternack (18 April 2011). "A MacBook May Have Given Roger Ebert His Voice, But An iPod Saved His Life (Video)". Motherboard. Retrieved 12 September 2011. He calls it the "Ebert Test," after Turing's AI standard... {{cite news}}: Italic or bold markup not allowed in: |publisher= (help)
^ Herbert Jaeger and Harald Haas. Harnessing Nonlinearity: Predicting Chaotic Systems and Saving Energy in Wireless Communication. Science 2 April 2004: Vol. 304. no. 5667, pp. 78 – 80 doi:10.1126/science.1091277 PDF
^ Herbert Jaeger (2007) Echo State Network. Scholarpedia.
^ Martignon, Laura; Vitouch, Oliver; Takezawa, Masanori; Forster, Malcolm. "Naive and Yet Enlightened: From Natural Frequencies to Fast and Frugal Decision Trees", published in Thinking : Psychological perspectives on reasoning, judgement and decision making (David Hardman and Laura Macchi; editors), Chichester: John Wiley & Sons, 2003.
^ Hodgson, Dr. J. P. E., "First Order Logic", Saint Joseph's University, Philadelphia, 1995.
^ Hughes, G. E., & Cresswell, M. J., A New Introduction to Modal Logic (London: Routledge, 1996), p.161.
^ Feigenbaum, Edward (1988). The Rise of the Expert Company. Times Books. p. 318. ISBN 978-0-8129-1731-4.
^ Pearl, Judea (1984). Heuristics: intelligent search strategies for computer problem solving. United States: Addison-Wesley Pub. Co., Inc., Reading, MA. p. 3. Retrieved 13 June 2017.
^ E. K. Burke, E. Hart, G. Kendall, J. Newall, P. Ross, and S. Schulenburg, Hyper-heuristics: An emerging direction in modern search technology, Handbook of Metaheuristics (F. Glover and G. Kochenberger, eds.), Kluwer, 2003, pp. 457–474.
^ P. Ross, Hyper-heuristics, Search Methodologies: Introductory Tutorials in Optimization and Decision Support Techniques (E. K. Burke and G. Kendall, eds.), Springer, 2005, pp. 529-556.
^ E. Ozcan, B. Bilgin, E. E. Korkmaz, A Comprehensive Analysis of Hyper-heuristics, Intelligent Data Analysis, 12:1, pp. 3-23, 2008.
^ Paskin, Mark. "A Short Course on Graphical Models" (PDF). Standford. {{cite web}}: Cite has empty unknown parameter: |dead-url= (help)

[Josephson-1] For example: Josephson, John R.; Josephson, Susan G., eds. (1994). Abductive Inference: Computation, Philosophy, Technology. Cambridge, UK; New York: Cambridge University Press. doi:10.1017/CBO9780511530128. ISBN 978-0521434614. OCLC 28149683.

[2] "Retroduction | Dictionary | Commens". Commens – Digital Companion to C. S. Peirce. Mats Bergman, Sami Paavola & João Queiroz. Retrieved 24 August 2014.

[3] Colburn, Timothy; Shute, Gary (5 June 2007). "Abstraction in Computer Science". Minds and Machines. 17 (2): 169–184. doi:10.1007/s11023-007-9061-7. ISSN 0924-6495.

[4] Kramer, Jeff (1 April 2007). "Is abstraction the key to computing?". Communications of the ACM. 50 (4): 36–42. CiteSeerX 10.1.1.120.6776. doi:10.1145/1232743.1232745. ISSN 0001-0782.

[5] Michael Gelfond, Vladimir Lifschitz (1998) "Action Languages", Linköping Electronic Articles in Computer and Information Science, vol 3, nr 16.

[6] "What is an Activation Function?". deepai.org. {{cite web}}: Cite has empty unknown parameter: |dead-url= (help)

[7] Jang, Jyh-Shing R (1991). Fuzzy Modeling Using Generalized Neural Networks and Kalman Filter Algorithm (PDF). Proceedings of the 9th National Conference on Artificial Intelligence, Anaheim, CA, USA, July 14–19. Vol. 2. pp. 762–767.

[8] Jang, J.-S.R. (1993). "ANFIS: adaptive-network-based fuzzy inference system". IEEE Transactions on Systems, Man and Cybernetics. 23 (3): 665–685. doi:10.1109/21.256541.

[9] Abraham, A. (2005), "Adaptation of Fuzzy Inference System Using Neural Learning", in Nedjah, Nadia; de Macedo Mourelle, Luiza (eds.), Fuzzy Systems Engineering: Theory and Practice, Studies in Fuzziness and Soft Computing, vol. 181, Germany: Springer Verlag, pp. 53–83, CiteSeerX 10.1.1.161.6135, doi:10.1007/11339366_3, ISBN 978-3-540-25322-8

[10] Jang, Sun, Mizutani (1997) – Neuro-Fuzzy and Soft Computing – Prentice Hall, pp 335–368, ISBN 0-13-261066-3

[11] Tahmasebi, P. (2012). "A hybrid neural networks-fuzzy logic-genetic algorithm for grade estimation" (PDF). Computers & Geosciences. 42: 18–27. doi:10.1016/j.cageo.2012.02.004. PMC 4268588. PMID 25540468.

[12] Tahmasebi, P. (2010). "Comparison of optimized neural network with fuzzy logic for ore grade estimation". Australian Journal of Basic and Applied Sciences. 4: 764–772.

[13] Russell, S.J.; Norvig, P. (2002). Artificial Intelligence: A Modern Approach. Prentice Hall. ISBN 978-0-13-790395-5.

[14] Template:Cite article

[TaoTan-15] Tao, Jianhua; Tieniu Tan (2005). "Affective Computing: A Review". Affective Computing and Intelligent Interaction. Vol. LNCS 3784. Springer. pp. 981–995. doi:10.1007/11573548. {{cite conference}}: Unknown parameter |booktitle= ignored (|book-title= suggested) (help)

[16] Comparison of Agent Architectures Archived August 27, 2008, at the Wayback Machine

[17] "Intel unveils Movidius Compute Stick USB AI Accelerator". 21 July 2017.

[18] "Inspurs unveils GX4 AI Accelerator". 21 June 2017.

[Shapiro92-19] Shapiro, Stuart C. (1992). Artificial Intelligence In Stuart C. Shapiro (Ed.), Encyclopedia of Artificial Intelligence (Second Edition, pp. 54–57). New York: John Wiley. (Section 4 is on "AI-Complete Tasks".)

[20] Solomonoff, R., "A Preliminary Report on a General Theory of Inductive Inference", Report V-131, Zator Co., Cambridge, Ma. (Nov. 1960 revision of the Feb. 4, 1960 report).

[21] "Artificial intelligence: Google's AlphaGo beats Go master Lee Se-dol". BBC News. 12 March 2016. Retrieved 17 March 2016.

[22] "AlphaGo | DeepMind". DeepMind.

[googlego-23] "Research Blog: AlphaGo: Mastering the ancient game of Go with Machine Learning". Google Research Blog. 27 January 2016.

[bbcgo-24] "Google achieves AI 'breakthrough' by beating Go champion". BBC News. 27 January 2016.

[25] See Dung (1995)

[26] See Besnard and Hunter (2001)

[27] see Bench-Capon (2002)

[Definition_of_AI-28] Definition of AI as the study of intelligent agents:
Poole, Mackworth & Goebel 1998, p. 1, which provides the version that is used in this article. Note that they use the term "computational intelligence" as a synonym for artificial intelligence.

Russell & Norvig (2003) (who prefer the term "rational agent") and write "The whole-agent view is now widely accepted in the field" (Russell & Norvig 2003, p. 55).

Nilsson 1998

Legg & Hutter 2007.

[29] Poole, Mackworth & Goebel 1998, p. 1, which provides the version that is used in this article. Note that they use the term "computational intelligence" as a synonym for artificial intelligence.

[30] Russell & Norvig (2003) (who prefer the term "rational agent") and write "The whole-agent view is now widely accepted in the field" (Russell & Norvig 2003, p. 55).

[31] Nilsson 1998

[32] Legg & Hutter 2007.

[FOOTNOTERussellNorvig20092-29] Russell & Norvig 2009, p. 2.

[30] "Artificial Neural Networks as Models of Neural Information Processing | Frontiers Research Topic". Retrieved 20 February 2018.

[31] "Build with AI | DeepAI". DeepAI. Retrieved 6 October 2018.

[32] "AAAI Corporate Bylaws".

[33] "The Lengthy History of Augmented Reality". Huffington Post. 15 May 2016.

[34] Schueffel, Patrick (2017). The Concise Fintech Compendium. Fribourg: School of Management Fribourg/Switzerland.

[35] Ghallab, Malik; Nau, Dana S.; Traverso, Paolo (2004), Automated Planning: Theory and Practice, Morgan Kaufmann, ISBN 978-1-55860-856-6

[Kephart-36] Kephart, J.O.; Chess, D.M. (2003), "The vision of autonomic computing", Computer, 36: 41–52, CiteSeerX 10.1.1.70.613, doi:10.1109/MC.2003.1160055

[37] [1]

[thrun2010toward-38] Thrun, Sebastian (2010). "Toward Robotic Cars". Communications of the ACM. 53 (4): 99–106. doi:10.1145/1721654.1721679.

[39] Gehrig, Stefan K.; Stein, Fridtjof J. (1999). Dead reckoning and cartography using stereo vision for an automated car. IEEE/RSJ International Conference on Intelligent Robots and Systems. Vol. 3. Kyongju. pp. 1507–1512. doi:10.1109/IROS.1999.811692. ISBN 0-7803-5184-3.

[40] "Information Engineering Main/Home Page". www.robots.ox.ac.uk. Retrieved 3 October 2018.

[41] Goodfellow, Ian; Bengio, Yoshua; Courville, Aaaron (2016) Deep Learning. MIT Press. p. 196. ISBN 9780262035613

[42] "What is Backpropagation?". deepai.org. {{cite web}}: Cite has empty unknown parameter: |dead-url= (help)

[43] Nielsen, Michael A. (2015). "Chapter 6". Neural Networks and Deep Learning.

[44] "Deep Networks: Overview - Ufldl". ufldl.stanford.edu. Retrieved 4 August 2017.

[45] Mozer, M. C. (1995). "A Focused Backpropagation Algorithm for Temporal Pattern Recognition". In Chauvin, Y.; Rumelhart, D. (eds.). Backpropagation: Theory, architectures, and applications. Hillsdale, NJ: Lawrence Erlbaum Associates. pp. 137–169. Retrieved 21 August 2017. {{cite book}}: |website= ignored (help)

[46] Robinson, A. J.; Fallside, F. (1987). The utility driven dynamic error propagation network (Technical report). Cambridge University, Engineering Department. CUED/F-INFENG/TR.1. {{cite tech report}}: Unknown parameter |lastauthoramp= ignored (|name-list-style= suggested) (help)

[47] Werbos, Paul J. (1988). "Generalization of backpropagation with application to a recurrent gas market model". Neural Networks. 1 (4): 339–356. doi:10.1016/0893-6080(88)90007-x.

[48] Feigenbaum, Edward (1988). The Rise of the Expert Company. Times Books. p. 317. ISBN 978-0-8129-1731-4.

[sivic-49] Sivic, Josef (April 2009). "Efficient visual search of videos cast as text retrieval" (PDF). IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, VOL. 31, NO. 4. IEEE. pp. 591–605. {{cite conference}}: Unknown parameter |booktitle= ignored (|book-title= suggested) (help)

[50] McTear et al 2016, p. 167.

[51] "Understanding the backward pass through Batch Normalization Layer". kratzert.github.io. Retrieved 24 April 2018.

[52] Ioffe, Sergey; Szegedy, Christian (2015). "Batch Normalization: Accelerating Deep Network Training b y Reducing Internal Covariate Shift". arXiv:1502.03167. {{cite journal}}: Cite journal requires |journal= (help)

[53] "Glossary of Deep Learning: Batch Normalisation". medium.com. 27 June 2017. Retrieved 24 April 2018.

[54] "Batch normalization in Neural Networks". towardsdatascience.com. 20 October 2017. Retrieved 24 April 2018.

[55] "Bayesian versus Frequentist Probability". deepai.org. {{cite web}}: Cite has empty unknown parameter: |dead-url= (help)

[Pham_&_al,_2005-56] Pham DT, Ghanbarzadeh A, Koc E, Otri S, Rahim S and Zaidi M. The Bees Algorithm. Technical Note, Manufacturing Engineering Centre, Cardiff University, UK, 2005.

[Pham_&_Castellani,_2009-57] Pham, D.T., Castellani, M. (2009), The Bees Algorithm – Modelling Foraging Behaviour to Solve Continuous Optimisation Problems. Proc. ImechE, Part C, 223(12), 2919-2938.

[58] Pham, D. T.; Castellani, M. (2014). "Benchmarking and comparison of nature-inspired population-based continuous optimisation algorithms". Soft Computing. 18 (5): 871–903. doi:10.1007/s00500-013-1104-9.

[59] Pham, Duc Truong; Castellani, Marco (2015). "A comparative study of the Bees Algorithm as a tool for function optimisation". Cogent Engineering. 2. doi:10.1080/23311916.2015.1091540.

[Nasrinpour_&_Massah_&_Teshnehlab_2017-60] Nasrinpour, H. R., Massah Bavani, A., Teshnehlab, M., (2017), Grouped Bees Algorithm: A Grouped Version of the Bees Algorithm, Computers 2017, 6(1), 5; (doi: 10.3390/computers6010005)

[61] Cao, Longbing (2010). "In-depth Behavior Understanding and Use: the Behavior Informatics Approach". Information Science. 180 (17): 3067–3085. doi:10.1016/j.ins.2010.03.025.

[Colledanchise_TRO16-62] Colledanchise Michele, and Ögren Petter 2016. How Behavior Trees Modularize Hybrid Control Systems and Generalize Sequential Behavior Compositions, the Subsumption Architecture, and Decision Trees. In IEEE Transactions on Robotics vol.PP, no.99, pp.1-18 (2016)

[Colledanchise_BOOK17-63] Colledanchise Michele, and Ögren Petter 2017. Behavior Trees in Robotics and AI: An Introduction.

[64] Breur, Tom (July 2016). "Statistical Power Analysis and the contemporary "crisis" in social sciences". Journal of Marketing Analytics. 4 (2–3): 61–65. doi:10.1057/s41270-016-0001-3. ISSN 2050-3318.

[Bachmann-65] Bachmann, Paul (1894). Analytische Zahlentheorie [Analytic Number Theory] (in German). Vol. 2. Leipzig: Teubner.

[Landau-66] Landau, Edmund (1909). Handbuch der Lehre von der Verteilung der Primzahlen [Handbook on the theory of the distribution of the primes] (in German). Leipzig: B. G. Teubner. p. 883.

[GarnierTaylor2009-67] Rowan Garnier; John Taylor (2009). Discrete Mathematics: Proofs, Structures and Applications, Third Edition. CRC Press. p. 620. ISBN 978-1-4398-1280-8.

[Skiena2009-68] Steven S Skiena (2009). The Algorithm Design Manual. Springer Science & Business Media. p. 77. ISBN 978-1-84800-070-4.

[69] Erman, L. D.; Hayes-Roth, F.; Lesser, V. R.; Reddy, D. R. (1980). "The Hearsay-II Speech-Understanding System: Integrating Knowledge to Resolve Uncertainty". ACM Computing Surveys. 12 (2): 213. doi:10.1145/356810.356816.

[70] Corkill, Daniel D. (September 1991). "Blackboard Systems" (PDF). AI Expert. 6 (9): 40–47.

[71] * Nii, H. Yenny (1986). Blackboard Systems (PDF) (Technical report). Department of Computer Science, Stanford University. STAN-CS-86-1123. Retrieved 12 April 2013.

[72] Hayes-Roth, B. (1985). "A blackboard architecture for control". Artificial Intelligence. 26 (3): 251–321. doi:10.1016/0004-3702(85)90063-3.

[73] NZZ- Die Zangengeburt eines möglichen Stammvaters. Website Neue Zürcher Zeitung. Seen 16. August 2013.

[74] Official Homepage Roboy Archived 2013-08-03 at the Wayback Machine. Website Roboy. Seen 16. August 2013.

[75] Official Homepage Starmind. Website Starmind. Seen 16. August 2013.

[76] Sabour, Sara; Frosst, Nicholas; Hinton, Geoffrey E. (26 October 2017). "Dynamic Routing Between Capsules". arXiv:1710.09829 [cs.CV].

[target-77] "What is a chatbot?". techtarget.com. Retrieved 30 January 2017.

[RASrobot-78] "Cloud Robotics and Automation A special issue of the IEEE Transactions on Automation Science and Engineering". IEEE. Retrieved 7 December 2014.

[79] "RoboEarth".

[kengoldberg-80] Goldberg, Ken. "Cloud Robotics and Automation".

[sites.google.com-81] Li, R. "Cloud Robotics-Enable cloud computing for robots". Retrieved 7 December 2014.

[82] Fisher, Douglas (1987). "Knowledge acquisition via incremental conceptual clustering" (PDF). Machine Learning. 2 (2): 139–172. doi:10.1007/BF00114265.

[83] Fisher, Douglas H. (July 1987). "Improving inference through conceptual clustering". Proceedings of the 1987 AAAI Conferences. AAAI Conference. Seattle Washington. pp. 461–465. {{cite conference}}: Unknown parameter |booktitle= ignored (|book-title= suggested) (help)

[84] William Iba and Pat Langley (27 January 2011). "Cobweb models of categorization and probabilistic concept formation". In Emmanuel M. Pothos and Andy J. Wills (ed.). Formal approaches in categorization. Cambridge: Cambridge University Press. pp. 253–273. ISBN 9780521190480.

[85] Refer to the ICT website: http://cogarch.ict.usc.edu/

[86] "Hewlett Packard Labs".

[87] Terdiman, Daniel (2014) .IBM's TrueNorth processor mimics the human brain.http://www.cnet.com/news/ibms-truenorth-processor-mimics-the-human-brain/

[88] Knight, Shawn (2011). IBM unveils cognitive computing chips that mimic human brain TechSpot: August 18, 2011, 12:00 PM

[89] Hamill, Jasper (2013). Cognitive computing: IBM unveils software for its brain-like SyNAPSE chips The Register: August 8, 2013

[Denning-90] Denning. P.J. (2014). "Surfing Toward the Future". Communications of the ACM. 57 (3): 26–29. doi:10.1145/2566967.

[91] Dr. Lars Ludwig (2013). "Extended Artificial Memory. Toward an integral cognitive theory of memory and technology" (pdf). Technical University of Kaiserslautern. Retrieved 7 February 2017. {{cite journal}}: Cite journal requires |journal= (help)

[92] "Research at HP Labs".

[93] "Automate Complex Workflows Using Tactical Cognitive Computing: Coseer". thesiliconreview.com. Retrieved 31 July 2017.

[94] Cognitive science is an interdisciplinary field of researchers from Linguistics, psychology, neuroscience, philosophy, computer science, and anthropology that seek to understand the mind. How We Learn: Ask the Cognitive Scientist

[95] Schrijver, Alexander (February 1, 2006). A Course in Combinatorial Optimization (PDF), page 1.

[96] HAYKIN, S. Neural Networks - A Comprehensive Foundation. Second edition. Pearson Prentice Hall: 1999.

[97] "PROGRAMS WITH COMMON SENSE". www-formal.stanford.edu. Retrieved 11 April 2018.

[98] Ernest Davis; Gary Marcus (2015). "Commonsense reasoning". Communications of the ACM. Vol. 58, no. 9. pp. 92–103. doi:10.1145/2701413.

[99] Hulstijn, J, and Nijholt, A. (eds.). Proceedings of the International Workshop on Computational Humor. Number 12 in Twente Workshops on Language Technology, Enschede, Netherlands. University of Twente, 1996.

[ACL-100] "ACL - Association for Computational Learning".

[:0-101] Trappenberg, Thomas P. (2002). Fundamentals of Computational Neuroscience. United States: Oxford University Press Inc. p. 1. ISBN 978-0-19-851582-1.

[102] What is computational neuroscience? Patricia S. Churchland, Christof Koch, Terrence J. Sejnowski. in Computational Neuroscience pp.46-55. Edited by Eric L. Schwartz. 1993. MIT Press "Archived copy". Archived from the original on 4 June 2011. Retrieved 11 June 2009. {{cite web}}: Unknown parameter |deadurl= ignored (|url-status= suggested) (help)CS1 maint: archived copy as title (link)

[103] Press, The MIT. "Theoretical Neuroscience". The MIT Press. Retrieved 24 May 2018.

[104] Gerstner, W.; Kistler, W.; Naud, R.; Paninski, L. (2014). Neuronal Dynamics. Cambridge, UK: Cambridge University Press. ISBN 9781107447615.

[105] "WordNet Search—3.1". Wordnetweb.princeton.edu. Retrieved 14 May 2012.

[106] Dana H. Ballard; Christopher M. Brown (1982). Computer Vision. Prentice Hall. ISBN 0-13-165316-4.

[107] Huang, T. (1996-11-19). Vandoni, Carlo, E, ed. Computer Vision : Evolution And Promise (PDF). 19th CERN School of Computing. Geneva: CERN. pp. 21–25. doi:10.5170/CERN-1996-008.21. ISBN 978-9290830955.

[108] Milan Sonka; Vaclav Hlavac; Roger Boyle (2008). Image Processing, Analysis, and Machine Vision. Thomson. ISBN 0-495-08252-X.

[109] Garson, James (27 November 2018). Zalta, Edward N. (ed.). The Stanford Encyclopedia of Philosophy. Metaphysics Research Lab, Stanford University – via Stanford Encyclopedia of Philosophy.

[110] "Ishtar for Belgium to Belgrade". European Broadcasting Union. Retrieved 19 May 2013.

[LeCun-111] LeCun, Yann. "LeNet-5, convolutional neural networks". Retrieved 16 November 2013.

[112] Zhang, Wei (1988). "Shift-invariant pattern recognition neural network and its optical architecture". Proceedings of annual conference of the Japan Society of Applied Physics.

[113] Zhang, Wei (1990). "Parallel distributed processing model with local space-invariant interconnections and its optical architecture". Applied Optics. 29 (32): 4790–7. Bibcode:1990ApOpt..29.4790Z. doi:10.1364/AO.29.004790. PMID 20577468.,

[facebook-paper2-114] Tian, Yuandong; Zhu, Yan (2015). "Better Computer Go Player with Neural Network and Long-term Prediction". arXiv:1511.06410v1 [cs.LG].

[115] "How Facebook's AI Researchers Built a Game-Changing Go Engine". MIT Technology Review. 4 December 2015. Retrieved 3 February 2016.

[116] "Facebook AI Go Player Gets Smarter With Neural Network And Long-Term Prediction To Master World's Hardest Game". Tech Times. 28 January 2016. Retrieved 24 April 2016.

[:2-117] "Facebook's artificially intelligent Go player is getting smarter". VentureBeat. 27 January 2016. Retrieved 24 April 2016.

[118] Solomonoff, R.J.The Time Scale of Artificial Intelligence; Reflections on Social Effects, Human Systems Management, Vol 5 1985, Pp 149-153

[119] Moor, J., The Dartmouth College Artificial Intelligence Conference: The Next Fifty years, AI Magazine, Vol 27, No., 4, Pp. 87-9, 2006

[120] Kline, Ronald R., Cybernetics, Automata Studies and the Dartmouth Conference on Artificial Intelligence, IEEE Annals of the History of Computing, October–December, 2011, IEEE Computer Society

[dca-121] Haghighat, Mohammad; Abdel-Mottaleb, Mohamed; Alhalabi, Wadee (2016). "Discriminant Correlation Analysis: Real-Time Feature Level Fusion for Multimodal Biometric Recognition". IEEE Transactions on Information Forensics and Security. 11 (9): 1984–1996. doi:10.1109/TIFS.2016.2569061.

[refone-122] Maurizio Lenzerini (2002). "Data Integration: A Theoretical Perspective" (PDF). PODS 2002. pp. 233–246. {{cite conference}}: Unknown parameter |booktitle= ignored (|book-title= suggested) (help)

[123] Big Data Integration

[DataExplode-124] Frederick Lane (2006). "IDC: World Created 161 Billion Gigs of Data in 2006".

[125] Dhar, V. (2013). "Data science and prediction". Communications of the ACM. 56 (12): 64–73. doi:10.1145/2500499.

[126] Jeff Leek (12 December 2013). "The key word in "Data Science" is not Data, it is Science". Simply Statistics.

[Hayashi-127] Hayashi, Chikio (1 January 1998). "What is Data Science? Fundamental Concepts and a Heuristic Example". In Hayashi, Chikio; Yajima, Keiji; Bock, Hans-Hermann; Ohsumi, Noboru; Tanaka, Yutaka; Baba, Yasumasa (eds.). Data Science, Classification, and Related Methods. Studies in Classification, Data Analysis, and Knowledge Organization. Springer Japan. pp. 40–51. doi:10.1007/978-4-431-65950-1_3. ISBN 9784431702085.

[128] Dedić, Nedim; Stanier, Clare (2016). Hammoudi, Slimane; Maciaszek, Leszek; Missikoff, Michele M. Missikoff; Camp, Olivier; Cordeiro, José (eds.). An Evaluation of the Challenges of Multilingualism in Data Warehouse Development. International Conference on Enterprise Information Systems, 25–28 April 2016, Rome, Italy. Proceedings of the 18th International Conference on Enterprise Information Systems (ICEIS 2016). Vol. 1. SciTePress. pp. 196–206. doi:10.5220/0005858401960206. ISBN 978-989-758-187-8. {{cite conference}}: External link in |conferenceurl= (help); Unknown parameter |conferenceurl= ignored (|conference-url= suggested) (help)

[rjmetrics-129] "9 Reasons Data Warehouse Projects Fail". blog.rjmetrics.com. Retrieved 30 April 2017.

[130] Huang, Green, and Loo, "Datalog and Emerging applications", SIGMOD 2011 (PDF), UC Davis{{citation}}: CS1 maint: multiple names: authors list (link).

[131] Steele, Katie and Stefánsson, H. Orri, "Decision Theory", The Stanford Encyclopedia of Philosophy (Winter 2015 Edition), Edward N. Zalta (ed.), URL = [2]

[132] Lloyd, J.W., Practical Advantages of Declarative Programming

[133] "What is a Deductive Classifier?". deepai.org. {{cite web}}: Cite has empty unknown parameter: |dead-url= (help)

[134] Sikos, Leslie F. (2017). Description Logics in Multimedia Reasoning. Cham: Springer International Publishing. doi:10.1007/978-3-319-54066-5. ISBN 978-3-319-54066-5.

[135] Hendrickx, Iris; Van den Bosch, Antal (October 2005). "Hybrid algorithms with Instance-Based Classification". Machine Learning: ECML2005. Springer. pp. 158–169. {{cite conference}}: Unknown parameter |booktitle= ignored (|book-title= suggested) (help)

[twsL35-136] Adam Ostrow (5 March 2011). "Roger Ebert's Inspiring Digital Transformation". Mashable Entertainment. Retrieved 12 September 2011. With the help of his wife, two colleagues and the Alex-equipped MacBook that he uses to generate his computerized voice, famed film critic Roger Ebert delivered the final talk at the TED conference on Friday in Long Beach, California.... {{cite news}}: Italic or bold markup not allowed in: |publisher= (help)

[twsL34-137] JENNIFER 8. LEE (7 March 2011). "Roger Ebert Tests His Vocal Cords, and Comedic Delivery". The New York Times. Retrieved 12 September 2011. Now perhaps, there is the Ebert Test, a way to see if a synthesized voice can deliver humor with the timing to make an audience laugh.... He proposed the Ebert Test as a way to gauge the humanness of a synthesized voice. {{cite news}}: Italic or bold markup not allowed in: |publisher= (help)CS1 maint: numeric names: authors list (link)

[twsL41-138] "Roger Ebert's Inspiring Digital Transformation". Tech News. 5 March 2011. Retrieved 12 September 2011. Meanwhile, the technology that enables Ebert to "speak" continues to see improvements – for example, adding more realistic inflection for question marks and exclamation points. In a test of that, which Ebert called the "Ebert test" for computerized voices, {{cite news}}: Italic or bold markup not allowed in: |publisher= (help)

[twsL37-139] Alex_Pasternack (18 April 2011). "A MacBook May Have Given Roger Ebert His Voice, But An iPod Saved His Life (Video)". Motherboard. Retrieved 12 September 2011. He calls it the "Ebert Test," after Turing's AI standard... {{cite news}}: Italic or bold markup not allowed in: |publisher= (help)

[140] Herbert Jaeger and Harald Haas. Harnessing Nonlinearity: Predicting Chaotic Systems and Saving Energy in Wireless Communication. Science 2 April 2004: Vol. 304. no. 5667, pp. 78 – 80 doi:10.1126/science.1091277 PDF

[141] Herbert Jaeger (2007) Echo State Network. Scholarpedia.

[naive-142] Martignon, Laura; Vitouch, Oliver; Takezawa, Masanori; Forster, Malcolm. "Naive and Yet Enlightened: From Natural Frequencies to Fast and Frugal Decision Trees", published in Thinking : Psychological perspectives on reasoning, judgement and decision making (David Hardman and Laura Macchi; editors), Chichester: John Wiley & Sons, 2003.

[143] Hodgson, Dr. J. P. E., "First Order Logic", Saint Joseph's University, Philadelphia, 1995.

[144] Hughes, G. E., & Cresswell, M. J., A New Introduction to Modal Logic (London: Routledge, 1996), p.161.

[145] Feigenbaum, Edward (1988). The Rise of the Expert Company. Times Books. p. 318. ISBN 978-0-8129-1731-4.

[146] Pearl, Judea (1984). Heuristics: intelligent search strategies for computer problem solving. United States: Addison-Wesley Pub. Co., Inc., Reading, MA. p. 3. Retrieved 13 June 2017.

[147] E. K. Burke, E. Hart, G. Kendall, J. Newall, P. Ross, and S. Schulenburg, Hyper-heuristics: An emerging direction in modern search technology, Handbook of Metaheuristics (F. Glover and G. Kochenberger, eds.), Kluwer, 2003, pp. 457–474.

[Ross05-148] P. Ross, Hyper-heuristics, Search Methodologies: Introductory Tutorials in Optimization and Decision Support Techniques (E. K. Burke and G. Kendall, eds.), Springer, 2005, pp. 529-556.

[Ozcan08-149] E. Ozcan, B. Bilgin, E. E. Korkmaz, A Comprehensive Analysis of Hyper-heuristics, Intelligent Data Analysis, 12:1, pp. 3-23, 2008.

[:1-150] Paskin, Mark. "A Short Course on Graphical Models" (PDF). Standford. {{cite web}}: Cite has empty unknown parameter: |dead-url= (help)

[1]

[2]

[3]

[4]

[5]

[6]

[7]

[8]

[9]

[10]

[11]

[12]

[13]

[14]

[15]

[16]

[17]

[18]

[19]

[20]

[21]

[22]

[23]

[24]

[25]

[26]

[27]

[28]

[29]

[30]

[31]

[32]

[33]

[34]

[35]

[36]

[37]

[38]

[39]

[40]

[41]

[42]

[43]

[44]

[45]

[46]

[47]

[48]

[49]

[50]

[51]

[52]

[53]

[54]

[55]

[56]

[57]

[58]

[59]

[60]

[61]

[62]

[63]

[64]

[65]

[66]

[67]

[68]

[69]

[70]

[71]

[72]

[73]

[74]

[75]

[76]

[77]

[78]

[79]

[80]

[81]

[82]

[83]

[84]

[85]

[86]

[87]

[88]

[89]

[90]

[91]

[92]

[93]

[94]

[95]

[96]

[97]

[98]

[99]

[100]

@@ Line 207: / Line 207: @@
 *'''[[Deep learning]]''' –
 *'''[[Default logic]]''' – is a [[non-monotonic logic]] proposed by [[Raymond Reiter]] to formalize reasoning with default assumptions.
+*'''[[Description logic]]''' – '''Description logics''' ('''DL''') are a family of formal [[knowledge representation]] languages. Many DLs are more expressive than [[propositional logic]] but less expressive than [[first-order logic]]. In contrast to the latter, the core reasoning problems for DLs are (usually) [[Decision problem|decidable]], and efficient decision procedures have been designed and implemented for these problems. There are general, spatial, temporal, spatiotemporal, and fuzzy descriptions logics, and each description logic features a different balance between DL expressivity and [[Knowledge_representation_and_reasoning|reasoning]] [[Complexity_class|complexity]] by supporting different sets of mathematical constructors.<ref>{{cite book |last=Sikos |first=Leslie F. |date=2017 |title=Description Logics in Multimedia Reasoning |url=https://www.springer.com/us/book/9783319540658 |location=Cham |publisher=Springer International Publishing |isbn=978-3-319-54066-5 |doi=10.1007/978-3-319-54066-5 }}</ref>
-*'''[[Description logic]]''' –
 *'''[[Developmental robotics]]''' –
 *'''[[Diagnosis (artificial intelligence)|Diagnosis]]''' –

v t e Computer science
Note: This template roughly follows the 2012 ACM Computing Classification System.
Hardware	Printed circuit board Peripheral Integrated circuit Very Large Scale Integration Systems on Chip (SoCs) Energy consumption (Green computing) Electronic design automation Hardware acceleration
Computer systems organization	Computer architecture Computational complexity Dependability Embedded system Real-time computing
Networks	Network architecture Network protocol Network components Network scheduler Network performance evaluation Network service
Software organization	Interpreter Middleware Virtual machine Operating system Software quality
Software notations and tools	Programming paradigm Programming language Compiler Domain-specific language Modeling language Software framework Integrated development environment Software configuration management Software library Software repository
Software development	Control variable Software development process Requirements analysis Software design Software construction Software deployment Software engineering Software maintenance Programming team Open-source model
Theory of computation	Model of computation Formal language Automata theory Computability theory Computational complexity theory Logic Semantics
Algorithms	Algorithm design Analysis of algorithms Algorithmic efficiency Randomized algorithm Computational geometry
Mathematics of computing	Discrete mathematics Probability Statistics Mathematical software Information theory Mathematical analysis Numerical analysis Theoretical computer science
Information systems	Database management system Information storage systems Enterprise information system Social information systems Geographic information system Decision support system Process control system Multimedia information system Data mining Digital library Computing platform Digital marketing World Wide Web Information retrieval
Security	Cryptography Formal methods Security hacker Security services Intrusion detection system Hardware security Network security Information security Application security
Human–computer interaction	Interaction design Social computing Ubiquitous computing Visualization Accessibility
Concurrency	Concurrent computing Parallel computing Distributed computing Multithreading Multiprocessing
Artificial intelligence	Natural language processing Knowledge representation and reasoning Computer vision Automated planning and scheduling Search methodology Control method Philosophy of artificial intelligence Distributed artificial intelligence
Machine learning	Supervised learning Unsupervised learning Reinforcement learning Multi-task learning Cross-validation
Graphics	Animation Rendering Photograph manipulation Graphics processing unit Mixed reality Virtual reality Image compression Solid modeling
Applied computing	Quantum Computing E-commerce Enterprise software Computational mathematics Computational physics Computational chemistry Computational biology Computational social science Computational engineering Differentiable computing Computational healthcare Digital art Electronic publishing Cyberwarfare Electronic voting Video games Word processing Operations research Educational technology Document management
Category Outline WikiProject Commons

v t e Evolutionary computation
Main Topics	Evolutionary algorithm Evolutionary data mining Evolutionary multimodal optimization Human-based evolutionary computation Interactive evolutionary computation
Algorithms	Cellular evolutionary algorithm Covariance Matrix Adaptation Evolution Strategy (CMA-ES) Cultural algorithm Differential evolution Evolutionary programming Genetic algorithm Genetic programming Gene expression programming Evolution strategy Natural evolution strategy Neuroevolution Learning classifier system
Related techniques	Swarm intelligence Ant colony optimization Bees algorithm Cuckoo search Particle swarm optimization Bacterial Colony Optimization
Metaheuristic methods	Firefly algorithm Harmony search Gaussian adaptation Memetic algorithm
Related topics	Artificial development Artificial intelligence Artificial life Digital organism Evolutionary robotics Fitness function Fitness landscape Fitness approximation Genetic operators Interactive evolutionary computation No free lunch in search and optimization Machine learning Mating pool Program synthesis
Journals	Evolutionary Computation (journal)

v t e Robotics
Main articles	Outline Glossary Index History Geography Hall of Fame Ethics Laws Competitions AI competitions
Types	Aerobot Anthropomorphic Humanoid Android Cyborg Gynoid Claytronics Companion Automaton Animatronic Audio-Animatronics Industrial Articulated arm Domestic Educational Entertainment Juggling Military Medical Service Disability Agricultural Food service Retail BEAM robotics Soft robotics
Classifications	Biorobotics Cloud robotics Continuum robot Unmanned vehicle aerial ground Mobile robot Microbotics Nanorobotics Necrobotics Robotic spacecraft Space probe Swarm Telerobotics Underwater remotely-operated Robotic fish
Locomotion	Tracks Walking Hexapod Climbing Electric unicycle Robotic fins
Navigation and mapping	Motion planning Simultaneous localization and mapping Visual odometry Vision-guided robot systems
Research	Evolutionary Kits Simulator Suite Open-source Software Adaptable Developmental Human–robot interaction Paradigms Perceptual Situated Ubiquitous
Companies	Amazon Robotics Anybots Barrett Technology Boston Dynamics Energid Technologies FarmWise FANUC Figure AI Foster-Miller Harvest Automation Honeybee Robotics Intuitive Surgical IRobot KUKA Starship Technologies Symbotic Universal Robotics Wolf Robotics Yaskawa
Related	Critique of work Powered exoskeleton Workplace robotics safety Robotic tech vest Technological unemployment Terrainability Fictional robots
Category Outline

Revision as of 14:47, 19 February 2019

A

B

C

D

E

F

G

H

I

J

K

L

M

N

O

P

Q

R

S

T

U

V

W

X

Y

Z

See also

References and notes