Artificial intelligence Artificial intelligence Belief revision is the process changing beliefs to take into account a new piece of information. The logical formalization of belief revision is researched in philosophy, in databases, and in artificial intelligence for the design of rational agents. ...more on Wikipedia about "Belief revision"
Biologically-inspired computing (also bio-inspired computing) is a field of study that loosely knits together subfields related to the topics of connectionism, social behaviour and emergence. It is often closely related to the field of artificial intelligence, as many of its pursuits can be linked to machine learning. It relies heavily on the fields of biology, computer science and mathematics. Briefly put, it is the use of computers to model nature, and simultaneously the study of nature to improve the usage of computers. Biologically-inspired computing is a major subset of natural computation. ...more on Wikipedia about "Biologically-inspired computing"
Blockhead is the name of a theoretical computer system invented as part of a thought experiment by philosopher Ned Block, which appeared in a paper entitled Psychologism and Behaviourism. In this paper, Block argues that the internal mechanism of a system was important in determining whether that system was intelligent, and also to show that a non-intelligent system could pass the Turing Test. ...more on Wikipedia about "Blockhead"
The term "Bootstrapped-Brain" refers generically to any cognitive entity or collective that can redesign itself, perform self-replication, and has the potential ability to develop fundamental technologies in much shorter timescales than humans could. ...more on Wikipedia about "Bootstrapped-Brain"
The Brill Tagger is a method for doing part-of-speech tagging. It was exposed by Eric Brill in his 1993 PhD thesis ** . It can be summarised as an "error-driven transformation-based tagger". It is ...more on Wikipedia about "Brill Tagger"
A captcha (an acronym for "completely automated public Turing test to tell computers and humans apart") is a type of challenge-response test used in computing to determine whether or not the user is human. The term was coined in 2000 by Luis von Ahn, Manuel Blum, and Nicholas J. Hopper of Carnegie Mellon University, and John Langford of IBM. A common type of captcha requires that the user type the letters of a distorted and/or obscured sequence of letters or digits that appears on the screen. Because the test is administered by a computer, in contrast to the standard Turing test that is administered by a human, a captcha is sometimes described as a reverse Turing test (this term, however, is misleading because it could also mean a Turing test in which the participants are both attempting to prove they are the computer). ...more on Wikipedia about "Captcha"
Circumscription is a non-monotonic logic created by John McCarthy to formalize the common sense assumption that things are as expected unless otherwise specified. Circumscription was later used by McCarthy in an attempt to solve the frame problem. In its original first-order logic formulation, circumscription minimizes the extension of some predicates, where the extension of a predicate is the set of tuples of values the predicate is true on. This minimization is similar to the closed world assumption that what is not known to be true is false. ...more on Wikipedia about "Circumscription"
Clinical (or Diagnostic) Decision Support Systems (CDSS) are interactive computer programs, which directly assist physicians and other health professionals with decision making tasks. ...more on Wikipedia about "Clinical decision support system"
Cognitive robotics (CR) is concerned with endowing robots (which have to operate in complex, fast-changing environments) with high-level cognitive capabilities, such as anticipation, planning, reasoning about other agents, and reasoning about their own mental states. This is the hardware (embodied) version of intelligent agents. A cognitive robot should exhibit: ...more on Wikipedia about "Cognitive robotics"
A cognitive tutor is a computer program which develops a cognitive model of a student as he or she interacts with the program, providing problems and individualized instruction based on this model. ...more on Wikipedia about "Cognitive tutor"
Combinatorial optimization is a branch of optimization in applied mathematics and computer science, related to operations research, algorithm theory and computational complexity theory that sits at the intersection of several fields, including artificial intelligence, mathematics and software engineering. Combinatorial optimization algorithms solve instances of problems that are believed to be hard in general, by exploring the usually-large solution space of these instances. Combinatorial optimization algorithms achieve this by reducing the effective size of the space, and by exploring the space efficiently. ...more on Wikipedia about "Combinatorial optimization"
Commonsense reasoning is the branch of Artificial intelligence concerned with replicating human thinking. There are several components to this problem, including: ...more on Wikipedia about "Commonsense reasoning"
Computational intelligence (CI) is a branch of the study of artificial intelligence. Computational intelligence research aims to use learning, adaptive, or evolutionary computation to create programs that are, in some sense, intelligent. Computational intelligence research either explicitly rejects statistical methods (as is the case with fuzzy systems), or tacitly ignores statistics (as is the case with most neural network research). In contrast, machine learning research rejects non-statistical approaches to learning, adaptivity, and optimization. ...more on Wikipedia about "Computational intelligence"
The game of poker (or at least most of the variants) is considered to be computationally unsolvable. However, methods are being developed to at least approximate perfect strategy from the game theory perspective in the heads-up (two player) game, and increasingly good systems are being created for the multi-player or ring game. Perfect strategy has multiple meanings in this context. From a game-theoretic optimal point of view, a perfect strategy is one that cannot lose to any other player's strategy; however, optimal strategy can vary in the presence of sub-optimal players who have weaknesses that can be exploited. In this case, perfect strategy would be one that correctly or closely models those weaknesses and takes advantage of them to make a profit. Some of these systems are based on Bayes theorem, Nash equilibrium, Monte Carlo simulation and Neural networks. A large amount of the research is being done at the University of Alberta by the GAMES group led by Jonathan Schaeffer who developed Poki and PsOpt. ...more on Wikipedia about "Computer poker players" There's a bit of www.shortopedia.com in all of us. Artificial_intelligence
Computer vision is the study and application of methods which allow computers to "understand" image content or content of multidimensional data in general. The term "understand" means here that specific information is being extracted from the image data for a specific purpose: either for presenting it to a human operator (e. g., if cancerous cells have been detected in a microscopy image), or for controlling some process (e. g., an industry robot or an autonomous vehicle). The image data that is fed into a computer vision system is often a digital gray-scale or colour image, but can also be in the form of two or more such images (e. g., from a stereo camera pair), a video sequence, or a 3D volume (e. g., from a tomography device). In most practical computer vision applications, the computers are pre-programmed to solve a particular task, but methods based on learning are now becoming increasingly common. ...more on Wikipedia about "Computer vision"
A computer-assisted proof is a mathematical proof that has been generated by computer. ...more on Wikipedia about "Computer-assisted proof"
Computing machinery and intelligence, written by Alan Turing and published in 1950, is a seminal paper on the topic of artificial intelligence in which the concept of what is now known as the Turing test was introduced. It was also the origin of the thesis that cognition is computation ( computationalism) ...more on Wikipedia about "Computing machinery and intelligence"
Connectionist expert systems are artificial neural network (ANN) based expert systems where the ANN generates inferencing rules e.g., fuzzy-multi layer perceptron where linguistic and natural form of inputs are used. Apart from that, rough set theory may be used for encoding knowledge in the weights better and also genetic algorithms may be used to optimize the search solutions better. ...more on Wikipedia about "Connectionist expert system"
Constraint satisfaction problems or CSPs are mathematical problems where one must find states or objects that satisfy a number of constraints or criteria. CSPs are the subject of intense research in both artificial intelligence and operations research. Many CSPs require a combination of heuristics and combinatorial search methods to be solved in a reasonable time. ...more on Wikipedia about "Constraint satisfaction problem"
The context of an event includes the circumstances and conditions which "surround" it; the context of a word, sentence, or longer utterance or text includes the words that "surround" it. ...more on Wikipedia about "Context"
In genetic algorithms, crossover is a genetic operator used to vary the programming of a chromosome or chromosomes from one generation to the next. It is an analogy to reproduction and biological crossover, upon which genetic algorithms are based. ...more on Wikipedia about "Crossover (genetic algorithm)"
Cyc is an artificial intelligence project that attempts to assemble a comprehensive ontology and database of everyday common-sense knowledge, with the goal of enabling AI applications to perform human-like reasoning. ...more on Wikipedia about "Cyc"
The DARPA Grand Challenge is a United States government-sponsored competition that aims to create the first fully autonomous vehicles capable of competing on an under-300 mile, off-road course in the Mojave Desert in the Southwest United States. This annual challenge took place for the first time on March 13, 2004 and was sponsored by the Defense Advanced Research Projects Agency (DARPA) of the U.S. Department of Defense. ...more on Wikipedia about "DARPA Grand Challenge"
The Dartmouth Conference was the name of a conference organised by John McCarthy, in which he gathered together everyone who was interested in finding out about " artificial intelligence" (as it was given its name at that time). The conference lasted a month, and it was essentially an extended brainstorming session. This is what catalysed the revolution that we now know as Artificial Intelligence. ...more on Wikipedia about "Dartmouth Conference"
Default logic is a non-monotonic logic proposed by Ray Reiter to formalize reasoning with default assumptions. ...more on Wikipedia about "Default logic" You are visiting http://www.shortopedia.com Artificial_intelligence
This article is licensed under the GNU Free Documentation License.
It uses material from the Wikipedia . Direct links to the original articles are in the text.
If you use exact copy or modified of this article you should preserve above paragraph and put also : It uses material from
the Shortopedia article about "Artificial intelligence".
| MAIN PAGE | MAIN INDEX | CONTACT US |