| Robert Kowalski | |
| Birth Date: | 1941 5, df=yes |
| Birth Place: | Bridgeport, Connecticut, U.S. |
| Nationality: | British |
| Field: | Logic Computer science |
| Work Institution: | University of Edinburgh Imperial College London |
| Alma Mater: | University of Chicago University of Bridgeport (BA) Stanford University (MSc) University of Warsaw University of Edinburgh (PhD) |
| Doctoral Advisor: | Bernard Meltzer |
| Doctoral Students: | |
| Thesis Title: | Studies in the Completeness and Efficiency of Theorem-Proving by Resolution |
| Thesis Year: | 1970 |
| Thesis Url: | http://www.era.lib.ed.ac.uk/handle/1842/6674 |
| Known For: | Logic programming Prolog Horn clause Event calculus |
| Prizes: | IJCAI Award for Research Excellence (2011) |
Robert Anthony Kowalski (born 15 May 1941) is an American-British logician and computer scientist, whose research is concerned with developing both human-oriented models of computing and computational models of human thinking.[1] He has spent most of his career in the United Kingdom.
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).
He was a research fellow at the University of Edinburgh (1970–75) and has been at the Department of Computing, Imperial College London since 1975, attaining a chair in Computational logic in 1982 and becoming Emeritus Professor in 1999.
He began his research in the field of automated theorem proving, developing both SL-resolution[2] with Donald Kuehner and the connection graph proof procedure.[3] He developed SLD resolution and the procedural interpretation of Horn clauses,[4] which underpin the operational semantics of backward reasoning in logic programming. With Maarten van Emden,[5] he also developed the minimal model and the fixpoint semantics of Horn clauses, which underpin the logical semantics of logic programming.
With Marek Sergot, he developed both the event calculus[6] and the application of logic programming to legal reasoning.[7] [8] Together, Kowalski and Sergot supervised one of the first use cases of a legal expert system.[9] With Fariba Sadri, he developed an agent model[10] [11] in which beliefs are represented by logic programs and goals are represented by integrity constraints.
Kowalski was one of the developers of abductive logic programming, in which logic programs are augmented with integrity constraints and with undefined, abducible predicates.[12] [13] 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.[14] [15]
In his 1979 book, Logic for Problem Solving,[16] Kowalski argues that logical inference provides a simple and powerful model of problem solving that can be used by both humans and computers. In his 2011 book, Computational Logic and Human Thinking - How to be Artificially Intelligent,[17] he argues that the use of computational logic can help ordinary people to improve their natural language communication skills, and that in combination with decision theory, it can be used to improve their practical problem-solving abilities.
In joint work with Fariba Sadri, he has developed the logic and computer language Logic Production Systems (LPS),[18] which integrates much of his previous work on computational logic. He has continued his interest in the development of artificial intelligence.[19]
Kowalski was elected 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. In 2011, he received the IJCAI Award for Research Excellence, "for his contributions to logic for knowledge representation and problem solving, including his pioneering work on automated theorem proving and logic programming".[20] In 2012, he received the Japan Society for the Promotion of Science Award for Eminent Scientists for 2012–2014.[21] In 2021, he received the Inaugural CodeX Prize for his work with Fariba Sadri and Marek Sergot "in acknowledgment of their work on the application of logic programming to the formalization and analysis of the British Nationality Act. The authors' seminal article, "The British Nationality Act as a Logic Program," published in 1986 in the Communications of the ACM journal, is one of the first and best-known works in computational law, and one of the most widely cited papers in the field."[22]