Algorithm for Extraction Common Properties of Objects Described in the Predicate Calculus Language with Several Predicate Symbols

When solving artificial intelligence problems connected with the study of complex structured objects, a convenient tool for describing such objects is the language of predicate calculus. The paper presents two algorithms for the extraction of common properties of objects described in the predicate calculus language with predicate symbols. The first of the algorithms extracts maximal common subformulas for elementary conjunctions containing 2 predicate symbols. The second algorithm extracts maximal common subformulas for elementary conjunctions with several predicate symbols. Estimates of their time complexity are given for both algorithms. Both algorithms are implemented in Python.