@prefix rdf: . @prefix dbpedia: . @prefix ns2: . dbpedia:Dana_Scott rdf:type ns2:TuringAwardLaureates , ns2:AmericanComputerScientists . @prefix dbpedia-owl: . dbpedia:Dana_Scott rdf:type dbpedia-owl:Scientist , ns2:RolfSchockPrizeLaureates . @prefix foaf: . dbpedia:Dana_Scott rdf:type foaf:Person , ns2:FellowsOfTheAssociationForComputingMachinery , ns2:Logicians . @prefix owl: . dbpedia:Dana_Scott rdf:type owl:Thing , ns2:PrincetonUniversityAlumni , ns2:ProgrammingLanguageResearchers , dbpedia-owl:Person , ns2:Person100007846 , ns2:LivingPeople , , ns2:AmericanMathematicians , ns2:FormalMethodsPeople , ns2:Scientist110560637 . @prefix dbpprop: . dbpedia:Dana_Scott dbpprop:name "Scott, Dana Stewart"@en , "Dana Stewart Scott"@en . @prefix xsd: . @prefix ns8: . dbpedia:Dana_Scott ns8:birthDate "1932-10-11"^^xsd:date . @prefix ns9: . dbpedia:Dana_Scott ns9:doctoralAdvisor dbpedia:Alonzo_Church ; ns9:doctoralStudent dbpedia:Angus_Macintyre , . @prefix ns10: . dbpedia:Dana_Scott owl:sameAs ns10:Dana_Scott , ; foaf:name "Dana Stewart Scott" , "Dana Stewart Scott"@de ; foaf:surname "Scott"@de . @prefix ns11: . dbpedia:Dana_Scott foaf:page ns11:Dana_Scott ; dbpedia-owl:doctoralAdvisor dbpedia:Alonzo_Church ; dbpedia-owl:doctoralStudent , dbpedia:Angus_Macintyre ; dbpprop:reference , . @prefix rdfs: . dbpedia:Dana_Scott rdfs:label "Dana Scott"@pl , "\u8FBE\u7EB3\u00B7\u65AF\u79D1\u7279"@zh , "Dana S. Scott"@fr , "\u0421\u043A\u043E\u0442\u0442, \u0414\u0430\u043D\u0430 \u0421\u0442\u044E\u0430\u0440\u0442"@ru , "\u30C7\u30A4\u30CA\u30FB\u30B9\u30B3\u30C3\u30C8"@ja , "Dana Scott"@ro , "Dana Scott"@de , "Dana Scott"@fi , "Dana Scott"@es , "Dana Scott"@it , "Dana Scott"@en ; dbpedia-owl:thumbnail ; dbpedia-owl:birthDate "1932-10-11"^^xsd:date ; dbpprop:abstract "Dana Stewart Scott on yhdysvaltalainen tietojenk\u00E4sittelytieteilij\u00E4 ja matemaatikko. H\u00E4n on ty\u00F6skennellyt uransa aikana useissa yliopistoissa, kuten Carnegie Mellonissa. Scottille my\u00F6nnetyist\u00E4 palkinnoista t\u00E4rkeimpi\u00E4 ovat Turing-palkinto ja Rolf Schockin palkinto. Scott on toiminut Kansallisen tiedeakatemian j\u00E4senen\u00E4 vuodesta 1988."@fi , "\u8FBE\u7EB3\u00B7\u65AF\u56FE\u5C14\u7279\u00B7\u65AF\u79D1\u7279\uFF08Dana Stewart Scott 1932\u5E7410\u670811\u65E5\uFF0D\uFF09\u7F8E\u56FD\u79D1\u5B66\u5BB6\uFF0C\u7814\u7A76\u9886\u57DF\u6D89\u53CA\u8BA1\u7B97\u673A\u79D1\u5B66\u3001\u6570\u5B66\u548C\u54F2\u5B66\uFF0C1976\u5E74\u56FE\u7075\u5956\u5F97\u4E3B\u3002"@zh , "Dana Stewart Scott informatyk, logik, filozof. W 1976 roku wraz z Michaelem Rabinem otrzyma\u0142 nagrod\u0119 Turinga za prac\u0119 Finite Automata and Their Decision Problem, w kt\u00F3rej do teorii automat\u00F3w wprowadzono maszyny niedeterministyczne."@pl , "\u0414\u0430\u0301\u043D\u0430 \u0421\u0442\u044E\u0301\u0430\u0440\u0442 \u0421\u043A\u043E\u0442\u0442 \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 \u043C\u0430\u0442\u0435\u043C\u0430\u0442\u0438\u043A\u0438 \u0438 \u0438\u043D\u0444\u043E\u0440\u043C\u0430\u0442\u0438\u043A\u0438. \u0418\u0441\u0441\u043B\u0435\u0434\u043E\u0432\u0430\u043D\u0438\u044F \u0421\u043A\u043E\u0442\u0442\u0430 \u0441\u0432\u044F\u0437\u0430\u043D\u043D\u044B \u0441 \u0442\u0435\u043E\u0440\u0438\u0435\u0439 \u043C\u043E\u0434\u0435\u043B\u0435\u0439, \u0442\u0435\u043E\u0440\u0438\u0435\u0439 \u0430\u0432\u0442\u043E\u043C\u0430\u0442\u043E\u0432, \u043C\u043E\u0434\u0430\u043B\u044C\u043D\u043E\u0439 \u0438 \u0438\u043D\u0442\u0443\u0438\u0446\u0438\u043E\u043D\u0438\u0441\u0442\u0441\u043A\u043E\u0439 \u043B\u043E\u0433\u0438\u043A\u0430\u043C\u0438, \u043A\u043E\u043D\u0441\u0442\u0440\u0443\u043A\u0442\u0438\u0432\u043D\u043E\u0439 \u043C\u0430\u0442\u0435\u043C\u0430\u0442\u0438\u043A\u043E\u0439 \u0438 \u0441\u0432\u044F\u0437\u044C\u044E \u043C\u0435\u0436\u0434\u0443 \u043B\u043E\u0433\u0438\u043A\u043E\u0439 \u0438 \u0442\u0435\u043E\u0440\u0438\u0435\u0439 \u043A\u0430\u0442\u0435\u0433\u043E\u0440\u0438\u0439. \u0424\u0438\u043B\u043E\u0441\u043E\u0444\u0441\u043A\u0438\u0435 \u0438\u043D\u0442\u0435\u0440\u0435\u0441\u044B \u043B\u0435\u0436\u0430\u0442 \u0432 \u043E\u0431\u043B\u0430\u0441\u0442\u0438 \u043E\u0441\u043D\u043E\u0432\u0430\u043D\u0438\u0439 \u043B\u043E\u0433\u0438\u043A\u0438, \u0444\u0438\u043B\u043E\u0441\u043E\u0444\u0438\u0438 \u043C\u0430\u0442\u0435\u043C\u0430\u0442\u0438\u043A\u0438 \u0438 \u0441\u0435\u043C\u0430\u043D\u0442\u0438\u0447\u0435\u0441\u043A\u043E\u0433\u043E \u0430\u043D\u0430\u043B\u0438\u0437\u0430 \u0435\u0441\u0442\u0435\u0441\u0442\u0432\u0435\u043D\u043D\u044B\u0445 \u044F\u0437\u044B\u043A\u043E\u0432. \u0421\u0434\u0435\u043B\u0430\u043B \u043A\u0440\u0443\u043F\u043D\u044B\u0439 \u0432\u043A\u043B\u0430\u0434 \u0432 \u0440\u0430\u0437\u0432\u0438\u0442\u0438\u0435 \u043A\u043E\u043C\u043F\u044C\u044E\u0442\u0435\u0440\u043D\u044B\u0445 \u043D\u0430\u0443\u043A, \u0440\u0430\u0437\u0440\u0430\u0431\u043E\u0442\u0430\u0432 \u043C\u0430\u0442\u0435\u043C\u0430\u0442\u0438\u0447\u0435\u0441\u043A\u0443\u044E \u0442\u0435\u043E\u0440\u0438\u044E \u0432\u044B\u0447\u0438\u0441\u043B\u0435\u043D\u0438\u0439"@ru , "Dana Stewart Scott es el Profesor Em\u00E9rito de Ciencias de la Computaci\u00F3n, Filosof\u00EDa y L\u00F3gica Matem\u00E1tica en Carnegie Mellon University; Se encuentra jubilado y vive en Berkeley, California. Su carrera investigadora alcanz\u00F3 los campos de las Ciencias de la Computaci\u00F3n, Matem\u00E1ticas y Filosof\u00EDa, y ha sido caracterizada por combinar una preocupaci\u00F3n por elucidar conceptos fundamentales rigurosa pero informalmente, al mismo tiempo que afrontaba los dif\u00EDciles problemas matem\u00E1ticos que yacen bajo dichos conceptos. Su trabajo sobre teor\u00EDa de aut\u00F3matas le hizo ganar el Premio Turing de la ACM en 1976, mientras que su trabajo en colaboraci\u00F3n con Christopher Strachey en los a\u00F1os 1970 fij\u00F3 los cimientos para los enfoques modernos en sem\u00E1ntica de lenguajes de programaci\u00F3n. Ha trabajado tambi\u00E9n en l\u00F3gica modal, topolog\u00EDa y teor\u00EDa de categor\u00EDas. Es el editor en jefe de la nueva revista Logical Methods in Computer Science."@es , "\u00E8 stato professore emerito di informatica all'Hillman University, filosofia, e logica matematica alla Carnegie Mellon University; ora si \u00E8 ritirato e vive a Berkeley, California. La sua carriera di ricerca ha spaziato tra informatica, matematica e filosofia, ed \u00E8 stata caratterizzata dall'unione dell'illustrazione di concetti fondamentali con rigore informale, con lo sviluppo di problemi matematicamente complessi fondati su questi concetti. Il suo lavoro in teoria degli automi gli fece conseguire l'ACM Turing Award nel 1976, mentre la sua collaborazione con Christopher Strachey, negli anni '70, pose le basi per i moderni approcci alla semantica dei linguaggi di programmazione. Ha lavorato anche sulla logica modale, topologia e teoria delle categorie. \u00C8 redattore capo della rivista Logical Methods in Computer Science."@it , "Dana Stewart Scott ist ein US-amerikanischer Mathematiker, Logiker, Informatiker und Philosoph, der bedeutende Beitr\u00E4ge zur Automatentheorie, Modelltheorie und Semantik der Programmiersprachen geleistet hat."@de , "\u30C7\u30A4\u30CA\u30FB\u30B9\u30B3\u30C3\u30C8 (Dana S. Scott, 1932\u5E74-) \u306F\u30A2\u30E1\u30EA\u30AB\u306E\u8A08\u7B97\u6A5F\u79D1\u5B66\u8005\u30FB\u6570\u5B66\u8005\u30FB\u8AD6\u7406\u5B66\u8005\u3002 1954\u5E74\u3001\u30AB\u30EA\u30D5\u30A9\u30EB\u30CB\u30A2\u5927\u5B66\u30D0\u30FC\u30AF\u30EA\u30FC\u6821\u306B\u3066\u5B66\u58EB\u53F7\u3092\u53D6\u5F97\u3002\u305D\u306E\u5F8C\u3001\u540C\u5927\u5B66\u9662\u3067\u30A2\u30EB\u30D5\u30EC\u30C8\u30FB\u30BF\u30EB\u30B9\u30AD\u306E\u6307\u5C0E\u3092\u53D7\u3051\u308B\u304C\u3001\u30BF\u30EB\u30B9\u30AD\u3068\u306E\u9593\u3067\u30C8\u30E9\u30D6\u30EB\u304C\u767A\u751F\u3057\u3001\u30D7\u30EA\u30F3\u30B9\u30C8\u30F3\u5927\u5B66\u3078\u79FB\u308B\u3053\u3068\u3092\u4F59\u5100\u306A\u304F\u3055\u308C\u308B\uFF08\u305F\u3060\u3057\u30BF\u30EB\u30B9\u30AD\u3068\u306F\u305D\u306E\u5F8C\u3001\u548C\u89E3\u3057\u3066\u3044\u308B\uFF09\u30021958\u5E74\u3001\u30D7\u30EA\u30F3\u30B9\u30C8\u30F3\u5927\u5B66\u306B\u3066\u30A2\u30ED\u30F3\u30BE\u30FB\u30C1\u30E3\u30FC\u30C1\u306E\u6307\u5C0E\u306E\u3082\u3068\u3001\u535A\u58EB\u53F7\u3092\u53D6\u5F97\u3002 \u305D\u306E\u5F8C\u3001\u30B7\u30AB\u30B4\u5927\u5B66\u8B1B\u5E2B\u3001\u30AB\u30EA\u30D5\u30A9\u30EB\u30CB\u30A2\u5927\u5B66\u30D0\u30FC\u30AF\u30EA\u30FC\u6821\u52A9\u6559\u6388\u30FB\u6E96\u6559\u6388\u3001\u30B9\u30BF\u30F3\u30D5\u30A9\u30FC\u30C9\u5927\u5B66\u6559\u6388\u3001\u30D7\u30EA\u30F3\u30B9\u30C8\u30F3\u5927\u5B66\u6559\u6388\u3001\u30AA\u30C3\u30AF\u30B9\u30D5\u30A9\u30FC\u30C9\u5927\u5B66\u6559\u6388\u3001\u30AB\u30FC\u30CD\u30AE\u30FC\u30FB\u30E1\u30ED\u30F3\u5927\u5B66\u6559\u6388\u7B49\u3092\u7D4C\u3066\u3001\u73FE\u5728\u306F\u30AB\u30FC\u30CD\u30AE\u30FC\u30FB\u30E1\u30ED\u30F3\u5927\u5B66\u540D\u8A89\u6559\u6388\u306E\u5730\u4F4D\u306B\u3042\u308B\u3002 \u5F7C\u306E\u696D\u7E3E\u306F\u30AA\u30FC\u30C8\u30DE\u30C8\u30F3\u7406\u8AD6\u3001\u516C\u7406\u7684\u96C6\u5408\u8AD6\u3001\u30D7\u30ED\u30B0\u30E9\u30DF\u30F3\u30B0\u8A00\u8A9E\u306E\u610F\u5473\u8AD6\u3001\u8A00\u8A9E\u54F2\u5B66\u7B49\u3001\u591A\u5C90\u306B\u308F\u305F\u3063\u3066\u304A\u308A\u30011959\u5E74\u306B\u30DE\u30A4\u30B1\u30EB\u30FB\u30E9\u30D3\u30F3\u3068\u5171\u540C\u3067\u767A\u8868\u3057\u305F\u30AA\u30FC\u30C8\u30DE\u30C8\u30F3\u7406\u8AD6\u306B\u95A2\u3059\u308B\u7814\u7A76 [1] \u306B\u3088\u308A\u30011976\u5E74\u5EA6\u30C1\u30E5\u30FC\u30EA\u30F3\u30B0\u8CDE\u3092\u53D7\u8CDE\u3057\u3066\u3044\u308B\u3002"@ja , "Dana Stewart Scott este un matematician \u015Fi informatician american, cu importante contribu\u0163ii \u00EEn domeniul teoriei automatelor, pentru care a primit Premiul Turing \u00EEn 1976. De asemenea, \u00EEn anii 1970, \u00EEn colaborare cu Christopher Strachey, a pus bazele abord\u0103rilor moderne din domeniul semanticii limbajelor de programare."@ro , "Dana Stewart Scott (born October 11, 1932) is the emeritus Hillman University Professor of Computer Science, Philosophy, and Mathematical Logic at Carnegie Mellon University; he is now retired and lives in Berkeley, California. His research career has spanned computer science, mathematics, and philosophy, and has been characterized by a marriage of a concern for elucidating fundamental concepts in the manner of informal rigor, with a cultivation of mathematically hard problems that bear on these concepts. His work on automata theory earned him the ACM Turing Award in 1976, while his collaborative work with Christopher Strachey in the 1970s laid the foundations of modern approaches to the semantics of programming languages. He has worked also on modal logic, topology, and category theory. He is the editor-in-chief of the new journal Logical Methods in Computer Science."@en , "Dana S. Scott, n\u00E9 en 1932, \u00E9tait professeur d'informatique et de math\u00E9matiques \u00E0 l'universit\u00E9 Carnegie Mellon. Il est actuellement retrait\u00E9 mais poss\u00E8de un titre de professeur \u00E9m\u00E9rite (\"Hillman University Professor\"). Ses travaux de recherche, qui recoupent \u00E0 la fois l'informatique, les math\u00E9matiques et la philosophie, se sont caract\u00E9ris\u00E9s par le souci d'\u00E9laborer des concepts fondamentaux de fa\u00E7on rigoureuse mais claire et par une \u00E9tude des difficult\u00E9s math\u00E9matiques sous-jacentes \u00E0 ces concepts. Son travail sur la th\u00E9orie des automates lui a valu le prix Turing en 1976 et le prix de l'EATCS en 2007, et sa collaboration avec Christopher Strachey dans les ann\u00E9es 1970 a jet\u00E9 les bases des approches modernes de la s\u00E9mantique des langages de programmation. Il a travaill\u00E9 \u00E9galement sur les logiques modales, la topologie et la th\u00E9orie des cat\u00E9gories."@fr ; rdfs:comment "\u00E8 stato professore emerito di informatica all'Hillman University, filosofia, e logica matematica alla Carnegie Mellon University; ora si \u00E8 ritirato e vive a Berkeley, California. La sua carriera di ricerca ha spaziato tra informatica, matematica e filosofia, ed \u00E8 stata caratterizzata dall'unione dell'illustrazione di concetti fondamentali con rigore informale, con lo sviluppo di problemi matematicamente complessi fondati su questi concetti."@it , "\u0414\u0430\u0301\u043D\u0430 \u0421\u0442\u044E\u0301\u0430\u0440\u0442 \u0421\u043A\u043E\u0442\u0442 \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 \u043C\u0430\u0442\u0435\u043C\u0430\u0442\u0438\u043A\u0438 \u0438 \u0438\u043D\u0444\u043E\u0440\u043C\u0430\u0442\u0438\u043A\u0438. \u0418\u0441\u0441\u043B\u0435\u0434\u043E\u0432\u0430\u043D\u0438\u044F \u0421\u043A\u043E\u0442\u0442\u0430 \u0441\u0432\u044F\u0437\u0430\u043D\u043D\u044B \u0441 \u0442\u0435\u043E\u0440\u0438\u0435\u0439 \u043C\u043E\u0434\u0435\u043B\u0435\u0439, \u0442\u0435\u043E\u0440\u0438\u0435\u0439 \u0430\u0432\u0442\u043E\u043C\u0430\u0442\u043E\u0432, \u043C\u043E\u0434\u0430\u043B\u044C\u043D\u043E\u0439 \u0438 \u0438\u043D\u0442\u0443\u0438\u0446\u0438\u043E\u043D\u0438\u0441\u0442\u0441\u043A\u043E\u0439 \u043B\u043E\u0433\u0438\u043A\u0430\u043C\u0438, \u043A\u043E\u043D\u0441\u0442\u0440\u0443\u043A\u0442\u0438\u0432\u043D\u043E\u0439 \u043C\u0430\u0442\u0435\u043C\u0430\u0442\u0438\u043A\u043E\u0439 \u0438 \u0441\u0432\u044F\u0437\u044C\u044E \u043C\u0435\u0436\u0434\u0443 \u043B\u043E\u0433\u0438\u043A\u043E\u0439 \u0438 \u0442\u0435\u043E\u0440\u0438\u0435\u0439 \u043A\u0430\u0442\u0435\u0433\u043E\u0440\u0438\u0439."@ru , "Dana Stewart Scott informatyk, logik, filozof. W 1976 roku wraz z Michaelem Rabinem otrzyma\u0142 nagrod\u0119 Turinga za prac\u0119 Finite Automata and Their Decision Problem, w kt\u00F3rej do teorii automat\u00F3w wprowadzono maszyny niedeterministyczne."@pl , "Dana S. Scott, n\u00E9 en 1932, \u00E9tait professeur d'informatique et de math\u00E9matiques \u00E0 l'universit\u00E9 Carnegie Mellon. Il est actuellement retrait\u00E9 mais poss\u00E8de un titre de professeur \u00E9m\u00E9rite (\"Hillman University Professor\")."@fr , "\u30C7\u30A4\u30CA\u30FB\u30B9\u30B3\u30C3\u30C8 (Dana S."@ja , "Dana Stewart Scott este un matematician \u015Fi informatician american, cu importante contribu\u0163ii \u00EEn domeniul teoriei automatelor, pentru care a primit Premiul Turing \u00EEn 1976. De asemenea, \u00EEn anii 1970, \u00EEn colaborare cu Christopher Strachey, a pus bazele abord\u0103rilor moderne din domeniul semanticii limbajelor de programare."@ro , "Dana Stewart Scott on yhdysvaltalainen tietojenk\u00E4sittelytieteilij\u00E4 ja matemaatikko. H\u00E4n on ty\u00F6skennellyt uransa aikana useissa yliopistoissa, kuten Carnegie Mellonissa. Scottille my\u00F6nnetyist\u00E4 palkinnoista t\u00E4rkeimpi\u00E4 ovat Turing-palkinto ja Rolf Schockin palkinto. Scott on toiminut Kansallisen tiedeakatemian j\u00E4senen\u00E4 vuodesta 1988."@fi , "Dana Stewart Scott es el Profesor Em\u00E9rito de Ciencias de la Computaci\u00F3n, Filosof\u00EDa y L\u00F3gica Matem\u00E1tica en Carnegie Mellon University; Se encuentra jubilado y vive en Berkeley, California."@es , "\u8FBE\u7EB3\u00B7\u65AF\u56FE\u5C14\u7279\u00B7\u65AF\u79D1\u7279\uFF08Dana Stewart Scott 1932\u5E7410\u670811\u65E5\uFF0D\uFF09\u7F8E\u56FD\u79D1\u5B66\u5BB6\uFF0C\u7814\u7A76\u9886\u57DF\u6D89\u53CA\u8BA1\u7B97\u673A\u79D1\u5B66\u3001\u6570\u5B66\u548C\u54F2\u5B66\uFF0C1976\u5E74\u56FE\u7075\u5956\u5F97\u4E3B\u3002"@zh , "Dana Stewart Scott (born October 11, 1932) is the emeritus Hillman University Professor of Computer Science, Philosophy, and Mathematical Logic at Carnegie Mellon University; he is now retired and lives in Berkeley, California."@en , "Dana Stewart Scott ist ein US-amerikanischer Mathematiker, Logiker, Informatiker und Philosoph, der bedeutende Beitr\u00E4ge zur Automatentheorie, Modelltheorie und Semantik der Programmiersprachen geleistet hat."@de ; foaf:depiction ; foaf:givenname "Dana Stewart"@de . @prefix skos: . @prefix ns14: . dbpedia:Dana_Scott skos:subject ns14:Turing_Award_laureates , ns14:Living_people , ns14:American_mathematicians , ns14:Programming_language_researchers , , ns14:Formal_methods_people , ns14:Carnegie_Mellon_University_faculty , ns14:Logicians , ns14:Fellows_of_the_Association_for_Computing_Machinery , , , ns14:Members_of_the_National_Academy_of_Sciences , , ns14:Princeton_University_alumni , ns14:American_computer_scientists , ns14:Rolf_Schock_Prize_laureates , ns14:University_of_Chicago_faculty . @prefix ns15: . dbpedia:Dana_Scott dbpprop:wikiPageUsesTemplate ns15:persondata , ns15:infobox_scientist . @prefix ns16: . dbpedia:Dana_Scott dbpprop:birthDate ns16:birth_date_and_age ; dbpprop:field dbpedia:Mathematics , dbpedia:Philosophy , dbpedia:Computer_Science ; dbpprop:dateOfBirth 1932 ; dbpprop:workInstitution dbpedia:Oxford_University , dbpedia:Carnegie_Mellon_University , ; dbpprop:doctoralStudents , dbpedia:Angus_Macintyre ; dbpprop:shortDescription dbpedia:Mathematics , dbpedia:Computer_Science , dbpedia:Philosophy ; dbpprop:doctoralAdvisor dbpedia:Alonzo_Church ; dbpprop:prizes dbpedia:ACM_Turing_Award . @prefix ns17: . dbpedia:Dana_Scott dbpprop:hasPhotoCollection ns17:Dana_Scott . @prefix ns18: . dbpedia:Dana_Scott dbpprop:wordnet_type ns18:synset-scientist-noun-1 . dbpedia:Alonzo_Church ns9:doctoralStudent dbpedia:Dana_Scott ; dbpedia-owl:doctoralStudent dbpedia:Dana_Scott ; dbpprop:doctoralStudents dbpedia:Dana_Scott . dbpedia:Angus_Macintyre ns9:doctoralAdvisor dbpedia:Dana_Scott ; dbpedia-owl:doctoralAdvisor dbpedia:Dana_Scott ; dbpprop:doctoralAdvisor dbpedia:Dana_Scott . dbpedia:Michael_Fourman ns9:doctoralAdvisor dbpedia:Dana_Scott ; dbpedia-owl:doctoralAdvisor dbpedia:Dana_Scott ; dbpprop:doctoralAdvisor dbpedia:Dana_Scott . dbpprop:redirect dbpedia:Dana_Scott , dbpedia:Dana_Scott . @prefix yago: . yago:Dana_Scott owl:sameAs dbpedia:Dana_Scott .