Introducci on - UC3Mocw.uc3m.es/cursos-archivados/inteligencia...Presente y Futuro Historia de la Inteligencia Arti cial 1950 Turing's paper on machine intelligence 1 956-58 Dartmouth

Inteligencia Artificial

DefinicionDiscusionHistoriaPresente y Futuro

Introduccion

Grupo de Planificacion y Aprendizaje (PLG)Departamento de InformaticaEscuela Politecnica Superior

Universidad Carlos III de Madrid

22 de diciembre de 2008

Introduccion



Definicion

Definicion

1956 “La ciencia e ingenierıa dedicadas a la creacion demaquinas inteligentes”

2000- “Estudio y diseno de agentes inteligentes”

Introduccion



Consideraciones preliminares

En 1931, Godel demuestra su teorema de incertidumbre

En 1936, Turing resolvio el problema de parada, demostrandoque es indecidible

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






Sin embargo ...


Aunque ...


Introduccion






Sin embargo ...


Aunque ...


Introduccion






Sin embargo ...


Aunque ...


Introduccion



Discusion

IA fuerte

Las 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

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?

Introduccion



Discusion

IA fuerte




IA operativa




Introduccion



Discusion

IA fuerte




IA operativa




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









Introduccion









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

1950

Turing’s paper on machine intelligence

195658

Dartmouth Conf.& McCarthy’s Advice Taker

Newell,Shaw, & Simon’s GPS

Heuristic Programmngat MIT

‘60s 196874

Feigenbaum, et al. s’ DENDRAL

SRI’s Shakey, STRIPS, A*

HierarchicalPlanners(SIPE, OPLAN)

1980’s

Lenat’sCYC

Brooks’sBehaviorBasedRobots

198590Pearl’sBelief Nets

Neural Net BackpropAlgorithm

1997

IBM’s Deep Blue

1999

NASA’sRemoteAgent (RAX)

Courtesy: Nils Nilsson, AAAI 2000

Introduccion




1950


195658




‘60s 196874




1980’s

Lenat’sCYC




1997

IBM’s Deep Blue

1999



Alan Turing

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

Claude Shannon

1950: Claude Shannon publisheddetailed analysis of chess playingas search

Introduccion




1950


195658




‘60s 196874




1980’s

Lenat’sCYC




1997

IBM’s Deep Blue

1999



Darmouth Conference

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

Arthur Samuel (IBM)

1952–1962: wrote the firstgame-playing program, forcheckers (draughts), to achievesufficient skill to challenge a worldchampion. His firstcheckers-playing program waswritten in 1952, and in 1955 hecreated a version that learned toplay (Samuel 1959)

Introduccion




1950


195658




‘60s 196874




1980’s

Lenat’sCYC




1997

IBM’s Deep Blue

1999



General Problem Solver

1957: GPS was a computerprogram created by HerbertSimon and Allen Newell to provetheorems and solve geometic,word and 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.

Introduccion




1950


195658




‘60s 196874




1980’s

Lenat’sCYC




1997

IBM’s Deep Blue

1999



Heuristic Programming

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”

Introduccion




1950


195658




‘60s 196874




1980’s

Lenat’sCYC




1997

IBM’s Deep Blue

1999



DENDRAL

1967: Dendral program (EdwardFeigenbaum et al. at StanfordUniversity) demonstrated tointerpret mass spectra on organicchemical compounds. Firstsuccessful knowledge-basedprogram for scientific reasoning

Introduccion




1950


195658




‘60s 196874




1980’s

Lenat’sCYC




1997

IBM’s Deep Blue

1999



Stanford Research Institute (SRI)

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

Introduccion




1950


195658




‘60s 196874




1980’s

Lenat’sCYC




1997

IBM’s Deep Blue

1999



A∗

1968: P. E. Hart, N. J.Nilsson,B. Raphael. A formal basis for theheuristic determination ofminimum cost paths. IEEE Trans.Syst. Sci. Cybernet., volume 4,number 2, pp 100–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.

Introduccion




1950


195658




‘60s 196874




1980’s

Lenat’sCYC




1997

IBM’s Deep Blue

1999



STRIPS

1971: STRIPS (STanfordResearch Institute ProblemSolver) is an automated plannerinvented by Richard Fikes and NilsNilsson1974: Earl Sacerdoti developedone of the first planning programs,ABSTRIPS, and developedtechniques of hierarchicalplanning.

Introduccion




1950


195658




‘60s 196874




1980’s

Lenat’sCYC




1997

IBM’s Deep Blue

1999



Hierarchical Planning

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

Introduccion




1950


195658




‘60s 196874




1980’s

Lenat’sCYC




1997

IBM’s Deep Blue

1999



Cycorp

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 integratedas knowledge, then thehuman-software system will besuperhuman, in the same sensethat mankind with writing issuperhuman compared to mankindbefore writing.”Doug Lenat, June 21, 2001

Introduccion




1950


195658




‘60s 196874




1980’s

Lenat’sCYC




1997

IBM’s Deep Blue

1999



Neural Networks

1969: Marvin Minsky andSeymour Papert publishPerceptrons, demonstratingpreviously unrecognized limits of asimple form of neural netsMid 80’s: Neural Networksbecome widely used with theBackpropagation algorithm —firstdescribed by Paul Werbos in 1974.1989: Dean Pomerleau at CMUcreates ALVINN: an AutonomousLand Vehicle in a Neural Network.

Introduccion




1950


195658




‘60s 196874




1980’s

Lenat’sCYC




1997

IBM’s Deep Blue

1999



Robotics

1987: Rodney Brooks introducedthe subsumption architecture andbehavior-based robotics as a moreminimalist modular model ofnatural intelligence.

Introduccion




1950


195658




‘60s 196874




1980’s

Lenat’sCYC




1997

IBM’s Deep Blue

1999



Belief Networks

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

Introduccion




1950


195658




‘60s 196874




1980’s

Lenat’sCYC




1997

IBM’s Deep Blue

1999



Deep Blue (IBM)

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

Introduccion




1950


195658




‘60s 196874




1980’s

Lenat’sCYC




1997

IBM’s Deep Blue

1999



RAX

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.

Introduccion




1950


195658




‘60s 196874




1980’s

Lenat’sCYC




1997

IBM’s Deep Blue

1999



Chinook

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)

Introduccion



Aplicaciones

Campos de aplicacion

Vida artificial

Razonamiento automatico

Computacion biologica

Representacion delconocimiento

Web semantica

Anti-spam de correo

Robotica

Sistemas hıbridos

Agentes inteligentes

Control inteligente

Introduccion



Problemas

Problemas de aplicacion

Reconocimiento de patrones

Creatividad artificial

Vision artificial

Diagnosis automatica

Teorıa de juegos

Juegos inteligentes y bots

Procesamiento del lenguaje

Planificacion y scheduling

Control no lineal

Aprendizaje

Resolucion automatica de problemas

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

Introduccion



Problemas

Problemas de aplicacion

Reconocimiento de patrones

Creatividad artificial

Vision artificial

Diagnosis automatica

Teorıa de juegos

Juegos inteligentes y bots

Procesamiento del lenguaje

Planificacion y scheduling

Control no lineal

Aprendizaje

Resolucion automatica de problemas

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

Introduccion

Documents

Introducci on - UC3Mocw.uc3m.es/cursos-archivados/inteligencia...Presente y Futuro Historia de la Inteligencia Arti cial 1950 Turing's paper on machine intelligence 1 956-58 Dartmouth