Bruno Buchberger
E47796
Bruno Buchberger is an Austrian mathematician best known for introducing Gröbner bases, a fundamental tool in computer algebra and symbolic computation.
All labels observed (2)
| Label | Occurrences |
|---|---|
| Bruno Buchberger canonical | 6 |
| Buchberger | 1 |
How this entity was disambiguated
This entity first appeared as the object of triple T364407 — 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.
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Bruno Buchberger Context triple: [Herbrand Award, notableRecipient, Bruno Buchberger]
-
A.
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.
-
B.
Paul Gordan
Paul Gordan was a 19th-century German mathematician known as the "king of invariant theory" for his foundational work in algebraic invariants.
-
C.
Wilhelm Ackermann
Wilhelm Ackermann was a German mathematician known for his work in mathematical logic and the development of the Ackermann function, one of the earliest-discovered examples of a computable but not primitive recursive function.
-
D.
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.
-
E.
Jacques Herbrand
Jacques Herbrand was a French mathematician and logician known for his foundational contributions to proof theory and mathematical logic, particularly Herbrand's theorem.
- F. None of above. chosen
- G. Unsure - the case is ambiguous/there is not enough information to decide.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: Bruno Buchberger Target entity description: Bruno Buchberger is an Austrian mathematician best known for introducing Gröbner bases, a fundamental tool in computer algebra and symbolic computation.
-
A.
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.
-
B.
Paul Gordan
Paul Gordan was a 19th-century German mathematician known as the "king of invariant theory" for his foundational work in algebraic invariants.
-
C.
Wilhelm Ackermann
Wilhelm Ackermann was a German mathematician known for his work in mathematical logic and the development of the Ackermann function, one of the earliest-discovered examples of a computable but not primitive recursive function.
-
D.
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.
-
E.
Jacques Herbrand
Jacques Herbrand was a French mathematician and logician known for his foundational contributions to proof theory and mathematical logic, particularly Herbrand's theorem.
- F. None of above. chosen
Statements (43)
| Predicate | Object |
|---|---|
| instanceOf |
computer scientist
ⓘ
human ⓘ mathematician ⓘ |
| areaOfInfluence |
computer algebra software design
ⓘ
theory of polynomial ideals ⓘ |
| awardReceived |
ACM Paris Kanellakis Theory and Practice Award
ⓘ
linked to:
Paris Kanellakis Theory and Practice Award
Austrian Cross of Honour for Science and Art ⓘ Honorary doctorate from the University of Innsbruck ⓘ Honorary doctorate from the University of Waterloo ⓘ Wilhelm Exner Medal ⓘ |
| countryOfCitizenship | Austria ⓘ |
| doctoralAdvisor | Wolfgang Gröbner ⓘ |
| educatedAt |
University of Innsbruck
ⓘ
University of Paris ⓘ
linked to:
Panthéon-Sorbonne University
|
| employer | Johannes Kepler University Linz ⓘ |
| familyName |
Buchberger
ⓘ
linked to:
Bruno Buchberger
|
| fieldOfWork |
algebra
ⓘ
algorithmic algebra ⓘ automated reasoning ⓘ computer algebra ⓘ mathematics ⓘ symbolic computation ⓘ |
| founded | Research Institute for Symbolic Computation ⓘ |
| gender | male ⓘ |
| givenName | Bruno ⓘ |
| influenced |
algorithmic methods in commutative algebra
ⓘ
development of computer algebra systems ⓘ |
| knownFor |
Buchberger algorithm
ⓘ
Gröbner bases ⓘ
linked to:
Gröbner basis
foundational work in computer algebra ⓘ |
| languageSpoken |
English
ⓘ
German ⓘ |
| memberOf | Austrian Academy of Sciences ⓘ |
| name | Bruno Buchberger ⓘ |
| nationality | Austrian ⓘ |
| notableIdea | use of Gröbner bases for solving systems of polynomial equations ⓘ |
| notableStudent | Franz Winkler ⓘ |
| notableWork | thesis introducing Gröbner bases ⓘ |
| occupation |
researcher
ⓘ
university professor ⓘ |
| positionHeld |
founding director of the Research Institute for Symbolic Computation
ⓘ
professor of computer mathematics at Johannes Kepler University Linz ⓘ |
| workLocation | Johannes Kepler University Linz ⓘ |
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.
Instruction
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.
Input
Subject: Bruno Buchberger Description of subject: Bruno Buchberger is an Austrian mathematician best known for introducing Gröbner bases, a fundamental tool in computer algebra and symbolic computation.
Referenced by (7)
Full triples — surface form annotated when it differs from this entity's canonical label.
linked to: Bruno Buchberger