artificial intelligence - International Journal of Computing and ...

International Manuscript ID : ISSN2249054X-V2I4M4-072012VOLUME 2 ISSUE 4 July 2012In 1941 an invention revolutionized every aspect of the storage and processing of information.That invention was the electronic computer. The first computers required large, separate airconditionedrooms, and were a programmer’s nightmare, involving the separate configuration ofthousands of wires to even get a program running. The 1949 innovation, the stored programcomputer, made the job of entering a program easier, and advancements in computer theorylead to computer science, and eventually Artificial intelligence. With the invention of anelectronic means of processing data, came a medium that made AI possible.3.2 THE BEGINNINGS OF AIAlthough the computer provided the technology necessary for AI, it was not until the early1950's that the link between human intelligence and machines was really observed. The firstobservations were made on the principle of feedback theory. The most familiar example offeedback theory is the thermostat. It controls the temperature of an environment by gatheringthe actual temperature of the house, comparing it to the desired temperature, and respondingby turning the heat up or down. What was so important about this research into feedback loopswas that it theorized that all intelligent behavior was the result of feedback mechanisms. Thisdiscovery influenced much of the early development of AI.In late 1955 The Logic Theorist, was developed considered by many to be the first AI program.The program, representing each problem as a tree model, would attempt to solve it by selectingthe branch that would most likely result in the correct conclusion. The impact that it made onboth the public and the field of AI has made it a crucial stepping stone in developing the AI field.In 1956 John McCarthy regarded as the father of AI, organized a conference to draw the talentand expertise of others interested in machine intelligence for a month of brainstorming. Heinvited them to Vermont for "The Dartmouth summer research project on artificial intelligence."From that point on, because of McCarthy, the field would be known as Artificial intelligence.Although not a huge success, the Dartmouth conference did bring together the founders in AI,and served to lay the groundwork for the future of AI research.4. PROBLEMS RELATED TO ARTIFICIAL INTELLIGENCE

International Manuscript ID : ISSN2249054X-V2I4M4-072012VOLUME 2 ISSUE 4 July 2012"Can a machine act intelligently?" is still an open problem. Taking "A machine can actintelligently" as a working hypothesis, many researchers have attempted to build such amachine.The general problem of simulating (or creating) intelligence has been broken down into anumber of specific sub-problems. These consist of particular traits or capabilities thatresearchers would like an intelligent system to display. Some of the most important traits aredescribed below:4.1 DEDUCTION, REASONING AND PROBLEM SOLVINGEarly AI researchers developed algorithms that imitated the step-by-step reasoning that humansuse when they solve puzzles or make logical deductions. By the late 1980s and '90s, AIresearch had also developed highly successful methods for dealing with uncertain or incompleteinformation, employing concepts from probability and economics.For difficult problems, most of these algorithms can require enormous computational resources— most experience a "combinatorial explosion": the amount of memory or computer timerequired becomes astronomical when the problem goes beyond a certain size. The search formore efficient problem-solving algorithms is a high priority for AI research.Human beings solve most of their problems using fast, intuitive judgments rather than theconscious, step-by-step deduction that early AI research was able to model. AI has made someprogress at imitating this kind of "sub-symbolic" problem solving: embodied agent approachesemphasize the importance of sensorimotor skills to higher reasoning; neural net researchattempts to simulate the structures inside human and animal brains that give rise to this skill.4.2 KNOWLEDGE REPRESENTATIONKnowledge representation and knowledge engineering are central to AI research. Many of theproblems machines are expected to solve will require extensive knowledge about the world.Among the things that AI needs to represent are: objects, properties, categories and relations

International Manuscript ID : ISSN2249054X-V2I4M4-072012VOLUME 2 ISSUE 4 July 2012between objects, situations, events, states and time; causes and effects; knowledge aboutknowledge (what we know about what other people know); and many other, less wellresearched domains.Among the most difficult problems in knowledge representations are:• Default reasoning and the qualification problem-Many of the things people know take the form of "working assumptions." For example, ifa bird comes up in conversation, people typically picture an animal that is fist sized,sings, and flies. None of these things are true about all birds. John McCarthy identifiedthis problem in 1969 as the qualification problem: for any commonsense rule that AIresearchers care to represent, there tend to be a huge number of exceptions. Almostnothing is simply true or false in the way that abstract logic requires.• The sub-symbolic form of some commonsense knowledge-Much of what people know is not represented as "facts" or "statements" that they couldexpress verbally. For example, a chess master will avoid a particular chess positionbecause it "feels too exposed" or an art critic can take one look at a statue and instantlyrealize that it is a fake. These are intuitions or tendencies that are represented in thebrain non-consciously and sub-symbolically. Knowledge like this supports and providesa context for symbolic, conscious knowledge. As with the related problem of subsymbolicreasoning, it is hoped that situated AI or computational intelligence will provideways to represent this kind of knowledge.4.3 PLANNINGIntelligent agents must be able to set goals and achieve them. They need a way to visualize thefuture (they must have a representation of the state of the world and be able to makepredictions about how their actions will change it) and be able to make choices that maximizethe utility of the available choices.4.4 LEARNING

