presentaciãƒâ¯ã‚â¿ã‚â½n...

DefinicionDiscusionHistoriaPresente y Futuro

Inteligencia Artificial

Introduccion

Introduccion

INTELIGENCIA ARTIFICAL



Definicion

Definicion1956 “La ciencia e ingenierıa dedicadas a la creacion de

maquinas inteligentes”“Estudio y diseno de agentes inteligentes”2000-

Introduccion



Consideraciones preliminares

En 1931, Godel demuestra su teorema de incertidumbre

En 1936, Turing resolvique es indecidible

o el problema de parada, demostrando

Sin embargo ...

Alan Turing sostuvo que la inteligencia artificial es posible creandomaquinas inteligentes que emularan la organizacion del neocortex

Aunque ...

Esto solo parece plausible si se conviene que existe una teorıa delpensamiento que explica la inteligencia de un modo sistematico

Introduccion



Discusion

IA operativa

La inteligencia llegamucho mas alla delcerebro. Se refiere alcuerpo y la relacion conotras inteligencias

Que una regla seamecanizable, ¡no significaque sea mecanica!(aviones vs. pajaros)

De modo que, ¿comopodemos decidir si unamaquina piensa?

IA fuerteLas celulas de W. Pitts yW. McCulloch (1940)parecen idoneas parareplicar la estructuraneuronal

Sin embargo, ahorasabemos que sonisomorfas a un programade Turing

De modo que solosabemos seguir unconjunto de reglas

Introduccion



¿Son las maquinas inteligentes?

El test de Turing establece que si una maquina demuestrahabilidades intelectuales indistinguibles de las nuestras,entonces lo es —definicion comportamental, circa 1920

La objecion de Lady Lovelace cuestiona si, aun ası, soncapaces de aprender independientemente, mostrando ası quesu inteligencia es original

La paradoja de la caja china de Searle sugiere que, entonces,serıa posible la inteligencia sin comprension

¿Y que hay de su relacion con el medio? transmision digital vsanalogica

¿Y como se mide la inteligencia colectiva? (el “lenguaje deDios” es silencio)

Introduccion



Investigacion

Normalmente somos mas eficientes que las maquinas en laresolucion de problemas NP-duros

(Hector Geffner, 2007)

“Si un problema en Inteligencia Artificial tiene solucion, ¡es quehabıamos escogido mal el problema!”

Pero hemos conseguido un progreso notable, . . .

Introduccion



Historia de la Inteligencia Artificial

Feigenbaum, et al. s’DENDRAL

HierarchicalPlanners(SIPE, OPLAN)Newell,Shaw, &

Simon’s GPS

Turing’s paperon machineintelligence

NASA’sRemoteAgent(RAX)

Neural NetBackpropAlgorithm

1997 19991950 1956 ‘60s 1968 1980’s 198590Pearl’s58 74 SRI’s Shakey,

STRIPS, A* Belief NetsHeuristic

IBM’sDeep Blue

Brooks’sLenat’sCYC

Programmngat MIT BehaviorBased

RobotsDartmouth Conf.& McCarthy’sAdvice Taker

Courtesy: Nils Nilsson, AAAI2000

Introduccion






Simon’s GPSAlan Turing

1936: The Turing machine,computability, universal machine1950: The Turing Test formachine intelligence




Claude Shannon1997 19991950 1956 ‘60s 1968 1980’s 198590

Pearl’s 1950: Claude Shannon publisheddetailed analysis of chess playingas search

58 74 SRI’s Shakey,STRIPS, A* Belief Nets

HeuristicIBM’sDeep Blue





Introduccion





Darmouth ConferenceHierarchicalPlanners(SIPE, OPLAN)

1956: John McCarthy coined theterm Artificial Intelligence as thetopic of the DartmouthConference, the first conferencedevoted to the subject

Newell,Shaw, &Simon’s GPS




Arthur Samuel (IBM)

1952–1962: wrote the firstgame-playing program, for checkers(draughts), to achieve sufficient skillto challenge a world champion. Hisfirstcheckers-playing program waswritten in 1952, and in 1955 hecreated a version that learned toplay (Samuel 1959)

1997 19991950 1956 ‘60s 1968 1980’s74 SRI’s Shakey,

STRIPS, A*

198590Pearl’s58Belief Nets






Introduccion






Simon’s GPSGeneral Problem Solver

1957: GPS was a computerprogram created by Herbert Simonand Allen Newell to provetheorems and solve geometic, wordand chess problems1959: Newell, A.; Shaw, J.C.;Simon, H.A. Report on a generalproblem-solving program.Proceedings of the InternationalConference on InformationProcessing. pp. 256–264.






IBM’sDeep Blue





Introduccion






Simon’s GPS

Heuristic ProgrammingTuring’s paperon machineintelligence


1958: Teddington Conference onthe Mechanization of ThoughtProcesses was held in the UK andamong the papers presented wereJohn McCarthy’s ”Programs withCommon Sense ”Oliver Selfridge’s”Pandemonium.and MarvinMinsky’s ”Some Methods ofHeuristic Programming andArtificial Intelligence ”




IBM’sDeep Blue





Introduccion






Simon’s GPS


DENDRALNASA’sRemoteAgent(RAX)

Neural NetBackpropAlgorithm 1967: Dendral program (Edward

Feigenbaum et al. at StanfordUniversity) demonstrated tointerpret mass spectra on organicchemical compounds. Firstsuccessful knowledge-basedprogram for scientific reasoning



