Abstract: Algorithms for soling artificial intelligence problems allowing to formalize by means of predicate
language are presented in the paper. These algorithms use the modified Maslov’s inverse method. One of these
algorithms is directly based on the inverse method, and the second one uses the inverse method and Ant
algorithm’s tactics. The model example using the described algorithms is shown.
Keywords: artificial intelligence, pattern recognition, predicate calculus, inverse method of S.Yu.Maslov,
complexity theory, Ant algorithms.
ACM Classification Keywords: I.2.4 ARTIFICIAL INTELLIGENCE Knowledge Representation Formalisms and
Methods – Predicate logic, I.5.1 PATTERN RECOGNITION Models – Deterministic, F.2.2 Nonnumerical
Algorithms and Problems – Complexity of proof procedures.
Link:
THE INVERSE MASLOV METHOD AND ANT TACTICS FOR EXHAUSTIVE SEARCH
DECREASING
Tatiana Kosovskaya, Nina Petukhova
http://www.foibg.com/ijima/vol02/ijima02-01-p08.pdf
Wiki
(1.00/10)
