Moshe Y. Vardi
E48391
Moshe Y. Vardi is a prominent computer scientist known for his influential work in logic in computer science, database theory, and automated verification.
All labels observed (1)
| Label | Occurrences |
|---|---|
| Moshe Y. Vardi canonical | 10 |
How this entity was disambiguated
This entity first appeared as the object of triple T364410 — 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: Moshe Y. Vardi Context triple: [Herbrand Award, notableRecipient, Moshe Y. Vardi]
-
A.
Manuel Blum
Manuel Blum is a Venezuelan-American computer scientist and Turing Award laureate renowned for his foundational contributions to computational complexity theory and cryptography.
-
B.
Edmund M. Clarke
Edmund M. Clarke was an American computer scientist best known for co-inventing model checking, a breakthrough technique in formal verification that earned him the Turing Award.
-
C.
Martin Davis
Martin Davis was an American mathematician and logician renowned for his foundational work in computability theory and the Entscheidungsproblem, including contributions to the Davis–Putnam algorithm.
-
D.
Michael Sipser
Michael Sipser is an American theoretical computer scientist known for his influential work in computational complexity theory and for authoring a widely used textbook on the theory of computation.
-
E.
John Alan Robinson
John Alan Robinson was a pioneering logician and computer scientist best known for introducing the resolution principle, a fundamental method in automated theorem proving and logic programming.
- F. None of above. chosen
- G. Unsure - the case is ambiguous/there is not enough information to decide.
Target entity: Moshe Y. Vardi Target entity description: Moshe Y. Vardi is a prominent computer scientist known for his influential work in logic in computer science, database theory, and automated verification.
-
A.
Manuel Blum
Manuel Blum is a Venezuelan-American computer scientist and Turing Award laureate renowned for his foundational contributions to computational complexity theory and cryptography.
-
B.
Edmund M. Clarke
Edmund M. Clarke was an American computer scientist best known for co-inventing model checking, a breakthrough technique in formal verification that earned him the Turing Award.
-
C.
Martin Davis
Martin Davis was an American mathematician and logician renowned for his foundational work in computability theory and the Entscheidungsproblem, including contributions to the Davis–Putnam algorithm.
-
D.
Michael Sipser
Michael Sipser is an American theoretical computer scientist known for his influential work in computational complexity theory and for authoring a widely used textbook on the theory of computation.
-
E.
John Alan Robinson
John Alan Robinson was a pioneering logician and computer scientist best known for introducing the resolution principle, a fundamental method in automated theorem proving and logic programming.
- F. None of above. chosen
Statements (66)
| Predicate | Object |
|---|---|
| instanceOf |
academic
ⓘ
computer scientist ⓘ human ⓘ logician ⓘ |
| almaMater |
Hebrew University of Jerusalem
ⓘ
Weizmann Institute of Science ⓘ |
| awardReceived |
ACM Presidential Award
ⓘ
Gödel Prize ⓘ
surface form:
ACM SIGACT Gödel Prize
ACM SIGMOD Contributions Award ⓘ Blaise Pascal Medal in Computer Science ⓘ EATCS Award ⓘ
surface form:
EATCS Distinguished Achievements Award
Gödel Prize ⓘ Donald E. Knuth Prize ⓘ
surface form:
Knuth Prize
LICS Test-of-Time Award ⓘ |
| citizenship |
Israel
ⓘ
United States of America ⓘ |
| degree | PhD in Computer Science ⓘ |
| doctoralAdvisor | Azaria Paz ⓘ |
| editorInChiefOf | Communications of the ACM ⓘ |
| employer | Rice University ⓘ |
| field |
automated verification
ⓘ
computer science ⓘ database theory ⓘ logic in computer science ⓘ |
| givenName |
Moses
ⓘ
surface form:
Moshe
|
| hasPublishedIn |
ACM Transactions on Database Systems
ⓘ
Communications of the ACM ⓘ Information and Computation ⓘ Journal of the ACM ⓘ Proceedings of the IEEE Symposium on Logic in Computer Science ⓘ |
| honor |
AAAI Fellow
ⓘ
Fellow of the Association for Computing Machinery ⓘ
surface form:
ACM Fellow
IEEE Fellow ⓘ |
| knownFor |
automated verification
ⓘ
database theory ⓘ database theory and logic ⓘ descriptive complexity ⓘ finite model theory applications in computer science ⓘ logic in computer science ⓘ model checking ⓘ temporal logic in verification ⓘ |
| languageSpoken |
English
ⓘ
Hebrew ⓘ |
| memberOf |
American Academy of Arts and Sciences
ⓘ
Association for Computing Machinery ⓘ Academia Europaea ⓘ
surface form:
European Academy of Sciences
National Academy of Engineering ⓘ National Academy of Sciences ⓘ
surface form:
National Academy of Sciences of the United States of America
|
| name | Moshe Y. Vardi self-link ⓘ |
| nationality | Israeli-American ⓘ |
| notableStudent | Orna Kupferman ⓘ |
| notableWork |
papers on automata-theoretic approach to temporal logic
ⓘ
papers on finite model theory and descriptive complexity ⓘ papers on model checking and verification ⓘ |
| occupation |
editor
ⓘ
professor ⓘ researcher ⓘ |
| position |
Karen Ostrum George Distinguished Service Professor in Computational Engineering
ⓘ
Professor in the Department of Computer Science at Rice University ⓘ University Professor at Rice University ⓘ |
| researchInterest |
artificial intelligence and logic
ⓘ
database systems ⓘ finite model theory ⓘ logic ⓘ verification ⓘ |
| workInstitution | Rice University ⓘ |
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: Moshe Y. Vardi Description of subject: Moshe Y. Vardi is a prominent computer scientist known for his influential work in logic in computer science, database theory, and automated verification.
Referenced by (10)
Full triples — surface form annotated when it differs from this entity's canonical label.