Paris C. Kanellakis
E487741
Paris C. Kanellakis was a prominent Greek-American computer scientist known for his influential contributions to theoretical computer science and database theory.
All labels observed (1)
| Label | Occurrences |
|---|---|
| Paris C. Kanellakis canonical | 3 |
How this entity was disambiguated
This entity first appeared as the object of triple T5028319 — resolving that mention is where its identity was fixed. The disambiguator weighed these candidate entities and picked the highlighted one (or “None”, minting a new entity). This is how homonymy is resolved: the same surface form can point to different entities.
Target entity: Paris C. Kanellakis Context triple: [Paris Kanellakis Theory and Practice Award, namedAfter, Paris C. Kanellakis]
-
A.
Barbara Liskov
Barbara Liskov is an American computer scientist renowned for her pioneering work in programming languages, data abstraction, and distributed systems, and is one of the first women to receive the Turing Award.
-
B.
Joseph Sifakis
Joseph Sifakis is a Greek-French computer scientist renowned for his pioneering work in formal verification and model checking, for which he received the Turing Award.
-
C.
Lenore Blum
Lenore Blum is an American mathematician and computer scientist known for her work in complexity theory, real computation, and advocacy for women in STEM.
-
D.
Barbara Grosz
Barbara Grosz is a pioneering computer scientist known for her foundational work in natural language processing, multi-agent systems, and contributions to the field of artificial intelligence research and ethics.
-
E.
Leslie Valiant
Leslie Valiant is a renowned computer scientist known for his foundational work in computational learning theory, complexity theory, and artificial intelligence.
- F. None of above. chosen
- G. Unsure - the case is ambiguous/there is not enough information to decide.
Target entity: Paris C. Kanellakis Target entity description: Paris C. Kanellakis was a prominent Greek-American computer scientist known for his influential contributions to theoretical computer science and database theory.
-
A.
Barbara Liskov
Barbara Liskov is an American computer scientist renowned for her pioneering work in programming languages, data abstraction, and distributed systems, and is one of the first women to receive the Turing Award.
-
B.
Joseph Sifakis
Joseph Sifakis is a Greek-French computer scientist renowned for his pioneering work in formal verification and model checking, for which he received the Turing Award.
-
C.
Lenore Blum
Lenore Blum is an American mathematician and computer scientist known for her work in complexity theory, real computation, and advocacy for women in STEM.
-
D.
Barbara Grosz
Barbara Grosz is a pioneering computer scientist known for her foundational work in natural language processing, multi-agent systems, and contributions to the field of artificial intelligence research and ethics.
-
E.
Leslie Valiant
Leslie Valiant is a renowned computer scientist known for his foundational work in computational learning theory, complexity theory, and artificial intelligence.
- F. None of above. chosen
Statements (48)
| Predicate | Object |
|---|---|
| instanceOf |
Greek-American
ⓘ
computer scientist ⓘ person ⓘ |
| academicDegree | PhD in Computer Science ⓘ |
| affiliation | Brown University Department of Computer Science NERFINISHED ⓘ |
| awardEstablishedBy | Association for Computing Machinery NERFINISHED ⓘ |
| coAuthorOf |
Constraint Query Languages
NERFINISHED
ⓘ
Fault-Tolerant Parallel Computation NERFINISHED ⓘ |
| countryOfCitizenship |
Greece
ⓘ
United States of America ⓘ |
| discipline | computer science ⓘ |
| educatedAt |
Brown University
ⓘ
Massachusetts Institute of Technology ⓘ |
| employer | Brown University NERFINISHED ⓘ |
| fieldOfWork |
concurrency theory
ⓘ
data structures ⓘ database theory ⓘ distributed computing ⓘ logic in computer science ⓘ theoretical computer science ⓘ |
| gender | male ⓘ |
| hasAcademicAdvisor | John Reif NERFINISHED ⓘ |
| hasAwardNamedAfter | ACM Paris Kanellakis Theory and Practice Award NERFINISHED ⓘ |
| hasDoctoralStudent |
Anna Karlin
NERFINISHED
ⓘ
Eli Upfal NERFINISHED ⓘ Maurice Herlihy NERFINISHED ⓘ |
| honours | ACM Paris Kanellakis Theory and Practice Award NERFINISHED ⓘ |
| influenced |
research in constraint programming
ⓘ
research in database theory ⓘ research in distributed algorithms ⓘ |
| languageSpoken |
English
ⓘ
Greek ⓘ |
| memberOf | Association for Computing Machinery NERFINISHED ⓘ |
| nationality |
American
ⓘ
Greek ⓘ |
| notableFor |
contributions to database theory
ⓘ
contributions to theoretical computer science ⓘ work on constraint query languages ⓘ work on deductive databases ⓘ work on fault-tolerant distributed computing ⓘ work on object-oriented databases ⓘ work on persistent data structures ⓘ |
| notableStudent | Mihalis Yannakakis NERFINISHED ⓘ |
| occupation |
researcher
ⓘ
university professor ⓘ |
| positionHeld | Professor of Computer Science at Brown University ⓘ |
| reasonForHonour | bridging theory and practice in computer science ⓘ |
| workLocation | Providence, Rhode Island NERFINISHED ⓘ |
How these facts were elicited
The pipeline generated the facts above by prompting gpt-5.1 with this entity's name + description and the instruction below.
You are a knowledge base construction expert. Given a subject entity and a description of it, return factual statements that you know for the subject as a JSON list of dictionaries(triples), where keys must be "subject", "predicate" and "object". The number of facts may be very high, between 25 to 50 or more, for very popular subjects. For less popular subjects, the number of facts can be very low, like 5 or 10. # Requirements - If you don't know the subject at all, return an empty list. - If the subject is not a named entity, return an empty list. - Include at least one triple where predicate is "instanceOf". - Do not get too wordy. - Separate several objects into multiple triples with one object.
Subject: Paris C. Kanellakis Description of subject: Paris C. Kanellakis was a prominent Greek-American computer scientist known for his influential contributions to theoretical computer science and database theory.
Referenced by (3)
Full triples — surface form annotated when it differs from this entity's canonical label.