International Manuscript ID : ISSN2249054X-V2I4M4-072012VOLUME 2 ISSUE 4 July 2012Machine learning has been central to AI research from the beginning. In 1956, at the originalDartmouth AI summer conference, a report was written on unsupervised probabilistic machinelearning: "An Inductive Inference Machine". Unsupervised learning is the ability to find patternsin a stream of input. Supervised learning includes both classification and numerical regression.Classification is used to determine what category something belongs in, after seeing a numberof examples of things from several categories. Regression is the attempt to produce a functionthat describes the relationship between inputs and outputs and predicts how the outputs shouldchange as the inputs change.4.5 NATURAL LANGUAGE PROCESSINGNatural language processing gives machines the ability to read and understand the languagesthat humans speak. A sufficiently powerful natural language processing system would enablethe acquisition of knowledge directly from human-written sources, such as Internet texts. Somestraightforward applications of natural language processing include information retrievaland machine translation.5. APPROACHES TOWARDS ARTIFICIAL INTELLIGENCEThere is no established unifying theory or paradigm that guides AI research. Researchersdisagree about many issues. A few of the longest standing questions that have remainedunanswered are these: Should artificial intelligence simulate natural intelligence bystudying psychology or neurology? Or is human biology as irrelevant to AI research as birdbiology is to aeronautical engineering? Can intelligent behavior be described using simple,elegant principles such as logic or optimization? Or does it necessarily require solving a largenumber of completely unrelated problems? Can intelligence be reproduced using high-levelsymbols, similar to words and ideas? Or does it require "sub-symbolic" processing? No singlealgorithm can answer all these questions .However there are some widely accepted approacheswhich are listed below:5.1 CYBERNETICS AND BRAIN SIMULATION

International Manuscript ID : ISSN2249054X-V2I4M4-072012VOLUME 2 ISSUE 4 July 2012There is currently no consensus on how closely the brain should be simulated.In the 1940s and 1950s, a number of researchers explored the connectionbetween neurology, information theory, and cybernetics. Some of them built machines that usedelectronic networks to exhibit rudimentary intelligence, such as W. Grey Walter's turtles andthe Johns Hopkins Beast. Many of these researchers gathered for meetings of the TeleologicalSociety at Princeton University and the Ratio Club in England. By 1960, this approach waslargely abandoned, although elements of it were revived in the 1980s.5.2 SYMBOLICWhen access to digital computers became possible in the middle 1950s, AI research began toexplore the possibility that human intelligence could be reduced to symbol manipulation. Theresearch was centered in three institutions: CMU, Stanford and MIT, and each one developedits own style of research. John Haugeland named these approaches to AI "good old fashionedAI" or "GOFAI".5.3 COGNITIVE SIMULATIONResearchers and economists studied human problem-solving skills and attempted to formalizethem, and their work laid the foundations of the field of artificial intelligence, as well as cognitivescience. The results of psychological experiments were used to develop programs thatsimulated the techniques that people use to solve problems.5.4 LOGIC-BASEDUnlike other researchers, John McCarthy felt that machines did not need to simulate humanthought, but should instead try to find the essence of abstract reasoning and problem solving,regardless of whether people used the same algorithms. His laboratory at Stanford focused onusing formal logic to solve a wide variety of problems, including knowledgerepresentation, planning and learning. Logic was also focus of the work at the University of

