The procedural interpretation of Horn clauses, developed by Robert Kowalski, provides the operational foundation for backward reasoning in logic programming. Born in 1941 in Bridgeport, Connecticut, the mathematician and computer scientist focused his career on the intersection of automated theorem proving and human-oriented computational models, primarily while working within academic institutions in the United Kingdom.
Academic Background
Kowalski attended Fairfield College Preparatory School before pursuing higher education. He earned a BA in mathematics from the University of Bridgeport in 1963, followed by an MSc in mathematics from Stanford University in 1966. His doctoral studies took him to the University of Warsaw and finally the University of Edinburgh, where he received a PhD in computer science in 1970.
Twenty questions, eight minutes on the clock, and a percentile measured against everyone who has taken it. No sign-up.
Take the IQ test →Foundations of Logic Programming
His research career began as a fellow at the University of Edinburgh from 1970 to 1975. In 1975, he moved to the Department of Computing at Imperial College London. He attained a chair in computational logic in 1982 and achieved emeritus status in 1999. Early in this period, he developed SL-resolution alongside Donald Kuehner and formulated the connection graph proof procedure. Collaborating with Maarten van Emden, he established the fixpoint semantics and minimal model of Horn clauses, which define the logical underpinnings of the field.
Applications in Law and Logic
Kowalski expanded the reach of logic programming into complex domains such as legal reasoning. With Marek Sergot, he developed the event calculus and applied logic programming to create early legal expert systems. Their 1986 study, The British Nationality Act as a Logic Program, remains a seminal work in computational law, earning the team the inaugural CodeX Prize in 2021. Furthermore, his work with Fariba Sadri led to the creation of Logic Production Systems and the development of Logical English, a restricted syntax designed to improve communication and formalize legal contracts.
Professional Recognition
His contributions have been marked by significant professional honors. He was elected a Fellow of the American Association for Artificial Intelligence in 1991 and of the Association for Computing Machinery in 2001. In 2011, he received the IJCAI Award for Research Excellence. Between 2012 and 2014, he held a Japan Society for the Promotion of Science Award for Eminent Scientists.
Fast facts
- Born: 1941, Bridgeport
- Field: Logic and informatics
- Doctorate: University of Edinburgh, 1970
- Emeritus Professor: Imperial College London
- Fellowships: AAAI, ACM
- Primary Interest: Computational logic
- Notable Book: Logic for Problem Solving, 1979
- CodeX Prize Winner: 2021
Questions readers ask
What is the primary function of Logical English?
It serves as syntactic sugar for programming languages like Prolog, intended to allow individuals to read and understand logical rules using standard English syntax.
How does Kowalski connect logic to human thinking?
He argues that computational logic acts as a model for problem-solving, which, when combined with decision theory, can improve natural language communication and practical reasoning skills.
Achievements
- Affiliated with Imperial College London and University of Edinburgh
- Educated at University of Edinburgh, Stanford University and University of Chicago
- Worked as mathematician, computer scientist and engineer
