Robert Anthony Kowalski ( May 15, 1941 ) is an American logician and scientist who spent most of his career in the United Kingdom .
| Robert Anthony Kowalski | |
|---|---|
| Date of Birth | |
| Place of Birth | |
| A country | |
| Scientific field | Informatics |
| Place of work | |
| Alma mater | |
| Awards and prizes | [d] ( 2011 ) [d] ( 2001 ) [d] |
Content
- 1 Education
- 2 Career
- 3 Prologue
- 4 Books
- 5 See also
- 6 notes
- 7 References
Education
He was educated at the University of Chicago , Bridgeport University (bachelor's degree in mathematics, 1963), Stanford University (master's degree in mathematics, 1966), at the University of Warsaw and at the University of Edinburgh (scientific degree in computer science , 1970).
Career
He was a research fellow at the University of Edinburgh (1970-75) and at Imperial College London since 1975. In 1999 he became a professor emeritus. He soon joined the American Association for the Development of Artificial Intelligence in 1991, the Coordinating Committee of Artificial Intelligence in 1999, and the Association of Computing Engineering in 2001.
Robert began his research in the field of automatic evidence [1] , which is implemented at the software level. It is based on the apparatus of mathematical logic . However, he is best known for his contribution to the development of logical programming , starting with the procedural interpretation of Horn . [2]
He also developed a minimal model of Horn semantics with Maarten van Emden [3] . With Marek Sergot, he developed the calculus of events [4] and the application of logic programming to legal reasoning. [5] [6] and the application of logical programming for legal purposes. With Farib Sadri, he developed an agent model [7] [8] in which the beliefs represented by logical programs and the goal are represented by integrity constraints.
Kowalski was one of the first developers of abductive programming logic , where logical programs are supplemented by integrity constraints and with vague, abductive predicates. [9] [10] This work has demonstrated that the logic for reasoning by default can be considered as separate cases of assumptions based on argumentation. [11] [12]
Prologue
The development of the Prolog language began in 1970 by Alan Kulmeroe and Philippe Roussel. They wanted to create a language that could draw logical conclusions based on a given text. The name Prolog is short for PROgramming in LOGic. This language was developed in Marseille in 1972. The principle of Kuznechny’s resolution seemed a suitable model, on the basis of which it was possible to develop a mechanism for logical conclusions. With the restriction of resolution on Horn’s disjunction, unification led to an efficient system where irresistible non-determinism was handled by a rollback process that could be easily implemented. The resolution algorithm allowed us to create the executable sequence necessary to implement specifications similar to the above relation.
The first implementation of the Prolog language using the ALGOL-W Wirth compiler was completed in 1972, and the foundations of the modern language were laid in 1973. The use of the Prolog language was gradually spread among those who were engaged in logical programming, mainly through personal contacts, and not through commercialization of the product . Currently, there are several different, but very similar versions. Although the Prolog language standard does not exist, however, the version developed at the University of Edinburgh has become the most widely used version. The lack of development of effective Prolog applications hindered its distribution until 1980.
Books
- Logic for Problem Solving, North Holland, Elsevier, 1979.
- "Computational Logic and Human Thinking: How to be Artificially Intelligent," Cambridge University Press, 2011.
See also
- Prologue
Notes
- ↑ Kowalski, R. and Kuehner, D., "Linear Resolution with Selection Function" in Artificial Intelligence, Vol. 2, 1971 227-260. Reprinted in "Anthology of Automated Theorem-Proving Papers", Vol. 2, Springer-Verlag , 1983 542-577.
- ↑ Kowalski, R., "Predicate Logic as Programming Language", in Proceedings IFIP Congress, Stockholm, North Holland Publishing Co., 1974. 569-574. Reprinted in Computers for Artificial Intelligence Applications, (eds. Wah, B. and Li, G.-J.), IEEE Computer Society Press , Los Angeles, 1986. 68-73.
- ↑ van Emden, M. and Kowalski, R., "The Semantics of Predicate Logic as a Programming Language", in "Journal of the ACM", Vol. 23, No. 4, 1976, 733-742.
- ↑ Kowalski, R. and Sergot, M., "A Logic-based Calculus of Events", in " New Generation Computing ", Vol. 4, No 1, February 1986, 67-95. Also in "Knowledge Base Management-Systems", (eds. C. Thanos and JW Schmidt), Springer-Verlag, gg. 23-51. Also in The Language of Time: A Reader (eds. Inderjeet Mani, J. Pustejovsky, and R. Gaizauskas). Oxford University Press , 2005.
- ↑ Sergot, M., Sadri, F., Kowalski, R., Kriwaczek, F., Hammond, P., and Cory, T., "The British Nationality Act as a Logic Program", in " Communications of the ACM " , Vol. 29, No. 5, 1986, years 370-386.
- ↑ Kowalski, R., "Legislation as Logic Programs, in Logic Programming in Action (eds. G. Comyn, NE Fuchs, MJ Ratcliffe), Springer-Verlag, 1992, 203-230.
- ↑ Kowalski, R., "Using Metalics to Reconcile with Reactive Rational Agents." In "Meta-Logics and Logic Programming" (K. and Apt F. Turini, eds.), MIT Press , 1995.
- ↑ Kowalski, R. and Sadri, F., "From Logic Programming towards Multi-agent Systems", " Annals of Mathematics and Artificial Intelligence ", Volume 25 (1999), 391-419.
- ↑ Eshghi, K., and Kowalski, R., "Abduction through deduction". Department of Computing, Imperial College, 1988.
- ↑ Kakas, T., Kowalski, K. and Toni, F., "Abductive Logic Programming". " Journal of Logic and Computation ", 1992, Vol. 2 No. 6, pp. 719-770.
- ↑ Bondarenko, A., Dung, PM, Kowalski, R., and Toni, F. An Abstract Argumentation-theoretic Approach to Default Reasoning. " Journal of Artificial Intelligence ", 93 (1-2), 1997, pp 63- 101.
- ↑ Dung, PM, Kowalski, R., and Toni, F. "Dialectic proof procedures for assumption-based, admissible argumentation." Journal of Artificial Intelligence, 170 (2), February 2006, 114-159.