Vaughan Pratt
E437485
Vaughan Pratt is a computer scientist known for his contributions to algorithms and formal methods, including co-developing the Knuth–Morris–Pratt string-searching algorithm.
All labels observed (2)
| Label | Occurrences |
|---|---|
| Vaughan Pratt canonical | 1 |
| Vaughan R. Pratt | 1 |
How this entity was disambiguated
This entity first appeared as the object of triple T4416382 — 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: Vaughan Pratt Context triple: [Knuth–Morris–Pratt algorithm, namedAfter, Vaughan Pratt]
-
A.
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.
-
B.
Oren Patashnik
Oren Patashnik is a computer scientist best known for coauthoring the influential textbook "Concrete Mathematics" and for creating the BibTeX reference management tool used with LaTeX.
-
C.
Dana Scott
Dana Scott is an American logician and mathematician renowned for his foundational work in domain theory, model theory, and the semantics of programming languages, for which he received the Turing Award.
-
D.
Gerard J. Holzmann
Gerard J. Holzmann is a computer scientist best known for creating the SPIN model checker and for his influential work in formal verification and software reliability.
-
E.
Gordon Plotkin
Gordon Plotkin is a British computer scientist renowned for his foundational contributions to programming language semantics and domain theory.
- F. None of above. chosen
- G. Unsure - the case is ambiguous/there is not enough information to decide.
Target entity: Vaughan Pratt Target entity description: Vaughan Pratt is a computer scientist known for his contributions to algorithms and formal methods, including co-developing the Knuth–Morris–Pratt string-searching algorithm.
-
A.
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.
-
B.
Oren Patashnik
Oren Patashnik is a computer scientist best known for coauthoring the influential textbook "Concrete Mathematics" and for creating the BibTeX reference management tool used with LaTeX.
-
C.
Dana Scott
Dana Scott is an American logician and mathematician renowned for his foundational work in domain theory, model theory, and the semantics of programming languages, for which he received the Turing Award.
-
D.
Gerard J. Holzmann
Gerard J. Holzmann is a computer scientist best known for creating the SPIN model checker and for his influential work in formal verification and software reliability.
-
E.
Gordon Plotkin
Gordon Plotkin is a British computer scientist renowned for his foundational contributions to programming language semantics and domain theory.
- F. None of above. chosen
Statements (30)
| Predicate | Object |
|---|---|
| instanceOf |
academic
ⓘ
computer scientist ⓘ person ⓘ researcher ⓘ |
| coDeveloperOf | Knuth–Morris–Pratt string-searching algorithm NERFINISHED ⓘ |
| coInventorWith |
Donald Knuth
NERFINISHED
ⓘ
James H. Morris NERFINISHED ⓘ |
| contributedTo |
design of efficient algorithms
ⓘ
formal verification methods ⓘ string-search algorithms ⓘ |
| fieldOfWork |
algorithms
ⓘ
computer science ⓘ formal methods ⓘ theoretical computer science ⓘ |
| hasNotability |
pioneering work in algorithms
ⓘ
pioneering work in formal methods ⓘ |
| hasResearchArea |
automata theory
ⓘ
concurrency theory ⓘ formal languages ⓘ logic in computer science ⓘ parsing techniques ⓘ program verification ⓘ string algorithms ⓘ |
| influenced |
research in parsing and syntax analysis
ⓘ
research in program verification ⓘ research in string matching ⓘ |
| knownFor | Knuth–Morris–Pratt string-searching algorithm NERFINISHED ⓘ |
| notableWork |
Pratt certificates for primality
NERFINISHED
ⓘ
Pratt parsing technique NERFINISHED ⓘ dynamic logic in computer science ⓘ |
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: Vaughan Pratt Description of subject: Vaughan Pratt is a computer scientist known for his contributions to algorithms and formal methods, including co-developing the Knuth–Morris–Pratt string-searching algorithm.
Referenced by (2)
Full triples — surface form annotated when it differs from this entity's canonical label.