Abstract: The paper is devoted to the modifying of Maslov inverse method for a special form of predicate formulas used in the solution of artificial intelligence problems. An algorithm of the inverse method application for such type formulas is justified. Upper and lower bounds of the number of steps in such an application are obtain. Upper bounds coincide with those of other deduction algorithms, but the exhaustion is greatly reduced while construction particular derivation.

Keywords: artificial intelligence, pattern recognition, predicate calculus, inverse method of S.Yu.Maslov, complexity theory.

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 METHOD FOR SOLVING ARTIFICIAL INTELLIGENCE PROBLEMS IN THE FRAMEWORKS OF LOGIC-OBJECTIVE APPROACH AND BOUNDS OF ITS NUMBER OF STEPS

Tatiana Kosovskaya, Nina Petukhova

http://www.foibg.com/ijima/vol01/ijima01-1-p08.pdf