International Manuscript ID : ISSN2249054X-V2I4M4-072012VOLUME 2 ISSUE 4 July 2012Edinburgh and elsewhere in Europe which led to the development of the programminglanguage Prolog and the science of logic programming.5.5 "ANTI-LOGIC" OR "SCRUFFY"Researchers at MIT found that solving difficult problems in vision and natural languageprocessing required ad-hoc solutions – they argued that there was no simple and generalprinciple that would capture all the aspects of intelligent behavior. This logic was described as"anti-logic" or "scruffy" (as opposed to the "neat" paradigms at CMU andStanford). Commonsense knowledge bases are an example of "scruffy" AI, since they must bebuilt by hand, one complicated concept at a time.5.6 KNOWLEDGE-BASEDWhen computers with large memories became available around 1970, researchers from allthree traditions began to build knowledge into AI applications. This "knowledge revolution" led tothe development and deployment of expert systems, the first truly successful form of AIsoftware. The knowledge revolution was also driven by the realization that enormous amountsof knowledge would be required by many simple AI applications.5.7 SUB-SYMBOLICDuring the 1960s, symbolic approaches had achieved great success at simulating high-levelthinking in small demonstration programs. By the 1980s, however, progress in symbolic AIseemed to stall and many believed that symbolic systems would never be able to imitate all theprocesses of human cognition, especially perception, robotics, learning and pattern recognition.A number of researchers began to look into "sub-symbolic" approaches to specific AI problems.Researchers from the related field of robotics rejected symbolic AI and focused on the basicengineering problems that would allow robots to move and survive. Their work revived the nonsymbolicviewpoint of the early researchers of the 50s and reintroduced the use of controltheory in AI.

International Manuscript ID : ISSN2249054X-V2I4M4-072012VOLUME 2 ISSUE 4 July 20125.8 STATISTICALIn the 1990s, AI researchers developed sophisticated mathematical tools to solve specificproblems. These tools were truly scientific, in the sense that their results were both measurableand verifiable. Also they have been responsible for many of AI's recent successes. The sharedmathematical language has also permitted a high level of collaboration with more establishedfields (like mathematics, economics or operations research). This movement is described asnothing less than a "revolution" and "the victory of the neats." Critics argue that thesetechniques are too focused on particular problems and have failed to address the long term goalof general intelligence.6. INTEGRATING THE APPROACHESAn intelligent agent is a system that perceives its environment and takes actions whichmaximize its chances of success. The simplest intelligent agents are programs that solvespecific problems. More complicated agents include human beings and organizations of humanbeings (such as firms). The paradigm gives researchers license to study isolated problems andfind solutions that are both verifiable and useful, without agreeing on one single approach. Anagent that solves a specific problem can use any approach that works — some agents aresymbolic and logical, some are sub-symbolic neural networks and others may use newapproaches. The paradigm also gives researchers a common language to communicate withother fields—such as decision theory and economics—that also use concepts of abstractagents.7. TOOLS USED IN ARTIFICIAL INTELLIGENCEIn the course of 50 years of research, AI has developed a large number of tools to solve themost difficult problems in computer science. A few of the most general of these methods arediscussed below.7.1 SEARCH AND OPTIMIZATION

International Manuscript ID : ISSN2249054X-V2I4M4-072012VOLUME 2 ISSUE 4 July 2012Many problems in AI can be solved in theory by intelligently searching through many possiblesolutions that is reasoning can be reduced to performing a search. For example, logical proofcan be viewed as searching for a path that leads from premises to conclusions, where eachstep is the application of an inference rule. Planning algorithms search through trees of goalsand sub goals, attempting to find a path to a target goal, a process called means-endsanalysis. Robotics algorithms for moving limbs and grasping objects use localsearches in configuration space. Many learning algorithms use search algorithms basedon optimization.Simple exhaustive searches are rarely sufficient for most real world problems: the searchspace (the number of places to search) quickly grows to astronomical numbers. The result is asearch that is too slow or never completes. The solution, for many problems, is to use"heuristics" or "rules of thumb" that eliminate choices that are unlikely to lead to the goal (called"pruning the search tree"). Heuristics supply the program with a "best guess" for the path onwhich the solution lies.A very different kind of search came to prominence in the 1990s, based on the mathematicaltheory of optimization. For many problems, it is possible to begin the search with some form of aguess and then refine the guess incrementally until no more refinements can be made. Thesealgorithms can be visualized as blind hill climbing: we begin the search at a random point on thelandscape, and then, by jumps or steps, we keep moving our guess uphill, until we reach thetop.Evolutionary computation uses a form of optimization search. For example, they may begin witha population of organisms (the guesses) and then allow them to mutate andrecombine, selecting only the fittest to survive each generation (refining the guesses). Formsof evolutionary computation include swarm intelligence algorithms (such as antcolony or particle swarm optimization) and evolutionary algorithms (such as geneticalgorithms and genetic programming).7.2 LOGIC