IBM’sDeep Blue





Introduccion






Simon’s GPS Stanford Research Institute (SRI)

1969: Shakey the Robot,demonstrated combining animallocomotion, perception andproblem solving






IBM’sDeep Blue





Introduccion






Simon’s GPS A∗

1968: P. E. Hart, N. J.Nilsson,B. Raphael. A formal basis for theheuristic determination of minimumcost paths. IEEE Trans. Syst. Sci.Cybernet., volume 4, number 2, pp100–107.1972: P. E. Hart, N. J.Nilsson,B. Raphael. Correction to aformed basis for the heuristicdetermination of minimum costpaths. SIGART Newsletter,volume 37, number 28, p. 9.




1997 19991950 1956 ‘60s 1968 1980’s74 SRI’s Shakey,

STRIPS, A*







Introduccion






Simon’s GPS

STRIPSTuring’s paperon machineintelligence


1971: STRIPS (STanfordResearch Institute Problem Solver) isan automated planner invented byRichard Fikes and Nils Nilsson1974: Earl Sacerdoti developedone of the first planning programs,ABSTRIPS, and developedtechniques of hierarchicalplanning.




IBM’sDeep Blue





Introduccion






Simon’s GPS




Hierarchical Planning

1983: O-PLAN has been used fora range of practical and researchtasks. It was developed in 1983 andstill runs as a planning service overthe web (www.aiai.ed.ac.-uk/project/oplan/)



IBM’sDeep Blue





Introduccion





CycorpHierarchicalPlanners(SIPE, OPLAN)Newell,Shaw, &

Simon’s GPS



1984: Cycorp, Inc., based inAustin, Texas was founded bycomputer science professor atStanford Douglas Lenat(www.cyc.com)“Once you have a truly massiveamount of information integrated asknowledge, then thehuman-software system will besuperhuman, in the same sense thatmankind with writing issuperhuman compared to mankindbefore writing.”Doug Lenat, June 21, 2001




IBM’sDeep Blue





Introduccion






Simon’s GPS Neural Networks

1969: Marvin Minsky andSeymour Papert publish Perceptrons,demonstrating previouslyunrecognized limits of a simple formof neural netsMid 80’s: Neural Networks becomewidely used with theBackpropagation algorithm —firstdescribed by Paul Werbos in 1974.1989: Dean Pomerleau at CMUcreates ALVINN: an AutonomousLand Vehicle in a Neural Network.




1997 19991950 1956 ‘60s 1968 1980’s74 SRI’s Shakey,

STRIPS, A*







Introduccion






Simon’s GPS




Robotics

1987: Rodney Brooks introducedthe subsumption architecture andbehavior-based robotics as a moreminimalist modular model ofnatural intelligence.1997 19991950 1956 ‘60s 1968 1980’s 198590

Pearl’s58 74 SRI’s Shakey,STRIPS, A* Belief Nets






Introduccion






Simon’s GPS

Belief NetworksTuring’s paperon machineintelligence



1988: Judea Pearl introducedbelief networks, which are causalnetworks whose links are labeledwith probabilities. The word beliefis an important qualifier because allthe representations used in AIrepresent somebody’s best guessor belief about causal influencesrather than the ultimate facts ofcausation

1997 19991950 1956 ‘60s 1968 1980’s74 SRI’s Shakey,

STRIPS, A*







Introduccion






Simon’s GPS Deep Blue (IBM)

1997: The Deep Blue chessprogram (IBM) beats the worldchess champion, Garry Kasparov,in a widely followed match.






IBM’sDeep Blue





Introduccion






Simon’s GPS

RAXTuring’s paperon machineintelligence



1999: Kanna Rajan was one of theprincipals of the Remote AgentExperiment (RAX) whichdesigned, built, tested and flewthe first AI based closed-loopcontrol system on a spacecraft.The RAX was the co-winner ofNASA’s 1999 Software of theYear, the agency’s highesttechnical award.

1997 19991950 1956 ‘60s 1968 1980’s74 SRI’s Shakey,

STRIPS, A*







Introduccion






Simon’s GPS

ChinookTuring’s paperon machineintelligence



2007: Computer CheckersProgram Is Invincible. “Chinook[...] reduces checkers to the levelof tic-tac-toe [...] it is the mostcomplex game that has beensolved to date” (Science - July,19, 2007)1997 19991950 1956 ‘60s 1968 1980’s 198590

Pearl’s58 74 SRI’s Shakey,STRIPS, A* Belief Nets






Introduccion



Aplicaciones

Campos de aplicacion

Vida artificial

Razonamiento automaticoAnti-spam de correo

Robotica

Sistemas hıbridos

Agentes inteligentes

Control inteligente

Minería de datos

Computacion biologica

Representacion delconocimiento

Web semantica

Introduccion



Problemas

Problemas de aplicacion

Reconocimiento de patrones

Creatividad artificial

Juegos inteligentes y bots

Procesamiento del lenguaje

Planificacion y scheduling

Control no lineal

Aprendizaje

Vision artificial

Diagnosis automatica

Teorıa de juegos

Resolucion automatica de problemas

En definitiva, la IA trata de la resolucion automatica de problemas

Introduccion

presentaciãƒâ¯ã‚â¿ã‚â½n...

Documents