@prefix ns0: .
@prefix dbpedia: .
ns0:doctoralStudent dbpedia:Stephen_Cook .
@prefix dbpedia-owl: .
dbpedia-owl:doctoralStudent dbpedia:Stephen_Cook .
@prefix dbpprop: .
dbpprop:doctoralStudents dbpedia:Stephen_Cook .
@prefix rdf: .
@prefix ns5: .
dbpedia:Stephen_Cook rdf:type ns5:Scientist110560637 ,
ns5:FellowsOfTheRoyalSociety ,
ns5:HarvardUniversityAlumni .
@prefix owl: .
dbpedia:Stephen_Cook rdf:type owl:Thing ,
ns5:TuringAwardLaureates ,
dbpedia-owl:Person ,
dbpedia-owl:Scientist ,
ns5:Person100007846 ,
ns5:LivingPeople ,
ns5:FellowsOfTheRoyalSocietyOfCanada .
@prefix foaf: .
dbpedia:Stephen_Cook rdf:type foaf:Person ,
ns5:AmericanComputerScientists ;
dbpprop:name "Stephen Arthur Cook"@en ,
"Cook, Stephen Arthur"@en .
@prefix xsd: .
@prefix ns9: .
dbpedia:Stephen_Cook ns9:birthDate "1939-12-14"^^xsd:date ;
ns9:birthPlace ,
dbpedia:New_York ;
ns9:almaMater dbpedia:Harvard_University ;
ns0:doctoralAdvisor ;
ns0:doctoralStudent dbpedia:Walter_Savitch ;
owl:sameAs .
@prefix ns10: .
dbpedia:Stephen_Cook owl:sameAs ns10:Stephen_Cook ,
;
foaf:name "Stephen Arthur Cook"@de ,
"Stephen Arthur Cook" ;
foaf:surname "Cook"@de .
@prefix ns11: .
dbpedia:Stephen_Cook foaf:page ns11:Stephen_Cook ;
dbpedia-owl:knownFor dbpedia:NP-complete ;
ns9:knownFor dbpedia:NP-complete ;
dbpedia-owl:doctoralAdvisor ;
dbpedia-owl:doctoralStudent dbpedia:Walter_Savitch ;
dbpprop:reference ,
,
.
@prefix rdfs: .
dbpedia:Stephen_Cook rdfs:label "\u53F2\u63D0\u82AC\u00B7\u53E4\u514B"@zh ,
"Stephen Cook"@es ,
"Stephen Cook"@pl ,
"Stephen Cook"@cs ,
"Stephen Cook"@fr ,
"Stephen Cook"@ro ,
"\u30B9\u30C6\u30A3\u30FC\u30D6\u30F3\u30FB\u30AF\u30C3\u30AF"@ja ,
"Stephen Cook"@en ,
"Stephen A. Cook"@de ,
"\u041A\u0443\u043A, \u0421\u0442\u0438\u0432\u0435\u043D \u0410\u0440\u0442\u0443\u0440"@ru ;
dbpedia-owl:thumbnail ;
dbpedia-owl:birthDate "1939-12-14"^^xsd:date ;
dbpedia-owl:birthPlace ,
dbpedia:New_York ;
dbpedia-owl:almaMater dbpedia:Harvard_University ;
dbpprop:abstract "Stephen Arthur Cook es un reconocido cient\u00EDfico de la computaci\u00F3n. Cook formaliz\u00F3 la cosa de NP-completitud en un famoso art\u00EDculo de 1971 titulado \"The Complexity of Theorem Proving Procedures\" (\"La Complejidad de los Procedimientos de Prueba de Teoremas\"), que tambi\u00E9nlas clases de complejidad P y NP. Cook recibi\u00F3 el Premio Turing en 1982 por su descubrimiento: Por su avance en nuestra comprensi\u00F3n de la complejidad computacional de un modo significativo y profundo. Su art\u00EDculo pionero, The Complexity of Theorem Proving Procedures, presentado en el ACM SIGACT Symposium on the Theory of Computing de 1971, sent\u00F3 los cimientos de la teor\u00EDa de NP-completitud. La exploraci\u00F3n de los l\u00EDmites de la clase de complejidad NP-completo ha sido una de las actividades investigadoras m\u00E1s activas e importantes en las ciencias de la computaci\u00F3n durante la \u00FAltima d\u00E9cada. Recibi\u00F3 su licenciatura en 1961 por la Universidad de M\u00EDchigan. En la Universidad de Harvard, recibi\u00F3 su t\u00EDtulo de m\u00E1ster en 1962, y se doctor\u00F3 en 1966. Desde 1966 hasta 1970 fue profesor asistente en la Universidad de California, Berkeley. Se uni\u00F3 al profesorado de la Universidad de Toronto en 1970 como profesor asociado, siendo ascendido a profesor en 1975 y profesor universitario en 1985 en el Departamento de Inform\u00E1tica y en el de Matem\u00E1ticas."@es ,
"\u30B9\u30C6\u30A3\u30FC\u30D6\u30F3\u30FB\u30AF\u30C3\u30AF\uFF08Stephen A. Cook, 1939\u5E74 - \uFF09\u306F\u3001\u7C73\u56FD\u30FB\u30AB\u30CA\u30C0\u306E\u8A08\u7B97\u6A5F\u79D1\u5B66\u8005\u30FB\u6570\u5B66\u8005\u3002\u5C02\u9580\u306F\u8A08\u7B97\u7406\u8AD6\u3001\u7279\u306B\u8A08\u7B97\u8907\u96D1\u6027\u7406\u8AD6\u306E\u8AD6\u7406\u5B66\u7684\u5074\u9762\u306E\u7814\u7A76\u306B\u5F93\u4E8B\u3057\u3066\u3044\u308B\u3002 1971\u5E74\u306E\u8AD6\u6587 \"The Complexity of Theorem Proving Procedures\" \u3067NP\u5B8C\u5168\u306E\u6982\u5FF5\u3092\u5B9A\u5F0F\u5316\u3057\u3001 \u5145\u8DB3\u53EF\u80FD\u6027\u554F\u984C\u304CNP\u5B8C\u5168\u3067\u3042\u308B\u3053\u3068\uFF08\u30AF\u30C3\u30AF\u306E\u5B9A\u7406\uFF09\u3092\u793A\u3057\u305F\u3002 \u305D\u306E\u8A08\u7B97\u8907\u96D1\u6027\u7406\u8AD6\u3078\u306E\u591A\u5927\u306A\u8CA2\u732E\u306B\u3088\u308A\u300182\u5E74\u306E\u30C1\u30E5\u30FC\u30EA\u30F3\u30B0\u8CDE\u3092\u53D7\u8CDE\u3002 \u7C73\u30CB\u30E5\u30FC\u30E8\u30FC\u30AF\u5DDE\u30D0\u30C3\u30D5\u30A1\u30ED\u30FC\u751F\u307E\u308C\u3002 1961\u5E74\u30DF\u30B7\u30AC\u30F3\u5927\u5B66\u5352\u696D\u300266\u5E74\u30CF\u30FC\u30D0\u30FC\u30C9\u5927\u5B66\u3067\u535A\u58EB\u53F7\u53D6\u5F97\u3002\u540C\u5E74\u30AB\u30EA\u30D5\u30A9\u30EB\u30CB\u30A2\u5927\u5B66\u30D0\u30FC\u30AF\u30EC\u30FC\u6821\u52A9\u6559\u6388\u3002 70\u5E74\u52A0\u30C8\u30ED\u30F3\u30C8\u5927\u5B66\u51C6\u6559\u6388\u300175\u5E74\u6559\u6388\uFF08\u73FE\u8077\uFF09\u3002 \u4E3B\u306A\u6559\u3048\u5B50\u3068\u3057\u3066\u30A6\u30A9\u30EB\u30BF\u30FC\u30FB\u30B5\u30F4\u30A3\u30C3\u30C1\u304C\u3044\u308B\u3002"@ja ,
"Stephen Arthur Cook ist Professor der Informatik an der University of Toronto in Kanada. Sein Hauptbet\u00E4tigungsfeld ist die Komplexit\u00E4tstheorie; Cook arbeitet neben seiner Lehrt\u00E4tigkeit aber auch an der Schnittstelle von Logik und Berechenbarkeitstheorie. Cook wurde in der theoretischen Informatik ber\u00FChmt durch den Satz von Cook: \u201ESAT ist NP-vollst\u00E4ndig\u201C. 1982 bekam er f\u00FCr diese Entdeckung den Turing Award."@de ,
"Stephen Arthur Cook este un informatician american, care a formalizat no\u0163iunea de NP-completitudine \u00EEntr-o lucrare scris\u0103 \u00EEn 1971 \u015Fi intitulat\u0103 Complexitatea procedurilor de demonstrare a teoremelor, \u00EEn care a demonstrat c\u0103 problema satisfacerii expresiilor booleene este NP complet\u0103. Pentru aceasta, Cook a primit \u00EEn 1982 Premiul Turing."@ro ,
"\u53F2\u63D0\u82AC\u00B7A\u00B7\u53E4\u514B\uFF08Stephen A. Cook\uFF0C1939\u5E74\uFF0D\uFF09\uFF0C\u8A08\u7B97\u6A5F\u79D1\u5B78\u5BB6\uFF0C\u8A08\u7B97\u8907\u96DC\u6027\u7406\u8AD6\u7684\u91CD\u8981\u7814\u7A76\u8005\u3002 1971\u5E74\uFF0C\u5728\u4ED6\u7684\u8AD6\u6587\u300AThe Complexity of Theorem Proving Procedures\u300B\uFF0C\u4ED6\u6574\u7406\u4E86NP\u5B8C\u5099\u6027\u7684\u76EE\u6A19\uFF0C\u4EA6\u7522\u751F\u4E86\u53E4\u514B\u5B9A\u7406\u2014\u2014\u5E03\u723E\u53EF\u6EFF\u8DB3\u6027\u554F\u984C\u662FNP\u5B8C\u5099\u7684\u8B49\u660E\u3002 1982\u5E74\uFF0C\u53E4\u514B\u5F97\u5230\u56FE\u7075\u5956\u3002\u56E0\u70BA\u5176\u8AD6\u6587\u958B\u555F\u4E86NP\u5B8C\u5099\u6027\u7684\u7814\u7A76\uFF0C\u4EE4\u9019\u500B\u7BC4\u7587\u65BC\u4E4B\u5F8C\u7684\u5341\u5E74\u6210\u70BA\u8A08\u7B97\u6A5F\u79D1\u5B78\u4E2D\u6700\u6D3B\u8E8D\u548C\u91CD\u8981\u7684\u7814\u7A76\u3002 \u53E4\u514B\u73FE\u70BA\u591A\u502B\u591A\u5927\u5B78\u7684\u8A08\u7B97\u6A5F\u79D1\u5B78\u548C\u6578\u5B78\u90E8\u9580\u6559\u6388\u3002"@zh ,
"Stephen Arthur Cook – ameryka\u0144ski informatyk, ceniony za fundamentalny wk\u0142ad w rozw\u00F3j teorii z\u0142o\u017Cono\u015Bci obliczeniowej, za co otrzyma\u0142 nagrod\u0119 Turinga w 1982 roku."@pl ,
"Stephen Arthur Cook is a noted computer scientist. Cook formalised the notion of NP-completeness in a famous 1971 paper \"The Complexity of Theorem Proving Procedures\", which also contained Cook's theorem, a proof that the boolean satisfiability problem is NP-complete. The paper left unsolved the greatest open question in theoretical computer science - whether complexity classes P and NP are equivalent. Cook received the Turing Award in 1982 for his discovery. His citation reads: For his advancement of our understanding of the complexity of computation in a significant and profound way. His seminal paper, The Complexity of Theorem Proving Procedures, presented at the 1971 ACM SIGACT Symposium on the Theory of Computing, laid the foundations for the theory of NP-Completeness. The ensuing exploration of the boundaries and nature of NP-complete class of problems has been one of the most active and important research activities in computer science for the last decade. He received his Bachelor's degree in 1961 from the University of Michigan. At Harvard University, he received his Master's degree in 1962 and his Ph.D. in 1966. From 1966 to 1970 he was Assistant Professor at the University of California, Berkeley in the math department, which infamously denied him tenure. In a speech celebrating the 30th anniversary of the Berkeley EECS department, fellow Turing Award winner and Berkeley professor Richard Karp said that, \"It is to our everlasting shame that we were unable to persuade the math department to give him tenure. \" Cook then joined the faculty at the University of Toronto in 1970 as an Associate Professor, and was promoted to Professor in 1975 and University Professor in 1985 in the Computer Science Department and Mathematics Department. He is a Fellow of the Association for Computing Machinery (2008)."@en ,
"Stephen Arthur Cook je americk\u00FD informatik. Je zn\u00E1m p\u0159edev\u0161\u00EDm d\u00EDky sv\u00E9mu \u010Dl\u00E1nku \"The Complexity of Theorem Proving Procedures\" z roku 1971, ve kter\u00E9m formalizoval pojem NP-\u00FAplnosti a dok\u00E1zal, \u017Ee existuje NP-\u00FApln\u00FD probl\u00E9m. Tento \u010Dl\u00E1nek otev\u0159el jeden z nejv\u011Bt\u0161\u00EDch nevy\u0159e\u0161en\u00FDch probl\u00E9m\u016F sou\u010Dasn\u00E9 informatiky a to, zda P = NP. Tato ot\u00E1zka byla za\u0159azena mezi sedm tzv. Probl\u00E9m\u016F tis\u00EDcilet\u00ED vyhl\u00E1\u0161en\u00FDch v roce 2000 Clayov\u00FDm matematick\u00FDm institutem, za vy\u0159e\u0161en\u00ED ka\u017Ed\u00E9ho z t\u011Bchto probl\u00E9m\u016F je vyps\u00E1na odm\u011Bna milion dolar\u016F. Probl\u00E9m se dot\u00FDk\u00E1 cel\u00E9 \u0159ady v\u011Bdn\u00EDch obor\u016F \u2014 teoretick\u00E9 informatiky, matematiky, logiky, kryptografie, ale tak\u00E9 i filosofie. V roce 1982 obdr\u017Eel Turingovu cenu. V z\u00E1\u0159\u00ED 2008 nav\u0161t\u00EDvil pra\u017Eskou Podzimn\u00ED \u0161kolu logiky. V roce 1962 absolvoval Harvardovu univerzitu, v roce 1966 zde obdr\u017Eel titul PhD."@cs ,
"Stephen Arthur Cook est un informaticien qui a formalis\u00E9 la notion de NP-compl\u00E9tude. Il est l'auteur de la publication The Complexity of Theorem Proving Procedures dans laquelle il \u00E9tablit le th\u00E9or\u00E8me de Cook, qui prouve que le probl\u00E8me SAT est NP-complet."@fr ,
"\u0421\u0442\u0438\u0432\u0435\u043D \u0410\u0440\u0442\u0443\u0440 \u041A\u0443\u043A\u00A0\u2014 \u0430\u043C\u0435\u0440\u0438\u043A\u0430\u043D\u0441\u043A\u0438\u0439 \u0443\u0447\u0451\u043D\u044B\u0439 \u0432 \u043E\u0431\u043B\u0430\u0441\u0442\u0438 \u0442\u0435\u043E\u0440\u0438\u0438 \u0432\u044B\u0447\u0438\u0441\u043B\u0438\u0442\u0435\u043B\u044C\u043D\u044B\u0445 \u0441\u0438\u0441\u0442\u0435\u043C. \u0417\u043D\u0430\u043C\u0435\u043D\u0438\u0442 \u0441\u0432\u043E\u0435\u0439 \u0440\u0430\u0431\u043E\u0442\u043E\u0439 \u043D\u0430\u0434 \u0442\u0435\u043E\u0440\u0438\u0435\u0439 \u0441\u043B\u043E\u0436\u043D\u043E\u0441\u0442\u0438 \u0432\u044B\u0447\u0438\u0441\u043B\u0435\u043D\u0438\u0439, \u043B\u0430\u0443\u0440\u0435\u0430\u0442 \u043F\u0440\u0435\u043C\u0438\u0438 \u0422\u044C\u044E\u0440\u0438\u043D\u0433\u0430. \u0412 \u0441\u0432\u043E\u0435\u0439 \u0440\u0430\u0431\u043E\u0442\u0435 \u00ABThe Complexity of Theorem Proving Procedures\u00BB \u041A\u0443\u043A \u0434\u043E\u043A\u0430\u0437\u0430\u043B, \u0447\u0442\u043E \u0437\u0430\u0434\u0430\u0447\u0430 \u0432\u044B\u043F\u043E\u043B\u043D\u0438\u043C\u043E\u0441\u0442\u0438 \u0431\u0443\u043B\u0435\u0432\u044B\u0445 \u0444\u043E\u0440\u043C\u0443\u043B \u044F\u0432\u043B\u044F\u0435\u0442\u0441\u044F NP-\u043F\u043E\u043B\u043D\u043E\u0439. \u0422\u0435\u043C \u0441\u0430\u043C\u044B\u043C \u043E\u043D \u043F\u043E\u0434\u043D\u044F\u043B \u0432\u043E\u043F\u0440\u043E\u0441 \u043E \u0440\u0430\u0432\u0435\u043D\u0441\u0442\u0432\u0435 \u043A\u043B\u0430\u0441\u0441\u043E\u0432 \u0441\u043B\u043E\u0436\u043D\u043E\u0441\u0442\u0438 P \u0438 NP, \u043E\u0434\u0438\u043D \u0438\u0437 \u0441\u043B\u043E\u0436\u043D\u0435\u0439\u0448\u0438\u0445 \u0432\u043E\u043F\u0440\u043E\u0441\u043E\u0432 \u0442\u0435\u043E\u0440\u0438\u0438 \u0432\u044B\u0447\u0438\u0441\u043B\u0438\u0442\u0435\u043B\u044C\u043D\u044B\u0445 \u0441\u0438\u0441\u0442\u0435\u043C, \u043D\u0430 \u043A\u043E\u0442\u043E\u0440\u044B\u0439 \u0434\u043E \u0441\u0438\u0445 \u043F\u043E\u0440 \u043D\u0435\u0442 \u043E\u0442\u0432\u0435\u0442\u0430."@ru ;
rdfs:comment "Stephen Arthur Cook – ameryka\u0144ski informatyk, ceniony za fundamentalny wk\u0142ad w rozw\u00F3j teorii z\u0142o\u017Cono\u015Bci obliczeniowej, za co otrzyma\u0142 nagrod\u0119 Turinga w 1982 roku."@pl ,
"Stephen Arthur Cook is a noted computer scientist. Cook formalised the notion of NP-completeness in a famous 1971 paper \"The Complexity of Theorem Proving Procedures\", which also contained Cook's theorem, a proof that the boolean satisfiability problem is NP-complete. The paper left unsolved the greatest open question in theoretical computer science - whether complexity classes P and NP are equivalent. Cook received the Turing Award in 1982 for his discovery."@en ,
"\u53F2\u63D0\u82AC\u00B7A\u00B7\u53E4\u514B\uFF08Stephen A."@zh ,
"\u30B9\u30C6\u30A3\u30FC\u30D6\u30F3\u30FB\u30AF\u30C3\u30AF\uFF08Stephen A."@ja ,
"Stephen Arthur Cook este un informatician american, care a formalizat no\u0163iunea de NP-completitudine \u00EEntr-o lucrare scris\u0103 \u00EEn 1971 \u015Fi intitulat\u0103 Complexitatea procedurilor de demonstrare a teoremelor, \u00EEn care a demonstrat c\u0103 problema satisfacerii expresiilor booleene este NP complet\u0103. Pentru aceasta, Cook a primit \u00EEn 1982 Premiul Turing."@ro ,
"Stephen Arthur Cook je americk\u00FD informatik. Je zn\u00E1m p\u0159edev\u0161\u00EDm d\u00EDky sv\u00E9mu \u010Dl\u00E1nku \"The Complexity of Theorem Proving Procedures\" z roku 1971, ve kter\u00E9m formalizoval pojem NP-\u00FAplnosti a dok\u00E1zal, \u017Ee existuje NP-\u00FApln\u00FD probl\u00E9m. Tento \u010Dl\u00E1nek otev\u0159el jeden z nejv\u011Bt\u0161\u00EDch nevy\u0159e\u0161en\u00FDch probl\u00E9m\u016F sou\u010Dasn\u00E9 informatiky a to, zda P = NP. Tato ot\u00E1zka byla za\u0159azena mezi sedm tzv."@cs ,
"Stephen Arthur Cook est un informaticien qui a formalis\u00E9 la notion de NP-compl\u00E9tude. Il est l'auteur de la publication The Complexity of Theorem Proving Procedures dans laquelle il \u00E9tablit le th\u00E9or\u00E8me de Cook, qui prouve que le probl\u00E8me SAT est NP-complet."@fr ,
"Stephen Arthur Cook ist Professor der Informatik an der University of Toronto in Kanada. Sein Hauptbet\u00E4tigungsfeld ist die Komplexit\u00E4tstheorie; Cook arbeitet neben seiner Lehrt\u00E4tigkeit aber auch an der Schnittstelle von Logik und Berechenbarkeitstheorie. Cook wurde in der theoretischen Informatik ber\u00FChmt durch den Satz von Cook: \u201ESAT ist NP-vollst\u00E4ndig\u201C. 1982 bekam er f\u00FCr diese Entdeckung den Turing Award."@de ,
"\u0421\u0442\u0438\u0432\u0435\u043D \u0410\u0440\u0442\u0443\u0440 \u041A\u0443\u043A\u00A0\u2014 \u0430\u043C\u0435\u0440\u0438\u043A\u0430\u043D\u0441\u043A\u0438\u0439 \u0443\u0447\u0451\u043D\u044B\u0439 \u0432 \u043E\u0431\u043B\u0430\u0441\u0442\u0438 \u0442\u0435\u043E\u0440\u0438\u0438 \u0432\u044B\u0447\u0438\u0441\u043B\u0438\u0442\u0435\u043B\u044C\u043D\u044B\u0445 \u0441\u0438\u0441\u0442\u0435\u043C. \u0417\u043D\u0430\u043C\u0435\u043D\u0438\u0442 \u0441\u0432\u043E\u0435\u0439 \u0440\u0430\u0431\u043E\u0442\u043E\u0439 \u043D\u0430\u0434 \u0442\u0435\u043E\u0440\u0438\u0435\u0439 \u0441\u043B\u043E\u0436\u043D\u043E\u0441\u0442\u0438 \u0432\u044B\u0447\u0438\u0441\u043B\u0435\u043D\u0438\u0439, \u043B\u0430\u0443\u0440\u0435\u0430\u0442 \u043F\u0440\u0435\u043C\u0438\u0438 \u0422\u044C\u044E\u0440\u0438\u043D\u0433\u0430."@ru ,
"Stephen Arthur Cook es un reconocido cient\u00EDfico de la computaci\u00F3n. Cook formaliz\u00F3 la cosa de NP-completitud en un famoso art\u00EDculo de 1971 titulado \"The Complexity of Theorem Proving Procedures\" (\"La Complejidad de los Procedimientos de Prueba de Teoremas\"), que tambi\u00E9nlas clases de complejidad P y NP. Cook recibi\u00F3 el Premio Turing en 1982 por su descubrimiento: Por su avance en nuestra comprensi\u00F3n de la complejidad computacional de un modo significativo y profundo."@es ;
foaf:depiction ;
foaf:givenname "Stephen Arthur"@de .
@prefix skos: .
@prefix ns14: .
dbpedia:Stephen_Cook skos:subject ns14:Fellows_of_the_Royal_Society ,
ns14:Living_people ,
ns14:Turing_Award_laureates ,
ns14:Fellows_of_the_Association_for_Computing_Machinery ,
ns14:University_of_Michigan_alumni ,
ns14:Members_of_the_National_Academy_of_Sciences ,
,
ns14:Harvard_University_alumni ,
ns14:American_computer_scientists ,
ns14:University_of_Toronto_faculty ,
ns14:Fellows_of_the_Royal_Society_of_Canada .
@prefix ns15: .
dbpedia:Stephen_Cook dbpprop:wikiPageUsesTemplate ns15:infobox_scientist ,
ns15:persondata .
@prefix ns16: .
dbpedia:Stephen_Cook dbpprop:birthDate ns16:birth_date_and_age ;
dbpprop:birthPlace ,
dbpedia:New_York ;
dbpprop:almaMater dbpedia:Harvard_University ;
dbpprop:imageWidth "150px"@en ;
dbpprop:field dbpedia:Computer_Science ;
dbpprop:dateOfBirth 1939 ;
dbpprop:workInstitution ,
dbpedia:University_of_Toronto ;
dbpprop:doctoralStudents dbpedia:Walter_Savitch ;
dbpprop:shortDescription dbpedia:Computer_Science ;
dbpprop:knownFor dbpedia:NP-complete ;
dbpprop:doctoralAdvisor ;
dbpprop:prizes dbpedia:Turing_Award .
@prefix ns17: .
dbpedia:Stephen_Cook dbpprop:hasPhotoCollection ns17:Stephen_Cook .
@prefix ns18: .
dbpedia:Stephen_Cook dbpprop:wordnet_type ns18:synset-scientist-noun-1 .
dbpedia:List_of_Harvard_University_people dbpprop:name dbpedia:Stephen_Cook .
dbpprop:redirect dbpedia:Stephen_Cook .
@prefix yago: .
yago:Stephen_Cook owl:sameAs dbpedia:Stephen_Cook .