International Manuscript ID : ISSN2249054X-V2I4M4-072012VOLUME 2 ISSUE 4 July 2012Logic is used for knowledge representation and problem solving, but it can be applied to otherproblems as well. Several different forms of logic are used in AIresearch. Propositional or sentential logic is the logic of statements which can be true orfalse. First-order logic also allows the use of quantifiers and predicates, and can express factsabout objects, their properties, and their relations with each other. Fuzzy logic is a version offirst-order logic which allows the truth of a statement to be represented as a value between 0and 1, rather than simply true (1) or false (0). Fuzzy systems can be used for uncertainreasoning and have been widely used in modern industrial and consumer product controlsystems. Subjective logic models uncertainty in a different and more explicit manner than fuzzylogic:a given binomial opinion satisfies belief + disbelief + uncertainty = 1 within a Betadistribution. By this method, ignorance can be distinguished from probabilistic statements thatan agent makes with high confidence.Default logics, non-monotonic logics and circumscription are forms of logic designed to help withdefault reasoning and the qualification problem. Several extensions of logic have been designedto handle specific domains of knowledge, such as description logics, situation calculus, eventcalculus and fluent calculus (for representing events and time), causal calculus; belief calculus,and modal logics.7.3 PROBABILISTIC METHODS FOR UNCERTAIN REASONINGMany problems in AI (in reasoning, planning, learning, perception and robotics) require theagent to operate with incomplete or uncertain information. AI researchers have devised anumber of powerful tools to solve these problems using methods from probability theoryand economics.Bayesian networks are a very general tool that can be used for a large number of problems:reasoning (using the Bayesian inference algorithm), learning (using the expectationmaximizationalgorithm), planning (using decision networks) and perception (using dynamicBayesian networks). Probabilistic algorithms can also be used for filtering, prediction, smoothingand finding explanations for streams of data, helping perception systems to analyze processesthat occur over time.

International Manuscript ID : ISSN2249054X-V2I4M4-072012VOLUME 2 ISSUE 4 July 2012A key concept from the science of economics is "utility": a measure of how valuable somethingis to an intelligent agent. Precise mathematical tools have been developed that analyze how anagent can make choices and plan, using decision theory, decision analysis, information valuetheory. These tools include models such as dynamic decision networks, gametheory and mechanism design.7.4 CLASSIFIERS AND STATISTICAL LEARNING METHODSThe simplest AI applications can be divided into two types: classifiers ("if shiny then diamond")and controllers ("if shiny then pick up"). Controllers do however also classify conditions beforeinferring actions, and therefore classification forms a central part of many AIsystems. Classifiers are functions that use pattern matching to determine a closest match. Theycan be tuned according to examples, making them very attractive for use in AI. These examplesare known as observations or patterns. In supervised learning, each pattern belongs to a certainpredefined class. A class can be seen as a decision that has to be made. All the observationscombined with their class labels are known as a data set. When a new observation is received,that observation is classified based on previous experience.A classifier can be trained in various ways; there are many statistical and machinelearning approaches. The most widely used classifiers are the neural network, kernelmethods such as the support vector machine ,k-nearest neighbor algorithm, Gaussian mixturemodel, naive Bayes classifier, and decision tree. The performance of these classifiers havebeen compared over a wide range of tasks. Classifier performance depends greatly on thecharacteristics of the data to be classified. There is no single classifier that works best on allgiven problems. This is also referred to as the "no free lunch" theorem. Determining a suitableclassifier for a given problem is still more an art than science.7.5 NEURAL NETWORKSA neural network is an interconnected group of nodes, akin to the vast network of neurons in thehuman brain. The study of artificial neural networks began in the decade before the field AIresearch was founded, in the work of Walter Pitts and Warren McCullough. Other important

