Nationality British Fields Logic, Computer Science Role Computer scientist | Name Robert Kowalski Doctoral advisor Bernard Meltzer | |
 | ||
Citizenship Naturalised British Citizen Institutions University of EdinburghImperial College London Alma mater University of ChicagoUniversity of BridgeportStanford UniversityUniversity of WarsawUniversity of Edinburgh Thesis Studies in the Completeness and Efficiency of Theorem-Proving by Resolution (1970) Books Logic for problem solving, La revolucion del colesterol Education Stanford University, University of Chicago, University of Edinburgh, University of Warsaw, University of Bridgeport People also search for Alain Colmerauer, Keith Clark, Steve Morrison | ||
“Computational Logic as an(...)” Prof. Robert Kowalski (ICAART 2015)
Robert Anthony "Bob" Kowalski (born 15 May 1941) is a logician and computer scientist, who has spent most of his career in the United Kingdom.
Contents
- Computational Logic as an Prof Robert Kowalski ICAART 2015
- Robert Kowalski
- Early life and education
- Career
- Books
- References
Robert Kowalski
Early life and education
He was educated at the University of Chicago, University of Bridgeport (BA in mathematics, 1963), Stanford University (MSc in mathematics, 1966), University of Warsaw and the University of Edinburgh (PhD in computer science, 1970).
Career
He was a research fellow at the University of Edinburgh (1970–75) and has been at Imperial College London since 1975, attaining a chair in Computational logic in 1982 and becoming Emeritus Professor in 1999. He was inducted as a Fellow of the American Association for Artificial Intelligence in 1991, of the European Co-ordinating Committee for Artificial Intelligence in 1999, and the Association for Computing Machinery in 2001.
He began his research in the field of automated theorem proving, developing both SL-resolution with Donald Kuehner and the connection graph proof procedure. However, he is best known for his contributions to the development of logic programming, starting with the procedural interpretation of Horn clauses.
He also developed the minimal model and the fixpoint semantics of Horn clauses with Maarten van Emden. With Marek Sergot, he developed both the event calculus and the application of logic programming to legal reasoning. With Fariba Sadri, he developed an agent model in which beliefs are represented by logic programs and goals are represented by integrity constraints.
Kowalski was one of the early developers of Abductive Logic Programming, in which logic programs are augmented with integrity constraints and with undefined, abducible predicates. This work led to the demonstration with Phan Minh Dung and Francesca Toni that most logics for default reasoning can be regarded as special cases of assumption-based argumentation.