Abstract
The resolution-like graph grammar is described and solvability of the extended Ackermann class is proved.
Similar content being viewed by others
Literature Cited
Yu. N. Kur'erov, "On solvability of one Ackermann class. Logic and mathematical foundations," in: Abstracts of papers at 8th All-Union Conf. on Logic and Methodology of Science [in Russian], Vil'nyus (1982), pp. 49–53.
Yu. N. Kur'erov, "On embedding of one Ackermann class in a graph grammer," Matem. Logika Ee Primen., No. 4, 89–99 (1985).
J. A. Robinson, "A machine-oriented logic based on the resolution principle," J. ACM,12, No. 1, 23–41 (1965).
Yu. N. Kur'erov, "On solvability by derivability of the ∀∃∧∀*∃* Ackermann class," in: Abstracts of papers at 8th All-Union Conf. on Mathematical Logic [in Russian], Nauka, Moscow (1986).
W. Ackermann, "Beitrage zum Entscheidungsproblem der mathematischen Logik," Mathem. Ann.,112, No. 3, 419–432 (1936).
S. O. Aanderaa, "On the solvability of the extended ∀∃∧∀*∃* Ackermann class with identity," Lect. Notes Comput. Sci.,171, 270–284 (1984).
V. N. Vagin and D. A. Pospelov, "Solution derivation methods in expert systems," in: Expert System Development Technology, Abstracts of papers at Republican School-Seminar [in Russian], Kishenev (1987), pp. 27–34.
Yu. N. Kur'erov, "On conditional satisfiability," in: Abstracts of papers at 1st All-Russian School on Foundations of Mathematics and Theory of Functions, Mathematical Papers in Memory of M. Ya. Suslin [in Russian], Saratov (1989), p. 70.
Additional information
Translated from Kibernetika i Sistemnyi Analiz, No. 2, pp. 60–69, March–April, 1992.
Rights and permissions
About this article
Cite this article
Kur'erov, Y.I. Logical knowledge-representation formalisms. Cybern Syst Anal 28, 211–218 (1992). https://doi.org/10.1007/BF01126207
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01126207