International Manuscript ID : ISSN2249054X-V2I4M4-072012VOLUME 2 ISSUE 4 July 2012early researchers were Frank Rosenblatt, who invented the perceptron and Paul Werbos whodeveloped the backpropagation algorithm.The main categories of neural networks are acyclic or feedforward neural networks (where thesignal passes in only one direction) and recurrent neural networks (which allow feedback).Among the most popular feedforward networks are perceptrons, multi-layerperceptrons and radial basis networks. Among recurrent networks, the most famous isthe Hopfield net, a form of attractor network, which was first described by John Hopfield in1982. Neural networks can be applied to the problem of intelligent control (for robotics)or learning, using such techniques as competitive learning.8. BRANCHES OF ARTIFICIAL INTELLIGENCESome of the branches of artificial intelligence are briefly described below. These are not thecomplete number of branches because some of the branches have not been studied yet. Alsosome of these may be regarded as concepts rather than full branches.8.1 LOGICAL AIWhat a program knows about the world in general the facts of the specific situation in which itmust act, and its goals are all represented by sentences of some mathematical logicallanguage. The program decides what to do by inferring that certain actions are appropriate forachieving its goals. The first article proposing this was [McC59]. [McC89], [McC96b], [Sha97]are more recent texts which list some of the concepts involved in logical AI.8.2 SEARCHAI programs often examine large numbers of possibilities, e.g. moves in a chess game orinferences by a theorem proving program. Discoveries are continually made about how to dothis more efficiently in various domains.8.3 PATTERN RECOGNITION

International Manuscript ID : ISSN2249054X-V2I4M4-072012VOLUME 2 ISSUE 4 July 2012When a program makes observations of some kind, it is often programmed to compare what itsees with a pattern. For example, a vision program may try to match a pattern of eyes and anose in a scene in order to find a face. More complex patterns, e.g. in a natural language text, ina chess position, or in the history of some event are also studied. These more complex patternsrequire quite different methods than do the simple patterns that have been studied the most.8.4 REPRESENTATIONFacts about the world have to be represented in some way. Usually languages of somemathematical logic are used for this kind of representation.8.5 INFERENCEFrom some facts, others can be inferred. Mathematical logical deduction is adequate for somepurposes, but new methods of non-monotonic inference have been added to logic since the1970s. The simplest kind of non-monotonic reasoning is default reasoning in which a conclusionis to be inferred by default, but the conclusion can be withdrawn if there is evidence to thecontrary. For example, when we hear of a bird, we can infer that it can fly, but this conclusioncan be reversed when we hear that it is a penguin. It is the possibility that a conclusion mayhave to be withdrawn that constitutes the non-monotonic character of the reasoning. Ordinarylogical reasoning is monotonic in that the set of conclusions that can be drawn from a set ofpremises is a monotonic increasing function of the premises. Circumscription is another form ofnon-monotonic reasoning.8.6 COMMON SENSE KNOWLEDGE AND REASONINGThis is the area in which AI is farthest from human-level, in spite of the fact that it has been anactive research area since the 1950s. While there has been considerable progress, e.g. indeveloping systems of non-monotonic reasoning and theories of action, yet more new ideas areneeded. For example the Cyc system contains a large but spotty collection of common sensefacts.

International Manuscript ID : ISSN2249054X-V2I4M4-072012VOLUME 2 ISSUE 4 July 20128.7 LEARNING FROM EXPERIENCEComputer programs can learn from experience and practice. The approaches to AI basedon connectionism and neural nets specialize in this. There is also learning of laws expressed inlogic. [Mit97] is a comprehensive undergraduate text on machine learning. Programs can onlylearn what facts or behaviors their formalisms can represent, and unfortunately learningsystems are almost all based on very limited abilities to represent information.8.8 PLANNINGPlanning programs start with general facts about the world (especially facts about the effects ofactions), facts about the particular situation and a statement of a goal. From these, theygenerate a strategy for achieving the goal. In the most common cases, the strategy is just asequence of actions.8.9 HEURISTICSA heuristic is a way of trying to discover something or an idea imbedded in a program. The termis used variously in AI. Heuristic functions are used in some approaches to search to measurehow far a node in a search tree seems to be from a goal. Heuristic predicates compares twonodes in a search tree to see if one is better than the other, i.e. constitutes an advance towardthe goal.REFERENCES• http://www-formal.stanford.edu/jmc/whatisai/node1.html• http://www-formal.stanford.edu/jmc/whatisai/node2.html

International Manuscript ID : ISSN2249054X-V2I4M4-072012VOLUME 2 ISSUE 4 July 2012• http://www-formal.stanford.edu/jmc/whatisai/• http://www-formal.stanford.edu/jmc/whatisai/node3.html• http://www-formal.stanford.edu/jmc/whatisai/node4.html• http://en.wikipedia.org/wiki/Artificial_intelligence• http://future.wikia.com/wiki/Artificial_Intelligence