Deductive logic in solving computer knowledge representation



Cite item

Full Text

Abstract

The article develops the concept of computer representology, which is the philosophical and methodological analysis of deductive models of knowledge representation. These models are one of the varieties of logical models of knowledge representation. These latter knowledge representations together with a logical languages form the important concept of the computer knowledge representation - logical. Under the concepts of computer representation of knowledge are understood aggregates of computer models of representation of domain knowledge of reality, and the corresponding to these models language means, which are developed by artificial intelligence. These concepts are different ways to solve the problems of computer knowledge representations.

About the authors

V. A Inozemtsev

Moscow State University of Mechanical Engineering (MAMI)

Email: inozem_63@mail.ru
Ph.D.

References

  1. Иноземцев В.А. Логика и дедуктивный вывод на знаниях в логических моделях представления знаний: метод резолюций и стратегии резолюции. Мн.: Издательство БГУИР. 2001. 36 с.
  2. Иноземцев В.А. Приложение математической логики в информатике и искусственном интеллекте. Мн.: Издательство БГУИР. 1999. 52 с.
  3. Искусственный интеллект. Справочное издание в 3-х кн. М.: Радио и связь. 1990.
  4. Маслов С.Ю. Обратный метод установления выводимости в классическом исчислении предикатов // Доклады АН СССР. М., 1964. Т. 159. № 1. С. 17-20.
  5. Маслов С.Ю. Теория дедуктивных систем и её применения. М.: Радио и связь. 1986. 133с.
  6. Обработка знаний / Под ред. С. Осуги. М., Мир. 1989. 293с.
  7. Поспелов Д.А. Логико-лингвистические модели в управлении. М.: Энергоатомиздат. 1981. 231с.
  8. Представление и использование знаний / Под ред. Х. Уэно, М. Исудзука. М.: Мир. 1989. 220 с.
  9. Робинсон Дж. Машинно-ориентированная логика, основанная на принципе резолюции // Кибернетический сборник. Новая серия. М.: Мир. 1970. Вып.7. С. 194-208.
  10. Anderson R., Bledsoe W.W. A linear format for resolution with merging and a new technique for establishing completeness // J. ACM. 1970. V.17. P. 525 - 534.
  11. Bobrow D. (Editor). Special issue on non-monotonic logic // AI. 1980. V.13. 216p.
  12. Boyer R.S. Locking: a restriction of resolution // University of Texas at Austin (Texas). 1971.
  13. Davis M., Putnam H. A computing procedure for quantification theory // J. ACM. 1960. V. 7. №3. Р. 201-215.
  14. Gilmore Р.C. A proof method for quantification theory: its justification and realization // IBMJ. Res. Develop. 1960. Р. 28-35.
  15. Herbrand J. Recherches sur la theorie de la demonstration // Travaux de la Soc. des Sc. et des letters varsovie. 1930. V.3. №P. 33-160.
  16. Kowalski R., Kuehner D. Linear resolution with selection function // AI. 1971. V.2. P. 227-260.
  17. Loveland D.W. A linear format for resolution // Proc. IRIA. 1970. P. 147-162.
  18. Loveland D.W. A unifying view of some linear Herbrand procedures // J. ACM. 1972. V.19. №5. P. 366-384.
  19. Lucknam D. Refinement theorems in resolution theory // Proc. IRIA. 1970. P. 163-190.
  20. Meltzer B. Theorem - proving for computes: some resolution and ranaming // Computer J. 1966. V. 8. P. 341-343.
  21. Orlowska E. Logic for reasoning about knowledge. Warsaw. IPI. 1981. 19 p.
  22. Orlowska E., Pawlak Zd. Logical foundations of knowledge representation. Warsaw. IPI. 1984. 106 p.
  23. Prawitz D. An improved proof procedure // Theorie. 1960. V. 26. P. 102-139.
  24. Robinson J.A. Theorem proving on the computer // J.ACM.1963.V.10. № 2. P. 163-174.
  25. Robinson J.A. Automatic deduction with hyper - resolution // Internat. J. of Comput. Math. 1965. V.1. P. 227-234.
  26. Robinson J.A. A review of automatic theorem proving // Proc. Symp. Appl. Math. Amer. Math. Soc. 1967. V.19. P. 1-18.
  27. Slagle J. Automatic theorem proving with renamable and semantic resolution // J. ACM. 1967. V. 14. № 4. P. 687-697.
  28. Wos L., Robinson G.A., Carson D.F. Efficiency and completeness of the set of support in the theorem proving // J. ACM. 1965. V.12. № 4. P. 536-54

Copyright (c) 2014 Inozemtsev V.A.

Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

This website uses cookies

You consent to our cookies if you continue to use our website.

About Cookies